There are $100$ cities in Matland. Every road in Matland connects two cities, does not pass through any other city and does not form crossroads with other roads (although roads can go through tunnels one after the other). Driving in Matlandia by road, it is possible to get from any city to any other. Prove that that it is possible to repair some of the roads of Matlandia so that from an odd number of repaired roads would go in each city.

Let $\triangle ABC$ with $\angle BAC=120 ^\circ$. Let $D, E, F$ points on sides $BC, CA, AB$, respectively, such that $AD, BE, CF$ are angle bisectors on $\triangle ABC$. \\ Prove that $\triangle ABC$ is isosceles if and only if $\triangle DEF$ is right-angled isosceles.

A polynomial $A(x)$ is said to be [i]simple[/i] if $A(x)$ is divisible by $x$ but not divisible by $x^2$. Suppose that a polynomial $P(x)$ has a simple polynomial $Q(x)$ such that $P(Q(x))-Q(2x)$ is divisible by $x^2$. Prove that there exists a simple polynomial $R(x)$ such that $P(R(x))-R(2x)$ is divisible by $x^{2023}$.

Let integer $n\ge 3,$ $\tbinom n2$ nonnegative real numbers $a_{i,j}$ satisfy $ a_{i,j}+a_{j,k}\le a_{i,k}$ holds for all $1\le i <j<k\le n$. Proof $$\left\lfloor\frac{n^2}4\right\rfloor\sum_{1\le i<j\le n}a_{i,j}^4\ge \left(\sum_{1\le i<j\le n}a_{i,j}^2\right)^2.$$ [i]Proposed by Jingjun Han, Dongyi Wei[/i]

We are given a natural number $k$. Let us consider the following game on an infinite onedimensional board. At the start of the game, we distrubute $n$ coins on the fields of the given board (one field can have multiple coins on itself). After that, we have two choices for the following moves: $(i)$ We choose two nonempty fields next to each other, and we transfer all the coins from one of the fields to the other. $(ii)$ We choose a field with at least $2$ coins on it, and we transfer one coin from the chosen field to the $k-\mathrm{th}$ field on the left , and one coin from the chosen field to the $k-\mathrm{th}$ field on the right. $\mathbf{(a)}$ If $n\leq k+1$, prove that we can play only finitely many moves. $\mathbf{(b)}$ For which values of $k$ we can choose a natural number $n$ and distribute $n$ coins on the given board such that we can play infinitely many moves.

There are $2021$ points on a circle. Kostya marks a point, then marks the adjacent point to the right, then he marks the point two to its right, then three to the next point's right, and so on. Which move will be the first time a point is marked twice? [i]K. Kokhas[/i]

Points $M$ and $N$ are taken on the sides $BC$ and $CD$ respectively of a square $ABCD$ so that $\angle MAN=45^{\circ}$. Prove that the circumcentre of $\triangle AMN$ lies on $AC$.

Let $a$ be the largest root of the equation $x^3 - 3x^2 + 1 = 0$. Find the first $200$ decimal digits for the number $a^{2000}$.

Let $ABC$ be an isosceles acute triangle ($AB = BC$). On the side $BC$ we mark a point $P$, such that $\angle PAC = 45^o$, and $Q$ is the point of intersection of the perpendicular bisector of the segment $AP$ with the side $AB$. Prove that $PQ \perp BC$.

We create a sequence by setting $a_1 = 2010$ and requiring that $a_n-a_{n-1}\leq n$ and $a_n$ is also divisible by $n$. Show that $a_{100},a_{101},a_{102},\dots$ form an arithmetic sequence.

Determine all functions $f: \mathbb{Z}\to\mathbb{Z}$ satisfying the following property: For each pair of integers $m$ and $n$ (not necessarily distinct), $\mathrm{gcd}(m, n)$ divides $f(m) + f(n)$. Note: If $n\in\mathbb{Z}$, $\mathrm{gcd}(m, n)=\mathrm{gcd}(|m|, |n|)$ and $\mathrm{gcd}(n, 0)=n$.

What is the largest $n$ such that there exists a non-degenerate convex $n$-gon such that each of its angles are an integer number of degrees, and are all distinct?

