Find all pairs of distinct primes $(p,q)$ such that $p$ and $q$ are both prime factors of $p^3+q^2+1$, and are the only such prime factors. [i]Proposed by Takeda Shigenori[/i]

Andryusha has $100$ stones of different weight and he can distinguish the stones by appearance, but does not know their weight. Every evening, Andryusha can put exactly $10$ stones on the table and at night the brownie will order them in increasing weight. But, if the drum also lives in the house then surely he will in the morning change the places of some $2$ stones.Andryusha knows all about this but does not know if there is a drum in his house. Can he find out?

Let $S=\{1,2,3,4,5,6\}.$ Find the number of bijective functions $f:S\rightarrow S$ for which there exist exactly $6$ bijective functions $g:S\rightarrow S$ such that $f(g(x))=g(f(x))$ for all $x\in S$. [i]Proposed by Nathan Ramesh

Find all functions $f$ from reals to reals which satisfy $f (f(x) + f(y)) = f(x^2) + 2x^2 f(y) + (f(y))^2$ for all real numbers $x$ and $y$.

Find one pair of positive integers $a,b$ such that $ab(a+b)$ is not divisible by $7$, but $(a+b)^7-a^7-b^7$ is divisible by $7^7$.

Let $n$ be a positive integer. Suppose that we have disks of radii $1, 2, . . . , n.$ Of each size there are two disks: a transparent one and an opaque one. In every disk there is a small hole in the centre, with which we can stack the disks using a vertical stick. We want to make stacks of disks that satisfy the following conditions: $i)$ Of each size exactly one disk lies in the stack. $ii)$ If we look at the stack from directly above, we can see the edges of all of the $n$ disks in the stack. (So if there is an opaque disk in the stack,no smaller disks may lie beneath it.) Determine the number of distinct stacks of disks satisfying these conditions. (Two stacks are distinct if they do not use the same set of disks, or, if they do use the same set of disks and the orders in which the disks occur are different.)

There is the tournament for boys and girls. Every person played exactly one match with every other person, there were no draws. It turned out that every person had lost at least one game. Furthermore every boy lost different number of matches that every other boy. Prove that there is a girl, who won a match with at least one boy.

Let $AH_A, BH_B, CH_C$ be the altitudes of triangle $ABC$. Prove that if $\frac{H_BC}{AC} = \frac{H_CA}{AB}$, then the line symmetric to $BC$ with respect to line $H_BH_C$ is tangent to the circumscribed circle of triangle $H_BH_CA$. [i](Proposed by Mykhailo Bondarenko)[/i]

Let $a$ and $b$ be integers (not necessarily positive). Prove that $a^3+5b^3 \neq 2016$.

For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A it tromino is an $L$-shape formed by three connected unit squares. For which values of $n$ is it possible to cover all the black squares with non-overlapping trominos? When it is possible, what is the minimum number of trominos needed?

Let $r_n$ be the $n$th smallest positive solution to $\tan x=x$, where the argument of tangent is in radians. Prove that \[ 0<r_{n+1}-r_n-\pi<\frac{1}{(n^2+n)\pi} \] for $n\geq 1$.

For all positive integers $a > 1$, there are divisors of $2021a$ that are not divisors of $2021$. If there are twelve unshared divisors, including $2021a$, which of the following answer choices could be a possible value of $a$? $\textbf{(A) }9\qquad\textbf{(B) }10\qquad\textbf{(C) }16\qquad\textbf{(D) }18\qquad\textbf{(E) }19$

Prove that for all positive reals $a,b,c$, \[\frac{1}{a+\frac{1}{b}+1}+\frac{1}{b+\frac{1}{c}+1}+\frac{1}{c+\frac{1}{a}+1}\ge \frac{3}{\sqrt[3]{abc}+\frac{1}{\sqrt[3]{abc}}+1}. \][i]Proposed by David Stoner[/i]

Let $z$ be a complex number that satisfies the equation \[\frac{z-4}{z^2-5z+1} + \frac{2z-4}{2z^2-5z+1} + \frac{z-2}{z^2-3z+1} = \frac{3}{z}.\] Over all possible values of $z$, find the sum of the values of \[\left| \frac{1}{z^2-5z+1} + \frac{1}{2z^2-5z+1} + \frac{1}{z^2-3z+1} \right|.\] [i]Proposed by Justin Hsieh[/i]

Let $0 \le a < b$ be real numbers. Prove that there is no continuous function $f : [a, b] \to \mathbb{R}$ such that \[ \int_a^b f(x)x^{2n} \mathrm dx>0 \quad \text{and} \quad \int_a^b f(x)x^{2n+1} \mathrm dx <0 \] for every integer $n \ge 0$.

Let $n$ be an integer number greater than $2$, let $x_{1},x_{2},\ldots ,x_{n}$ be $n$ positive real numbers such that \[\sum_{i=1}^{n}\frac{1}{x_{i}+1}=1\] and let $k$ be a real number greater than $1$. Show that: \[\sum_{i=1}^{n}\frac{1}{x_{i}^{k}+1}\ge\frac{n}{(n-1)^{k}+1}\] and determine the cases of equality.

