Ana and Luca play the following game. Ana writes a list of $n$ different integer numbers. Luca wins if he can choose four different numbers, $a, b, c$ and $d$, so that the number $a+b-(c+d)$ is multiple of $20$. Determine the minimum value of $n$ for which, whatever Ana's list, Luca can win.

Let $a$ and $b$ be parallel lines with $50$ distinct points marked on $a$ and $50$ distinct points marked on $b$. Find the greatest possible number of acute-angled triangles all of whose vertices are marked.

Given $1989$ points in the space, any three of them are not collinear. We divide these points into $30$ groups such that the numbers of points in these groups are different from each other. Consider those triangles whose vertices are points belong to three different groups among the $30$. Determine the numbers of points of each group such that the number of such triangles attains a maximum.

For all natural $n$, an $n$-staircase is a figure consisting of unit squares, with one square in the first row, two squares in the second row, and so on, up to $n$ squares in the $n^{th}$ row, such that all the left-most squares in each row are aligned vertically. Let $f(n)$ denote the minimum number of square tiles requires to tile the $n$-staircase, where the side lengths of the square tiles can be any natural number. e.g. $f(2)=3$ and $f(4)=7$. (a) Find all $n$ such that $f(n)=n$. (b) Find all $n$ such that $f(n) = n+1$.

5. Nine farmers have a checkered $9 \times 9$ field. There is a fence along the boundary of the field. The entire field is completely covered with berries (there is a berry in every point of the field, except the points of the fence). The farmers divided the field along the grid lines in 9 plots of equal area (every plot is a polygon), however they did not demarcate their boundaries. Each farmer takes care of berries only inside his own plot (not on its boundaries). A farmer will notice a loss only if at least two berries disappeared inside his plot. There is a crow which knows all of the above, except the location of boundaries of plots. Can the crow carry off 8 berries from the field so that for sure no farmer will notice this? Tatiana Kazitsina

The edges of a cube are labeled from $1$ to $12$. Show that there must exist at least eight triples $(i, j, k)$ with $1 \leq i < j < k \leq 12$ so that the edges $i, j, k$ are consecutive edges of a path. Also show that there exists labeling in which we cannot find nine such triples.

Let $n$ be a positive integer. Two players $A$ and $B$ play a game in which they take turns choosing positive integers $k \le n$. The rules of the game are: (i) A player cannot choose a number that has been chosen by either player on any previous turn. (ii) A player cannot choose a number consecutive to any of those the player has already chosen on any previous turn. (iii) The game is a draw if all numbers have been chosen; otherwise the player who cannot choose a number anymore loses the game. The player $A$ takes the first turn. Determine the outcome of the game, assuming that both players use optimal strategies. [i]Proposed by Finland[/i]

A circle is located on the plane. What is the smallest number of lines you need to draw so that, symmetrically reflecting a given circle relative to these lines (in any order a finite number of times), it could cover any given point of the plane?

Find the number of ways to write $24$ as the sum of at least three positive integer multiples of $3$. For example, count $3 + 18 + 3$, $18 + 3 + 3$, and $3 + 6 + 3 + 9 + 3$, but not $18 + 6$ or $24$.

To prepare a stay abroad, students meet at a workshop including an excursion. To promote interaction between the students, they are to be distributed to two busses such that not too many of the students in the same bus know each other. Every student knows all those who know her. The number of such pairwise acquaintances is $k$. Prove that it is possible to distribute the students such that the number of pairwise acquaintances in each bus is at most $\frac{k}{3}$.

Draw all the diagonals of a convex polygon of $10$ sides. They divide their angles into $80$ parts. It is known that at least $59$ of those parts are equal. Determine the largest number of distinct values ​​among the $ 80$ angles of division and how many times each of those values ​​occurs.

If you roll four fair $6$-sided dice, what is the probability that at least three of them will show the same value?

There are three boxes of stones. Sisyphus moves stones one by one between the boxes. Whenever he moves a stone, Zeus gives him the number of coins that is equal to the difference between the number of stones in the box the stone was put in, and that in the box the stone was taken from (the moved stone does not count). If this difference is negative, then Sisyphus returns the corresponding amount to Zeus (if Sisyphus cannot pay, generous Zeus allows him to make the move and pay later). After some time all the stones lie in their initial boxes. What is the greatest possible earning of Sisyphus at that moment? [i]I. Izmest’ev[/i]

Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties: [list=disc] [*]every term in the sequence is less than or equal to $2^{2023}$, and [*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\] [/list]

Let $r$ be a given positive integer. Is is true that for every $r$-colouring of the natural numbers there exists a monochromatic solution of the equation $x+y=3z$? (proposed by B. Batbaysgalan, folklore)

