Given positive integer $n$ and $r$ pairwise distinct primes $p_1,p_2,\cdots,p_r.$ Initially, there are $(n+1)^r$ numbers written on the blackboard: $p_1^{i_1}p_2^{i_2}\cdots p_r^{i_r} (0 \le i_1,i_2,\cdots,i_r \le n).$ Alice and Bob play a game by making a move by turns, with Alice going first. In Alice's round, she erases two numbers $a,b$ (not necessarily different) and write $\gcd(a,b)$. In Bob's round, he erases two numbers $a,b$ (not necessarily different) and write $\mathrm{lcm} (a,b)$. The game ends when only one number remains on the blackboard. Determine the minimal possible $M$ such that Alice could guarantee the remaining number no greater than $M$, regardless of Bob's move.

Let $O$ be the circumcenter of the acute triangle $ABC$. Suppose points $A',B'$ and $C'$ are on sides $BC,CA$ and $AB$ such that circumcircles of triangles $AB'C',BC'A'$ and $CA'B'$ pass through $O$. Let $\ell_a$ be the radical axis of the circle with center $B'$ and radius $B'C$ and circle with center $C'$ and radius $C'B$. Define $\ell_b$ and $\ell_c$ similarly. Prove that lines $\ell_a,\ell_b$ and $\ell_c$ form a triangle such that it's orthocenter coincides with orthocenter of triangle $ABC$. [i]Proposed by Mehdi E'tesami Fard[/i]

Given positive integers $n,k$, $n \ge 2$. Find the minimum constant $c$ satisfies the following assertion: For any positive integer $m$ and a $kn$-regular graph $G$ with $m$ vertices, one could color the vertices of $G$ with $n$ different colors, such that the number of monochrome edges is at most $cm$.

Through a point $O$ on the diagonal $BD$ of a parallelogram $ABCD$, segments $MN$ parallel to $AB$, and $PQ$ parallel to $AD$, are drawn, with $M$ on $AD$, and $Q$ on $AB$. Prove that diagonals $AO,BP,DN$ (extended if necessary) will be concurrent.

$ABCD$ is a convex quadrilateral. We draw its diagnals to divide the quadrilateral to four triabgles. $P$ is the intersection of diagnals. $I_{1},I_{2},I_{3},I_{4}$ are excenters of $PAD,PAB,PBC,PCD$(excenters corresponding vertex $P$). Prove that $I_{1},I_{2},I_{3},I_{4}$ lie on a circle iff $ABCD$ is a tangential quadrilateral.

Find all functions $g:\mathbb{N}\rightarrow\mathbb{N}$ such that \[\left(g(m)+n\right)\left(g(n)+m\right)\] is a perfect square for all $m,n\in\mathbb{N}.$ [i]Proposed by Gabriel Carroll, USA[/i]

Let $ABCD$ be a quadrilateral (with non-perpendicular diagonals). The perpendicular from $A$ to $BC$ meets $CD$ at $K$. The perpendicular from $A$ to $CD$ meets $BC$ at $L$. The perpendicular from $C$ to $AB$ meets $AD$ at $M$. The perpendicular from $C$ to $AD$ meets $AB$ at $N$. 1. Prove that $KL$ is parallel to $MN$. 2. Prove that $KLMN$ is a parallelogram if $ABCD$ is cyclic.

Let $ A,B,C,M$ points in the plane and no three of them are on a line. And let $ A',B',C'$ points such that $ MAC'B, MBA'C$ and $ MCB'A$ are parallelograms: (a) Show that \[ \overline{MA} \plus{} \overline{MB} \plus{} \overline{MC} < \overline{AA'} \plus{} \overline{BB'} \plus{} \overline{CC'}.\] (b) Assume segments $ AA', BB'$ and $ CC'$ have the same length. Show that $ 2 \left(\overline{MA} \plus{} \overline{MB} \plus{} \overline{MC} \right) \leq \overline{AA'} \plus{} \overline{BB'} \plus{} \overline{CC'}.$ When do we have equality?

Find the number of ordered triples $(x,y,z)$ of non-negative integers satisfying (i) $x \leq y \leq z$ (ii) $x + y + z \leq 100.$

Let $m$ be a positive integer and $x_0, y_0$ integers such that $x_0, y_0$ are relatively prime, $y_0$ divides $x_0^2+m$, and $x_0$ divides $y_0^2+m$. Prove that there exist positive integers $x$ and $y$ such that $x$ and $y$ are relatively prime, $y$ divides $x^2 + m$, $x$ divides $y^2 + m$, and $x + y \leq m+ 1.$

Let $ABC$ be a triangle and $D$ be a point on $BC$ such that $AB+BD=AC+CD$. The line $AD$ intersects the incircle of triangle $ABC$ at $X$ and $Y$ where $X$ is closer to $A$ than $Y$ i. Suppose $BC$ is tangent to the incircle at $E$, prove that: 1) $EY$ is perpendicular to $AD$; 2) $XD=2IM$ where $I$ is the incentre and $M$ is the midpoint of $BC$.

Compute the number of ways to erase 24 letters from the string ``OMOMO$\cdots$OMO'' (with length 27), such that the three remaining letters are O, M and O in that order. Note that the order in which they are erased does not matter. [i]Proposed by Yannick Yao

There is a game. The magician let the participant think up a positive integer (at least two digits). For example, an integer $ \displaystyle\overline{a_1a_2 \cdots a_n}$ is rearranged as $ \overline{a_{i_1}a_{i_2} \cdots a_{i_n}}$, that is, $ i_1, i_2, \cdots, i_n$ is a permutation of $ 1,2, \cdots, n$. Then we get $ n!\minus{}1$ integers. The participant is asked to calculate the sum of the $ n!\minus{}1$ numbers, then tell the magician the sum $ S$. The magician claims to be able to know the original number when he is told the sum $ S$. Try to decide whether the magician can be successful or not.

We say that a positive integer $n$ is lovely if there exist a positive integer $k$ and (not necessarily distinct) positive integers $d_1$, $d_2$, $\ldots$, $d_k$ such that $n = d_1d_2\cdots d_k$ and $d_i^2 \mid n + d_i$ for $i=1,2,\ldots,k$. a) Are there infinitely many lovely numbers? b) Is there a lovely number, greater than $1$, which is a perfect square of an integer?

