A piece is placed in the lower left-corner cell of the $15 \times 15$ board. It can move to the cells that are adjacent to the sides or the corners of its current cell. It must also alternate between horizontal and diagonal moves $($the first move must be diagonal$).$ What is the maximum number of moves it can make without stepping on the same cell twice$?$

Five edges of a tetrahedron are tangent to a sphere. Prove that there are another five edges from this tetrahedron that are also tangent to a $($not necessarily the same$)$ sphere.

Let $A$ be a countable set, some of its countable subsets are selected such that; the intersection of any two selected subsets has at most one element. Find the smallest $k$ for which one can ensure that we can color elements of $A$ with $k$ colors such that each selected subsets exactly contain one element of one of the colors and an infinite number of elements of each of the other colors.

Vasya has a calculator that works with pairs of numbers. The calculator knows hoe to make a pair $(x+y,x)$ or a pair $(2x+y+1,x+y+1)$ from a pair $(x,y).$ At the beginning, the pair $(1,1)$ is presented on the calculator. Prove that for any natural $n$ there is exactly one pair $(n,k)$ that can be obtained using a calculator.

Prove that there are infinitely many positive integers $k$ such that $k(k+1)(k+2)(k+3)$ has no prime divisor of the form $8t+5.$

$239$ wise men stand in a circle near an opaque baobab. The king put on the head of each of these wise men a hat og one of $16$ colors. Each wise men does nor know the color of his hat and can only see the two nearest wise men on each side around the circle. Without communicating, these wise men must at the same time make a guess about the color of their hat $($i.e, tell one color$)$. These wise men were allowed to consult in advance, while they are afraid of being too lucky. What is the maximum $k$ for which, in any arrangement of hats, they can certainly ensure that no more than $k$ wise men guess the color of their hats$?$

Points $A,B,C$are chosen inside the triangle $ A_{1}B_{1}C_{1},$ so that the quadrilaterals $B_{1}CBC_{1}, C_{1}ACA_{1}$ and $A_{1}BAB_{1}$ are inscribed in the circles $\Omega _{A}, \Omega _{B}$ and $\Omega _{C},$ respectively. The circle $Y_{A}$ internally touches the circles $\Omega _{B}, \Omega _{C}$ and externally touches the circle $\Omega _{A}.$ The common interior tangent to the circles $Y_{A}$ and $\Omega _{A}$ intersects the line $BC$ at point $A'.$ Points $B'$ and $C'$ are analogously defined. Prove that points $A',B'$ and $C'$ are lying on the same line.

Prove that there is positive integers $N$ such that the equation $$arctan(N)=\sum_{i=1}^{2020} a_i arctan(i),$$does not hold for any integers $a_{i}.$

Egor and Igor take turns (Igor starts) replacing the coefficients of the polynomial \[a_{99}x^{99} + \cdots + a_1x + a_0\]with non-zero integers. Egor wants the polynomial to have as many different integer roots as possible. What is the largest number of roots he can always achieve?

Point $I{}$ is the center of the circle inscribed in the quadrilateral $ABCD$. Prove that there is a point $K{}$ on the ray $CI$ such that $\angle KBI=\angle KDI=\angle BAI$.

The degrees of all vertices of a graph are not less than 100 and not more than 200. Prove that its vertices can be divided into connected pairs and triples.

On the side $BC$ of the rectangle $ABCD$, a point $P{}$ is marked so that $\angle APD = 90^\circ$. On the straight line $AD$, points $Q{}$ and $R{}$ are selected outside the segment $AD$ such that $AQ = BP$ and $CP = DR$. The circle $\omega$ passes through the points $Q, D$ and the circumcenter of the triangle $PDQ$. The circle $\gamma$ passes through the points $A, R$ and the circumcenter of the triangle $APR$. Prove that the radius of one of the circles touching the line $AD$ and the circles $\omega$ and $\gamma$ is $2AB$.

There are several rational numbers written on a board. If the numbers $x{}$ and $y{}$ are present on the board, we can add the number $(x+y)/(1-xy)$ to it. Prove that there is a rational number that cannot ever appear on the board.