For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \geq 2016$, the integer $P(n)$ is positive and $$S(P(n)) = P(S(n)).$$ Proposed by Warut Suksompong, Thailand

Let $D$ be the foot of perpendicular from $A$ to the Euler line (the line passing through the circumcentre and the orthocentre) of an acute scalene triangle $ABC$. A circle $\omega$ with centre $S$ passes through $A$ and $D$, and it intersects sides $AB$ and $AC$ at $X$ and $Y$ respectively. Let $P$ be the foot of altitude from $A$ to $BC$, and let $M$ be the midpoint of $BC$. Prove that the circumcentre of triangle $XSY$ is equidistant from $P$ and $M$.

There are $n \geq 3$ islands in a city. Initially, the ferry company offers some routes between some pairs of islands so that it is impossible to divide the islands into two groups such that no two islands in different groups are connected by a ferry route. After each year, the ferry company will close a ferry route between some two islands $X$ and $Y$. At the same time, in order to maintain its service, the company will open new routes according to the following rule: for any island which is connected to a ferry route to exactly one of $X$ and $Y$, a new route between this island and the other of $X$ and $Y$ is added. Suppose at any moment, if we partition all islands into two nonempty groups in any way, then it is known that the ferry company will close a certain route connecting two islands from the two groups after some years. Prove that after some years there will be an island which is connected to all other islands by ferry routes.

The leader of an IMO team chooses positive integers $n$ and $k$ with $n > k$, and announces them to the deputy leader and a contestant. The leader then secretly tells the deputy leader an $n$-digit binary string, and the deputy leader writes down all $n$-digit binary strings which differ from the leader’s in exactly $k$ positions. (For example, if $n = 3$ and $k = 1$, and if the leader chooses $101$, the deputy leader would write down $001, 111$ and $100$.) The contestant is allowed to look at the strings written by the deputy leader and guess the leader’s string. What is the minimum number of guesses (in terms of $n$ and $k$) needed to guarantee the correct answer?

Find all functions $f:(0,\infty)\rightarrow (0,\infty)$ such that for any $x,y\in (0,\infty)$, $$xf(x^2)f(f(y)) + f(yf(x)) = f(xy) \left(f(f(x^2)) + f(f(y^2))\right).$$

Let $ABCD$ be a convex quadrilateral with $\angle ABC = \angle ADC < 90^{\circ}$. The internal angle bisectors of $\angle ABC$ and $\angle ADC$ meet $AC$ at $E$ and $F$ respectively, and meet each other at point $P$. Let $M$ be the midpoint of $AC$ and let $\omega$ be the circumcircle of triangle $BPD$. Segments $BM$ and $DM$ intersect $\omega$ again at $X$ and $Y$ respectively. Denote by $Q$ the intersection point of lines $XE$ and $YF$. Prove that $PQ \perp AC$.

Let $ABC$ be a triangle with $AB = AC \neq BC$ and let $I$ be its incentre. The line $BI$ meets $AC$ at $D$, and the line through $D$ perpendicular to $AC$ meets $AI$ at $E$. Prove that the reflection of $I$ in $AC$ lies on the circumcircle of triangle $BDE$.

Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.

Find the largest real constant $a$ such that for all $n \geq 1$ and for all real numbers $x_0, x_1, ... , x_n$ satisfying $0 = x_0 < x_1 < x_2 < \cdots < x_n$ we have \[\frac{1}{x_1-x_0} + \frac{1}{x_2-x_1} + \dots + \frac{1}{x_n-x_{n-1}} \geq a \left( \frac{2}{x_1} + \frac{3}{x_2} + \dots + \frac{n+1}{x_n} \right)\]

Find the smallest constant $C > 0$ for which the following statement holds: among any five positive real numbers $a_1,a_2,a_3,a_4,a_5$ (not necessarily distinct), one can always choose distinct subscripts $i,j,k,l$ such that \[ \left| \frac{a_i}{a_j} - \frac {a_k}{a_l} \right| \le C. \]

Let $n, m, k$ and $l$ be positive integers with $n \neq 1$ such that $n^k + mn^l + 1$ divides $n^{k+l} - 1$. Prove that $m = 1$ and $l = 2k$; or $l|k$ and $m = \frac{n^{k-l}-1}{n^l-1}$.

Let $n$ be a positive integer. Determine the smallest positive integer $k$ with the following property: it is possible to mark $k$ cells on a $2n \times 2n$ board so that there exists a unique partition of the board into $1 \times 2$ and $2 \times 1$ dominoes, none of which contain two marked cells.

What is the largest number of cells that can be marked on a $100 \times 100$ board in such a way that a chess king from any cell attacks no more than two marked ones? (The cell on which a king stands is also considered to be attacked by this king.)

