Three positive integers are written on the board. In every minute, instead of the numbers $a, b, c$, Elbek writes $a+\gcd(b,c), b+\gcd(a,c), c+\gcd(a,b)$ . Prove that there will be two numbers on the board after some minutes, such that one is divisible by the other. Note. $\gcd(x,y)$ - Greatest common divisor of numbers $x$ and $y$ [i]Proposed by Sergey Berlov, Russia[/i]

Let AOB and COD be angles which can be identified by a rotation of the plane (such that rays OA and OC are identified). A circle is inscribed in each of these angles; these circles intersect at points E and F. Show that angles AOE and DOF are equal.

Prove that the equation $$1320x^3=(y_1+y_2+y_3+y_4)(z_1+z_2+z_3+z_4)(t_1+t_2+t_3+t_4+t_5)$$ has infinitely many solutions in the set of Fibonacci numbers. [i]Proposed by Mihály Bencze[/i]

i) Show that a regular hexagon, six squares, and six equilateral triangles can be assembled without overlapping to form a regular dodecagon. ii) Let $P_1 , P_2 ,\ldots, P_{12}$ be the vertices of a regular dodecagon. Prove that the three diagonals $P_{1}P_{9}, P_{2}P_{11}$ and $P_{4}P_{12}$ intersect.

Let $F$ be a field in which $1+1 \neq 0$. Show that the set of solutions to the equation $x^2+y^2=1$ with $x$ and $y$ in $F$ is given by $(x,y)=(1,0)$ and \[ (x,y) = \left( \frac{r^2-1}{r^2+1}, \frac{2r}{r^2+1} \right) \] where $r$ runs through the elements of $F$ such that $r^2\neq -1$.

Let $ABC$ be an acute-angled triangle with $AC > AB$, let $O$ be its circumcentre, and let $D$ be a point on the segment $BC$. The line through $D$ perpendicular to $BC$ intersects the lines $AO, AC,$ and $AB$ at $W, X,$ and $Y,$ respectively. The circumcircles of triangles $AXY$ and $ABC$ intersect again at $Z \ne A$. Prove that if $W \ne D$ and $OW = OD,$ then $DZ$ is tangent to the circle $AXY.$

A multiple choice examination consists of $20$ questions. The scoring is $+5$ for each correct answer, $-2$ for each incorrect answer, and $0$ for each unanswered question. John's score on the examination is $48$. What is the maximum number of questions he could have answered correctly? $\text{(A)}\ 9 \qquad \text{(B)}\ 10 \qquad \text{(C)}\ 11 \qquad \text{(D)}\ 12 \qquad \text{(E)}\ 16$

Consider the real number axis (i. e. the $x$-axis of a Cartesian coordinate system). We mark the points $1$, $2$, ..., $2n$ on this axis. A flea starts at the point $1$. Now it jumps along the real number axis; it can jump only from a marked point to another marked point, and it doesn't visit any point twice. After the ($2n-1$)-th jump, it arrives at a point from where it cannot jump any more after this rule, since all other points are already visited. Hence, with its $2n$-th jump, the flea breaks this rule and gets back to the point $1$. Assume that the sum of the (non-directed) lengths of the first $2n-1$ jumps of the flea was $n\left(2n-1\right)$. Show that the length of the last ($2n$-th) jump is $n$.

Let $\triangle ABC$ be a triangle with $AB=65$, $BC=70$, and $CA=75$. A semicircle $\Gamma$ with diameter $\overline{BC}$ is constructed outside the triangle. Suppose there exists a circle $\omega$ tangent to $AB$ and $AC$ and furthermore internally tangent to $\Gamma$ at a point $X$. The length $AX$ can be written in the form $m\sqrt{n}$ where $m$ and $n$ are positive integers with $n$ not divisible by the square of any prime. Find $m+n$.

How many sequences of $0$s and $1$s of length $19$ are there that begin with a $0$, end with a $0$, contain no two consecutive $0$s, and contain no three consecutive $1$s? $\textbf{(A) }55\qquad\textbf{(B) }60\qquad\textbf{(C) }65\qquad\textbf{(D) }70\qquad\textbf{(E) }75$

Let $t$ be a positive constant. Given two points $A(2t,\ 2t,\ 0),\ B(0,\ 0,\ t)$ in a space with the origin $O$. Suppose mobile points $P$ in such way that $\overrightarrow{OP}\cdot \overrightarrow{AP}+\overrightarrow{OP}\cdot \overrightarrow{BP}+\overrightarrow{AP}\cdot \overrightarrow{BP}=3.$ Find the value of $t$ such that the maximum value of $OP$ is 3.