Let $\mathbb{N}$ denote the set of positive integers, and let $S$ be a set. There exists a function $f :\mathbb{N} \rightarrow S$ such that if $x$ and $y$ are a pair of positive integers with their difference being a prime number, then $f(x) \neq f(y)$. Determine the minimum number of elements in $S$.

Let $k$ be the product of every third positive integer from $2$ to $2006$, that is $k = 2\cdot 5\cdot 8\cdot 11 \cdots 2006$. Find the number of zeros there are at the right end of the decimal representation for $k$.

Solve the equation $ \sin^3x \cos 3x \plus{} \cos^3x \sin 3x \equal{} \frac{3}{8}$.

A sequence of positive real numbers $a_1, a_2, a_3, ... $ satisfies $a_n = a_{n-1} + a_{n-2}$ for all $n \ge 3$. A sequence $b_1, b_2, b_3, ...$ is defined by equations $b_1 = a_1$ , $b_n = a_n + (b_1 + b_3 + ...+ b_{n-1})$ for even $n > 1$ , $b_n = a_n + (b_2 + b_4 + ... +b_{n-1})$ for odd $n > 1$. Prove that if $n\ge 3$, then $\frac13 < \frac{b_n}{n \cdot a_n} < 1$

Let $ABCD$ be a quadrilateral inscribed in a circle $(O)$. Let $(O_1), (O_2), (O_3), (O_4)$ be the circles going through $(A,B), (B,C),(C,D),(D,A)$. Let $X, Y,Z, T$ be the second intersection of the pairs of the circles: $(O_1)$ and $(O_2), (O_2)$ and $(O_3), (O_3)$ and $(O_4), (O_4)$ and $(O_1)$. (a) Prove that $X, Y,Z, T$ are on the same circle of radius $I$. (b) Prove that the midpoints of the line segments $O_1O_3,O_2O_4,OI$ are collinear. Nguyễn Văn Linh

Let $ w, x, y, z$ are non-negative reals such that $ wx \plus{} xy \plus{} yz \plus{} zw \equal{} 1$. Show that $ \frac {w^3}{x \plus{} y \plus{} z} \plus{} \frac {x^3}{w \plus{} y \plus{} z} \plus{} \frac {y^3}{w \plus{} x \plus{} z} \plus{} \frac {z^3}{w \plus{} x \plus{} y}\geq \frac {1}{3}$.

Find all ordered pairs of nonnegative integers $(x,y)$ such that \[x^4-x^2y^2+y^4+2x^3y-2xy^3=1.\]

A number $n$ is called a Niven number, named for Ivan Niven, if it is divisible by the sum of its digits. For example, $24$ is a Niven number. Show that it is not possible to have more than $20$ consecutive Niven numbers.

Let $n > 1$ be an integer. Let $A$ denote the set of divisors of $n$ that are less than $\sqrt n$. Let $B$ denote the set of divisors of $n$ that are greater than $\sqrt n$. Prove that there exists a bijective function $f \colon A \to B$ such that $a$ divides $f(a)$ for all $a \in A$. (We say $f$ is [i]bijective[/i] if for every $b \in B$ there exists a unique $a \in A$ with $f(a) = b$.)

A five digit number $n= \overline{abcdc}$. Is such that when divided respectively by $2,3,4,5,6$ the remainders are $a,b,c,d,c$. What is the remainder when $n$ is divided by $100$?

In a rectangular plot of land, a man walks in a very peculiar fashion. Labeling the corners $ABCD$, he starts at $A$ and walks to $C$. Then, he walks to the midpoint of side $AD$, say $A_1$. Then, he walks to the midpoint of side $CD$ say $C_1$, and then the midpoint of $A_1D$ which is $A_2$. He continues in this fashion, indefinitely. The total length of his path if $AB=5$ and $BC=12$ is of the form $a + b\sqrt{c}$. Find $\displaystyle\frac{abc}{4}$.