Consider a 4-point configuration in the plane such that every 3 points can be covered by a strip of a unit width. Prove that: 1) the four points can be covered by a strip of length at most $\sqrt2$ and 2)if no strip of length less that $\sqrt2$ covers all the four points, then the points are vertices of a square of length $\sqrt2$

A tourist going to visit the [i]Complant[/i], found that: a) in this country $1024$ cities, numbered by integers from $0$ to $1023$ , b) two cities with numbers $m$ and $n$ are connected by a straight line if and only if the binary entries of numbers $m$ and $n$ they differ exactly in one digit, c) during the stay of a tourist in that country $8$ roads will be closed for scheduled repairs. Prove that a tourist can make a closed route along the existing roads of [i]Complant[/i], passing through each of its cities exactly once.

Annie drew a rectangle and partitioned it into $n$ rows and $k$ columns with horizontal and vertical lines. Annie knows the area of the resulting $n \cdot k$ little rectangles while Benny does not. Annie reveals the area of some of these small rectangles to Benny. Given $n$ and $k$ at least how many of the small rectangle’s areas did Annie have to reveal, if from the given information Benny can determine the areas of all the $n \cdot k$ little rectangles? For example in the case $n = 3$ and $k = 4$ revealing the areas of the $10$ small rectangles if enough information to find the areas of the remaining two little rectangles. [img]https://cdn.artofproblemsolving.com/attachments/b/1/c4b6e0ab6ba50068ced09d2a6fe51e24dd096a.png[/img]

Let $ABC$ be an equilateral triangle. From the vertex $A$ we draw a ray towards the interior of the triangle such that the ray reaches one of the sides of the triangle. When the ray reaches a side, it then bounces off following the law of reflection, that is, if it arrives with a directed angle $\alpha$, it leaves with a directed angle $180^{\circ}-\alpha$. After $n$ bounces, the ray returns to $A$ without ever landing on any of the other two vertices. Find all possible values of $n$.

Sitting at a desk, Alice writes a nonnegative integer $N$ on a piece of paper, with $N \le 10^{10}$. Interestingly, Celia, sitting opposite Alice at the desk, is able to properly read the number upside-down and gets the same number $N$, without any leading zeros. (Note that the digits 2, 3, 4, 5, and 7 will not be read properly when turned upside-down.) Find the number of possible values of $N$. [i]Proposed by Yannick Yao[/i]

Let $P$ be a simple polygon completely in $C$, a circle with radius $1$, such that $P$ does not pass through the center of $C$. The perimeter of $P$ is $36$. Prove that there is a radius of $C$ that intersects $P$ at least $6$ times, or there is a circle which is concentric with $C$ and have at least $6$ common points with $P$. [i]Proposed by Seyed Reza Hosseini[/i]

In a sport competition, there are teams of two different countries, with $5$ teams in each country. Each team plays against two teams from each country, including the one itself belongs to, one game at home, one away. How many different ways can one choose the matches in this competition?

Let $C$ be the set of all 100-digit numbers consisting of only the digits $1$ and $2$. Given a number in $C$, we may transform the number by considering any $10$ consecutive digits $x_0x_1x_2 \dots x_9$ and transform it into $x_5x_6\dots x_9x_0x_1\dots x_4$. We say that two numbers in $C$ are similar if one of them can be reached from the other by performing finitely many such transformations. Let $D$ be a subset of $C$ such that any two numbers in $D$ are not similar. Determine the maximum possible size of $D$.

Let $m > n$ be positive integers. In the host country of the International Olympiad in Informatics this year, there are coins of $1$, $2$, $\ldots$, $n$ [i]alexandrias[/i], [i]lira[/i] banknotes, each worth $m$ alexandrias, and [i]pharaoh[/i] banknotes, each worth $m+n$ alexandrias. Let $A$ be a positive integer. Boris wants to exchange the amount $A$ using coins and lira, using no more than $m-1$ coins, while Vesko wants to exchange the amount $A$ using coins and pharaohs, using no more than $m$ coins. Prove that regardless of the value of $A$, the number of ways for each of them to fulfill their desire is the same.

Let $n(\ge 2)$ be an integer. $2n^2$ contestants participate in a Chinese chess competition, where any two contestant play exactly once. There may be draws. It is known that (1)If A wins B and B wins C, then A wins C. (2)there are at most $\frac{n^3}{16}$ draws. Proof that it is possible to choose $n^2$ contestants and label them $P_{ij}(1\le i,j\le n)$, so that for any $i,j,i',j'\in \{1,2,...,n\}$, if $i<i'$, then $P_{ij}$ wins $P_{i'j'}$.