The wizards $A, B, C, D$ know that the integers $1, 2, \ldots, 12$ are written on 12 cards, one integer on each card, and that each wizard will get three cards and will see only his own cards. Having received the cards, the wizards made several statements in the following order. “One of my cards contains the number 8”. “All my numbers are prime”. “All my numbers are composite and they all have a common prime divisor”. “Now I know all the cards of each wizard”. What were the cards of $A{}$ if everyone was right? Mikhail Evdokimov

There was a rook at some square of a $10 \times 10{}$ chessboard. At each turn it moved to a square adjacent by side. It visited each square exactly once. Prove that for each main diagonal (the diagonal between the corners of the board) the following statement is true: in the rook’s path there were two consecutive steps at which the rook first stepped away from the diagonal and then returned back to the diagonal. Alexandr Gribalko

Grasshopper Gerald and his 2020 friends play leapfrog on a plane as follows. At each turn Gerald jumps over a friend so that his original point and his resulting point are symmetric with respect to this friend. Gerald wants to perform a series of jumps such that he jumps over each friend exactly once. Let us say that a point is achievable if Gerald can finish the 2020th jump in it. What is the maximum number $N{}$ such that for some initial placement of the grasshoppers there are just $N{}$ achievable points? Mikhail Svyatlovskiy

What is the minimum $k{}$ for which among any three nonzero real numbers there are two numbers $a{}$ and $b{}$ such that either $|a-b|\leqslant k$ or $|1/a-1/b|\leqslant k$? Maxim Didin

Let $ABCD$ be a parallelogram and let $P{}$ be a point inside it such that $\angle PDA= \angle PBA$. Let $\omega_1$ be the excircle of $PAB$ opposite to the vertex $A{}$. Let $\omega_2$ be the incircle of the triangle $PCD$. Prove that one of the common tangents of $\omega_1$ and $\omega_2$ is parallel to $AD$. Ivan Frolov

There are 20 buns with jam and 20 buns with treacle arranged in a row in random order. Alice and Bob take in turn a bun from any end of the row. Alice starts, and wants to finally obtain 10 buns of each type; Bob tries to prevent this. Is it true for any order of the buns that Alice can win no matter what are the actions of Bob? Alexandr Gribalko

A checkered square of size $2\times2$ is covered by two triangles. Is it necessarily true that: at least one of its four cells is fully covered by one of the triangles; some square of size $1\times1$ can be placed into one of these triangles? Alexandr Shapovalov

Alice wrote a sequence of $n > 2$ nonzero nonequal numbers such that each is greater than the previous one by the same amount. Bob wrote the inverses of those n numbers in some order. It so happened that each number in his row also is greater than the previous one by the same amount, possibly not the same as in Alice’s sequence. What are the possible values of $n{}$? Alexey Zaslavsky

On a table there are all 8 possible horizontal bars $1\times3$ such that each $1\times1$ square is either white or gray (see the figure). It is allowed to move them in any direction by any (not necessarily integer) distance. We may not rotate them or turn them over. Is it possible to move the bars so that they do not overlap, all the white points form a polygon bounded by a closed non-self-intersecting broken line and the same is true for all the gray points? Mikhail Ilyinsky

The hypotenuse of a right triangle has length 1. Consider the line passing through the points of tangency of the incircle with the legs of the triangle. The circumcircle of the triangle cuts out a segment of this line. What is the possible length of this segment? Maxim Volchkevich

The number 7 is written on a board. Alice and Bob in turn (Alice begins) write an additional digit in the number on the board: it is allowed to write the digit at the beginning (provided the digit is nonzero), between any two digits or at the end. If after someone’s turn the number on the board is a perfect square then this person wins. Is it possible for a player to guarantee the win? Alexandr Gribalko

A parallelogram $ABCD$ is split by the diagonal $BD$ into two equal triangles. A regular hexagon is inscribed into the triangle $ABD$ so that two of its consecutive sides lie on $AB$ and $AD$ and one of its vertices lies on $BD$. Another regular hexagon is inscribed into the triangle $CBD{}$ so that two of its consecutive vertices lie on $CB$ and $CD$ and one of its sides lies on $BD$. Which of the hexagons is bigger? Konstantin Knop

Prove that for any positive integers $a_1, a_2, \ldots , a_n$ the following inequality holds true: \[\left\lfloor\frac{a_1^2}{a_2}\right\rfloor+\left\lfloor\frac{a_2^2}{a_3}\right\rfloor+\cdots+\left\lfloor\frac{a_n^2}{a_1}\right\rfloor\geqslant a_1+a_2+\cdots+a_n.\]Maxim Didin

