Let $n\geq 3$ be a fixed integer. Each side and each diagonal of a regular $n$-gon is labelled with a number from the set $\left\{1;\;2;\;...;\;r\right\}$ in a way such that the following two conditions are fulfilled: [b]1.[/b] Each number from the set $\left\{1;\;2;\;...;\;r\right\}$ occurs at least once as a label. [b]2.[/b] In each triangle formed by three vertices of the $n$-gon, two of the sides are labelled with the same number, and this number is greater than the label of the third side. [b](a)[/b] Find the maximal $r$ for which such a labelling is possible. [b](b)[/b] [i]Harder version (IMO Shortlist 2005):[/i] For this maximal value of $r$, how many such labellings are there? [hide="Easier version (5th German TST 2006) - contains answer to the harder version"] [i]Easier version (5th German TST 2006):[/i] Show that, for this maximal value of $r$, there are exactly $\frac{n!\left(n-1\right)!}{2^{n-1}}$ possible labellings.[/hide] [i]Proposed by Federico Ardila, Colombia[/i]

Let $\Delta ABC$ be an acute triangle with incenter $I$ and orthocenter $H$. $AI$ meets the circumcircle of $\Delta ABC$ again at $M$. Suppose the length $IM$ is exactly the circumradius of $\Delta ABC$. Show that $AH\geq AI$.

The game Boddle uses eight cards numbered $6, 11, 12, 14, 24, 47, 54$, and $n$, where $0 \le n \le 56$. An integer D is announced, and players try to obtain two cards, which are not necessarily distinct, such that one of their differences (positive or negative) is congruent to $D$ modulo $57$. For example, if $D = 27$, then the pair $24$ and $54$ would work because $24 - 54 \equiv 27$ mod $57$. Compute $n$ such that this task is always possible for all $D$.

Given the intersecting lines $ r$ and $s$, consider the lines $u$ and $v$ as such what: a) $u$ is symmetric to $r$ with respect to $s$, b) $v$ is symmetric to $s$ with respect to $r$ . Determine the angle that the given lines must form such that $u$ and $v$ to be coplanar.

Circle with center $I$, inscribed in a triangle $ABC$ , touches the sides $BC$ and $AC$ at points $A_1$ and $B_1$ respectively. On rays $A_1I$ and $B_1I$, respectively, let be the points $A_2$ and $B_2$ such that $IA_2=IB_2=R$, where $R$is the radius of the circumscribed circle of the triangle $ABC$. Prove that: a) $AA_2 = BB_2 = OI$ where $O$ is the center of the circumscribed circle of the triangle $ABC$, b) lines $AA_2$ and $BB_2$ intersect on the circumcircle of the triangle $ABC$.

For how many positive integers $x$ is $\log_{10}{(x-40)} + \log_{10}{(60-x)} < 2$? ${ \textbf{(A)}\ 10\qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 19\qquad\textbf{(D)}}\ 20\qquad\textbf{(E)}\ \text{infinitely many} $

Determine all integers $a$ such that $a^k + 1$ is divisible by $12321$ for some $k$

In equilateral triangle $ABC$, a circle $\omega$ is drawn such that it is tangent to all three sides of the triangle. A line is drawn from $A$ to point $D$ on segment $BC$ such that $AD$ intersects $\omega$ at points $E$ and $F$. If $EF = 4$ and $AB = 8$, determine $|AE - FD|$.

The midpoints of the sides of a regular hexagon $ABCDEF$ are joined to form a smaller hexagon. What fraction of the area of $ABCDEF$ is enclosed by the smaller hexagon? [asy] size(130); pair A, B, C, D, E, F, G, H, I, J, K, L; A = dir(120); B = dir(60); C = dir(0); D = dir(-60); E = dir(-120); F = dir(180); draw(A--B--C--D--E--F--cycle); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); G = midpoint(A--B); H = midpoint(B--C); I = midpoint(C--D); J = midpoint(D--E); K = midpoint(E--F); L = midpoint(F--A); draw(G--H--I--J--K--L--cycle); label("$A$", A, dir(120)); label("$B$", B, dir(60)); label("$C$", C, dir(0)); label("$D$", D, dir(-60)); label("$E$", E, dir(-120)); label("$F$", F, dir(180)); [/asy] $\textbf{(A)}\ \displaystyle \frac{1}{2} \qquad \textbf{(B)}\ \displaystyle \frac{\sqrt 3}{3} \qquad \textbf{(C)}\ \displaystyle \frac{2}{3} \qquad \textbf{(D)}\ \displaystyle \frac{3}{4} \qquad \textbf{(E)}\ \displaystyle \frac{\sqrt 3}{2}$

Sasha and Serg plays next game with $100$-angled regular polygon . In the beggining Sasha set natural numbers in every angle. Then they make turn by turn, first turn is made by Serg. Serg turn is to take two opposite angles and add $1$ to its numbers. Sasha turn is to take two neigbour angles and add $1$ to its numbers. Serg want to maximize amount of odd numbers. What maximal number of odd numbers can he get no matter how Sasha plays?

For how many ordered pairs of positive integers $(x, y)$ is the least common multiple of $x$ and $y$ equal to $1{,}003{,}003{,}001$?

