There are $2008$ trinomials $x^2-a_kx+b_k$ where $a_k$ and $b_k$ are all different numbers from set $(1,2,...,4016)$. These trinomials has not common real roots. We mark all real roots on the $Ox$-axis. Prove, that distance between some two marked points is $\leq \frac{1}{250}$

Let $(a_0,a_1,a_2,...)$ and $(b_0,b_1,b_2,...)$ be such sequences of non-negative real numbers, that for every integer $i\geqslant 1$ holds $a_i^2\leqslant a_{i-1}a_{i+1}$ and $b_i^2\leqslant b_{i-1}b_{i+1}$. Define sequence $c_0,c_1,c_2,...$ as $$c_0=a_0b_0, \; c_n=\sum_{i=0}^{n} {{n}\choose{i}} a_ib_{n-i}.$$ Prove that for every integer $k\geqslant 1$ holds $c_{k}^2\leqslant c_{k-1}c_{k+1}$.

Since $24 = 3+5+7+9$, the number $24$ can be written as the sum of at least two consecutive odd positive integers. (a) Can $2005$ be written as the sum of at least two consecutive odd positive integers? If yes, give an example of how it can be done. If no, provide a proof why not. (b) Can $2006$ be written as the sum of at least two consecutive odd positive integers? If yes, give an example of how it can be done. If no, provide a proof why not.

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

Determine whether there exist non-constant polynomials $P(x)$ and $Q(x)$ with real coefficients satisfying $$P(x)^{10}+P(x)^9 = Q(x)^{21}+Q(x)^{20}.$$

Let \[f(x)=(x+1)^{6}+(x-1)^{5}+(x+1)^{4}+(x-1)^3+(x+1)^2+(x-1)^1+1.\] Find the remainder when $\sum_{j=-126}^{126}jf(j)$ is divided by 1000. [i]Proposed by Hari Desikan[/i]

Solve the system of equations $\begin{cases}6x-y+z^2=3\\ x^2-y^2-2z=-1\quad\quad (x,y,z\in\mathbb{R}.)\\ 6x^2-3y^2-y-2z^2=0\end{cases}$.

Given a positive integer $n \geq 2$. Let $a_{ij}$ $(1 \leq i,j \leq n)$ be $n^2$ non-negative reals and their sum is $1$. For $1\leq i \leq n$, define $R_i=max_{1\leq k \leq n}(a_{ik})$. For $1\leq j \leq n$, define $C_j=min_{1\leq k \leq n}(a_{kj})$ Find the maximum value of $C_1C_2 \cdots C_n(R_1+R_2+ \cdots +R_n)$

A set $A$ is endowed with a binary operation $*$ satisfying the following four conditions: (1) If $a, b, c$ are elements of $A$, then $a * (b * c) = (a * b) * c$ , (2) If $a, b, c$ are elements of $A$ such that $a * c = b *c$, then $a = b$ , (3) There exists an element $e$ of $A$ such that $a * e = a$ for all $a$ in $A$, and (4) If a and b are distinct elements of $A-\{e\}$, then $a^3 * b = b^3 * a^2$, where $x^k = x * x^{k-1}$ for all integers $k \ge 2$ and all $x$ in $A$. Determine the largest cardinality $A$ may have. proposed by Bojan Basic, Serbia

Prove the identity $\sin^3 a \cos 3a + \cos^3 a \sin 3a=\frac{3}{4}\sin 4a.$

Find the real number coefficient $c$ of polynomial $x^2+x+c$, if his roots $x_1$ and $x_2$ satisfy following: $$\frac{2x_1^3}{2+x_2}+\frac{2x_2^3}{2+x_1}=-1$$

A function $f : \mathbb{Z}_+ \to \mathbb{Z}_+$, where $\mathbb{Z}_+$ is the set of positive integers, is non-decreasing and satisfies $f(mn) = f(m)f(n)$ for all relatively prime positive integers $m$ and $n$. Prove that $f(8)f(13) \ge (f(10))^2$.

