Points $A_1, A_2, ..., A_{10}$ are marked on a circle clockwise. It is known that these points can be divided into pairs of points symmetric with respect to the centre of the circle. Initially at each marked point there was a grasshopper. Every minute one of the grasshoppers jumps over its neighbour along the circle so that the resulting distance between them doesn't change. It is not allowed to jump over any other grasshopper and to land at a point already occupied. It occurred that at some moment nine grasshoppers were found at points $A_1, A_2, ... , A_9$ and the tenth grasshopper was on arc $A_9A_{10}A_1$. Is it necessarily true that this grasshopper was exactly at point $A_{10}$?

Find the greatest integer $k\leq 2023$ for which the following holds: whenever Alice colours exactly $k$ numbers of the set $\{1,2,\dots, 2023\}$ in red, Bob can colour some of the remaining uncoloured numbers in blue, such that the sum of the red numbers is the same as the sum of the blue numbers. Romania

Square $600\times 600$ is divided into figures of four types, shown in figure. In the figures of the two types, shown on the left, in painted black, the cells recorded number $2^k$, where $k$ is the number of the column, where is this cell (columns numbered from left to right by numbers from $1$ to $600$). Prove that the sum of all recorded numbers are divisible by $9$. [asy] // Set up the drawing area size(10cm,0); defaultpen(fontsize(10pt)); unitsize(0.8cm); // A helper function to draw a single unit square // c = coordinates of the lower-left corner // p = fill color (default is white) void drawsq(pair c, pen p=white) { fill(shift(c)*unitsquare, p); draw(shift(c)*unitsquare); } // --- Shape 1 (left) --- // 2 columns, 3 rows, black square in the middle-left drawsq((1,1), black); // middle-left black drawsq((2,0)); // bottom-right drawsq((2,1)); // middle-right drawsq((2,2)); // top-right // --- Shape 2 (next to the first) --- // 2 columns, 3 rows, black square in the middle-right drawsq((4,0)); drawsq((4,1)); drawsq((4,2)); drawsq((5,1), black); // middle-right black // --- Shape 3 (the "T" shape, 3 across the bottom + 1 in the middle top) --- drawsq((7,0)); drawsq((8,0)); drawsq((9,0)); drawsq((8,1)); // --- Shape 4 (the "T" shape, 3 across the top + 1 in the middle bottom) --- drawsq((11,1)); drawsq((12,1)); drawsq((13,1)); drawsq((12,0)); [/asy]

There are cities in country, and some cities are connected by roads. Not more than $100$ roads go from every city. Set of roads is called as ideal if all roads in set have not common ends, and we can not add one more road in set without breaking this rule. Every day minister destroy one ideal set of roads. Prove, that he need not more than $199$ days to destroy all roads in country.

Pete chose a positive integer $ n$. For each (unordered) pair of its decimal digits, he wrote their difference on the blackboard. After that, he erased some of these differences, and the remaining ones are $ 2,0,0,7$. Find the smallest number $ n$ for which this situation is possible.

Find all quadrilaterals which can be covered (without overlappings) with squares with side $ 1$ and equilateral triangles with side $ 1$. (Emanuele Tron)

Let $(a_1,a_2,a_3,a_4,a_5)$ be a random permutation of the integers from $1$ to $5$ inclusive. Find the expected value of $$\sum^5_{i=1} |a_i -i | = |a_1 -1|+|a_2 -2|+|a_3 -3|+|a_4 -4|+|a_5 -5|.$$ [i]Proposed by Muztaba Syed[/i]

Each person stands on a whole number on the number line from $0$ to $2022$ . In each turn, two people are selected by a distance of at least $2$. These go towards each other by $1$. When no more such moves are possible, the process ends. Show that this process always ends after a finite number of moves, and determine all possible configurations where people can end up standing. (whereby is for each configuration is only of interest how many people stand at each number.) [i](Birgit Vera Schmidt)[/i] [hide=original wording]Bei jeder ganzen Zahl auf dem Zahlenstrahl von 0 bis 2022 steht zu Beginn eine Person. In jedem Zug werden zwei Personen mit Abstand mindestens 2 ausgewählt. Diese gehen jeweils um 1 aufeinander zu. Wenn kein solcher Zug mehr möglich ist, endet der Vorgang. Man zeige, dass dieser Vorgang immer nach endlich vielen Zügen endet, und bestimme alle möglichen Konfigurationen, wo die Personen am Ende stehen können. (Dabei ist für jede Konfiguration nur von Interesse, wie viele Personen bei jeder Zahl stehen.)[/hide]

