(a) The integers $x$, $x^2$ and $x^3$ begin with the same digit. Does it imply that this digit is $1$? ($2$ points) (b) The same question for the integers $x, x^2, x^3, \cdots, x^{2015}$ ($3$ points) .

A point $X$ is marked on the base $BC$ of an isosceles $\triangle ABC$, and points $P$ and $Q$ are marked on the sides $AB$ and $AC$ so that $APXQ$ is a parallelogram. Prove that the point $Y$ symmetrical to $X$ with respect to line $PQ$ lies on the circumcircle of the $\triangle ABC$. ($5$ points)

(a) A $2 \times n$-table (with $n > 2$) is filled with numbers so that the sums in all the columns are different. Prove that it is possible to permute the numbers in the table so that the sums in the columns would still be different and the sums in the rows would also be different. ($2$ points) (b) A $100 \times 100$-table is filled with numbers such that the sums in all the columns are different. Is it always possible to permute the numbers in the table so that the sums in the columns would still be different and the sums in the rows would also be different? ($6$ points)

A convex$N-$gon with equal sides is located inside a circle. Each side is extended in both directions up to the intersection with the circle so that it contains two new segments outside the polygon. Prove that one can paint some of these new $2N$ segments in red and the rest in blue so that the sum of lengths of all the red segments would be the same as for the blue ones. ($8$ points)

Do there exist two polynomials with integer coefficients such that each polynomial has a coefficient with an absolute value exceeding $2015$ but all coefficients of their product have absolute values not exceeding $1$? ($10$ points)

An Emperor invited $2015$ wizards to a festival. Each of the wizards knows who of them is good and who is evil, however the Emperor doesn’t know this. A good wizard always tells the truth, while an evil wizard can tell the truth or lie at any moment. The Emperor gives each wizard a card with a single question, maybe different for different wizards, and after that listens to the answers of all wizards which are either “yes” or “no”. Having listened to all the answers, the Emperor expels a single wizard through a magic door which shows if this wizard is good or evil. Then the Emperor makes new cards with questions and repeats the procedure with the remaining wizards, and so on. The Emperor may stop at any moment, and after this the Emperor may expel or not expel a wizard. Prove that the Emperor can expel all the evil wizards having expelled at most one good wizard. ($10$ points)

It is well-known that if a quadrilateral has the circumcircle and the incircle with the same centre then it is a square. Is the similar statement true in 3 dimensions: namely, if a cuboid is inscribed into a sphere and circumscribed around a sphere and the centres of the spheres coincide, does it imply that the cuboid is a cube? (A cuboid is a polyhedron with 6 quadrilateral faces such that each vertex belongs to $3$ edges.) ($10$ points)

From a set of integers $\{1,...,100\}$, $k$ integers were deleted. Is it always possible to choose $k$ distinct integers from the remaining set such that their sum is $100$ if (a) $k=9$? (b) $k=8$?

Several distinct real numbers are written on a blackboard. Peter wants to make an expression such that its values are exactly these numbers. To make such an expression, he may use any real numbers, brackets, and usual signs $+$ , $-$ and $\times$. He may also use a special sign $\pm$: computing the values of the resulting expression, he chooses values $+$ or $-$ for every $\pm$ in all possible combinations. For instance, the expression $5 \pm 1$ results in $\{4, 6 \}$, and $(2 \pm 0.5) \pm 0.5$ results in $\{1, 2, 3 \}$. Can Pete construct such an expression: $a)$ If the numbers on the blackboard are $1, 2, 4$; $b)$ For any collection of $100$ distinct real numbers on a blackboard?

Santa Clause had $n$ sorts of candies, $k$ candies of each sort. He distributed them at random between $k$ gift bags, $n$ candies per a bag and gave a bag to everyone of $k$ children at Christmas party. The children learned what they had in their bags and decided to trade. Two children trade one candy for one candy in case if each of them gets the candy of the sort which was absent in his/her bag. Prove that they can organize a sequence of trades so that finally every child would have candies of each sort.

A geometrical progression consists of $37$ positive integers. The first and the last terms are relatively prime numbers. Prove that the $19^{th}$ term of the progression is the $18^{th}$ power of some positive integer. ($3$ points)

A $10 \times 10$ square on a grid is split by $80$ unit grid segments into $20$ polygons of equal area (no one of these segments belongs to the boundary of the square). Prove that all polygons are congruent. ($6$ points)

Each coefficient of a polynomial is an integer with absolute value not exceeding $2015$. Prove that every positive root of this polynomial exceeds $\frac{1}{2016}$. ($6$ points)

Let $ABCD$ be a cyclic quadrilateral, $K$ and $N$ be the midpoints of the diagonals and $P$ and $Q$ be points of intersection of the extensions of the opposite sides. Prove that $\angle PKQ + \angle PNQ = 180$. ($7$ points) .

Several distinct real numbers are written on a blackboard. Peter wants to create an algebraic expression such that among its values there would be these and only these numbers. He may use any real numbers, brackets, signs $+, -, \times$ and a special sign $\pm$. Usage of $\pm$ is equivalent to usage of $+$ and $-$ in all possible combinations. For instance, the expression $5 \pm 1$ results in $\{4, 6\}$, while $(2 \pm 0.5) \pm 0.5$ results in $\{1, 2, 3\}$. Can Peter construct an expression if the numbers on the blackboard are : (a) $1, 2, 4$ ? ($2$ points) (b) any $100$ distinct real numbers ? ($6$ points)

Basil has a melon in a shape of a ball, $20$ in diameter. Using a long knife, Basil makes three mutually perpendicular cuts. Each cut carves a circular segment in a plane of the cut, $h$ deep ($h$ is a height of the segment). Does it necessarily follow that the melon breaks into two or more pieces if (a) $h = 17$ ? (6 points) (b) $h = 18$ ? (6 points)

$N$ children no two of the same height stand in a line. The following two-step procedure is applied: first, the line is split into the least possible number of groups so that in each group all children are arranged from the left to the right in ascending order of their heights (a group may consist of a single child). Second, the order of children in each group is reversed, so now in each group the children stand in descending order of their heights. Prove that in result of applying this procedure $N - 1$ times the children in the line would stand from the left to the right in descending order of their heights. (12 points)