The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\]for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

Find all functions $f:\mathbb Z_{>0}\to \mathbb Z_{>0}$ such that $a+f(b)$ divides $a^2+bf(a)$ for all positive integers $a$ and $b$ with $a+b>2019$.

Let $n>1$ be an integer. Suppose we are given $2n$ points in the plane such that no three of them are collinear. The points are to be labelled $A_1, A_2, \dots , A_{2n}$ in some order. We then consider the $2n$ angles $\angle A_1A_2A_3, \angle A_2A_3A_4, \dots , \angle A_{2n-2}A_{2n-1}A_{2n}, \angle A_{2n-1}A_{2n}A_1, \angle A_{2n}A_1A_2$. We measure each angle in the way that gives the smallest positive value (i.e. between $0^{\circ}$ and $180^{\circ}$). Prove that there exists an ordering of the given points such that the resulting $2n$ angles can be separated into two groups with the sum of one group of angles equal to the sum of the other group.

Let $ABC$ be an acute-angled triangle and let $D, E$, and $F$ be the feet of altitudes from $A, B$, and $C$ to sides $BC, CA$, and $AB$, respectively. Denote by $\omega_B$ and $\omega_C$ the incircles of triangles $BDF$ and $CDE$, and let these circles be tangent to segments $DF$ and $DE$ at $M$ and $N$, respectively. Let line $MN$ meet circles $\omega_B$ and $\omega_C$ again at $P \ne M$ and $Q \ne N$, respectively. Prove that $MP = NQ$. (Vietnam)

Let $n\geqslant 2$ be a positive integer and $a_1,a_2, \ldots ,a_n$ be real numbers such that \[a_1+a_2+\dots+a_n=0.\]Define the set $A$ by \[A=\left\{(i, j)\,|\,1 \leqslant i<j \leqslant n,\left|a_{i}-a_{j}\right| \geqslant 1\right\}\]Prove that, if $A$ is not empty, then \[\sum_{(i, j) \in A} a_{i} a_{j}<0.\]

Let $a$ and $b$ be two positive integers. Prove that the integer \[a^2+\left\lceil\frac{4a^2}b\right\rceil\]is not a square. (Here $\lceil z\rceil$ denotes the least integer greater than or equal to $z$.) Russia

Let $n \geqslant 3$ be a positive integer and let $\left(a_{1}, a_{2}, \ldots, a_{n}\right)$ be a strictly increasing sequence of $n$ positive real numbers with sum equal to 2. Let $X$ be a subset of $\{1,2, \ldots, n\}$ such that the value of \[ \left|1-\sum_{i \in X} a_{i}\right| \]is minimised. Prove that there exists a strictly increasing sequence of $n$ positive real numbers $\left(b_{1}, b_{2}, \ldots, b_{n}\right)$ with sum equal to 2 such that \[ \sum_{i \in X} b_{i}=1. \]

Let $P$ be a point inside triangle $ABC$. Let $AP$ meet $BC$ at $A_1$, let $BP$ meet $CA$ at $B_1$, and let $CP$ meet $AB$ at $C_1$. Let $A_2$ be the point such that $A_1$ is the midpoint of $PA_2$, let $B_2$ be the point such that $B_1$ is the midpoint of $PB_2$, and let $C_2$ be the point such that $C_1$ is the midpoint of $PC_2$. Prove that points $A_2, B_2$, and $C_2$ cannot all lie strictly inside the circumcircle of triangle $ABC$. (Australia)

A polynomial $P(x, y, z)$ in three variables with real coefficients satisfies the identities $$P(x, y, z)=P(x, y, xy-z)=P(x, zx-y, z)=P(yz-x, y, z).$$ Prove that there exists a polynomial $F(t)$ in one variable such that $$P(x,y,z)=F(x^2+y^2+z^2-xyz).$$

