All internal angles of a convex octagon $ABCDEFGH$ are equal to each other and the edges are alternatively equal: $$AB = CD = EF = GH,BC = DE = FG = HA$$ (we call such an octagon semiregular). The diagonals $AD$, $BE$, $CF$, $DG$, $EH$, $FA$, $GB$ and $HC$ divide the inside of the octagon into certain parts. Consider the part containing the centre of the octagon. If that part is an octagon, then this central octagon is semiregular (this is obvious). In this case we construct similar diagonals in the central octagon and so on. If, after several steps, the central figure is not an octagon, then the process stops. Prove that if the process never stops, then the initial octagon was regular. (A. Tolpygo, Kiev)

Examine if we can put the sixteen positive divisors of $2024$ on the cells of the table shown such that the sum of the four numbers of any line or row to be a multiple of $3$. $ \begin{tabular}{ | l | c | c | r| } \hline & & & \\ \hline & & & \\ \hline & & & \\ \hline & & & \\ \hline \end{tabular} $

For each positive integer $n$ determine the maximum number of points in space creating the set $A$ which has the following properties: $1)$ the coordinates of every point from the set $A$ are integers from the range $[0, n]$ $2)$ for each pair of different points $(x_1,x_2,x_3), (y_1,y_2,y_3)$ belonging to the set $A$ it is satisfied at least one of the following inequalities $x_1< y_1, x_2<y_2, x_3<y_3$ and at least one of the following inequalities $x_1>y_1, x_2>y_2,x_3>y_3$.

Let $P$ be a polygon formed by the edges of an infinite chessboard, which does not intersect itself. Let the numbers $a_1,a_2,a_3$ represent the number of unit squares that have exactly $1,2\text{ or } 3$ edges on the boundary of $P$ respectively. Find the largest real number $k$ such that the inequality $a_1+a_2>ka_3$ holds for each polygon constructed with these conditions.

Given a convex polyhedron $F$. Its vertex $A$ has degree $5$, other vertices have degree $3$. A colouring of edges of $F$ is called nice, if for any vertex except $A$ all three edges from it have different colours. It appears that the number of nice colourings is not divisible by $5$. Prove that there is a nice colouring, in which some three consecutive edges from $A$ are coloured the same way. [i]D. Karpov[/i]

In a round robin chess tournament each player plays every other player exactly once. The winner of each game gets $ 1$ point and the loser gets $ 0$ points. If the game is tied, each player gets $ 0.5$ points. Given a positive integer $ m$, a tournament is said to have property $ P(m)$ if the following holds: among every set $ S$ of $ m$ players, there is one player who won all her games against the other $ m\minus{}1$ players in $ S$ and one player who lost all her games against the other $ m \minus{} 1$ players in $ S$. For a given integer $ m \ge 4$, determine the minimum value of $ n$ (as a function of $ m$) such that the following holds: in every $ n$-player round robin chess tournament with property $ P(m)$, the final scores of the $ n$ players are all distinct.

Let $n$ be a positive integer. Let $S$ be a subset of points on the plane with these conditions: $i)$ There does not exist $n$ lines in the plane such that every element of $S$ be on at least one of them. $ii)$ for all $X \in S$ there exists $n$ lines in the plane such that every element of $S - {X} $ be on at least one of them. Find maximum of $\mid S\mid$. [i]Proposed by Erfan Salavati[/i]

Let $n\geq 2$ be a natural number. A unit square is removed from a square $n$ x $n$ and the remaining figure is cut into squares 2 x 2 and 3 x 3. Determine all possible values of $n$.

A lake is in the shape of a regular hexagon of side length \(1\). Initially there is a single lotus leaf somewhere in the lake, sufficiently far from the shore. Each day, from every existing leaf a new leaf may grow at distance \(\sqrt{3}\) (measured between centers), provided it does not overlap any other leaf. If the lake is large enough that edge effects never interfere, what is the least number of days required to have \(2025\) leaves in the lake?

For $n \ge 2$, consider $n$ boxes aligned from left to right. In each box, one puts a ball that can be red, blue or white such that the following condition is fullled: [i]Each box is neighboring at least one box containing a ball of the same color.[/i] We denote by $I_n$ the number of such congurations. a) Determine $I_{11}$. Justify your answer. b) Find, with proof, the general formula for $I_n$.

Find the largest possible number of intersection points of the diagonals of a convex $n$-gon.

Let $n$ be an odd positive integer and consider an $n \times n$ chessboard of $n^2$ unit squares. In some of the cells of the chessboard, we place a knight. A knight in a cell $c$ is said to [i]attack [/i] a cell $c'$ if the distance between the centers of $c$ and $c'$ is exactly $\sqrt{5}$ (in particular, a knight does not attack the cell which it occupies). Suppose each cell of the board is attacked by an even number of knights (possibly zero). Show that the configuration of knights is symmetric with respect to all four axes of symmetry of the board (i.e. the configuration of knights is both horizontally and vertically symmetric, and also unchanged by reflection along either diagonal of the chessboard). [i]NIkolai Beluhov[/i]

