Nina and Tadashi play the following game. Initially, a triple $(a, b, c)$ of nonnegative integers with $a+b+c=2021$ is written on a blackboard. Nina and Tadashi then take moves in turn, with Nina first. A player making a move chooses a positive integer $k$ and one of the three entries on the board; then the player increases the chosen entry by $k$ and decreases the other two entries by $k$. A player loses if, on their turn, some entry on the board becomes negative. Find the number of initial triples $(a, b, c)$ for which Tadashi has a winning strategy.

Find all positive integers $n$ for which all positive divisors of $n$ can be put into the cells of a rectangular table under the following constraints: [list] [*]each cell contains a distinct divisor; [*]the sums of all rows are equal; and [*]the sums of all columns are equal. [/list]

Decide whether there exists a largest positive integer $n$ such that the inequality \[\frac{\frac{a^2}{b}+\frac{b^2}{a}}{2} \ge \sqrt[n]{\frac{a^n+b^n}{2}}\] holds for all positive real numbers $a$ and $b$. If such a largest positive integer $n$ exists, determine it.

Find all pairs of natural numbers $(a,b)$ satisfying the following conditions: [list] [*]$b-1$ is divisible by $a+1$ and [*]$a^2+a+2$ is divisible by $b$. [/list]

Given $f,g\in L^1[0,1]$ and $\int_0^1 f = \int_0^1 g=1$, prove that there exists an interval I st $\int_I f = \int_I g=\frac12$.

Are there any integral solutions to $n^2 + (n+1)^2 + (n+2)^2 = m^2$ ?

(a)Two circles $S_1$ and $S_2$ are placed so that they do not overlap each other, neither completely nor partially. They have centres in $O_1$ and $O_2$, respectively. Further, $L_1$ and $M_1$ are different points on $S_1$ so that $O_2L_1$ and $O_2M_1$ are tangent to $S_1$, and similarly $L_2$ and $M_2$ are different points on $S_2$ so that $O_1L_2$ and $O_1M_2$ are tangent to $S_2$. Show that there exists a unique circle which is tangent to the four line segments $O_2L_1, O_2M_1, O_1L_2$, and $O_1M_2$. (b) Four circles $S_1, S_2, S_3$ and $S_4$ are placed so that none of them overlap each other, neither completely nor partially. They have centres in $O_1, O_2, O_3$, and $O_4$, respectively. For each pair $(S_i, S_j )$ of circles, with $1 \le i < j \le 4$, we find a circle $S_{ij}$ as in part [b]a[/b]. The circle $S_{ij}$ has radius $R_{ij}$ . Show that $\frac{1}{R_{12}} + \frac{1}{R_{23}}+\frac{1}{R_{34}}+\frac{1}{R_{14}}= 2 \left(\frac{1}{R_{13}} +\frac{1}{R_{24}}\right)$

Can every positive rational number $q$ be written as $$\frac{a^{2021} + b^{2023}}{c^{2022} + d^{2024}},$$ where $a, b, c, d$ are all positive integers? [i]Proposed by Dominic Yeo, UK[/i]

Let \(c\) be a real number. For all \(x\) and \(y\) real numbers we have, \[f(x-f(y))=f(x-y)+c(f(x)-f(y))\] and \(f(x)\) is not constant. \(a)\) Find all possible values of \(c\). \(b)\) Can \(f\) be periodic?

Show that an arbitrary quadrilateral can be divided into nine isosceles triangles.

Let $S$ be the set of sides and diagonals of a regular pentagon. A pair of elements of $S$ are selected at random without replacement. What is the probability that the two chosen segments have the same length? $ \textbf{(A) }\frac25\qquad\textbf{(B) }\frac49\qquad\textbf{(C) }\frac12\qquad\textbf{(D) }\frac59\qquad\textbf{(E) }\frac45 $

Given a line $k$ and three distinct points on it. Each of these points is the beginning of a pair of the rays - all the rays lie on the same side of the halfplane of the edge $k$. Each of these three pairs form a convex quadrilateral with another pair (so we have three quadrilaterals formed by these pairs of the rays). Prove that if it is possible to inscribe a circle in two of these quadrilaterals, then it is possible to inscribe a circle in the third one as well.

Let $a,b,c$ be real numbers such that $a^2+b^2+c^2=1$. Prove that \[\frac{a^2}{1+2bc}+\frac{b^2}{1+2ca}+\frac{c^2}{1+2ab} \ge \frac35\]

Some checkers placed on an $n \times n$ checkerboard satisfy the following conditions: (a) every square that does not contain a checker shares a side with one that does; (b) given any pair of squares that contain checkers, there is a sequence of squares containing checkers, starting and ending with the given squares, such that every two consecutive squares of the sequence share a side. Prove that at least $(n^{2}-2)/3$ checkers have been placed on the board.

We call a rectangle of the size $1 \times 2$ a domino. Rectangle of the $2 \times 3$ removing two opposite (under center of rectangle) corners we call tetramino. These figures can be rotated. It requires to tile rectangle of size $2008 \times 2010$ by using dominoes and tetraminoes. What is the minimal number of dominoes should be used?

Kendrick Lamar and Drake are cutting their circular beef to share with their fans. The cuts must pass all the way from one side of the beef to the other, and no other modifications may be performed on the beef (e.g. folding, eating, stacking, etc.). Find the minimum number of cuts they will need to split their beef into $2024$ pieces.