Školjka

%V0 If $a, b, c$ are three positive real numbers such that $ab+bc+ca = 1$, prove that $$\sqrt[3]{ \frac{1}{a} + 6b} + \sqrt[3]{\frac{1}{b} + 6c} + \sqrt[3]{\frac{1}{c} + 6a } \leq \frac{1}{abc}.$$

%V0 Let $A$ be a non-empty set of positive integers. Suppose that there are positive integers $b_1,\ldots b_n$ and $c_1,\ldots,c_n$ such that - for each $i$ the set $b_iA+c_i=\left\{b_ia+c_i\colon a\in A\right\}$ is a subset of $A$, and - the sets $b_iA+c_i$ and $b_jA+c_j$ are disjoint whenever $i\ne j$ Prove that $${1\over b_1}+\,\ldots\,+{1\over b_n}\leq1.$$

%V0 Let $n$ be a positive integer that is not a perfect cube. Define real numbers $a,b,c$ by $$a=\root3\of n\kern1.5pt,\qquad b={1\over a-[a]}\kern1pt,\qquad c={1\over b-[b]}\kern1.5pt,$$ where $[x]$ denotes the integer part of $x$. Prove that there are infinitely many such integers $n$ with the property that there exist integers $r,s,t$, not all zero, such that $ra+sb+tc=0$.

%V0 Find all positive integers $a_1, a_2, \ldots, a_n$ such that $$\frac{99}{100} = \frac{a_0}{a_1} + \frac{a_1}{a_2} + \cdots + \frac{a_{n-1}}{a_n},$$ where $a_0 = 1$ and $(a_{k+1}-1)a_{k-1} \geq a_k^2(a_k - 1)$ for $k = 1,2,\ldots,n-1$.

%V0 Let $f(x) = \frac{x^2+1}{2x}$ for $x \neq 0.$ Define $f^{(0)}(x) = x$ and $f^{(n)}(x) = f(f^{(n-1)}(x))$ for all positive integers $n$ and $x \neq 0.$ Prove that for all non-negative integers $n$ and $x \neq \{-1,0,1\}$ $$\frac{f^{(n)}(x)}{f^{(n+1)}(x)} = 1 + \frac{1}{f \left( \left( \frac{x+1}{x-1} \right)^{2n} \right)}.$$

%V0 $a > 0$ and $b$, $c$ are integers such that $ac$ – $b^2$ is a square-free positive integer P. For example P could be 3*5, but not 3^2*5. Let $f(n)$ be the number of pairs of integers $d, e$ such that $ad^2 + 2bde + ce^2= n$. Show that$f(n)$ is finite and that $f(n) = f(P^{k}n)$ for every positive integer $k$. Original Statement: Let $a,b,c$ be given integers $a > 0,$ $ac-b^2 = P = P_1 \cdots P_n$ where $P_1 \cdots P_n$ are (distinct) prime numbers. Let $M(n)$ denote the number of pairs of integers $(x,y)$ for which $$ax^2 + 2bxy + cy^2 = n.$$ Prove that $M(n)$ is finite and $M(n) = M(P_k \cdot n)$ for every integer $k \geq 0.$ Note that the "$n$" in $P_N$ and the "$n$" in $M(n)$ do not have to be the same.