Let $P = \{p_1,p_2,\ldots, p_{10}\}$ be a set of $10$ different prime numbers and let $A$ be the set of all the integers greater than $1$ so that their prime decomposition only contains primes of $P$. The elements of $A$ are colored in such a way that: [list] [*] each element of $P$ has a different color, [*] if $m,n \in A$, then $mn$ is the same color of $m$ or $n$, [*] for any pair of different colors $\mathcal{R}$ and $\mathcal{S}$, there are no $j,k,m,n\in A$ (not necessarily distinct from one another), with $j,k$ colored $\mathcal{R}$ and $m,n$ colored $\mathcal{S}$, so that $j$ is a divisor of $m$ and $n$ is a divisor of $k$, simultaneously. [/list] Prove that there exists a prime of $P$ so that all its multiples in $A$ are the same color.

Let $P$ be a polynomial with integer coefficients of degree $d$. For the set $A = \{ a_1, a_2, ..., a_k\}$ of positive integers we denote $S (A) = P (a_1) + P (a_2) + ... + P (a_k )$. The natural numbers $m, n$ are such that $m ^{d+ 1} | n$. Prove that the set $\{1, 2, ..., n\}$ can be subdivided into $m$ disjoint subsets $A_1, A_2, ..., A_m$ with the same number of elements such that $S (A_1) = S(A_2) = ... = S (A_m )$.

Let $D(n)$ denote the number of ways of writing the positive integer $n$ as a product$$n = f_1\cdot f_2\cdots f_k,$$where $k\ge1$, the $f_i$ are integers strictly greater than $1$, and the order in which the factors are listed matters (that is, two representations that differ only in the order of the factors are counted as distinct). For example, the number $6$ can be written as $6$, $2\cdot 3$, and $3\cdot2$, so $D(6) = 3$. What is $D(96)$? $\textbf{(A) } 112 \qquad\textbf{(B) } 128 \qquad\textbf{(C) } 144 \qquad\textbf{(D) } 172 \qquad\textbf{(E) } 184$

Let $n$ and $k$ be positive integers. Prove that for $a_1, \dots, a_n \in [1,2^k]$ one has \[ \sum_{i = 1}^n \frac{a_i}{\sqrt{a_1^2 + \dots + a_i^2}} \le 4 \sqrt{kn}. \]

Find the sum of all real solutions for $x$ to the equation $(x^2 + 2x + 3)^{(x^2+2x+3)^{(x^2+2x+3)}} = 2012$.

If $w$ is one of the imaginary roots of the equation $x^3=1$, then the product $(1-w+w^2)(1+w-w^2)$ is equal to $\textbf{(A) }4\qquad\textbf{(B) }w\qquad\textbf{(C) }2\qquad\textbf{(D) }w^2\qquad \textbf{(E) }1$

Vertices $A$ and $C$ of the quadrilateral $ABCD$ are fixed points of the circle $k$ and each of the vertices $B$ and $D$ is moving to one of the arcs of $k$ with ends $A$ and $C$ in such a way that $BC=CD$. Let $M$ be the intersection point of $AC$ and $BD$ and $F$ is the center of the circumscribed circle around $\triangle ABM$. Prove that the locus of $F$ is an arc of a circle. [i]J. Tabov[/i]

Calculate the product $\tfrac13 \times \tfrac24 \times \tfrac35 \times \cdots \times \tfrac{18}{20} \times \tfrac{19}{21}$. $\textbf{(A) }\dfrac{1}{210}\qquad\textbf{(B) }\dfrac{1}{190}\qquad\textbf{(C) }\dfrac{1}{21}\qquad\textbf{(D) }\dfrac{1}{20}\qquad\textbf{(E) }\dfrac{1}{10}$

On a chessboard (with $64$ squares) there are situated $32$ white and $32$ black pools. We say that two pools form a mixed pair when they are with different colors and they lie on the same row or column. Find the maximum and the minimum of the mixed pairs for all possible situations of the pools. [i]K. Dochev[/i]

The following facts are known in a mathematical contest: [list] (a) The number of problems tested was $n\ge 4$ (b) Each problem was solved by exactly four contestants. (c) For each pair of problems, there is exactly one contestant who solved both problems [/list] Assuming the number of contestants is greater than or equal to $4n$, find the minimum value of $n$ for which there always exists a contestant who solved all the problems.

Let $ g : \mathbb{R} \rightarrow \mathbb{R}$ be a continuous function such that $ x+g(x)$ is strictly monotone (increasing or decreasing), and let $ u : [0,\infty) \rightarrow \mathbb{R}$ be a bounded and continuous function such that \[ u(t)+ \int_{t-1}^tg(u(s))ds\] is constant on $ [1,\infty)$. Prove that the limit $ \lim_{t\rightarrow \infty} u(t)$ exists. [i]T. Krisztin[/i]