In a country with $n$ cities, some pairs of cities are connected by one-way flights operated by one of two companies $A$ and $B$. Two cities can be connected by more than one flight in either direction. An $AB$-word $w$ is called implementable if there is a sequence of connected flights whose companies’ names form the word $w$. Given that every $AB$-word of length $ 2^n $ is implementable, prove that every finite $AB$-word is implementable. (An $AB$-word of length $k$ is an arbitrary sequence of $k$ letters $A $ or $B$; e.g. $ AABA $ is a word of length $4$.)

Given a $15\times 15$ chessboard. We draw a closed broken line without self-intersections such that every edge of the broken line is a segment joining the centers of two adjacent cells of the chessboard. If this broken line is symmetric with respect to a diagonal of the chessboard, then show that the length of the broken line is $\leq 200$.

A robot is placed at point $P$ on the $x$-axis but different from $(0,0)$ and $(1,0)$ and can only move along the axis either to the left or to the right. Two players play the following game. Player $A$ gives a distance and $B$ gives a direction and the robot will move the indicated distance along the indicated direction. Player $A$ aims to move the robot to either $(0,0)$ or $(1,0)$. Player $B$'s aim is to stop $A$ from achieving his aim. For which $P$ can $A$ win?

Fix an integer $n \ge 1$. On a $m\times n$ chess board, what is the minimum value of $m$ such that $n$ queens can be placed on the chessboard without any two attacking each other? (A queen can attack vertically, horizontally, or diagonally across any distance.)

Suppose that $1000$ students are standing in a circle. Prove that there exists an integer $k$ with $100 \leq k \leq 300$ such that in this circle there exists a contiguous group of $2k$ students, for which the first half contains the same number of girls as the second half. [i]Proposed by Gerhard Wöginger, Austria[/i]

We call a graph with n vertices $k-flowing-chromatic$ if: 1. we can place a chess on each vertex and any two neighboring (connected by an edge) chesses have different colors. 2. we can choose a hamilton cycle $v_1,v_2,\cdots , v_n$, and move the chess on $v_i$ to $v_{i+1}$ with $i=1,2,\cdots ,n$ and $v_{n+1}=v_1$, such that any two neighboring chess also have different colors. 3. after some action of step 2 we can make all the chess reach each of the n vertices. Let T(G) denote the least number k such that G is k-flowing-chromatic. If such k does not exist, denote T(G)=0. denote $\chi (G)$ the chromatic number of G. Find all the positive number m such that there is a graph G with $\chi (G)\le m$ and $T(G)\ge 2^m$ without a cycle of length small than 2017.

Let $a$ and $b$ be positive integers. The cells of an $(a+b+1)\times (a+b+1)$ grid are colored amber and bronze such that there are at least $a^2+ab-b$ amber cells and at least $b^2+ab-a$ bronze cells. Prove that it is possible to choose $a$ amber cells and $b$ bronze cells such that no two of the $a+b$ chosen cells lie in the same row or column.

Prove that among $39$ consecutive natural numbers, there is always one whose sum of digits (in base $10$) is divisible by $11$.

Consider a natural number $ n $ for which it exist a natural number $ k $ and $ k $ distinct primes so that $ n=p_1\cdot p_2\cdots p_k. $ [b]a)[/b] Find the number of functions $ f:\{ 1, 2,\ldots , n\}\longrightarrow\{ 1,2,\ldots ,n\} $ that have the property that $ f(1)\cdot f(2)\cdots f\left( n \right) $ divides $ n. $ [b]b)[/b] If $ n=6, $ find the number of functions $ f:\{ 1, 2,3,4,5,6\}\longrightarrow\{ 1,2,3,4,5,6\} $ that have the property that $ f(1)\cdot f(2)\cdot f(3)\cdot f(4)\cdot f(5)\cdot f(6) $ divides $ 36. $

