Let $x_i,$ $1 \leq i \leq n$ be real numbers with $n \geq 3.$ Let $p$ and $q$ be their symmetric sum of degree $1$ and $2$ respectively. Prove that: i) $p^2 \cdot \frac{n-1}{n}-2q \geq 0$ ii) $\left|x_i - \frac{p}{n}\right| \leq \sqrt{p^2 - \frac{2nq}{n-1}} \cdot \frac{n-1}{n}$ for every meaningful $i$.

Kirill has $n{}$ identical footballs and two infinite rows of baskets, each numbered with consecutive natural numbers. In one row the baskets are red, in the other they are blue. Kirill puts all the balls into baskets so that the number of balls in the either row of baskets does not increase. Denote by $A{}$ the number of ways to arrange the balls so that the first blue basket contains more balls than any red one, and by $B{}$ the number of arrangements so that the number of some blue basket corresponds with the number of balls in it. Prove that $A = B$.

Solve the following equation in $\mathbb{R}$: $$\left(x-\frac{1}{x}\right)^\frac{1}{2}+\left(1-\frac{1}{x}\right)^\frac{1}{2}=x.$$

Buses from Dallas to Houston leave every hour on the hour. Buses from Houston to Dallas leave every hour on the half hour. The trip from one city to the other takes $5$ hours. Assuming the buses travel on the same highway, how many Dallas-bound buses does a Houston-bound bus pass in the highway (not in the station)? $\text{(A)}\ 5 \qquad \text{(B)}\ 6 \qquad \text{(C)}\ 9 \qquad \text{(D)}\ 10 \qquad \text{(E)}\ 11$

Professor Oak is feeding his $100$ Pokémon. Each Pokémon has a bowl whose capacity is a positive real number of kilograms. These capacities are known to Professor Oak. The total capacity of all the bowls is $100$ kilograms. Professor Oak distributes $100$ kilograms of food in such a way that each Pokémon receives a non-negative integer number of kilograms of food (which may be larger than the capacity of the bowl). The [i]dissatisfaction level[/i] of a Pokémon who received $N$ kilograms of food and whose bowl has a capacity of $C$ kilograms is equal to $\lvert N-C\rvert$. Find the smallest real number $D$ such that, regardless of the capacities of the bowls, Professor Oak can distribute food in a way that the sum of the dissatisfaction levels over all the $100$ Pokémon is at most $D$. [i]Oleksii Masalitin, Ukraine[/i]

We are given $1998$ normal coins, $1$ heavy coin and $1$ light coin, which all look the same. We wish to determine whether the average weight of the two abnormal coins is less than, equal to, or greater than the weight of a normal coin. Show how to do this using a balance $4$ times or less.

Determine all positive integers $n$ such that $n$ equals the square of the sum of the digits of $n$.

Inside of the square $ABCD$ the point $P$ is given such that $|PA|:|PB|:|PC|=1:2:3$. Find $\angle APB$.

Points $A$ and $B$ move on circles centered at $O_A$ and $O_B$ such that $O_AA$ and $O_BB$ rotate at the same speed. Prove that vertex $C$ of the equilateral triangle $ABC$ moves along a certain circle at the same angular velocity. (The vertices of $ABC$ are oriented clockwise.)

What is remainder when the sum \[\binom{2013}{1}+2013\binom{2013}{3} + 2013^2\binom{2013}{5} + \dots + 2013^{1006}\binom{2013}{2013}\] is divided by $41$? $ \textbf{(A)}\ 20 \qquad\textbf{(B)}\ 14 \qquad\textbf{(C)}\ 7 \qquad\textbf{(D)}\ 1 \qquad\textbf{(E)}\ \text{None} $

In a convex $n$-gon, several diagonals are drawn. Among these diagonals, a diagonal is called [i]good[/i] if it intersects exactly one other diagonal drawn (in the interior of the $n$-gon). Find the maximum number of good diagonals.

On a board of $8 \times 8$ exists $64$ kings, all initially placed in different squares. Alnardo and Bernaldo play alternately, with Arnaldo starting. On each move, one of the two players chooses a king and can move it one square to the right, one square up, or one square up to the right. In the event that a king is moved to an occupied square, both kings are removed from the game. The player who can remove two of the last kings or leave one last king in the upper right corner wins the game. Which of the two players can ensure victory?

For $x >0$ , prove that $$\frac{1}{2\sqrt{x+1}}<\sqrt{x+1}-\sqrt{x}<\frac{1}{2\sqrt{x}}$$ and for all $n \ge 2$ prove that $$1 <2\sqrt{n} - \sum_{k=1}^n\frac{1}{\sqrt{k}}<2$$

Veni writes down finitely many real numbers (possibly one), squares them, and then subtracts 1 from each of them and gets the same set of numbers as in the beginning. What were the starting numbers?

The integers from $1$ to $36$ are written on a “mathlotto” ticket. When you buy a “mathlotto” ticket, you choose $6$ of these $36$ numbers. Then $6$ of the integers from $1$ to $36$ are drawn, and a winning ticket is one which does not contain any of them. Prove that (a) if you buy $9$ tickets, you can choose your numbers so that regardless of which numbers are drawn, you are guaranteed to have at least one winning ticket; (b) if you buy only $8$ tickets, it is possible for you not to have any winning tickets, regardless of how you choose your numbers. (S Tokarev)

Compute the number of ways to arrange $3$ copies of each of the $26$ lowercase letters of the English alphabet such that for any two distinct letters $x_1$ and $x_2,$ the number of $x_2$’s between the first and second occurrences of $x_1$ equals the number of $x_2$’s between the second and third occurrences of $x_1.$

Two acute triangles $ABC$ and $A_1B_1C_1$ are such that $B_1$ and $C_1$ lie on $BC$, and $A_1$ lies inside the triangle $ABC$. Let $S$ and $S_1$ be the areas of those triangles respectively. Prove that $\frac{S}{AB + AC}> \frac{S_1}{A_1B_1 + A_1C_1}$ (Nairi Sedrakyan, Ilya Bogdanov)