Let $A_1$, $A_2$, $\ldots$, $A_n$, $n\geq 2$ be $n$ finite sets with the properties i) $|A_i| \geq 2$, for all $1\leq i \leq n$; ii) $|A_i\cap A_j| \neq 1$, for all $1\leq i<j\leq n$. Prove that the elements of the set $\displaystyle \bigcup_{i=1}^n A_i$ can be colored with 2 colors, such that all the sets $A_i$ are bi-color, for all $1\leq i \leq n$.

Prove that the sum of the squares of the right-angled projections of the sides of a triangle onto the line $ p $ of the plane of this triangle does not depend on the position of the line $ p $ if and only if it the triangle is equilateral.

Let $n$ be a positive integer. Bolek draws $2n$ points in the plane, no two of them defining a vertical or a horizontal line. Then Lolek draws for each of these $2n$ points two rays emanating from them, one of them vertically and the other one horizontally. Lolek wants to maximize the number of regions in which these rays divide the plane. Determine the largest number $k$ such that Lolek can obtain at least $k$ regions independent of the points chosen by Bolek.

Find a right triangle that can be cut into $365$ equal triangles.

Consider polynomials $P$ of degree $2015$, all of whose coefficients are in the set $\{0,1,\dots,2010\}$. Call such a polynomial [i]good[/i] if for every integer $m$, one of the numbers $P(m)-20$, $P(m)-15$, $P(m)-1234$ is divisible by $2011$, and there exist integers $m_{20}, m_{15}, m_{1234}$ such that $P(m_{20})-20, P(m_{15})-15, P(m_{1234})-1234$ are all multiples of $2011$. Let $N$ be the number of good polynomials. Find the remainder when $N$ is divided by $1000$. [i]Proposed by Yang Liu[/i]

Let $x, y$ be positive integers such that $\frac{x^2}{y}+\frac{y^2}{x}$ is an integer. Prove that $y|x^2$.

Let $ABC$ be a triangle with incenter $I$ and let $X$, $Y$ and $Z$ be the incenters of the triangles $BIC$, $CIA$ and $AIB$, respectively. Let the triangle $XYZ$ be equilateral. Prove that $ABC$ is equilateral too. [i]Proposed by Mirsaleh Bahavarnia, Iran[/i]

There are relatively prime positive integers $m$ and $n$ so that \[\dfrac{\dfrac{1}{2}}{\dfrac{\dfrac{1}{3}}{\dfrac{1}{4}+\dfrac{1}{4}+\dfrac{1}{4}}+\dfrac{\dfrac{1}{3}}{\dfrac{1}{4}+\dfrac{1}{4}+\dfrac{1}{4}}}=\dfrac{m}{n}.\]Find $m+2n$.

Tsrutsuna starts in the bottom left cell of a 7 × 7 square table, while Tsuna is in the upper right cell. The center cell of the table contains cheese. Tsrutsuna wants to reach Tsuna and bring a piece of cheese with him. From a cell Tsrutsuna can only move to the right or the top neighboring cell. Determine the number of different paths Tsrutsuna can take from the lower left cell to the upper right cell, such that he passes through the center cell. [i]Proposed by Giorgi Arabidze, Georgia[/i]

Let $ABC$ be a triangle with circumcircle $\Omega$ and incentre $I$. A line $\ell$ intersects the lines $AI$, $BI$, and $CI$ at points $D$, $E$, and $F$, respectively, distinct from the points $A$, $B$, $C$, and $I$. The perpendicular bisectors $x$, $y$, and $z$ of the segments $AD$, $BE$, and $CF$, respectively determine a triangle $\Theta$. Show that the circumcircle of the triangle $\Theta$ is tangent to $\Omega$.

Let $a_1,a_2,\ldots,a_n$ are different integer numbers in the range $[100,200]$ for which: $a_1+a_2+\ldots+a_n\ge11100$. Prove that it can be found at least number from the given in the representation of decimal system on which there are at least two equal digits. [i]L. Davidov[/i]

Let $ABCD$ be a cyclic quadrilateral. Let $DA$ and $BC$ intersect at $E$ and let $AB$ and $CD$ intersect at $F$. Assume that $A, E, F$ all lie on the same side of $BD$. Let $P$ be on segment $DA$ such that $\angle CPD = \angle CBP$, and let $Q$ be on segment $CD$ such that $\angle DQA = \angle QBA$. Let $AC$ and $PQ$ meet at $X$. Prove that, if $EX = EP$, then $EF$ is perpendicular to $AC$.

Esmeralda has created a special knight to play on quadrilateral boards that are identical to chessboards. If a knight is in a square then it can move to another square by moving 1 square in one direction and 3 squares in a perpendicular direction (which is a diagonal of a $2\times4$ rectangle instead of $2\times3$ like in chess). In this movement, it doesn't land on the squares between the beginning square and the final square it lands on. A trip of the length $n$ of the knight is a sequence of $n$ squares $C1, C2, ..., Cn$ which are all distinct such that the knight starts at the $C1$ square and for each $i$ from $1$ to $n-1$ it can use the movement described before to go from the $Ci$ square to the $C(i+1)$. Determine the greatest $N \in \mathbb{N}$ such that there exists a path of the knight with length $N$ on a $5\times5$ board.

In order to estimate the value of $x-y$ where $x$ and $y$ are real numbers with $x>y>0$, Xiaoli rounded $x$ up by a small amount, rounded $y$ down by the same amount, and then subtracted her values. Which of the following statements is necessarily correct? $ \textbf{(A)}\ \text{Her estimate is larger than }x-y\\ \textbf{(B)}\ \text{Her estimate is smaller than }x-y\\ \textbf{(C)}\ \text{Her estimate equals }x-y\\ \textbf{(D)}\ \text{Her estimate equals }y-x\\ \textbf{(E)}\ \text{Her estimate is }0 $

Find all polynomials $P(x)$ with real coefficients such that for all pairwise distinct positive integers $x, y, z, t$ with $x^2 + y^2 + z^2 = 2t^2$ and $\gcd(x, y, z, t ) = 1,$ the following equality holds \[2P^2(t ) + 2P(xy + yz + zx) = P^2(x + y + z) .\] [b]Note.[/b] $P^2(k)=\left( P(k) \right)^2.$

A convex quadrilateral $ ABCD$ is inscribed in a circle. The tangents to the circle through $ A$ and $ C$ intersect at a point $ P$, such that this point $ P$ does not lie on $ BD$, and such that $ PA^{2}=PB\cdot PD$. Prove that the line $ BD$ passes through the midpoint of $ AC$.