On a blackboard there are three positive integers. In each step the three numbers on the board are denoted as $a, b, c$ such that $a >gcd(b, c)$, then $a$ gets replaced by $ a-gcd(b, c)$. The game ends if there is no way to denote the numbers such that $a >gcd(b, c)$. Prove that the game always ends and that the last three numbers on the blackboard only depend on the starting numbers. (Theresia Eisenkölbl)

Let a function $f$ satisfy $f(1) = 1$ and $f(1)+ f(2)+...+ f(n) = n^2f(n)$ for all $n \in N$. Determine $f(1995)$.

The product of a million whole numbers is equal to million. What can be the greatest possible value of the sum of these numbers?

Javiera and Claudio play on a board consisting of a row with $2019$ cells. Claudio starts by placing a token anywhere on the board. Next Javiera says a natural number $k$, $1 \le k \le n$ and Claudio must move the token to the right or to the left at your choice $k$ squares and so on. Javiera wins if she manages to remove the piece that Claudio moves from the board. Determine the smallest $n$ such that Javiera always wins after a finite number of moves.

Parallel lines $\ell_1$ and $\ell_2$ are drawn in a plane. Points $A_1, A_2, \dots, A_n$ are chosen on $\ell_1$, and points $B_1, B_2, \dots, B_{n+1}$ are chosen on $\ell_2$. All segments $A_iB_j$ are drawn, such that $1 \le i \le n$ and $1 \le j \le n+1$. Let the number of total intersections between these segments (not including endpoints) be denoted by $Q$. Given that no three segments are concurrent, besides at endpoints, prove that $Q$ is divisible by 3. [i]Proposed by Lewis Chen[/i]

Let $O, H$ be the circumcentor and the orthocenter of a scalene triangle $ABC$. Let $P$ be the reflection of $A$ w.r.t. $OH$, and $Q$ is a point on $\odot (ABC)$ such that $AQ, OH, BC$ are concurrent. Let $A'$ be a points such that $ABA'C$ is a parallelogram. Show that $A', H, P, Q$ are concylic. (ltf0501).

Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards. Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells. [*]Prove that every minimal blocking set containing at most $3m^2$ cells.

There are $n$ football teams in [i]Tumbolia[/i]. A championship is to be organised in which each team plays against every other team exactly once. Ever match takes place on a sunday and each team plays at most one match each sunday. Find the least possible positive integer $m_n$ for which it is possible to set up a championship lasting $m_n$ sundays.

In an acute triangle $ABC$, let $M$ and $N$ be the midpoints of $AB$ and $AC$ and let $BH$ be its altitude from $B$. Its incircle touches $AC$ at $K$ and the line through $K$ parallel to $MH$ meets $MN$ at $P$. Prove that $AMPK$ has an incircle.

Does there exist a positive integer, $x$, such that $(x+2)^{2023}-x^{2023}$ has exactly $2023^{2023}$ factors? [i]Proposed by Wong Jer Ren[/i]

