Let us call a real number $r$ [i]interesting[/i], if $r = a + b\sqrt2$ for some integers a and b. Let $A(x)$ and $B(x)$ be polynomial functions with interesting coefficients for which the constant term of $B(x)$ is $1$, and $Q(x)$ be a polynomial function with real coefficients such that $A(x) = B(x) \cdot Q(x)$. Prove that the coefficients of $Q(x)$ are interesting.

Find all natural numbers $ n\ge 4 $ that satisfy the property that the affixes of any nonzero pairwise distinct complex numbers $ a,b,c $ that verify the equation $$ (a-b)^n+(b-c)^n+(c-a)^n=0, $$ represent the vertices of an equilateral triangle in the complex plane.

S is the set of all ($a$, $b$, $c$, $d$, $e$, $f$) where $a$, $b$, $c$, $d$, $e$, $f$ are integers such that $a^2 + b^2 + c^2 + d^2 + e^2 = f^2$. Find the largest $k$ which divides abcdef for all members of $S$.

Find all real numbers $a$ for which there exists a function $f: R \to R$ asuch that $x + f(y) =a(y + f(x))$ for all real numbers $x,y\in R$. I.Voronovich

Let $a, b$, and $c$ be real numbers such that \[\frac{1}{bc-a^2} + \frac{1}{ca-b^2}+\frac{1}{ab-c^2} = 0.\] Prove that \[\frac{a}{(bc-a^2)^2} + \frac{b}{(ca-b^2)^2}+\frac{c}{(ab-c^2)^2} = 0.\]

Define a sequence $<x_n>$ by $x_0 = 0$ and $$\large x_n = \left\{ \begin{array}{ll} x_{n-1} + \frac{3^r-1}{2} & if \,\,n = 3^{r-1}(3k + 1)\\ & \\ x_{n-1} - \frac{3^r+1}{2} & if \,\, n = 3^{r-1}(3k + 2)\\ \end{array} \right. $$ where $k, r$ are integers. Prove that every integer occurs exactly once in the sequence.

Let $Z\subset \mathbb{C}$ be a set of $n$ complex numbers, $n\geqslant 2.$ Prove that for any positive integer $m$ satisfying $m\leqslant n/2$ there exists a subset $U$ of $Z$ with $m$ elements such that\[\Bigg|\sum_{z\in U}z\Bigg|\leqslant\Bigg|\sum_{z\in Z\setminus U}z\Bigg|.\][i]Vasile Pop[/i]

Find all polynomials $ p\in\mathbb Z[x]$ such that $ (m,n)\equal{}1\Rightarrow (p(m),p(n))\equal{}1$

Let $a,b$ be positive reals such that $\frac{1}{a}+\frac{1}{b}\leq2\sqrt2$ and $(a-b)^2=4(ab)^3$. Find $\log_a b$.

Does there exist a sequence $ F(1), F(2), F(3), \ldots$ of non-negative integers that simultaneously satisfies the following three conditions? [b](a)[/b] Each of the integers $ 0, 1, 2, \ldots$ occurs in the sequence. [b](b)[/b] Each positive integer occurs in the sequence infinitely often. [b](c)[/b] For any $ n \geq 2,$ \[ F(F(n^{163})) \equal{} F(F(n)) \plus{} F(F(361)). \]

Let $\alpha$ be a non-zero real number. Find all functions $f: \mathbb{R}\to\mathbb{R}$ such that \[ xf(x+y)=(x+\alpha y)f(x)+xf(y) \] for all $x,y\in\mathbb{R}$.

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.)

Solve the equation $x^4 + 4x^3 - 8x + 4 = 0$.

For any positive integer $ x$ define $ g(x)$ as greatest odd divisor of $ x,$ and \[ f(x) \equal{} \begin{cases} \frac {x}{2} \plus{} \frac {x}{g(x)} & \text{if \ \(x\) is even}, \\ 2^{\frac {x \plus{} 1}{2}} & \text{if \ \(x\) is odd}. \end{cases} \] Construct the sequence $ x_1 \equal{} 1, x_{n \plus{} 1} \equal{} f(x_n).$ Show that the number 1992 appears in this sequence, determine the least $ n$ such that $ x_n \equal{} 1992,$ and determine whether $ n$ is unique.