An equilateral triangle has inside it a point with distances 5,12,13 from the vertices . Find its side.

Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $ \forall x\notin\{-1,1\}$ holds: \[\displaystyle{f\Big(\frac{x-3}{x+1}\Big)+f\Big(\frac{3+x}{1-x}\Big)=x}\]

Let $P(x)=x^{100}+20x^{99}+198x^{98}+a_{97}x^{97}+\ldots+a_1x+1$ be a polynomial where the $a_i~(1\le i\le97)$ are real numbers. Prove that the equation $P(x)=0$ has at least one nonreal root.

Let $a_0, a_1,\dots, a_{19} \in \mathbb{R}$ and $$P(x) = x^{20} + \sum_{i=0}^{19}a_ix^i, x \in \mathbb{R}.$$ If $P(x)=P(-x)$ for all $x \in \mathbb{R}$, and $$P(k)=k^2,$$ for $k=0, 1, 2, \dots, 9$ then find $$\lim_{x\rightarrow 0} \frac{P(x)}{\sin^2x}.$$

Take the function $f:\mathbb{R}\to \mathbb{R}$, $f\left( x \right)=ax,x\in \mathbb{Q},f\left( x \right)=bx,x\in \mathbb{R}\backslash \mathbb{Q}$, where $a$ and $b$ are two real numbers different from 0. Prove that $f$ is injective if and only if $f$ is surjective.

Find all $f: R \longrightarrow R$ such that \[f(xy+f(x))=xf(y)+f(x)\] for every pair of real numbers $x,y$.

Suppose $a_1,a_2,a_3,a_4$ are distinct integers and $P(x)$ is a polynomial with integer coefficients satisfying $P(a_1) = P(a_2) = P(a_3) = P(a_4) = 1$. (a) Prove that there is no integer $n$ such that $P(n) = 12$. (b) Do there exist such a polynomial and $a_n$ integer $n$ such that $P(n) = 1998$?

A linear form in $k$ variables is an expression of the form $P(x_1,...,x_k)=a_1x_1+...+a_kx_k$ with real constants $a_1,...,a_k$. Prove that there exist a positive integer $n$ and linear forms $P_1,...,P_n$ in $2017$ variables such that the equation $$x_1\cdot x_2\cdot ... \cdot x_{2017}=P_1(x_1,...,x_{2017})^{2017}+...+P_n(x_1,...,x_{2017})^{2017}$$ holds for all real numbers $x_1,...,x_{2017}$.

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

Find all pairs of positive integers $ a,b$ such that \begin{align*} b^2 + b+ 1 & \equiv 0 \pmod a \\ a^2+a+1 &\equiv 0 \pmod b . \end{align*}

(a) Prove that for every $x \in R$ holds that $$-1 \le \frac{x}{x^2 + x + 1} \le \frac 13$$ (b) Determine all functions $f : R \to R$ for which for every $x \in R$ holds that $$f \left( \frac{x}{x^2 + x + 1} \right) = \frac{x^2}{x^4 + x^2 + 1}$$

Determine whether there exist non-constant polynomials $P(x)$ and $Q(x)$ with real coefficients satisfying $$P(x)^{10}+P(x)^9 = Q(x)^{21}+Q(x)^{20}.$$

For a positive integer $k$, define the $k$-[i]pop[/i] of a positive integer $n$ as the infinite sequence of integers $a_1, a_2, ...$ such that $a_1 = n$ and $$a_{i+1}= \left\lfloor \frac{a_i}{k} \right\rfloor , i = 1, 2, ..$$ where $ \lfloor x\rfloor $ denotes the greatest integer less than or equal to $x$. Furthermore, define a positive integer $m$ to be $k$-[i]pop avoiding[/i] if $k$ does not divide any nonzero term in the $k$-pop of $m$. For example, $14$ is 3-pop avoiding because $3$ does not divide any nonzero term in the $3$-pop of $14$, which is $14, 4, 1, 0, 0, ....$ Suppose that the number of positive integers less than $13^{2018}$ which are $13$-pop avoiding is equal to N. What is the remainder when $N$ is divided by $1000$?