For a given real number $a$ and a positive integer $n$, prove that: i) there exists exactly one sequence of real numbers $x_0,x_1,\ldots,x_n,x_{n+1}$ such that \[\begin{cases} x_0=x_{n+1}=0,\\ \frac{1}{2}(x_i+x_{i+1})=x_i+x_i^3-a^3,\ i=1,2,\ldots,n.\end{cases}\] ii) the sequence $x_0,x_1,\ldots,x_n,x_{n+1}$ in i) satisfies $|x_i|\le |a|$ where $i=0,1,\ldots,n+1$. [i]Liang Yengde[/i]

Let $n$ be a positive integer and $x_1,x_2,...,x_n$ be integer numbers such that $$x_1^2+x_2^2+...+x_n^2+ n^3 \le (2n - 1)(x_1+x_2+...+x_n ) + n^2$$ . Show that : a) $x_1,x_2,...,x_n$ are non-negative integers b) the number $x_1+x_2+...+x_n+n+1$ is not a perfect square.

Let $a,b$ be real numbers such that $a<b$. Evaluate \[\lim_{b\rightarrow a} \frac{\displaystyle\int_a^b \ln |1+(x-a)(b-x)|dx}{(b-a)^3}\].

Let $q$ be a real number. Gugu has a napkin with ten distinct real numbers written on it, and he writes the following three lines of real numbers on the blackboard: [list] [*]In the first line, Gugu writes down every number of the form $a-b$, where $a$ and $b$ are two (not necessarily distinct) numbers on his napkin. [*]In the second line, Gugu writes down every number of the form $qab$, where $a$ and $b$ are two (not necessarily distinct) numbers from the first line. [*]In the third line, Gugu writes down every number of the form $a^2+b^2-c^2-d^2$, where $a, b, c, d$ are four (not necessarily distinct) numbers from the first line. [/list] Determine all values of $q$ such that, regardless of the numbers on Gugu's napkin, every number in the second line is also a number in the third line.

Suppose $x_0, x_1, \ldots , x_n$ are integers and $x_0 > x_1 > \cdots > x_n.$ Prove that at least one of the numbers $|F(x_0)|, |F(x_1)|, |F(x_2)|, \ldots, |F(x_n)|,$ where \[F(x) = x^n + a_1x^{n-1} + \cdots+ a_n, \quad a_i \in \mathbb R, \quad i = 1, \ldots , n,\] is greater than $\frac{n!}{2^n}.$

For real numbers $a,b,c,d$ not all equal to $0$ , define a real function $f(x) = a +b\cos{2x} + c\sin{5x} +d \cos{8x}$. Suppose $f(t) = 4a$ for some real $t$. prove that there exist a real number $s$ s.t. $f(s)<0$

Determine all possible values of the expression $xy+yz+zx$ with real numbers $x, y, z$ satisfying the conditions $x^2-yz = y^2-zx = z^2-xy = 2$.

Consider functions $\, f: [0,1] \rightarrow \mathbb{R} \,$ which satisfy (i) $f(x) \geq 0 \,$ for all $\, x \,$ in $\, [0,1],$ (ii) $f(1) = 1,$ (iii) $f(x) + f(y) \leq f(x+y)\,$ whenever $\, x, \, y, \,$ and $\, x + y \,$ are all in $\, [0,1]$. Find, with proof, the smallest constant $\, c \,$ such that \[ f(x) \leq cx \] for every function $\, f \,$ satisfying (i)-(iii) and every $\, x \,$ in $\, [0,1]$.

Let $\mathbb{N}_{\ge 1}$ be the set of positive integers. Find all functions $f \colon \mathbb{N}_{\ge 1} \to \mathbb{N}_{\ge 1}$ such that, for all positive integers $m$ and $n$: (a) $n = \left(f(2n)-f(n)\right)\left(2 f(n) - f(2n)\right)$, (b)$f(m)f(n) - f(mn) = \left(f(2m)-f(m)\right)\left(2 f(n) - f(2n)\right) + \left(f(2n)-f(n)\right)\left(2 f(m) - f(2m)\right)$, (c) $m-n$ divides $f(2m)-f(2n)$ if $m$ and $n$ are distinct odd prime numbers.