Two pirates divide the loot, consisting of two bags of coins and a diamond, according to the following rules. First the first pirate takes take a few coins from any bag and transfer them from this bag in the other the same number of coins. Then the second pirate does the same (choosing the bag from which he takes the coins at his discretion) and etc. until you can take coins according to these rules. The pirate who takes the coins last gets the diamond. Who will get the diamond if is each of the pirates trying to get it? Give your answer depending on the initial number of coins in the bags.

For all $y$, define cubic $f_y (x)$ such that $f_y (0) = y$, $f_y (1) = y +12$, $f_y (2) = 3y^2$, $f_y (3) = 2y +4$. For all $y$, $f_y(4)$ can be expressed in the form $ay^2 +by +c$ where $a,b,c$ are integers. Find $a +b +c$.

Let $\mathbb Q_{>0}$ be the set of all positive rational numbers. Let $f:\mathbb Q_{>0}\to\mathbb R$ be a function satisfying the following three conditions: (i) for all $x,y\in\mathbb Q_{>0}$, we have $f(x)f(y)\geq f(xy)$; (ii) for all $x,y\in\mathbb Q_{>0}$, we have $f(x+y)\geq f(x)+f(y)$; (iii) there exists a rational number $a>1$ such that $f(a)=a$. Prove that $f(x)=x$ for all $x\in\mathbb Q_{>0}$. [i]Proposed by Bulgaria[/i]

Find all polynomial $P(x)$ with degree $\leq n$and non negative coefficients such that $$P(x)P(\frac{1}{x})\leq P(1)^2$$ for all positive $x$. Here $n$ is a natuaral number

Let $ r$, $ s$, and $ t$ be the three roots of the equation \[ 8x^3\plus{}1001x\plus{}2008\equal{}0.\]Find $ (r\plus{}s)^3\plus{}(s\plus{}t)^3\plus{}(t\plus{}r)^3$.

The set $ \{a_0, a_1, \ldots, a_n\}$ of real numbers satisfies the following conditions: [b](i)[/b] $ a_0 \equal{} a_n \equal{} 0,$ [b](ii)[/b] for $ 1 \leq k \leq n \minus{} 1,$ \[ a_k \equal{} c \plus{} \sum^{n\minus{}1}_{i\equal{}k} a_{i\minus{}k} \cdot \left(a_i \plus{} a_{i\plus{}1} \right)\] Prove that $ c \leq \frac{1}{4n}.$

In a soccer tournament between four teams, $A$, $B$, $C$, and $D$, each team plays each of the others exactly once. a) Decide if, at the end of the tournament, it is possible for the quantities of goals scored and goals allowed for each team to be as follows: $\begin{tabular}{ c|c|c|c|c } {} & A & B & C & D \\ \hline Goals scored & 1 & 3 & 6 & 7 \\ \hline Goals allowed & 4 & 4 & 4 & 5 \\ \end{tabular}$ If the answer is yes, give an example for the results of the six games; in the contrary, justify your answer. b) Decide if, at the end of the tournament, it is possible for the quantities of goals scored and goals allowed for each team to be as follows: $\begin{tabular}{ c|c|c|c|c } {} & A & B & C & D \\ \hline Goals scored & 1 & 3 & 6 & 13 \\ \hline Goals allowed & 4 & 4 & 4 & 11 \\ \end{tabular}$ If the answer is yes, give an example for the results of the six games; in the contrary, justify your answer.

Simplify $\frac{1}{\sqrt[3]{81} + \sqrt[3]{72} + \sqrt[3]{64}}$

Let $a$ and $b$ be natural numbers. Prove that the number of polynomials $P(x)$ with integer coefficients such that $|P(n)| \leq a^n$ for every natural number $n \geq b$ is finite.

Let $a, b$ and $c$ be positive real numbers such that min $\{ab, bc, ca\} \ge 1$. Prove that $$\sqrt[3]{(a^2 + 1)(b^2 + 1)(c^2 + 1)} \le (\frac{a+b+c}{3} )^2 + 1 $$

Prove that there are two numbers $u$ and $v$, between any $101$ real numbers that apply $100 |u - v| \cdot |1 - uv| \le (1 + u^2)(1 + v^2)$