There are many of the same regular triangles. At the vertices of each of them, the numbers $1, 2, 3$ are written in random order. The triangles were superimposed on one another and found the sum of the numbers that fell into each of the three corners of the stack. Could it be that in each corner the sum is equal to: a) $25$, b) $50$?

Initially, the numbers $1, 2, \dots, 2024$ are written on a blackboard. Trixi and Nana play a game, taking alternate turns. Trixi plays first. The player whose turn it is chooses two numbers $a$ and $b$, erases both, and writes their (possibly negative) difference $a-b$ on the blackboard. This is repeated until only one number remains on the blackboard after $2023$ moves. Trixi wins if this number is divisible by $3$, otherwise Nana wins. Which of the two has a winning strategy? [i](Birgit Vera Schmidt)[/i]

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.

Consider a horizontal line $L$ with $n\ge 4$ different points $P_1, P_2, ..., P_n$. For each pair of points $P_i$ ,$P_j $a circle is drawn such that the segment $P_iP_j$ is a diameter. Determine the maximum number of intersections between circles that can occur, considering only those that occur strictly above $L$. [hide=original wording]Considere una recta horizontal $L$ con $n\ge 4$ puntos $P_1, P_2, ..., P_n$ distintos en ella. Para cada par de puntos $P_i,P_j$ se traza un circulo de manera tal que el segmento $P_iP_j$ es un diametro. Determine la cantidad maxima de intersecciones entre circulos que pueden ocurrir, considerando solo aquellas que ocurren estrictamente arriba de $L$.[/hide]

Tanya and Serezha take turns putting chips in empty squares of a chessboard. Tanya starts with a chip in an arbitrary square. At every next move, Serezha must put a chip in the column where Tanya put her last chip, while Tanya must put a chip in the row where Serezha put his last chip. The player who cannot make a move loses. Which of the players has a winning strategy? [i]Proposed by A. Golovanov[/i]

Let $n$ be some positive integer. Free university accepts $n^2$ freshmen, where no two students know each other initially. It's known that students can only get to know eachother on parties, which are organized by the university's administration. The administration's goal is to ensure that there does not exist a group of $n$ students where none of them know each other. Organizing a party with $m$ members incurs a cost of $m^2 - m$. Determine the minimal cost for the administration to fulfill their goal. [i]Proposed by Luka Macharashvili, Georgia[/i]

Given positive integer $m,n$, color the points of the regular $(2m+2n)$-gon in black and white, $2m$ in black and $2n$ in white. The [i]coloring distance[/i] $d(B,C) $ of two black points $B,C$ is defined as the smaller number of white points in the two paths linking the two black points. The [i]coloring distance[/i] $d(W,X) $ of two white points $W,X$ is defined as the smaller number of black points in the two paths linking the two white points. We define the matching of black points $\mathcal{B}$ : label the $2m$ black points with $A_1,\cdots,A_m,B_1,\cdots,B_m$ satisfying no $A_iB_i$ intersects inside the gon. We define the matching of white points $\mathcal{W}$ : label the $2n$ white points with $C_1,\cdots,C_n,D_1,\cdots,D_n$ satisfying no $C_iD_i$ intersects inside the gon. We define $P(\mathcal{B})=\sum^m_{i=1}d(A_i,B_i), P(\mathcal{W} )=\sum^n_{j=1}d(C_j,D_j) $. Prove that: $\max_{\mathcal{B}}P(\mathcal{B})=\max_{\mathcal{W}}P(\mathcal{W})$

There are $2006$ students and $14$ teachers in a school. Each student knows at least one teacher (knowing is a symmetric relation). Suppose that, for each pair of a student and a teacher who know each other, the ratio of the number of the students whom the teacher knows to that of the teachers whom the student knows is at least $t.$ Find the maximum possible value of $t.$