"KING-THE SUICIDER" Given a chess-board $1000\times 1000$, $499$ white castles and a black king. Prove that it does not matter neither the initial situation nor the way white plays, but the king can always enter under the check in a finite number of moves.

For the family of parabolas $$y= \frac{ a^3 x^{2}}{3}+ \frac{ a^2 x}{2}-2a$$ (i) find the locus of vertices, (ii) find the envelope, (iii) sketch the envelope and two typical curves of the family.

Let's consider the graph of a square trinomial having roots $1$ and $4$. Let's draw two tangents to it from point $O$ (the origin of coordinates), touching it at points $A$ and $B$. What values can the cosine of angle $\angle AOB$ take?

Find the least positive integer $n$ such that $2^{2014}$ divides $19^n-1$.

Let $ABC$ be an acute triangle with $AB\ne AC$ and circumcircle $\omega$. The angle bisector of $BAC$ intersects $BC$ and $\omega$ at $D$ and $E$ respectively. Circle with diameter $DE$ intersects $\omega$ again at $F \ne E$. Point $P$ is on $AF$ such that $PB = PC$ and $X$ and $Y$ are feet of perpendiculars from $P$ to $AB$ and $AC$ respectively. Let $H$ and $H'$ be the orthocenters of $ABC$ and $AXY$ respectively. $AH$ meets $\omega$ again at $Q$ . If $AH'$ and $HH'$ intersect the circle with diameter $AH$ again at points $S$ and $T$, respectively, prove that the lines $AT , HS$ and $FQ$ are concurrent.

Let $ABCDEF$ be a convex hexagon of area $1$, whose opposite sides are parallel. The lines $AB$, $CD$ and $EF$ meet in pairs to determine the vertices of a triangle. Similarly, the lines $BC$, $DE$ and $FA$ meet in pairs to determine the vertices of another triangle. Show that the area of at least one of these two triangles is at least $3/2$.

A infinite sequence $\{ a_n \}_{n \ge 0}$ of real numbers satisfy $a_n \ge n^2$. Suppose that for each $i, j \ge 0$ there exist $k, l$ with $(i,j) \neq (k,l)$, $l - k = j - i$, and $a_l - a_k = a_j - a_i$. Prove that $a_n \ge (n + 2016)^2$ for some $n$.

Find the area of the quadrilateral with vertices at $(0,0), (2,0), (20,24), (0,2)$ in that order.

Given a regular 103-sided polygon. 79 vertices are colored red and the remaining vertices are colored blue. Let $A$ be the number of pairs of adjacent red vertices and $B$ be the number of pairs of adjacent blue vertices. a) Find all possible values of pair $(A,B).$ b) Determine the number of pairwise non-similar colorings of the polygon satisfying $B=14.$ 2 colorings are called similar if they can be obtained from each other by rotating the circumcircle of the polygon.

Let $A, B, C$ and $D$ be four different points lying on a common circle in this order. Assume that the line segment $AB$ is the (only) longest side of the inscribed quadrilateral $ABCD$. Prove that the inequality $AB + BD > AC + CD$ holds. [i](Proposed by Karl Czakler)[/i]

Prove or disprove that there exist two tetrahedra $T_1$ and $T_2$ such that: (i) the volume of $T_1$ is greater than that of $T_2$; (ii) the area of any face of $T_1$ does not exceed the area of any face of $T_2$.

Set $a_n=\frac{2n}{n^4+3n^2+4},n\in\mathbb N$. Prove that the sequence $S_n=a_1+a_2+\ldots+a_n$ is upperbounded and lowerbounded and find its limit as $n\to\infty$.

In a bag there are $1007$ black and $1007$ white balls, which are randomly numbered $1$ to $2014$. In every step we draw one ball and put it on the table; also if we want to, we may choose two different colored balls from the table and put them in a different bag. If we do that we earn points equal to the absolute value of their differences. How many points can we guarantee to earn after $2014$ steps?

Prove that the sum of the six angles subtended at an interior point of a tetrahedron by its six edges is greater than 540°.

A boat has a speed of $ 15$ mph in still water. In a stream that has a current of $ 5$ mph it travels a certain distance downstream and returns. The ratio of the average speed for the round trip to the speed in still water is: $ \textbf{(A)}\ \frac{5}{4} \qquad \textbf{(B)}\ \frac{1}{1} \qquad \textbf{(C)}\ \frac{8}{9} \qquad \textbf{(D)}\ \frac{7}{8} \qquad \textbf{(E)}\ \frac{9}{8}$