Let us call a positive integer $k{}$ interesting if the product of the first $k{}$ primes is divisible by $k{}$. For example the product of the first two primes is $2\cdot3 = 6$, it is divisible by 2, hence 2 is an interesting integer. What is the maximal possible number of consecutive interesting integers? Boris Frenkin

A cube was split into 8 parallelepipeds by three planes parallel to its faces. The resulting parts were painted in a chessboard pattern. The volumes of the black parallelepipeds are 1, 6, 8, 12. Find the volumes of the white parallelepipeds. Oleg Smirnov

In a checkered square of size $2021\times 2021$ all cells are initially white. Ivan selects two cells and paints them black. At each step, all the cells that have at least one black neighbor by side are painted black simultaneously. Ivan selects the starting two cells so that the entire square is painted black as fast as possible. How many steps will this take? Ivan Yashchenko

Given is a segment $AB$. Three points $X, Y, Z$ are picked in the space so that $ABX$ is an equilateral triangle and $ABYZ$ is a square. Prove that the orthocenters of all triangles $XYZ$ obtained in this way belong to a fixed circle. Alexandr Matveev

Consider the segment $[0; 1]$. At each step we may split one of the available segments into two new segments and write the product of lengths of these two new segments onto a blackboard. Prove that the sum of the numbers on the blackboard never will exceed $1/2$. Mikhail Lukin

The Tournament of Towns is held once per year. This time the year of its autumn round is divisible by the number of the tournament: $2021\div 43 = 47$. How many times more will the humanity witness such a wonderful event? Alexey Zaslavsky

A pirate has five purses with 30 coins in each. He knows that one purse contains only gold coins, another one contains only silver coins, the third one contains only bronze coins, and the remaining two ones contain 10 gold, 10 silver and 10 bronze coins each. It is allowed to simultaneously take one or several coins out of any purses (only once), and examine them. What is the minimal number of taken coins that is necessary to determine for sure the content of at least one purse? Mikhail Evdokimov

A convex $n{}$-gon with $n > 4$ is such that if a diagonal cuts a triangle from it then this triangle is isosceles. Prove that there are at least 2 equal sides among any 4 sides of the $n{}$-gon. Maxim Didin

There were 20 participants in a chess tournament. Each of them played with each other twice: once as white and once as black. Let us say that participant $X{}$ is no weaker than participant $Y{}$ if $X{}$ has won at least the same number of games playing white as $Y{}$ and also has won at least the same number of games playing black as $Y{}$ . Do there exist for sure two participants $A{}$ and $B{}$ such that $A{}$ is not weaker than $B{}$? Boris Frenkin

For each of the $9$ positive integers $n,2n,3n,\dots , 9n$ Alice take the first decimal digit (from the left) and writes it onto a blackboard. She selected $n$ so that among the nine digits on the blackboard there is the least possible number of different digits. What is this number of different digits equals to?

On a blank paper there were drawn two perpendicular axes $x$ and $y$ with the same scale. The graph of a function $y=f(x)$ was drawn in this coordinate system. Then the $y$ axis and all the scale marks on the $x$ axis were erased. Provide a way how to draw again the $y$ axis using pencil, ruler and compass: (a) $f(x)= 3^x$; (b) $f(x)= \log_a x$, where $a>1$ is an unknown number.

The intersection of two triangles is a hexagon. If this hexagon is removed, six small triangles remain. These six triangles have the same in-radii. Prove the in-radii of the original two triangles are also equal. Spoiler: This is one of the highlights of TT. Also SA3

A rock travelled through an n x n board, stepping at each turn to the cell neighbouring the previous one by a side, so that each cell was visited once. Bob has put the integer numbers from 1 to n^2 into the cells, corresponding to the order in which the rook has passed them. Let M be the greatest difference of the numbers in neighbouring by side cells. What is the minimal possible value of M?

What is the maximal possible number of roots on the interval (0,1) for a polynomial of degree 2022 with integer coefficients and with the leading coefficient equal to 1?

The king assembled 300 wizards and gave them the following challenge. For this challenge, 25 colors can be used, and they are known to the wizards. Each of the wizards receives a hat of one of those 25 colors. If for each color the number of used hats would be written down then all these number would be different, and the wizards know this. Each wizard sees what hat was given to each other wizard but does not see his own hat. Simultaneously each wizard reports the color of his own hat. Is it possible for the wizards to coordinate their actions beforehand so that at least 150 of them would report correctly?

A starship is located in a halfspace at the distance $a$ from its boundary. The crew knows this but does not know which direction to move to reach the boundary plane. The starship may travel through the space by any path, may measure the way it has already travelled and has a sensor that signals when the boundary is reached. Is it possible to reach the boundary for sure, having passed no more than: $a)14a$ $b)13a$?

