Determine all polynomials with integral coefficients $P(x)$ such that if $a,b,c$ are the sides of a right-angled triangle, then $P(a), P(b), P(c)$ are also the sides of a right-angled triangle. (Sides of a triangle are necessarily positive. Note that it's not necessary for the order of sides to be preserved; if $c$ is the hypotenuse of the first triangle, it's not necessary that $P(c)$ is the hypotenuse of the second triangle, and similar with the others.)

Positive real numbers $x, y, z$ satisfy $xyz+xy+yz+zx = x+y+z+1$. Prove that \[ \frac{1}{3} \left( \sqrt{\frac{1+x^2}{1+x}} + \sqrt{\frac{1+y^2}{1+y}} + \sqrt{\frac{1+z^2}{1+z}} \right) \le \left( \frac{x+y+z}{3} \right)^{5/8} . \]

a) Prove that for all positive reals $u,v,x,y$ the following inequality takes place: \[ \frac ux + \frac vy \geq \frac {4(uy+vx)}{(x+y)^2} . \] b) Let $a,b,c,d>0$. Prove that \[ \frac a{b+2c+d} + \frac b{c+2d+a} + \frac c{d+2a+b} + \frac d{a+2b+c} \geq 1.\] [i]Traian Tămâian[/i]

Three operations $f,g$ and $h$ are defined on subsets of the natural numbers $\mathbb{N}$ as follows: $f(n)=10n$, if $n$ is a positive integer; $g(n)=10n+4$, if $n$ is a positive integer; $h(n)=\frac{n}{2}$, if $n$ is an [i]even[/i] positive integer. Prove that, starting from $4$, every natural number can be constructed by performing a finite number of operations $f$, $g$ and $h$ in some order. $[$For example: $35=h(f(h(g(h(h(4)))))).]$

Let $ S$ be a finite set of points in the plane such that no three of them are on a line. For each convex polygon $ P$ whose vertices are in $ S$, let $ a(P)$ be the number of vertices of $ P$, and let $ b(P)$ be the number of points of $ S$ which are outside $ P$. A line segment, a point, and the empty set are considered as convex polygons of $ 2$, $ 1$, and $ 0$ vertices respectively. Prove that for every real number $ x$ \[\sum_{P}{x^{a(P)}(1 \minus{} x)^{b(P)}} \equal{} 1,\] where the sum is taken over all convex polygons with vertices in $ S$. [i]Alternative formulation[/i]: Let $ M$ be a finite point set in the plane and no three points are collinear. A subset $ A$ of $ M$ will be called round if its elements is the set of vertices of a convex $ A \minus{}$gon $ V(A).$ For each round subset let $ r(A)$ be the number of points from $ M$ which are exterior from the convex $ A \minus{}$gon $ V(A).$ Subsets with $ 0,1$ and 2 elements are always round, its corresponding polygons are the empty set, a point or a segment, respectively (for which all other points that are not vertices of the polygon are exterior). For each round subset $ A$ of $ M$ construct the polynomial \[ P_A(x) \equal{} x^{|A|}(1 \minus{} x)^{r(A)}. \] Show that the sum of polynomials for all round subsets is exactly the polynomial $ P(x) \equal{} 1.$ [i]Proposed by Federico Ardila, Colombia[/i]

If $f$ is a monic cubic polynomial with $f(0)=-64$, and all roots of $f$ are non-negative real numbers, what is the largest possible value of $f(-1)$? (A polynomial is monic if it has a leading coefficient of $1$.)

We consider the two sequences $(a_n)_{n\ge 0}$ and $(b_n) _{n\ge 0}$ of integers, which are given by $a_0 = b_0 = 2$ and $a_1= b_1 = 14$ and for $n\ge 2$ they are defined as $a_n = 14a_{n-1} + a_{n-2}$ , $b_n = 6b_{n-1}-b_{n-2}$. Determine whether there are infinite numbers that occur in both sequences

Let $n\ge 2$ be a positive integer, and suppose $a_1,a_2,\cdots ,a_n$ are positive real numbers whose sum is $1$ and whose squares add up to $S$. Prove that if $b_i=\tfrac{a^2_i}{S} \;(i=1,\cdots ,n)$, then for every $r>0$, we have $$\sum_{i=1}^n \frac{a_i}{{(1-a_i)}^r}\le \sum_{i=1}^n \frac{b_i}{{(1-b_i)}^r}.$$