In space, there are \( 13 \) points, no four of which lie in the same plane. Three of the points are colored blue, and the triangle with these points as vertices will be called a [i]blue triangle[/i]. The remaining \( 10 \) points are colored red. We say that a triangle with three red vertices is [i]attached[/i] to the blue triangle if the boundary of the red triangle intersects the blue triangle (either in its interior or on its boundary) at exactly one point. Is it possible for the number of attached triangles to be \( 33 \)?

A coin is flipped until there is a head followed by two tails. What is the probability that this will take exactly $12$ flips?

Some $n>2$ lamps are cyclically connected: lamp $1$ with lamp $2$, ..., lamp $k$ with lamp $k+1$,..., lamp $n-1$ with lamp $n$, lamp $n$ with lamp $1$. At the beginning all lamps are off. When one pushes the switch of a lamp, that lamp and the two ones connected to it change status (from off to on, or vice versa). Determine the number of configurations of lamps reachable from the initial one, through some set of switches being pushed.

There is a box with 2020 stones. Ana and Beto alternately play removing stones from the box and starting with Ana. Each player in turn must remove a positive number of stones that is capicua. Whoever leaves the box empty wins. Determine which of the two has a strategy winner and explain what that strategy is. $Note: $ A positive integer is capicua if it can be read equally from right to right. left and left to right. For example, 3, 22, 484 and 2002 are capicuas.

If we write the sequence $\text{AAABABBB}$ along the perimeter of a circle, then every word of the length $3$ consisting of letters $A$ and $B$ (i.e. $\text{AAA}$, $\text{AAB}$, $\text{ABA}$, $\text{BAB}$, $\text{ABB}$, $\text{BBB}$, $\text{BBA}$, $\text{BAA}$) occurs exactly once on the perimeter. Decide whether it is possible to write a sequence of letters from a $k$-element alphabet along the perimeter of a circle in such a way that every word of the length $l$ (i.e. an ordered $l$-tuple of letters) occurs exactly once on the perimeter.

Square $ABCD$ with side-length $n$ is divided into $n^2$ small (fundamental) squares by drawing lines parallel to its sides (the case $n=5$ is presented on the diagram).The squares' vertices that lie inside (or on the boundary) of the triangle $ABD$ are connected with each other with arcs.Starting from $A$,we move only upwards or to the right.Each movement takes place on the segments that are defined by the fundamental squares and the arcs of the circles.How many possible roots are there in order to reach $C$;

An equilateral triangle $ABC$ is divided into $100$ congruent equilateral triangles. What is the greatest number of vertices of small triangles that can be chosen so that no two of them lie on a line that is parallel to any of the sides of the triangle $ABC$?

Let $S$ be the set of words made from the letters $a,b$ and $c$. The equivalence relation $\sim$ on $S$ satisfies \[uu \sim u \] \[u \sim v \Rightarrow uw \sim vw \; \text{and} \; wu \sim wv\] for all words $u, v$ and $w$. Prove that every word in $S$ is equivalent to a word of length $\leq 8$.

$ n > 2 $ points are chosen on a circle and each of them is connected to every other by a segment. Is it possible to draw all of these segments in one sequence, i.e. so that the end of the first segment is the beginning of the second, the end of the second - the beginning of the third, etc., and so that the end of the last segment is the beginning of the first?

In a country, one can get from some point $A$ to any other point either by walking, or by calling a cab, waiting for it, and then being driven. Every citizen always chooses the method of transportation that requires the least time. It turns out that the distances and the traveling times are as follows: $1$ km takes $10$ min, $2$ km takes $15$ min, $3$ km takes $17.5 $ min. We assume that the speeds of the pedestrian and the cab, and the time spent waiting for cabs, are all constants. How long does it take to reach a point which is $6$ km from $A$?

A list of positive integers is called good if the maximum element of the list appears exactly once. A sublist is a list formed by one or more consecutive elements of a list. For example, the list $10,34,34,22,30,22$ the sublist $22,30,22$ is good and $10,34,34,22$ is not. A list is very good if all its sublists are good. Find the minimum value of $k$ such that there exists a very good list of length $2019$ with $k$ different values on it.

Prove that the plane is not a union of the inner regions of finitely many parabolas. (The outer region of a parabola is the union of the lines not intersecting the parabola. The inner region of a parabola is the set of points of the plane that do not belong to the outer region of the parabola)

In a group of people, there are some mutually friendly pairs. For positive integer $k\ge3$ we say the group is $k$-great, if every (unordered) $k$-tuple of people from the group can be seated around a round table it the way that all pairs of neighbors are mutually friendly. [i](Since this was the 67th year of CZE/SVK MO,)[/i] show that if the group is 6-great, then it is 7-great as well. [b]Bonus[/b] (not included in the competition): Determine all positive integers $k\ge3$ for which, if the group is $k$-great, then it is $(k+1)$-great as well.