In the trapezoid $ABCD, AB // CD$ and the diagonals intersect at $O$. The points $P, Q$ are on $AD, BC$ respectively such that $\angle AP B = \angle CP D$ and $\angle AQB = \angle CQD$. Show that $OP = OQ$.

In a mathematical competition, some competitors are friends; friendship is mutual, that is, when $A$ is a friend of $B$, then $B$ is also a friend of $A$. We say that $n \geq 3$ different competitors $A_1, A_2, \ldots, A_n$ form a [i]weakly-friendly cycle [/i]if $A_i$ is not a friend of $A_{i+1}$ for $1 \leq i \leq n$ (where $A_{n+1} = A_1$), and there are no other pairs of non-friends among the components of the cycle. The following property is satisfied: "for every competitor $C$ and every weakly-friendly cycle $\mathcal{S}$ of competitors not including $C$, the set of competitors $D$ in $\mathcal{S}$ which are not friends of $C$ has at most one element" Prove that all competitors of this mathematical competition can be arranged into three rooms, such that every two competitors in the same room are friends. ([i]Serbia[/i])

Let $a$, $b$, $c$ be positive real numbers and let $m$, $n$ $(m \geq n)$ be positive integers. Prove that$$\frac{a^{n-1}b^{n-1}c^{m-n-1}}{a^{m+n}+b^{m+n}+a^nb^nc^{m-n}}+\frac{b^{n-1}bc^{n-1}a^{m-n-1}}{b^{m+n}+c^{m+n}+b^nc^na^{m-n}}+\frac{c^{n-1}a^{n-1}b^{m-n-1}}{c^{m+n}+a^{m+n}+c^na^nb^{m-n}}\leq \frac{1}{abc}$$

The number $1- \frac12 +\frac13-\frac14+...+\frac{1}{2n-1}-\frac{1}{2n}$ is represented as an irreducible fraction. If $3n+1$ is a prime number, prove that the numerator of this fraction is a multiple of $3n + 1$.

The subsets $A_1,A_2,\ldots ,A_{2000}$ of a finite set $M$ satisfy $|A_i|>\frac{2}{3}|M|$ for each $i=1,2,\ldots ,2000$. Prove that there exists $m\in M$ which belongs to at least $1334$ of the subsets $A_i$.

An invisible tank is on a $100 \times 100 $ table. A cannon can fire at any $k$ cells of the board after that the tank will move to one of the adjacent cells (by side). Then the progress is repeated. Find the smallest value of $k$ such that the cannon can definitely shoot the tank after some time.

Let $I_{m}=\textstyle\int_{0}^{2 \pi} \cos (x) \cos (2 x) \cdots \cos (m x) d x .$ For which integers $m, 1 \leq m \leq 10$ is $I_{m} \neq 0 ?$

Prove that there exists a function $f : \mathbb{N} \mapsto \mathbb{N}$ that satisfies the following: [color=#FFFFFF]___[/color]1. For all positive integers $m, n$ we have \[\gcd(|f(m)-f(n)|, f(mn)) = f(\gcd(m, n))\] [color=#FFFFFF]___[/color]2. For all positive integers $m$, we have $f(f(m)) = f(m)$. [color=#FFFFFF]___[/color]3. For all positive integers $k$, there exists a positive integer $n$ with $2024^{k} \mid f(n)$. [i]Proposed by MV Adhitya, Archit Manas[/i]

Let $f_n$ be the Fibonacci numbers, defined by $f_0 = 1$, $f_1 = 1$, and $f_n = f_{n-1}+f_{n-2}$. For each $i$, $1 \le i \le 200$, we calculate the greatest common divisor $g_i$ of $f_i$ and $f_{2007}$. What is the sum of the distinct values of $g_i$?

A sequence $a_1,a_2,...,a_{2007}$ where $a_i \in\{2,3\}$ for $i = 1,2,...,2007$ and an integer sequence $x_1,x_2,...,x_{2007}$ satisfies the following: $a_ix_i + x_{i+2 }\equiv 0$ ($mod 5$) , where the indices are taken modulo $2007$. Prove that $x_1,x_2,...,x_{2007}$ are all multiples of $5$.