We want to paint some identically-sized cubes so that each face of each cube is painted a solid color and each cube is painted with six different colors. If we have seven different colors to choose from, how many distinguishable cubes can we produce?

A positive integer $n\geq 4$ is called [i]interesting[/i] if there exists a complex number $z$ such that $|z|=1$ and \[1+z+z^2+z^{n-1}+z^n=0.\] Find how many interesting numbers are smaller than $2022.$

In $\triangle{ABC}$ with $\angle{BAC}=60^\circ,$ points $D, E,$ and $F$ lie on $BC, AC,$ and $AB$ respectively, such that $D$ is the midpoint of $BC$ and $\triangle{DEF}$ is equilateral. If $BF=1$ and $EC=13,$ then the area of $\triangle{DEF}$ can be written as $\tfrac{a\sqrt{b}}{c},$ where $a$ and $c$ are relatively prime positive integers and $b$ is not divisible by a square of a prime. Compute $a+b+c.$

Positive integers $p, q, r$ satisfy $gcd(a,b,c) = 1$. Prove that there exists an integer $a$ such that $gcd(p,q+ar) = 1$.

Let $O$ be a point (in the plane) and $T$ be an infinite set of points such that $|P_1P_2| \le 2012$ for every two distinct points $P_1,P_2\in T$. Let $S(T)$ be the set of points $Q$ in the plane satisfying $|QP| \le 2013$ for at least one point $P\in T$. Now let $L$ be the set of lines containing exactly one point of $S(T)$. Call a line $\ell_0$ passing through $O$ [i]bad[/i] if there does not exist a line $\ell\in L$ parallel to (or coinciding with) $\ell_0$. (a) Prove that $L$ is nonempty. (b) Prove that one can assign a line $\ell(i)$ to each positive integer $i$ so that for every bad line $\ell_0$ passing through $O$, there exists a positive integer $n$ with $\ell(n) = \ell_0$. [i]Proposed by David Yang[/i]

Isabella has a bag with $20$ blue diamonds and $25$ purple diamonds. She repeats the following process $44$ times: she removes a diamond from the bag uniformly at random, then puts one blue diamond and one purple diamond into the bag. Compute the expected number of blue diamonds in the bag after all $44$ repetitions.

Find all $f: \mathbb R \to\mathbb R$ such that for all real numbers $x$, $f(x) \geq 0$ and for all real numbers $x$ and $y$, \[ f(x+y)+f(x-y)-2f(x)-2y^2=0. \]

Find the smallest value of the expression $|253^m - 40^n|$ over all pairs of positive integers $(m, n)$. [i]Proposed by Oleksii Masalitin[/i]

Segments $AA'$, $BB'$, and $CC'$ are the bisectrices of triangle $ABC$. It is known that these lines are also the bisectrices of triangle $A'B'C'$. Is it true that triangle $ABC$ is regular?

In space, $n$ wire triangles are situated so that any two of them have a common vertex and each vertex is the vertex of $k$ triangles. Find all $n$ and $k$ for which this is possible.

A graph contains $p$ vertices numbered from $1$ to $p$, and $q$ edges numbered from $p + 1$ to $p + q$. It turned out that for each edge the sum of the numbers of its ends and of the edge itself equals the same number $s$. It is also known that the numbers of edges starting in all vertices are equal. Prove that \[s = \dfrac{1}{2} (4p+q+3).\]

Find the digits left and right of the decimal point in the decimal form of the number \[ (\sqrt{2} + \sqrt{3})^{1980}. \]

Anna and Bob play the following game. In the beginning, Bob writes down the numbers $1, 2, ... , 2022$ on a piece of paper, such that half of the numbers are on the left and half on the right. Furthermore, we assume that the $1011$ numbers on both sides are written in some order. After Bob does this, Anna has the opportunity to swap the positions of the two numbers lying on different sides of the paper if they have different parity. Anna wins if, after finitely many moves, all odd numbers end up on the left, in increasing order, and all even ones end up on the right, in increasing order. Can Bob write down a arrangement of numbers for which Anna cannot win? For example, Bob could write down numbers in the following way: $$4, 2, 5, 7, 9, ... , 2021\,\,\,\,\,\,\,\,\,\,,\, \,\,\,\,\,\,\,\,\,\,,\, 3, 1, 6, 8, 10, ... , 2022$$ Then Anna could swap the numbers $1, 4$ and then swap $2, 3$ to win. However, if Anna swapped the pairs $3, 4$ and $1, 2$, the resulting numbers on the left and on the right would not be in increasing order, and hence Anna would not win.

Seven students in a class compare their marks in 12 subjects studied and observe that no two of the students have identical marks in all 12 subjects. Prove that we can choose 6 subjects such that any two of the students have different marks in at least one of these subjects.

How many ways are there to paint the squares of a $6 \times 6$ board black or white such that within each $2\times 2$ square on the board, the number of black squares is odd?

Five squirrels together have a supply of 2022 nuts. On the first day 2 nuts are added, on the second day 4 nuts, on the third day 6 nuts and so on, i.e. on each further day 2 nuts more are added than on the day before. At the end of any day the squirrels divide the stock among themselves. Is it possible that they all receive the same number of nuts and that no nut is left over?

We define the sequence $x_n$ so that \[x_1=a, x_2=b, x_n=\frac{{x_{n-1}}^2+{x_{n-2}}^2}{x_{n-1}+x_{n-2}} \quad \forall n \geq 3.\] Where $a,b >1$ are relatively prime numbers. Show that $x_n$ is not an integer for $n \geq 3$.

In triangle $ABC$, ($AB \ne AC$), let the orthocenter be $H$, circumcenter be $O$, and the midpoint of $BC$ be $M$. Let $HM \cap AO = D$. Let $P,Q,R,S$ be the midpoints of $AB,CD,AC,BD$. Let $X = PQ\cap RS$. Find $AH/OX$.

Suppose that $P(x)$ is a polynomial with degree $10$ and integer coefficients. Prove that, there is an infinite arithmetic progression (open to bothside) not contain value of $P(k)$ with $k\in\mathbb{Z}$

Let $G$ be the centroid of a triangle $ABC$. Prove that if $AB+GC = AC+GB$, then the triangle is isosceles

Let $n \ge 3$ be an integer. What is the largest possible number of interior angles greater than $180^\circ$ in an $n$-gon in the plane, given that the $n$-gon does not intersect itself and all its sides have the same length?

Six chairs sit in a row. Six people randomly seat themselves in the chairs. Each person randomly chooses either to set their feet on the floor, to cross their legs to the right, or to cross their legs to the left. There is only a problem if two people sitting next to each other have the person on the right crossing their legs to the left and the person on the left crossing their legs to the right. The probability that this will [b]not[/b] happen is given by $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Set $S_n = \sum_{p=1}^n (p^5+p^7)$. Determine the greatest common divisor of $S_n$ and $S_{3n}.$

The area of the triangle whose altitudes have lengths $36.4$, $39$, and $42$ can be written as $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

We have “bricks” made in the following way: we take a unit cube and glue to three of its faces which have a common vertex three more cubes in such a way that the faces glued together coincide. Is it possible to construct from these bricks an $11 \times 12 \times 13$ box? (A Andjans, Riga )