A uniform rod of length $2k$ and weight $w$ rests with the end $A$ against a vertical wall, while the lower end $B$ is fastened by a string $BC$ of length $2b$ coming from a point $C$ in the wall above $A.$ If the system is in equilibrium, determine the angle $ABC.$

Let $n$ be a positive integer. Find the maximal number of non-congruent triangles whose sides lengths are integers $\leq n.$

Mariana plays with an $8\times 8$ board with all its squares blank. She says that two houses are [i]neighbors [/i] if they have a common side or vertex, that is, two houses can be neighbors vertically, horizontally or diagonally. The game consists of filling the $64$ squares on the board, one after the other, each with a number according to the following rule: she always chooses a house blank and fill it with an integer equal to the number of neighboring houses that are still in White. Once this is done, the house is no longer considered blank. Show that the value of the sum of all $64$ numbers written on the board at the end of the game does not depend in the order of filling. Also, calculate the value of this sum. Note: A house is not neighbor to itself. [hide=original wording]Mariana brinca com um tabuleiro 8 x 8 com todas as suas casas em branco. Ela diz que duas casas s˜ao vizinhas se elas possu´ırem um lado ou um v´ertice em comum, ou seja, duas casas podem ser vizinhas verticalmente, horizontalmente ou diagonalmente. A brincadeira consiste em preencher as 64 casas do tabuleiro, uma ap´os a outra, cada uma com um n´umero de acordo com a seguinte regra: ela escolhe sempre uma casa em branco e a preenche com o n´umero inteiro igual `a quantidade de casas vizinhas desta que ainda estejam em branco. Feito isso, a casa n˜ao ´e mais considerada em branco. Demonstre que o valor da soma de todos os 64 n´umeros escritos no tabuleiro ao final da brincadeira n˜ao depende da ordem do preenchimento. Al´em disso, calcule o valor dessa soma. Observa¸c˜ao: Uma casa n˜ao ´e vizinha a si mesma[/hide]

Nonzero real numbers $x_1, x_2, \ldots, x_n$ satisfy the following condition: $$x_1 - \frac{1}{x_2} = x_2 - \frac{1}{x_3} = \ldots = x_{n-1} - \frac{1}{x_n} = x_n - \frac{1}{x_1}$$ Determine all $n$ for which $x_1, x_2, \ldots, x_n$ have to be equal. [i](Proposed by Oleksii Masalitin, Anton Trygub)[/i]

It is known that the equation$ |x - 1| + |x - 2| +... + |x - 2001| = a$ has exactly one solution. Find $a$.

Let $ABC$ be a triangle with circumcircle $\Omega$, incircle $\omega$, and $A$-excircle $\omega_A$. Let $X$ and $Y$ be the tangency points of $\omega_A$ with $AB$ and $AC$. Lines $XY$ and $BC$ intersect in $T$. The tangent from $T$ to $\omega$ different from $BC$ intersects $\omega$ at $K$. The radical axis of $\omega_A$ and $\Omega$ intersects $BC$ in $S$. The tangent from $S$ to $\omega_A$ different from $BC$ intersects $\omega_A$ at $L$. Prove that $A$, $K$ and $L$ are collinear. [i]Proposed by Ana Boiangiu[/i]

Show that the number $x$ is rational if and only if three distinct terms that form a geometric progression can be chosen from the sequence \[x, ~ x+1, ~ x+2,~ x+3,\ldots . \]

Let nonnegative real numbers $ a_{1},a_{2},a_{3},a_{4}$ satisfy $ a_{1} \plus{} a_{2} \plus{} a_{3} \plus{} a_{4} \equal{} 1.$ Prove that $ max\{\sum_{1}^4{\sqrt {a_{i}^2 \plus{} a_{i}a_{i \minus{} 1} \plus{} a_{i \minus{} 1}^2 \plus{} a_{i \minus{} 1}a_{i \minus{} 2}}},\sum_{1}^4{\sqrt {a_{i}^2 \plus{} a_{i}a_{i \plus{} 1} \plus{} a_{i \plus{} 1}^2 \plus{} a_{i \plus{} 1}a_{i \plus{} 2}}}\}\ge 2.$ Where for all integers $ i, a_{i \plus{} 4} \equal{} a_{i}$ holds.

The parallel sides of a trapezoid are $ 3$ and $ 9$. The non-parallel sides are $ 4$ and $ 6$. A line parallel to the bases divides the trapezoid into two trapezoids of equal perimeters. The ratio in which each of the non-parallel sides is divided is: [asy]defaultpen(linewidth(.8pt)); unitsize(2cm); pair A = origin; pair B = (2.25,0); pair C = (2,1); pair D = (1,1); pair E = waypoint(A--D,0.25); pair F = waypoint(B--C,0.25); draw(A--B--C--D--cycle); draw(E--F); label("6",midpoint(A--D),NW); label("3",midpoint(C--D),N); label("4",midpoint(C--B),NE); label("9",midpoint(A--B),S);[/asy]$ \textbf{(A)}\ 4: 3\qquad \textbf{(B)}\ 3: 2\qquad \textbf{(C)}\ 4: 1\qquad \textbf{(D)}\ 3: 1\qquad \textbf{(E)}\ 6: 1$