[color=blue][size=150]PERU TST IMO - 2006[/size] Saturday, may 20.[/color] [b]Question 01[/b] Find all $(x,y,z)$ positive integers, such that: $\sqrt{\frac{2006}{x+y}} + \sqrt{\frac{2006}{y+z}} + \sqrt{\frac{2006}{z+x}},$ is an integer. --- [url=http://www.mathlinks.ro/Forum/viewtopic.php?t=88509]Spanish version[/url] $\text{\LaTeX}{}$ed by carlosbr

On a typical morning Aiden gets out of bed, goes through his morning preparation, rides the bus, and walks from the bus stop to work arriving at work 120 minutes after getting out of bed. One morning Aiden got out of bed late, so he rushed through his morning preparation getting onto the bus in half the usual time, the bus ride took 25 percent longer than usual, and he ran from the bus stop to work in half the usual time it takes him to walk arriving at work 96 minutes after he got out of bed. The next morning Aiden got out of bed extra early, leisurely went through his morning preparation taking 25 percent longer than usual to get onto the bus, his bus ride took 25 percent less time than usual, and he walked slowly from the bus stop to work taking 25 percent longer than usual. How many minutes after Aiden got out of bed did he arrive at work that day?

Let $ABCD$ be a cyclic quadrilateral and $w$ be its circumcircle. For a given point $E$ inside $w$, $DE$ intersects $AB$ at $F$ inside $w$. Let $l$ be a line passes through $E$ and tangent to circle $AEF$. Let $G$ be any point on $l$ and inside the quadrilateral $ABCD$. Show that if $\angle GAD =\angle BAE$ and $\angle GCB + \angle GAB = \angle EAD + \angle AGD + \angle ABE$ then $BC$, $AD$ and $EG$ are concurrent.

Let $K_1$ be an open disk in the complex plane whose boundary passes through the points -1 and +1, and let $K_2$ be the mirror image of $K_1$ across the real axis. Also, let $D_1 = K_1 \cap K_2$ , and let $D_2$ be the outside of $D_1$ . Suppose that the function $u_1( z )$ is harmonic on $D_1$ and continuous on its closure, $u_2(z)$ harmonic on $D_2$ (including $\infty$) and continuous on its closure, and $u_1(z) = u_2(z)$ at the common boundary of the domains $D_1$ and $D_2$ . Prove that if $u_1( x )\geq 0$ for all $-1 < x <1$, then $u_2 ( x )\geq 0$ for all $x>1$ and $x<-1$.

The Euler line of a scalene triangle touches its incircle. Prove that this triangle is obtuse-angled.

The cells of the $11 \times 111 \times11$ cube contain the numbers $ 1, 2, , . .. . . 1331$, once each number. Two worms are sent from one corner cube to the opposite corner. Each of them can crawl into a cube adjacent to the edge, while the first can crawl if the number in the adjacent cube differs by $8$, the second - if they differ by $ 9$. Is there such an arrangement of numbers that both worms can get to the opposite corner cube?

For which $n{}$ can we partition a regular $n{}$-gon into finitely many triangles such that no two triangles share a side? [i]Based on a problem of the 2017 Miklós Schweitzer competition[/i]

Three children wanted to make a table-game. For that purpose they wished to enumerate the $mn$ squares of an $m \times n$ game-board by the numbers $1, ... ,mn$ in such way that the numbers $1$ and $mn$ lie in the corners of the board and the squares with successive numbers have a common edge. The children agreed to place the initial square (with number $1$) in one of the corners but each child wanted to have the final square (with number $mn$ ) in different corner. For which numbers $m$ and $n$ is it possible to satisfy the wish of any of the children?

What's the smallest possible value of $$\frac{(x+y+|x-y|)^2}{xy}$$ over positive real numbers $x, y$?

$-15+9\times (6\div 3) =$ $\text{(A)}\ -48 \qquad \text{(B)}\ -12 \qquad \text{(C)}\ -3 \qquad \text{(D)}\ 3 \qquad \text{(E)}\ 12$

In the triangle $ ABC $ on the sides $ BC $, $ CA $, $ AB $, the points $ D $, $ E $, $ F $ are chosen respectively in such a way that $$ BD \colon DC = CE \colon EA = AF \colon FB = k,$$ where $k$ is a given positive number. Given the area $ S $ of the triangle $ ABC $, calculate the area of the triangle $ DEF $

Let $\Gamma$ be the circumcircle of acute triangle $ABC$. Points $D$ and $E$ are on segments $AB$ and $AC$ respectively such that $AD = AE$. The perpendicular bisectors of $BD$ and $CE$ intersect minor arcs $AB$ and $AC$ of $\Gamma$ at points $F$ and $G$ respectively. Prove that lines $DE$ and $FG$ are either parallel or they are the same line. [i]Proposed by Silouanos Brazitikos, Evangelos Psychas and Michael Sarantis, Greece[/i]

The number $695$ is to be written with a factorial base of numeration, that is, $695=a_1+a_2\times2!+a_3\times3!+ . . . a_n \times n!$ where $a_1, a_2, a_3 ... a_n$ are integers such that $0 \le a_k \le k$, and $n!$ means $n(n-1)(n-2)...2 \times 1$. Find $a_4$ ${{ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 3}\qquad\textbf{(E)}\ 4} $

Evaluate $\int^\infty_0\frac{\operatorname{arctan}(\pi x)-\operatorname{arctan}(x)}xdx$ (where $0\le\operatorname{arctan}(x)<\frac\pi2$ for $0\le x<\infty$).

Let $\{a_{n,1},\ldots, a_{n,n} \}_{n=1}^{\infty}$ integers such that $a_{n,i}\neq a_{n,j}$ for $1\le i<j\le n\, , n=2,3,\ldots$ and let $\left\langle y\right\rangle\in [0,1)$ denote the fractional part of the real number $y$. Show that there exists a real sequence $\{ x_n\}_{n=1}^{\infty}$ such that the numbers $\langle a_{n,1}x_n \rangle, \ldots, \langle a_{n,n}x_n \rangle$ are asymptotically uniformly distributed on the interval $[0,1]$. (translated by L. Erdős)