Let $A$ and $B$ be rectangles in the plane and $f : A \rightarrow B$ be a mapping which is uniform on the interior of $A$, maps the boundary of $A$ homeomorphically to the boundary of $B$ by mapping the sides of $A$ to corresponding sides in $B$. Prove that $f$ is an affine transformation.

Let $f(x) = x^3 + 3x - 1$ have roots $ a, b, c$. Given that $\frac{1}{a^3 + b^3}+\frac{1}{b^3 + c^3}+\frac{1}{c^3 + a^3}$ can be written as $\frac{m}{n}$, where $m, n$ are positive integers and $gcd(m, n) = 1$, find $100m + n$.

Given prime numbers $p$ and $q$ with $p<q$, determine all pairs $(x,y)$ of positive integers such that $$\frac1x+\frac1y=\frac1p-\frac1q.$$

You are standing at a pole and a snail is moving directly away from the pole at $1$ cm/s. When the snail is $1$ meter away, you start "Round 1". In Round $n$ ($n\ge 1$), you move directly toward the snail at $n+1$ cm/s. When you reach the snail, you immediately turn around and move back to the starting pole at $n + 1$ cm/s. When you reach the pole, you immediately turn around and Round $n + 1$ begins. At the start of Round $100$, how many meters away is the snail?

Real numbers $x,y,a$ are such that $x+y=x^2+y^2=x^3+y^3=a$. Find all the possible values of $a$.

Integers not divisible by $2012$ are arranged on the arcs of an oriented graph. We call the [i]weight of a vertex [/i]the difference between the sum of the numbers on the arcs coming into it and the sum of the numbers on the arcs going away from it. It is known that the weight of each vertex is divisible by $2012$. Prove that non-zero integers with absolute values not exceeding $2012$ can be arranged on the arcs of this graph, so that the weight of each vertex is zero. [i]Proposed by W. Tutte[/i]

Let $y_1$ and $y_2$ be two linearly independent solutions of the equation $$y''+P(x)y'+Q(x)=0.$$ Find the differential equation satisfied by the product $z=y_1 y_2$.

The nine squares in the table shown are to be filled so that every row and every column contains each of the numbers $1,2,3$. Then $A+B=$ \[\begin{tabular}{|c|c|c|} \hline 1 & & \\ \hline & 2 & A \\ \hline & & B \\ \hline \end{tabular}\] $\text{(A)}\ 2 \qquad \text{(B)}\ 3 \qquad \text{(C)}\ 4 \qquad \text{(D)}\ 5 \qquad \text{(E)}\ 6$

There were $n{}$ positive integers. For each pair of those integers Boris wrote their arithmetic mean onto a blackboard and their geometric mean onto a whiteboard. It so happened that for each pair at least one of those means was integer. Prove that on at least one of the boards all the numbers are integer. [i]Boris Frenkin[/i]

Let $C_1$ and $C_2$ be two tangent unit circles inside a circle $C$ of radius $2$. Circle $C_3$ inside $C$ is tangent to the circles $C,C_1,C_2$, and circle $C_4$ inside $C$ is tangent to $C,C_1,C_3$. Prove that the centers of $C,C_1,C_3$ and $C_4$ are vertices of a rectangle.

Three mutually externally tangent circles are internally tangent to a circle with radius $1$. If two of the inner circles have radius $\frac{1}{3}$, the largest possible radius of the third inner circle can be expressed in the form $\frac{a+b\sqrt{c}}{d}$ where $c$ is squarefree and $\gcd(a,b,d)=1$. Find $a+b+c+d$.

The vertices of a triangle are lattice points (they have integer coordinates). There are no other lattice points on the boundary of the triangle, but there is exactly one lattice point inside the triangle. Show that it must be the centroid.

Let $k$ be any fixed positive integer. Let's look at integer pairs $(a, b)$, for which the quadratic equations $x^2 - 2ax + b = 0$ and $y^2 + 2ay + b = 0$ are real solutions (not necessarily different), which can be denoted by $x_1, x_2$ and $y_1, y_2$, respectively, in such an order that the equation $x_1 y_1 - x_2 y_2 = 4k$. a) Find the largest possible value of the second component $b$ of such a pair of numbers ($a, b)$. b) Find the sum of the other components of all such pairs of numbers.