Find the largest positive integer $n$ such that for each prime $p$ with $2<p<n$ the difference $n-p$ is also prime.

Prove that for any convex quadrilateral it is always possible to cut out three smaller quadrilaterals similar to the original one with the scale factor equal to 1/2. (The angles of a smaller quadrilateral are equal to the corresponding original angles and the sides are twice smaller then the corresponding sides of the original quadrilateral.)

Consider a white 100×100 square. Several cells (not necessarily neighbouring) were painted black. In each row or column that contains some black cells their number is odd. Hence we may consider the middle black cell for this row or column (with equal numbers of black cells in both opposite directions). It so happened that all the middle black cells of such rows lie in different columns and all the middle black cells of the columns lie in different rows. a) Prove that there exists a cell that is both the middle black cell of its row and the middle black cell of its column. b) Is it true that any middle black cell of a row is also a middle black cell of its column?

There were made 7 golden, 7 silver and 7 bronze for a tournament. All the medals of the same material should weigh the same and the medals of different materials should have different weight. However, it so happened that exactly one medal had a wrong weight. If this medal is golden, it is lighter than a standard golden medal; if it is bronze, it is heavier than a standard bronze one; if it is silver, it may be lighter or heavier than a standard silver one. Is it possible to find the nonstandard one for sure, using three weighings on a balance scale with no weights?

Let $p$ be a prime number and let $M$ be a convex polygon. Suppose that there are precisely $p$ ways to tile $m$ with equilateral triangles with side $1$ and squares with side $1$. Show there is some side of $M$ of length $p-1$.

Peter picked a positive integer, multiplied it by 5, multiplied the result by 5,then multiplied the result by 5 again and so on. Altogether $k$ multiplications were made. It so happened that the decimal representations of the original number and of all $k$ resulting numbers in this sequence do not contain digit $7$. Prove that there exists a positive integer such that it can be multiplied $k$ times by $2$ so that no number in this sequence contains digit $7$.

The fox and pinocchio have grown a tree on the field of miracles with $8$ golden coins. It is known that exactly $3$ of them are counterfeit. All the real coins weigh the same, the counterfeit coins also weigh the same but are lighter. The fox and pinocchio have collected the coins and wish to divide them. The fox is going to give 3 coins to pinocchio, but pinocchio wants to check whether they all are real. Can he check this using $2$ weighings on a balance scale with no weights?

Let $n$ be a positive integer. Let us call a sequence $a_1,a_2,\dots,a_n$ interesting if for any $i=1,2,\dots,n$ either $a_i=i$ or $a_i=i+1$. Let us call an interesting sequence even if the sum of its members is even, and odd otherwise. Alice has multiplied all numbers in each odd interesting sequence and has written the result in her notebook. Bob, in his notebook, has done the same for each even interesting sequence. In which notebook is the sum of the numbers greater than by how much? (The answer may depend on $n$.)

Let us call a 1×3 rectangle a tromino. Alice and Bob go to different rooms, and each divides a 20 × 21 board into trominos. Then they compare the results, compute how many trominos are the same in both splittings, and Alice pays Bob that number of dollars. What is the maximal amount Bob may guarantee to himself no matter how Alice plays?

A quadrilateral ABCD is inscribed into a circle ω with center O. The circumcircle of the triangle AOC intersects the lines AB, BC, CD and DA the second time at the points M, N, K and L respectively. Prove that the lines MN, KL and the tangents to ω at the points A и C all touch the same circle.

Two friends walked towards each other along a straight road. Each had a constant speed but one was faster than the other. At one moment each friend released his dog to run freely forward, the speed of each dog is the same and constant. Each dog reached the other person and then returned to its owner. Which dog returned to its owner the first, of the person who walks fast or who walks slow?

Peter picked an arbitrary positive integer, multiplied it by 5, multiplied the result by 5, then multiplied the result by 5 again and so on. Is it true that from some moment all the numbers that Peter obtains contain 5 in their decimal representation?

The Fox and Pinocchio have grown a tree on the Field of Miracles with 11 golden coins. It is known that exactly 4 of them are counterfeit. All the real coins weigh the same, the counterfeit coins also weigh the same but are lighter. The Fox and Pinocchio have collected the coins and wish to divide them. The Fox is going to give 4 coins to Pinocchio, but Pinocchio wants to check whether they all are real. Can he check this using two weighings on a balance scale with no weights?

Consider a square ABCD. A point P was selected on its diagonal AC. Let H be the orthocenter of the triangle APD, let M be the midpoint of AD and N be the midpoint of CD. Prove that PN is orthogonal to MH.