What is the smallest integer $a_0$ such that, for every positive integer $n$, there exists a sequence of positive integers $a_0, a_1, ..., a_{n-1}, a_n$ such that the first $n-1$ are all distinct, $a_0 = a_n$, and for $0 \le i \le n -1$, $a_i^{a_{i+1}}$ ends in the digits $\overline{0a_i}$ when expressed without leading zeros in base $10$.

Determine for which natural numbers $n$ you can cover a $2n \times 2n$ chessboard with non-overlapping $L$ pieces. An $L$ piece covers four spaces and has appearance like the letter $L$. The piece may be rotated and mirrored at will.

Let $ABC$ is acute angled triangle and $K,L$ is points on $AC,BC$ respectively such that $\angle{AKB}=\angle{ALB}$. $P$ is intersection of $AL$ and $BK$ and $Q$ is the midpoint of segment $KL$. Let $T,S$ are the intersection $AL,BK$ with $(ABC)$ respectively. Prove that $TK,SL,PQ$ are concurrent.

Let $O$ be the intersection point of altitudes $AD$ and $BE$ of equilateral triangle $ABC.$ Points $K$ and $L$ are chosen inside segments $AO$ and $BO$ respectively such that line $KL$ bisects the perimeter of triangle $ABC.$ Let $F$ be the intersection point of lines $EK$ and $DL.$ Prove that $O$ is the circumcenter of triangle $DEF.$

Find a multiple of $2018$ whose decimal expansion's first four digits are $2017$.

Given equilateral triangle $ABC$. Some line, parallel to $[AC]$ crosses $[AB]$ and $[BC]$ in $M$ and $P$ points respectively. Let $D$ be the centre of $PMB$ triangle, $E$ be the midpoint of the $[AP]$ segment. Find the angles of triangle $DEC$ .

A point in the plane with a cartesian coordinate system is called a [i]mixed point[/i] if one of its coordinates is rational and the other one is irrational. Find all polynomials with real coefficients such that their graphs do not contain any mixed point.

We say that a finite set $S$ of red and green points in the plane is [i]separable[/i] if there exists a triangle $\delta$ such that all points of one colour lie strictly inside $\delta$ and all points of the other colour lie strictly outside of $\delta$. Let $A$ be a finite set of red and green points in the plane, in general position. Is it always true that if every $1000$ points in $A$ form a separable set then $A$ is also separable?

$$F(x)=x^{6}+15x^{5}+85x^{4}+225x^{3}+274x^{2}+120x+1$$

For a positive real number $t$, in the coordiante space, consider 4 points $O(0,\ 0,\ 0),\ A(t,\ 0,\ 0),\ B(0,\ 1,\ 0),\ C(0,\ 0,\ 1)$. Let $r$ be the radius of the sphere $P$ which is inscribed to all faces of the tetrahedron $OABC$. When $t$ moves, find the maximum value of $\frac{\text{vol[P]}}{\text{vol[OABC]}}.$

The diagram below shows circles radius $1$ and $2$ externally tangent to each other and internally tangent to a circle radius $3$. There are relatively prime positive integers $m$ and $n$ so that a circle radius $\frac{m}{n}$ is internally tangent to the circle radius $3$ and externally tangent to the other two circles as shown. Find $m+n$. [asy] import graph; size(5cm); real labelscalefactor = 0.5; pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); pen dotstyle = black; draw(circle((8,2), 3)); draw(circle((8,1), 2)); draw(circle((8,4), 1)); draw((8,-1)--(8,5)); draw(circle((9.72,3.28), 0.86)); label("$ 2 $",(7.56,1.38),SE*labelscalefactor); label("$ 1 $",(7.6,4.39),SE*labelscalefactor); [/asy]

Is it possible to fill an $n \times n$ table with the numbers $-1$, $0$ and $1$ so that all $2n$ sums in each column and each row are different? Solve the problem with a) $n = 5$; b) $n = 10$.

$ \frac{10^7}{5 \times 10^4}\equal{}$ \[ \textbf{(A)}\ .002 \qquad \textbf{(B)}\ .2 \qquad \textbf{(C)}\ 20 \qquad \textbf{(D)}\ 200 \qquad \textbf{(E)}\ 2000 \]

Let $n$ be a positive with $n\geq 3$. Consider a board of $n \times n$ boxes. In each step taken the colors of the $5$ boxes that make up the figure bellow change color (black boxes change to white and white boxes change to black) The figure can be rotated $90°, 180°$ or $270°$. Firstly, all the boxes are white.Determine for what values of $n$ it can be achieved, through a series of steps, that all the squares on the board are black.

A pair of words consisting only of the letters $a$ and $b$ (with repetitions) is [i]good[/i] if it is $(a,b)$ or of one of the forms $(uv, v)$, $(u, uv)$, where $(u,v)$ is a good pair. Prove that if $(\alpha, \beta)$ is a good pair, then there exists a palindrome $\gamma$ such that $\alpha\beta = a\gamma b$.

A collector offers to buy state quarters for $2000\%$ of their face value. At that rate how much will Bryden get for his four state quarters? $ \text{(A)}\ 20\text{ dollars}\qquad\text{(B)}\ 50\text{ dollars}\qquad\text{(C)}\ 200\text{ dollars}\qquad\text{(D)}\ 500\text{ dollars}\qquad\text{(E)}\ 2000\text{ dollars} $

Compare $\tan(\sin x)$ with $\sin(\tan x)$, for $x\in \left]0,\frac{\pi}{2}\right[$.

Find the greatest positive integer $N$ with the following property: there exist integers $x_1, . . . , x_N$ such that $x^2_i - x_ix_j$ is not divisible by $1111$ for any $i\ne j.$

When Yunji added all the integers from $1$ to $9$, she mistakenly left out a number. Her incorrect sum turned out to be a square number. Which number did Yunji leave out? $\textbf{(A) } 5\qquad\textbf{(B) } 6\qquad\textbf{(C) } 7\qquad\textbf{(D) } 8\qquad\textbf{(E) } 9$

Let $n > 1$ be an integer and let $a_1, a_2,... , a_n$ be $n$ different integers. Show that the polynomial $f(x) = (x -a_1)(x - a_2)\cdot ... \cdot (x -a_n) - 1$ is not divisible by any polynomial with integer coefficients and of degree greater than zero but less than $n$ and such that the highest power of $x$ has coefficient $1$.

Determine the smallest positive integer $m$ with the property that $m^3-3m^2+2m$ is divisible by both $79$ and $83$.

Find all $n$ such that there is a real polynomial $f(x)$ of degree $n$ such that $f(x) \ge f'(x)$ for all real $x$.

Evaluate $ \int_{\frac{\pi}{4}}^{\frac{\pi}{3}} \frac{x^2}{(1\plus{}x\tan x)(x\minus{}\tan x)\cos ^ 2 x}\ dx.$

Find the smallest real number $p$ such that the inequality $\sqrt{1^2+1}+\sqrt{2^2+1}+...+\sqrt{n^2+1} \le \frac{1}{2}n(n+p)$ holds for all natural numbers $n$.

Given an integer $n\geq 2$. There are $N$ distinct circle on the plane such that any two circles have two distinct intersections and no three circles have a common intersection. Initially there is a coin on each of the intersection points of the circles. Starting from $X$, players $X$ and $Y$ alternatively take away a coin, with the restriction that one cannot take away a coin lying on the same circle as the last coin just taken away by the opponent in the previous step. The one who cannot do so will lost. In particular, one loses where there is no coin left. For what values of $n$ does $Y$ have a winning strategy?