Each point of the sphere of radius $r\ge 1$ is colored in one of $n$ colors ($n \ge 2$), and for each color there is a point on the sphere colored in this color. Prove that there are points $A_i$, $B_i$, $i= 1, ..., n$ on the sphere such that the colors of the points $A_1, ..., A_n$ are pairwise different and the color of the point $B_i$ at a distance of $1$ from $A_i$ is different from the color of the point $A_1, i= 1, ..., n$

Let $a$, $b$, and $c$ be three distinct one-digit numbers. What is the maximum value of the sum of the roots of the equation $(x-a)(x-b)+(x-b)(x-c)=0$? $\textbf{(A) } 15 \qquad\textbf{(B) } 15.5 \qquad\textbf{(C) } 16 \qquad\textbf{(D) } 16.5 \qquad\textbf{(E) } 17 $

Let $k$ be a positive integer and $a_1, a_2, ...$ be a sequence of terms from set $\{ 0, 1, ..., k \}$. Let $b_n = \sqrt[n] {a_1^n + a_2^n + ... + a_n^n}$ for all positive integers $n$. Prove, that if in sequence $b_1, b_2, b_3, ...$ are infinitely many integers, then all terms of this series are integers.

Prove that you can't split a square into finitely many hexagons, whose inner angles are all less than $180^o$.

Let $n \geq 4$, and consider a (not necessarily convex) polygon $P_1P_2\hdots P_n$ in the plane. Suppose that, for each $P_k$, there is a unique vertex $Q_k\ne P_k$ among $P_1,\hdots, P_n$ that lies closest to it. The polygon is then said to be [i]hostile[/i] if $Q_k\ne P_{k\pm 1}$ for all $k$ (where $P_0 = P_n$, $P_{n+1} = P_1$). (a) Prove that no hostile polygon is convex. (b) Find all $n \geq 4$ for which there exists a hostile $n$-gon.

How many of the numbers $1\cdot 2\cdot 3$, $2\cdot 3\cdot 4$,..., $2020 \cdot 2021 \cdot 2022$ are divisible by $2020$?

Let $ABC$ be an acute triangle. Let $D$ be a point on side $AB$ and $E$ be a point on side $AC$ such that lines $BC$ and $DE$ are parallel. Let $X$ be an interior point of $BCED$. Suppose rays $DX$ and $EX$ meet side $BC$ at points $P$ and $Q$, respectively, such that both $P$ and $Q$ lie between $B$ and $C$. Suppose that the circumcircles of triangles $BQX$ and $CPX$ intersect at a point $Y \neq X$. Prove that the points $A, X$, and $Y$ are collinear.

Let $p \neq 13$ be a prime number of the form $8k+5$ such that $39$ is a quadratic non-residue modulo $p$. Prove that the equation $$x_1^4+x_2^4+x_3^4+x_4^4 \equiv 0 \pmod p$$ has a solution in integers such that $p\nmid x_1x_2x_3x_4$.

Find all pairs $(x, y)$ of positive integers such that $x^2 + y^2 + 33^2 =2010\sqrt{x-y}$.

Show the the sum of any three consecutive positive integers is a divisor of the sum of their cubes.