Let $P(x)$ be a polynomial taking integer values at integer inputs. Are there infinitely many natural numbers that are not representable in the form $P(k)-2^n$ where $n{}$ and $k{}$ are non-negative integers? Proposed by F. Petrov

There are 10,000 vertices in a graph, with at least one edge coming out of each vertex. Call a set $S{}$ of vertices delightful if no two of its vertices are connected by an edge, but any vertex not from $S{}$ is connected to at least one vertex from $S{}$. For which smallest $m$ is there necessarily a delightful set of at most $m$ vertices?

Let $I$ be the incentre of acute-angled triangle $ABC$. Let the incircle meet $BC, CA$, and $AB$ at $D, E$, and $F,$ respectively. Let line $EF$ intersect the circumcircle of the triangle at $P$ and $Q$, such that $F$ lies between $E$ and $P$. Prove that $\angle DPA + \angle AQD =\angle QIP$. (Slovakia)

Determine all functions $f:\mathbb{R}^+\to\mathbb{R}^+$ satisfying $xf(xf(2y))=y+xyf(x)$ for all $x,y>0$.

Octagon $A_1A_2A_3A_4A_5A_6A_7A_8$ is inscribed in a circle $\Omega$ with center $O$. It is known that $A_1A_2\|A_5A_6$, $A_3A_4\|A_7A_8$ and $A_2A_3\|A_5A_8$. The circle $\omega_{12}$ passes through $A_1$, $A_2$ and touches $A_1A_6$; circle $\omega_{34}$ passes through $A_3$, $A_4$ and touches $A_3A_8$; the circle $\omega_{56}$ passes through $A_5$, $A_6$ and touches $A_5A_2$; the circle $\omega_{78}$ passes through $A_7$, $A_8$ and touches $A_7A_4$. The common external tangent to $\omega_{12}$ and $\omega_{34}$ cross the line passing through ${A_1A_6}\cap{A_3A_8}$ and ${A_5A_2}\cap{A_7A_4}$ at the point $X$. Prove that one of the common tangents to $\omega_{56}$ and $\omega_{78}$ passes through $X$.

There are 60 empty boxes $B_1,\ldots,B_{60}$ in a row on a table and an unlimited supply of pebbles. Given a positive integer $n$, Alice and Bob play the following game. In the first round, Alice takes $n$ pebbles and distributes them into the 60 boxes as she wishes. Each subsequent round consists of two steps: (a) Bob chooses an integer $k$ with $1\leq k\leq 59$ and splits the boxes into the two groups $B_1,\ldots,B_k$ and $B_{k+1},\ldots,B_{60}$. (b) Alice picks one of these two groups, adds one pebble to each box in that group, and removes one pebble from each box in the other group. Bob wins if, at the end of any round, some box contains no pebbles. Find the smallest $n$ such that Alice can prevent Bob from winning. Czech Republic

There are coins worth $1, 2, \ldots , b$ rubles, blue bills with worth $a{}$ rubles and red bills worth $a + b$ rubles. Ilya wants to exchange a certain amount into coins and blue bills, and use no more than $a-1$ coins. Pasha wants to exchange the same amount in coins and red bills, but use no more than $a{}$ coins. Prove that they have equally many ways of doing so.

Given a natural number $n{}$ find the smallest $\lambda$ such that\[\gcd(x(x + 1)\cdots(x + n - 1), y(y + 1)\cdots(y + n - 1)) \leqslant (x-y)^\lambda,\]for any positive integers $y{}$ and $x \geqslant y + n$.

In a convex quadrilateral $ABCD$, the lines $AB$ and $DC$ intersect at point $P{}$ and the lines $AD$ and $BC$ intersect at point $Q{}$. The points $E{}$ and $F{}$ are inside the quadrilateral $ABCD$ such that the circles $(ABE), (CDE), (BCF),(ADF)$ intersect at one point $K{}$. Prove that the circles $(PKF)$ and $(QKE)$ intersect a second time on the line $PQ$.