Let $n\ge 2$ be an integer, and let $a_1, a_2, \cdots , a_n$ be positive integers. Show that there exist positive integers $b_1, b_2, \cdots, b_n$ satisfying the following three conditions: $\text{(A)} \ a_i\le b_i$ for $i=1, 2, \cdots , n;$ $\text{(B)} \ $ the remainders of $b_1, b_2, \cdots, b_n$ on division by $n$ are pairwise different; and $\text{(C)} \ $ $b_1+b_2+\cdots b_n \le n\left(\frac{n-1}{2}+\left\lfloor \frac{a_1+a_2+\cdots a_n}{n}\right \rfloor \right)$ (Here, $\lfloor x \rfloor$ denotes the integer part of real number $x$, that is, the largest integer that does not exceed $x$.)

Positive integers $n$, $k>1$ are given. Pasha and Vova play a game on a board $n\times k$. Pasha begins, and further they alternate the following moves. On each move a player should place a border of length 1 between two adjacent cells. The player loses if after his move there is no way from the bottom left cell to the top right without crossing any order. Determine who of the players has a winning strategy.

Let $x, y$ and $k$ be three positive integers. Prove that there exist a positive integer $N$ and a set of $k + 1$ positive integers $\{b_0,b_1, b_2, ... ,b_k\}$, such that, for every $i = 0, 1, ... , k$ , the $b_i$-ary expansion of $N$ is a $3$-digit palindrome, and the $b_0$-ary expansion is exactly $\overline{\mbox{xyx}}$. proposed by Bojan Basic, Serbia

Let $n \ge 2$ be an integer. Find all real numbers $a$ such that there exist real numbers $x_1,x_2,\dots,x_n$ satisfying \[x_1(1-x_2)=x_2(1-x_3)=\dots=x_n(1-x_1)=a.\] [i]Proposed by Walther Janous and Gerhard Kirchner, Innsbruck.[/i]

Triangle $ ABC$ is scalene with angle $ A$ having a measure greater than 90 degrees. Determine the set of points $ D$ that lie on the extended line $ BC$, for which \[ |AD|\equal{}\sqrt{|BD| \cdot |CD|}\] where $ |BD|$ refers to the (positive) distance between $ B$ and $ D$.

We are given 5771 weights weighing 1,2,3,...,5770,5771. We partition the weights into $n$ sets of equal weight. What is the maximal $n$ for which this is possible?

On the Cartesian coordinate system $Oxy$, consider a sequence of points $A_n(x_n, y_n)$ in which $(x_n)^{\infty}_{n=1}$,$(y_n)^{\infty}_{n=1}$ are two sequences of positive numbers satisfing the following conditions: $$x_{n+1} =\sqrt{\frac{x_n^2+x_{n+2}^2}{2}}, y_{n+1} =\big( \frac{\sqrt{y_n}+\sqrt{y_{n+2}}}{2} \big)^2 \,\, \forall n \ge 1 $$ Suppose that $O, A_1, A_{2016}$ belong to a line $d$ and $A_1, A_{2016}$ are distinct. Prove that all the points $A_2, A_3,. .. , A_{2015}$ lie on one side of $d$.

Find all real numbers $x$ such that $\lfloor x^2-2x \rfloor+2\lfloor x \rfloor=\lfloor x \rfloor^2$. (For a real number $x$, $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x$.)

For real numer $ c$ for which $ cx^2\geq \ln (1\plus{}x^2)$ for all real numbers $ x$, find the value of $ c$ such that the area of the figure bounded by two curves $ y\equal{}cx^2$ and $ y\equal{}\ln (1\plus{}x^2)$ and two lines $ x\equal{}1,\ x\equal{}\minus{}1$ is 4.

Alice has an isosceles triangle $M_0N_0P$, where $M_0P=N_0P$ and $\angle M_0PN_0=\alpha^{\circ}$. (The angle is measured in degrees.) Given a triangle $M_iN_jP$ for nonnegative integers $i$ and $j$, Alice may perform one of two [i]elongations[/i]: a) an $M$-[i]elongation[/i], where she extends ray $\overrightarrow{PM_i}$ to a point $M_{i+1}$ where $M_iM_{i+1}=M_iN_j$ and removes the point $M_i$. b) an $N$-[i]elongation[/i], where she extends ray $\overrightarrow{PN_j}$ to a point $N_{j+1}$ where $N_jN_{j+1}=M_iN_j$ and removes the point $N_j$. After a series of $5$ elongations, $k$ of which were $M$-elongations, Alice finds that triangle $M_kN_{5-k}P$ is an isosceles triangle. Given that $10\alpha$ is an integer, compute $10\alpha$. [i]Proposed by Yannick Yao[/i]

Find the number of positive integers $n$ not greater than 2017 such that $n$ divides $20^n + 17k$ for some positive integer $k$.