Let $ABCD$ be a convex quadrilateral. The rays $AB$ and $DC$ intersect in point $E$. Rays $AD$ and $BC$ intersect in point $F$. The angle bisector of $\angle DCF$ intersects $EF$ in point $K$. Let $I_1$ and $I_2$ be the centers of the inscribed circles in $\Delta ECB$ and $\Delta FCD$. $M$ is the projection of $I_2$ on line $CF$ and $N$ is the projection of $I_1$ on line $BC$. Let $P$ be the reflection of $N$ in $I_1$. If $P,M,K$ are colinear, prove that $ABCD$ is tangential.

Let $ABC$ be a triangle, $I$ its incenter, and $\Gamma$ its circumcircle. Let $D$ be the second point of intersection of $AI$ with $\Gamma$. The line parallel to $BC$ through $I$ intersects $AB$ and $AC$ at $P$ and $Q$, respectively. The lines $PD$ and $QD$ intersect $BC$ at $E$ and $F$, respectively. Prove that triangles $IEF$ and $ABC$ are similar.

There are $2019$ students sitting around circular table. Initially each of them have one candy. Teacher is allowed to pick one student, who has at least one can candy, and this student can decide, whether he gives his candy to his neighbour on the right or on the left. Prove that no matter what students teacher picks during the process, students can always ensure that any point of time no student has more than $2$ candies.

The grid below is to be filled with integers in such a way that the sum of the numbers in each row and the sum of the numbers in each column are the same. Four numbers are missing. The number $x$ in the lower left corner is larger than the other three missing numbers. What is the smallest possible value of $x$? [asy] unitsize(0.5cm); draw((3,3)--(-3,3)); draw((3,1)--(-3,1)); draw((3,-3)--(-3,-3)); draw((3,-1)--(-3,-1)); draw((3,3)--(3,-3)); draw((1,3)--(1,-3)); draw((-3,3)--(-3,-3)); draw((-1,3)--(-1,-3)); label((-2,2),"$-2$"); label((0,2),"$9$"); label((2,2),"$5$"); label((2,0),"$-1$"); label((2,-2),"$8$"); label((-2,-2),"$x$"); [/asy] $\textbf{(A) } -1 \qquad \textbf{(B) } 5 \qquad \textbf{(C) } 6 \qquad \textbf{(D) } 8 \qquad \textbf{(E) } 9 \qquad$

Assume that all angles of a triangle $ABC$ are acute. Let $D$ and $E$ be points on the sides $AC$ and $BC$ of the triangle such that $A, B, D,$ and $E$ lie on the same circle. Further suppose the circle through $D,E,$ and $C$ intersects the side $AB$ in two points $X$ and $Y$. Show that the midpoint of $XY$ is the foot of the altitude from $C$ to $AB$.

Determine all functions $f: \mathbb{R} \to \mathbb{R}$ such that for any $x,y \in \mathbb{R}$ we have \[ f(f(f(x)) + f(y)) = f(y) - f(x) \]

Prove that every positive integer can be written as a finite sum of distinct integral powers of the golden ratio.

[b]2.[/b] Let $f_{1}(x), \dots , f_{n}(x)$ be Lebesgue integrable functions on $[0,1]$, with $\int_{0}^{1}f_{1}(x) dx= 0$ $ (i=1,\dots ,n)$. Show that, for every $\alpha \in (0,1)$, there existis a subset $E$ of $[0,1]$ with measure $\alpha$, such that $\int_{E}f_{i}(x)dx=0$. [b](R. 17)[/b]

Let points $M$ and $N$ lie on sides $AB$ and $BC$ of triangle $ABC$ in such a way that $MN||AC$. Points $M'$ and $N'$ are the reflections of $M$ and $N$ about $BC$ and $AB$ respectively. Let $M'A$ meet $BC$ at $X$, and let $N'C$ meet $AB$ at $Y$. Prove that $A,C,X,Y$ are concyclic.

Find all natural numbers $ n$ such that the equation: $ a_{n\plus{}1} x^2\minus{}2x \sqrt{a_1^2\plus{}a_2^2\plus{}...\plus{}a_{n\plus{}1}^2}\plus{}a_1\plus{}a_2\plus{}...\plus{}a_n\equal{}0$ has real solutions for all real numbers $ a_1,a_2,...,a_{n\plus{}1}$.

The triangle $ ABC$ is inscribed in a circle. The interior bisectors of the angles $ A,B$ and $ C$ meet the circle again at $ A', B'$ and $ C'$ respectively. Prove that the area of triangle $ A'B'C'$ is greater than or equal to the area of triangle $ ABC.$

Show that the only integral solution to \[\left\{ \begin{array}{l} xy + yz + zx = 3n^2 - 1\\ x + y + z = 3n \\ \end{array} \right. \] with $x \geq y \geq z$ is $x=n+1$, $y=n$, $z=n-1$.

For how many integers $1\leq n\leq 9999$ is there a solution to the congruence \[\phi(n)\equiv 2\,\,\,\pmod{12},\] where $\phi(n)$ is the Euler phi-function?

Solve the system of equations $\begin{cases} \frac{1}{x}+\frac{1}{y}=\frac{1}{6} \\ \frac{3}{x}+\frac{2}{y}=\frac{5}{6} \end{cases}$