An acute triangle $\triangle ABC$ has incenter $I$, and the incircle hits $BC, CA, AB$ at $D, E, F$. Lines $BI, CI, BC, DI$ hits $EF$ at $K, L, M, Q$ and the line connecting the midpoint of segment $CL$ and $M$ hits the line segment $CK$ at $P$. Prove that $$PQ=\frac{AB \cdot KQ}{BI}$$

Prove that for any polynomial $P$ with real coefficients, and for any positive integer $n$, there exists a polynomial $Q$ with real coefficients such that $P(x)^2 +Q(x)^2$ is divisible by $(1+x^2)^n$.

Let $\mathbb{N}$ denote the set of positive integers. Find all functions $f:\mathbb{N}\longrightarrow\mathbb{N}$ such that \[n+f(m)\mid f(n)+nf(m)\]for all $m,n\in \mathbb{N}$ Proposed by Dorlir Ahmeti, Albania

What is the smallest number of nodes that can be marked in a rectangular $n \times k$ grid so that each cell contains at least two marked nodes?

Let's call a number of the form $x^3+y^2$ with natural $x, y$ successful. Are there infinitely many natural $m$ such that among the numbers from $m + 1$ to $m + 2016^2$ exactly 2017 are successful?

Let $a_1, a_2,...,a_n$ be positive real numbers, prove that $$\sum {\frac{a_{i+1}}{a_i}} \ge \sum{\sqrt{\frac{a_{i+1}^2+1}{a_i^2+1}}}$$$a_{n+1}=a_1$

Let $K=(V, E)$ be a finite, simple, complete graph. Let $\phi: E \to \mathbb{R}^2$ be a map from the edge set to the plane, such that the preimage of any point in the range defines a connected graph on the entire vertex set $V$, and the points assigned to the edges of any triangle are collinear. Show that the range of $\phi$ is contained in a line.

The diagonals of a convex quadrilateral divide it into four triangles. Prove that the nine point centers of these four triangles either lie on one straight line, or are the vertices of a parallelogram.

Prove that every rational number is representable as $x^4+y^4-z^4-t^4$ with rational $x,y,z,t$.

Let $ABCD$ be a trapezium, $AD\parallel BC$, and let $E,F$ be points on the sides$AB$ and $CD$, respectively. The circumcircle of $AEF$ meets $AD$ again at $A_1$, and the circumcircle of $CEF$ meets $BC$ again at $C_1$. Prove that $A_1C_1,BD,EF$ are concurrent.

A regular hexagon is divided by straight lines parallel to its sides into $6n^2$ equilateral triangles. On them, there are $2n$ rooks, no two of which attack each other (a rook attacks in directions parallel to the sides of the hexagon). Prove that if we color the triangles black and white such that no two adjacent triangles have the same color, there will be as many rooks on the black triangles as on the white ones.

Let $a_1,\ldots , a_{p-2}{}$ be nonzero residues modulo an odd prime $p{}$. For every $d\mid p - 1$ there are at least $\lfloor(p - 2)/d\rfloor$ indices $i{}$ for which $p{}$ does not divide $a_i^d-1$. Prove that the product of some of $a_1,\ldots , a_{p-2}$ gives the remainder two modulo $p{}$.

Prove that $\sqrt{a_1}+\sqrt{a_2}+\cdots+\sqrt{a_{119}}$ is an integer, where \[a_n=2-\frac{1}{n^2+\sqrt{n^4+1/4}}.\]

For each positive integer $k$, let $S(k)$ the sum of digits of $k$ in decimal system. Show that there is an integer $k$, with no $9$ in it's decimal representation, such that: $$S(2^{24^{2017}}k)=S(k)$$

A planar country has an odd number of cities separated by pairwise distinct distances. Some of these cities are connected by direct two-way flights. Each city is directly connected to exactly two ther cities, and the latter are located farthest from it. Prove that, using these flights, one may go from any city to any other city

Find all functions $f$ from the interval $(1,\infty)$ to $(1,\infty)$ with the following property: if $x,y\in(1,\infty)$ and $x^2\le y\le x^3,$ then $(f(x))^2\le f(y) \le (f(x))^3.$

Let $ABCD$ be a convex quadrilateral and let $P$ and $Q$ be variable points inside this quadrilateral so that $\angle APB=\angle CPD=\angle AQB=\angle CQD$. Prove that the lines $PQ$ obtained in this way all pass through a fixed point , or they are all parallel.

Are there integers $a$ and $b$ such that $a^5b+3$ and $ab^5+3$ are both perfect cubes of integers?