Let $ABC$ be an acute angled triangle with incenter $I$. Line perpendicular to $BI$ at $I$ meets $BA$ and $BC$ at points $P$ and $Q$ respectively. Let $D, E$ be the incenters of $\triangle BIA$ and $\triangle BIC$ respectively. Suppose $D,P,Q,E$ lie on a circle. Prove that $AB=BC$.

The sequence $ \{a_n \} $ is defined as follows: $ a_0 = 1 $ and $ {a_n} = \sum \limits_ {k = 1} ^ {[\sqrt n]} {{a_ {n - {k ^ 2 }}}} $ for $ n \ge 1. $ Prove that among $ a_1, a_2, \ldots, a_ {10 ^ 6} $ there are at least $500$ even numbers. (Here, $ [x] $ is the largest integer not exceeding $ x $.)

A pile of $2020$ stones is given. Arnaldo and Bernaldo play the following game: In each move, it is allowed to remove $1, 4, 16, 64, ...$ (any power of $4$) stones from the pile. They make their moves alternately, and the player who can no longer play loses. If Arnaldo is the first to play, who has the winning strategy?

Let $x_1$ and $x_2$ be such that $x_1 \neq x_2$ and $3x_i^2-hx_i=b$, $i=1, 2$. Then $x_1+x_2$ equals $ \textbf{(A)}\ -\frac{h}{3} \qquad\textbf{(B)}\ \frac{h}{3} \qquad\textbf{(C)}\ \frac{b}{3} \qquad\textbf{(D)}\ 2b \qquad\textbf{(E)}\ -\frac{b}{3} $

Find the number of positive integers $n$ such that the highest power of $7$ dividing $n!$ is $8$.

There are $n$ lamps $L_1, L_2, \dots, L_n$ arranged in a circle in that order. At any given time, each lamp is either [i]on[/i] or [i]off[/i]. Every second, each lamp undergoes a change according to the following rule: (a) For each lamp $L_i$, if $L_{i-1}, L_i, L_{i+1}$ have the same state in the previous second, then $L_i$ is [i]off[/i] right now. (Indices taken mod $n$.) (b) Otherwise, $L_i$ is [i]on[/i] right now. Initially, all the lamps are [i]off[/i], except for $L_1$ which is [i]on[/i]. Prove that for infinitely many integers $n$ all the lamps will be [i]off[/i] eventually, after a finite amount of time.

Let $ABCDEF$ be a convex hexagon containing a point $P$ in its interior such that $PABC$ and $PDEF$ are congruent rectangles with $PA = BC = P D = EF$ (and $AB = PC = DE = PF$). Let $\ell$ be the line through the midpoint of $AF$ and the circumcentre of $PCD$. Prove that $\ell$ passes through $P$.

Peter made a paper rectangle, put it on an identical rectangle and pasted both rectangles along their perimeters. Then he cut the upper rectangle along one of its diagonals and along the perpendiculars to this diagonal from two remaining vertices. After this he turned back the obtained triangles in such a way that they, along with the lower rectangle form a new rectangle. Let this new rectangle be given. Restore the original rectangle using compass and ruler.

Let $ ABC$ be an arbitrary acute angled triangle. For any point $ P$ lying within the triangle, let $ D$, $ E$, $ F$ denote the feet of the perpendiculars from $ P$ onto the sides $ AB$, $ BC$, $ CA$ respectively. Determine the set of all possible positions of the point $ P$ for which the triangle $ DEF$ is isosceles. For which position of $ P$ will the triangle $ DEF$ become equilateral?

For a positive integer $n$, prove that $$\sum_{n \le p \le n^4} \frac{1}{p} < 4$$ where the sum is taken across primes $p$ in the range $[n, n^4]$ [i]N. Filonov[/i]

Find all polynomials $p(x)$ satisfying $p(x^3+1)=p(x+1)^3$ for all $x$.

Let $ a $ be a non-negative real number distinct from $ 1. $ [b]a)[/b] For which positive values $ x $ the equation $$ \left\lfloor\log_a x\right\rfloor +\left\lfloor \frac{1}{3} +\log_a x\right\rfloor =\left\lfloor 2\cdot\log_a x\right\rfloor $$ is true? [b]b)[/b] Solve $ \left\lfloor\log_3 x\right\rfloor +\left\lfloor \frac{1}{3} +\log_3 x\right\rfloor =3. $

The sum of two nonzero real numbers is $4$ times their product. What is the sum of the reciprocals of the two numbers? $\textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 8\qquad\textbf{(E)}\ 12$

Seven two-digit integers form a strictly increasing arithmetic sequence. If the first and last terms of this sequence have the same set of digits, what is the sum of all possible medians of the sequence?