Let $ a$, $ a'$, $ b$, and $ b'$ be real numbers with $ a$ and $ a'$ nonzero. The solution to $ ax \plus{} b \equal{} 0$ is less than the solution to $ a'x \plus{} b' \equal{} 0$ if and only if $ \textbf{(A)}\ a'b < ab' \qquad \textbf{(B)}\ ab' < a'b \qquad \textbf{(C)}\ ab < a'b' \qquad \textbf{(D)}\ \frac {b}{a} < \frac {b'}{a'}$ $ \textbf{(E)}\ \frac {b'}{a'} < \frac {b}{a}$

Determine all $ f:R\rightarrow R $ such that $$ f(xf(y)+y^3)=yf(x)+f(y)^3 $$

Let $a_0,a_1,\ldots$ be an infinite sequence of positive numbers. Prove that the inequality $1+a_n>\sqrt[n]2a_{n-1}$ holds for infinitely many positive integers $n$.

Let side $BC$ of $\bigtriangleup ABC$ be the diameter of a semicircle which cuts $AB$ and $AC$ at $D$ and $E$ respectively. $F$ and $G$ are the feet of the perpendiculars from $D$ and $E$ to $BC$ respectively. $DG$ and $EF$ intersect at $M$. Prove that $AM \perp BC$.

$\frac{2}{25}=$ $\text{(A)}\ .008 \qquad \text{(B)}\ .08 \qquad \text{(C)}\ .8 \qquad \text{(D)} 1.25 \qquad \text{(E)}\ 12.5$

A triangle is given whose altitudes' lengths are $\frac{1}{5},\frac{1}{5},\frac{1}{8}$. Evaluate the triangle's area.

A straight line is drawn through an arbitrary internal point $K$ of the trapezoid $ABCD$, intersecting the bases of $BC$ and $AD$ at points $P$ and $Q$, respectively. The circles circumscribed around the triangles $BPK$ and $DQK$ intersect, besides the point $K$, also at the point $L$. Prove that the point $L$ lies on the diagonal $BD$.

For a positive integer $n$, consider all nonincreasing functions $f : \{1,\hdots,n\}\to\{1,\hdots,n\}$. Some of them have a fixed point (i.e. a $c$ such that $f(c) = c$), some do not. Determine the difference between the sizes of the two sets of functions. [i]Remark.[/i] A function $f$ is [i]nonincreasing[/i] if $f(x) \geq f(y)$ holds for all $x \leq y$

Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ with the property that $$f(x)f(y) = (xy - 1)^2f\left(\frac{x + y - 1}{xy - 1}\right)$$ for all real numbers $x, y$ with $xy \neq 1$.

Three wise men live in an old region. As they do not always agree on their advice to the king, he decided to stay with the wisest of the three, killing the others. To decide which of them was saved, performed the following test: He put each sage a hat, without him seeing its color, then locked them in a common room and told them: $\bullet$ Only the first to guess the color of his own hat will save his life. $\bullet$ In total there are five hats, three are white and two are black. $\bullet$ You cannot communicate with each other, but you can look at each other. After a long time, one of the wise men says: "I know the color of my hat." What color did they have? How did you figure it out? What color were the other hats used?

Solve the following system for real $x,y,z$ \[ \{ \begin{array}{ccc} x+ y -z & =& 4 \\ x^2 - y^2 + z^2 & = & -4 \\ xyz & =& 6. \end{array} \]

There exists some integers $n,a_1,a_2,\ldots,a_{2012}$ such that \[ n^2=\sum_{1 \leq i \leq 2012}{{a_i}^{p_i}} \] where $p_i$ is the i-th prime ($p_1=2,p_2=3,p_3=5,p_4=7,\ldots$) and $a_i>1$ for all $i$?

Done working on his sand castle design, Joshua sits down and starts rolling a $12$-sided die he found when cleaning the storage shed. He rolls and rolls and rolls, and after $17$ rolls he finally rolls a $1$. Just $3$ rolls later he rolls the first $2\textit{ after}$ that first roll of $1$. $11$ rolls later, Joshua rolls the first $3\textit{ after}$ the first $2$ that he rolled $\textit{after}$ the first $1$ that he rolled. His first $31$ rolls make the sequence \[4,3,11,3,11,8,5,2,12,9,5,7,11,3,6,10,\textbf{1},8,3,\textbf{2},10,4,2,8,1,9,7,12,11,4,\textbf{3}.\] Joshua wonders how many times he should expect to roll the $12$-sided die so that he can remove all but $12$ of the numbers from the entire sequence of rolls and (without changing the order of the sequence), be left with the sequence \[1,2,3,4,5,6,7,8,9,10,11,12.\] What is the expected value of the number of times Joshua must roll the die before he has such a sequence? (Assume Joshua starts from the beginning - do $\textit{not}$ assume he starts by rolling the specific sequence of $31$ rolls above.)

Triangle $ABC$ has $\overline{AB} = 5, \overline{BC} = 4, \overline{CA} = 6$. Points $D$ and $E$ are on sides $AB$ and $AC$, respectively, such that $\overline{AD} = \overline{AE} = \overline{BC}$. Let $CD$ and $BE$ intersect at $F$ and let $AF$ and $DE$ intersect at $G$. The length of $FG$ can be expressed in the form $\tfrac{a\sqrt{b}}{c}$ in simplified form. What is $a + b + c$?

Let $\lambda$ be a real number such that the inequality $0 <\sqrt {2002} - \frac {a} {b} <\frac {\lambda} {ab}$ holds for an infinite number of pairs $ (a, b)$ of positive integers. Prove that $\lambda \geq 5 $.