Find all functions $f : R \to R$ with $f (x + yf(x + y))= y^2 + f(x)f(y)$ for all $x, y \in R$.

Let $p>0$ be a given parameter. Determine all real $x$ such that \[\frac{1}{\,x+\sqrt{p-x^2\,}\,}+\frac{1}{\,x-\sqrt{p-x^2\,}\,}\ge\frac{1}{\,p\,}.\]

The roots of the equation $x^5-180x^4+Ax^3+Bx^2+Cx+D=0$ are in geometric progression. The sum of their reciprocals is $20$. Compute $|D|$.

A [i]root of unity[/i] is a complex number that is a solution to $ z^n \equal{} 1$ for some positive integer $ n$. Determine the number of roots of unity that are also roots of $ z^2 \plus{} az \plus{} b \equal{} 0$ for some integers $ a$ and $ b$.

Find the smallest constant $C > 0$ for which the following statement holds: among any five positive real numbers $a_1,a_2,a_3,a_4,a_5$ (not necessarily distinct), one can always choose distinct subscripts $i,j,k,l$ such that \[ \left| \frac{a_i}{a_j} - \frac {a_k}{a_l} \right| \le C. \]

Replacing any of the coefficients of quadratic trinomial $f(x)=ax^2+bx+c$ with an $1$ will result in a quadratic trinomial with at least one real root. Prove that the resulting trinomial attains a negative value at at least one point. EDIT: Oops I failed, added "with a 1." Also, I am sorry for not knowing these are posted already, however, these weren't posted in the contest lab yet, which made me think they weren't translated yet. Note: fresh translation

If $a,b,c$ are the sides of a triangle, prove that \[\frac{\sqrt{b+c-a}}{\sqrt{b}+\sqrt{c}-\sqrt{a}}+\frac{\sqrt{c+a-b}}{\sqrt{c}+\sqrt{a}-\sqrt{b}}+\frac{\sqrt{a+b-c}}{\sqrt{a}+\sqrt{b}-\sqrt{c}}\leq 3 \] [i]Proposed by Hojoo Lee, Korea[/i]

Prove that for any positive real numbers $a, b, c$, $$2(a^3 + b^3 + c^3 + abc) \ge (a+b)(b + c)(c + a)$$.

Is there a quadratic trinomial $f(x)$ with integer coefficients such that $f(f(\sqrt{2}))=0$ ? [i]A. Khrabrov[/i]

Find the largest positive value attained by the function \[ f(x)=\sqrt{8x-x^2}-\sqrt{14x-x^2-48}, \qquad x\ \text{a real number} \] $ \textbf{(A)}\ \sqrt{7}-1 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 2\sqrt{3} \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \sqrt{55}-\sqrt{5} $

Let $P(x)$ be a polynomial with integer coefficients and roots $1997$ and $2010$. Suppose further that $|P(2005)|<10$. Determine what integer values $P(2005)$ can get.

Determine all pairs of positive integers $(x, y)$ such that: $$x^4 - 6x^2 + 1 = 7\cdot 2^y$$

Suppose that $4^{x_1}= 5, 5^{x_2}= 6,6^{x_3} = 7,..., 126^{x_{123}} = 127,127^{x_{124}} = 128$. What is the value of the product $X_1X_2... X_{124}$?

Let $ A_1,A_2,\dots,A_n$ be idempotent matrices with real entries. Prove that: \[ \mbox{N}(A_1)\plus{}\mbox{N}(A_2)\plus{}\dots\plus{}\mbox{N}(A_n)\geq \mbox{rank}(I\minus{}A_1A_2\dots A_n)\] $ \mbox{N}(A)$ is $ \mbox{dim}(\mbox{ker(A)})$

Determine all functions $ f : \mathbb{R} \to \mathbb{R} $ continuous at zero and such that for every real number $ x $ the equality holds $$ 2f(2x) = f(x) + x.$$

Prove that $\frac{a}{(a + 1)(b + 1)} +\frac{ b}{(b + 1)(c + 1)} + \frac{c}{(c + 1)(a + 1)} \ge \frac34$ where $a, b$ and $c$ are positive real numbers satisfying $abc = 1$.

Let $p(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0$ be a monic polynomial of degree $n>2$, with real coefficients and all its roots real and different from zero. Prove that for all $k=0,1,2,\cdots,n-2$, at least one of the coefficients $a_k,a_{k+1}$ is different from zero.