Triangle $ABC$ with $AB = AC$ is inscribed in circle $o$. Circles $o_1$ and $o_2$ are internally tangent to circle $o$ in points $P$ and $Q$, respectively, and they are tangent to segments $AB$ and $AC$, respectively, and they are disjoint with the interior of triangle $ABC$. Let $m$ be a line tangent to circles $o_1$ and $o_2$, such that points $P$ and $Q$ lie on the opposite side than point $A$. Line $m$ cuts segments $AB$ and $AC$ in points $K$ and $L$, respectively. Prove, that intersection point of lines $PK$ and $QL$ lies on bisector of angle $BAC$.

Given $n \ge 4$ points in the plane such that any four of them are the vertices of a convex quadrilateral, prove that these points are the vertices of a convex polygon.

Let $a$ be an integer and $n$ a positive integer . Show that the sum : $$\sum_{k=1}^{n} a^{(k,n)}$$ is divisible by $n$ , where $(x,y)$ is the greatest common divisor of the numbers $x$ and $y$ .

Determine if there exist positive real numbers $x, \alpha$, so that for any non-empty finite set of positive integers $S$, the inequality \[\left|x-\sum_{s\in S}\frac{1}{s}\right|>\frac{1}{\max(S)^\alpha}\] holds, where $\max(S)$ is defined as the maximum element of the finite set $S$.

Define a [i]T-grid[/i] to be a $ 3\times3$ matrix which satisfies the following two properties: (1) Exactly five of the entries are $ 1$'s, and the remaining four entries are $ 0$'s. (2) Among the eight rows, columns, and long diagonals (the long diagonals are $ \{a_{13},a_{22},a_{31}\}$ and $ \{a_{11},a_{22},a_{33}\}$, no more than one of the eight has all three entries equal. Find the number of distinct T-grids.

Let $A,B$ be two points on a give circle, and $M$ be the midpoint of one of the arcs $AB$ . Point $C$ is the orthogonal projection of $B$ onto the tangent $l$ to the circle at $A$. The tangent at $M$ to the circle meets $AC,BC$ at $A',B'$ respectively. Prove that if $\hat{BAC}<\frac{\pi}{8}$ then $S_{ABC}<2S_{A'B'C'}$.

Prove that for all prime $p \ge 5$, there exist an odd prime $q \not= p$ such that $q$ divides $(p-1)^p + 1$

Let $P = (7, 1)$ and let $O = (0, 0)$. (a) If $S$ is a point on the line $y = x$ and $T$ is a point on the horizontal $x$-axis so that $P$ is on the line segment $ST$, determine the minimum possible area of triangle $OST$. (b) If $U$ is a point on the line $y = x$ and $V$ is a point on the horizontal $x$-axis so that $P$ is on the line segment $UV$, determine the minimum possible perimeter of triangle $OUV$.

Which of the following answer choices is the closest approximation to \[\dfrac34+\dfrac78+\dfrac{15}{16}+\cdots+\dfrac{1023}{1024} = \dfrac{2^2-1}{2^2}+\dfrac{2^3-1}{2^3}+\cdots+\dfrac{2^{10}-1}{2^{10}}?\] $\textbf{(A) }\dfrac{15}{2}\qquad\textbf{(B) }8\qquad\textbf{(C) }\dfrac{17}{2}\qquad\textbf{(D) }9\qquad\textbf{(E) }\dfrac{19}{2}$

We call a real number $x$ with $0 < x < 1$ [i]interesting[/i] if $x$ is irrational and if in its decimal writing the first four decimals are equal. Determine the least positive integer $n$ with the property that every real number $t$ with $0 < t < 1$ can be written as the sum of $n$ pairwise distinct interesting numbers.

Let $P$ be a point inside $\vartriangle ABC$. Let $D, E, F$ be the feet of the perpendiculars from $P$ to the lines $BC, CA$ and $AB$, respectively (see Fig. ). Show that (i) $EF = AP \sin A$, (ii) $PA+ PB + PC \ge 2(PE+ PD+ PF)$ [img]https://cdn.artofproblemsolving.com/attachments/d/f/f37d8764fc7d99c2c3f4d16f66223ef39dfd09.png[/img]

Given a paper on which the numbers $1,2,3\dots ,14,15$ are written. Andy and Bobby are bored and perform the following operations, Andy chooses any two numbers (say $x$ and $y$) on the paper, erases them, and writes the sum of the numbers on the initial paper. Meanwhile, Bobby writes the value of $xy(x+y)$ in his book. They were so bored that they both performed the operation until only $1$ number remained. Then Bobby adds up all the numbers he wrote in his book, let’s call $k$ as the sum. $a$. Prove that $k$ is constant which means it does not matter how they perform the operation, $b$. Find the value of $k$.

For $a\in C^{*}$ find all $n\in N$ such that $X^{2}(X^{2}-aX+a^{2})^{2}$ divides $(X^{2}+a^{2})^{n}-X^{2n}-a^{2n}$

Show that there exists a tetrahedron which can be partitioned into eight congruent tetrahedra, each of which is similar to the original one.