Let $ P$ be a point inside a regular tetrahedron $ T$ of unit volume. The four planes passing through $ P$ and parallel to the faces of $ T$ partition $ T$ into 14 pieces. Let $ f(P)$ be the joint volume of those pieces that are neither a tetrahedron nor a parallelepiped (i.e., pieces adjacent to an edge but not to a vertex). Find the exact bounds for $ f(P)$ as $ P$ varies over $ T.$

Find the minimum value of real number $m$, such that inequality \[m(a^3+b^3+c^3) \ge 6(a^2+b^2+c^2)+1\] holds for all positive real numbers $a,b,c$ where $a+b+c=1$.

Given a positive integer $k$ show that there exists a prime $p$ such that one can choose distinct integers $a_1,a_2\cdots, a_{k+3} \in \{1, 2, \cdots ,p-1\}$ such that p divides $a_ia_{i+1}a_{i+2}a_{i+3}-i$ for all $i= 1, 2, \cdots, k$. [i]South Africa [/i]

Consider a sequence of words , consisting of the letters $A$ and $B$ . The first word in the sequence is "$A$" . The k-th word i s obtained from the $(k-1)$-th by means of the following transformation : each $A$ is substituted by $AAB$ , and each $B$ is substituted by $A$. It is easily seen that every word is an initial part of the next word. The initial parts of these words coincide to give a sequence of letters $AABAABAAA BAABAAB...$ (a) In which place of this sequence is the $1000$-th letter $A$? (b ) Prove that this sequence is not periodic. (V . Galperin , Moscows)

Three non-overlapping regular plane polygons, at least two of which are congruent, all have sides of length $ 1$. The polygons meet at a point $ A$ in such a way that the sum of the three interior angles at $ A$ is $ 360^\circ$. Thus the three polygons form a new polygon with $ A$ as an interior point. What is the largest possible perimeter that this polygon can have? $ \textbf{(A)}\ 12\qquad \textbf{(B)}\ 14\qquad \textbf{(C)}\ 18\qquad \textbf{(D)}\ 21\qquad \textbf{(E)}\ 24$

Let $\Delta ABC$ be a triangle inscribed in the circumference $\omega$ of center $O$. Let $T$ be the symmetric of $C$ respect to $O$ and $T'$ be the reflection of $T$ respect to line $AB$. Line $BT'$ intersects $\omega$ again at $R$. The perpendicular to $CT$ through $O$ intersects line $AC$ at $L$. Let $N$ be the intersection of lines $TR$ and $AC$. Prove that $\overline{CN}=2\overline{AL}$.

Let $n$ be a positive integer. On the table, we have $n^2$ ornaments in $n$ different colours, not necessarily $n$ of each colour. Prove that we can hang the ornaments on $n$ Christmas trees in such a way that there are exactly $n$ ornaments on each tree and the ornaments on every tree are of at most $2$ different colours.

What is the maximum value of the function $$\frac{1}{\left|x+1\right|+\left|x+2\right|+\left|x-3\right|}?$$ $\text{(A) }\frac{1}{3}\qquad\text{(B) }\frac{1}{4}\qquad\text{(C) }\frac{1}{5}\qquad\text{(D) }\frac{1}{6}\qquad\text{(E) }\frac{1}{7}$

In two wooden boxes, there are $1994$ and $2024$ marbles, respectively. Spiro and Cvetko play the following game: alternately, each player takes a turn and removes some marbles from one of the boxes, so that the number of removed marbles in that turn is a divisor of the current number of marbles in the other box. The winner of the game is the one after whose turn both boxes are empty. Spiro takes the first turn. Which of the players has a winning strategy?

Given a triangle $ABC$, with right $\angle A$, we know: the point $T$ of tangency of the circumference inscribed in $ABC$ with the hypotenuse $BC$, the point $D$ of intersection of the angle bisector of $\angle B$ with side AC and the point E of intersection of the angle bisector of $\angle C$ with side $AB$ . Describe a construction with ruler and compass for points $A$, $B$, and $C$. Justify.

Several prime numbers (some repeated) are written on the board. Mauro added the numbers on the board and Fernando multiplied the numbers on the board. The result obtained by Fernando is equal to $40$ times the result obtained by Mauro. Determine what the numbers on the board can be. Give all chances.

A TV station holds a math talent competition, where each participant will be scored by 8 people. The scores are F (failed), G (good), or E (exceptional). The competition is participated by three people, A, B, and C. In the competition, A and B get the same score from exactly 4 people. C states that he has differing scores with A from at least 4 people, and also differing scores with B from at least 4 people. Assuming C tells the truth, how many scoring schemes can occur?

Let $P(x) = x^4 + x^3 + x^2 + x + 1$. Show that there exist two non-constant polynomials $Q(y)$ and $R(y)$ with integer coefficients such that for all $Q(y) \cdot R(y)= P(5y^2)$ for all $y$ .

A $10 \times 10$ square on a grid is split by $80$ unit grid segments into $20$ polygons of equal area (no one of these segments belongs to the boundary of the square). Prove that all polygons are congruent. [i]($6$ points)[/i]