What is the smallest number ? (A) $3$ (B) $2^{\sqrt2}$ (C) $2^{1+\frac{1}{\sqrt2}}$ (D) $2^{\frac12} + 2^{\frac23}$ (E) $2^{\frac53}$

Real numbers $a, b, c, x, y, z$ satisfy $$\begin{aligned} \begin{cases} a^2+2bc=x^2+2yz,\\ b^2+2ca=y^2+2zx,\\ c^2+2ab=z^2+2xy.\\ \end{cases} \end{aligned}$$ Prove that $a^2+b^2+c^2=x^2+y^2+z^2$.

Determine all real numbers $\alpha$ with the property that all numbers in the sequence $\cos\alpha,\cos2\alpha,\cos2^2\alpha,\ldots,\cos2^n\alpha,\ldots$ are negative.

Determine all values $\alpha\in\mathbb R$ with the following property: if positive numbers $(x,y,z)$ satisfy the inequality \[x^2+y^2+z^2\le\alpha(xy+yz+zx),\] then $x,y,z$ are sides of a triangle.

A function $ f$ is defined by $ f(z) \equal{} i\bar z$, where $ i \equal{}\sqrt{\minus{}\!1}$ and $ \bar z$ is the complex conjugate of $ z$. How many values of $ z$ satisfy both $ |z| \equal{} 5$ and $ f (z) \equal{} z$? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 8$

In a row there are $51$ written positive integers. Their sum is $100$ . An integer is [i]representable [/i] if it can be expressed as the sum of several consecutive numbers in a row of $51$ integers. Show that for every $k$ , with $1\le k \le 100$ , one of the numbers $k$ and $100-k$ is representable.

Let $a,b,c$ be positive real numbers. Determine the largest total number of real roots that the following three polynomials may have among them: $ax^2+bx+c, bx^2+cx+a,$ and $cx^2+ax+b $.

Prove that $ \lfloor{(4+\sqrt11)^{n}}\rfloor $ is odd for every natural number n.

$n$ being a given integer, find all functions $f\colon \mathbb{Z} \to \mathbb{Z}$, such that for all integers $x,y$ we have $f\left( {x + y + f(y)} \right) = f(x) + ny$.

Determine all functions $f:\mathbb{R}^{+} \to \mathbb{R}^{+}$ such that for any positive reals $x,y$, $$f(xy+f(xy)) = xf(y) + yf(x)$$

Let $\mathcal{F}$ be the set of all the functions $f : \mathcal{P}(S) \longrightarrow \mathbb{R}$ such that for all $X, Y \subseteq S$, we have $f(X \cap Y) = \min (f(X), f(Y))$, where $S$ is a finite set (and $\mathcal{P}(S)$ is the set of its subsets). Find \[\max_{f \in \mathcal{F}}| \textrm{Im}(f) |. \]

Find all monotonic functions $f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying \[f(f(x) - y) + f(x+y) = 0,\] for every real $x, y$. (Note that monotonic means that function is not increasing or not decreasing)

Find all pairs of functions $f; g : R \to R$ such that for all reals $x.y \ne 0$ : $$f(x + y) = g \left(\frac{1}{x}+\frac{1}{y}\right) \cdot (xy)^{2008}$$

Let $f$ be a non-constant function from the set of positive integers into the set of positive integer, such that $a-b$ divides $f(a)-f(b)$ for all distinct positive integers $a$, $b$. Prove that there exist infinitely many primes $p$ such that $p$ divides $f(c)$ for some positive integer $c$. [i]Proposed by Juhan Aru, Estonia[/i]

Do there exist polynomials $a(x)$, $b(x)$, $c(y)$, $d(y)$ such that \[1 + xy + x^2y^2= a(x)c(y) + b(x)d(y)\] holds identically?

Find the largest integer $A$ such that, for any permutation of the natural numbers not exceeding $100$, the sum of some ten successive numbers is at least $A$.