For each positive integer $n$ and non-negative integer $k$, define $W(n,k)$ recursively by \[ W(n,k) = \begin{cases} n^n & k = 0 \\ W(W(n,k-1), k-1) & k > 0. \end{cases} \] Find the last three digits in the decimal representation of $W(555,2)$.

Find all continuous monotonic functions $f : R \to R$ that satisfy $f (1) = 1$ and $f(f (x)) = f (x)^2$ for all $x \in R$.

Let $a, b, c$ be non-negative reals with $a + b + c \le 2$. prove that $$\sqrt{b^2+ac} + \sqrt{a^2+bc} + \sqrt{c^2+ab} \le 3$$

Find all ordered pairs of integers $(x,y)$ such that $5^x = 1 + 4y + y^4$.

Steve has a tricycle which has a front wheel with a radius of $30$ cm and back wheels with radii of $10$ cm and $9$ cm. The axle passing through the centers of the back wheels has a length of $40$ cm and is perpendicular to both planes containing the wheels. Since the tricycle is tilted, it goes in a circle as Steve pedals. Steve rides the tricycle until it reaches its original position, so that all of the wheels do not slip or leave the ground. The tires trace out concentric circles on the ground, and the radius of the circle the front wheel traces is the average of the radii of the other two traced circles. Compute the total number of degrees the front wheel rotates. (Express your answer in simplest radical form.)

Define a sequence $(a_n)_{n \geq 1}$ by $a_1 =1$ and $a_2 =2$ and $a_{n+2} = 2 a_{n+1} - a_n + 2$ for $n \geq 1$. prove that for any $m$ , $a_m a_{m+1}$ is also a term in this sequence.

There are 5 points on the plane. The following steps are used to construct lines. In step 1, connect all possible pairs of the points; it is found that no two lines are parallel, nor any two lines perpendicular to each other, also no three lines are concurrent. In step 2, perpendicular lines are drawn from each of the five given points to straight lines connecting any two of the other four points. What is the maximum number of points of intersection formed by the lines drawn in step 2, including the 5 given points?

On a Cartesian plane, $n$ parabolas are drawn, all of which are graphs of quadratic trinomials. No two of them are tangent. They divide the plane into many areas, one of which is above all the parabolas. Prove that the border of this area has no more than $2(n-1)$ corners (i.e. the intersections of a pair of parabolas).

Let $p>3$ is a prime number and $k=\lfloor\frac{2p}{3}\rfloor$. Prove that \[{p \choose 1}+{p \choose 2}+\cdots+{p \choose k}\] is divisible by $p^{2}$.

Let $ABC$ be triangle with incenter $I$ . Let $AI$ intersect $BC$ at $D$. Point $P,Q$ lies inside triangle $ABC$ such that $\angle BPA + \angle CQA = 180^\circ$ and $B,Q,I,P,C$ concyclic in order . $BP$ intersect $CQ$ at $X$. Prove that the intersection of $(ABC)$ and $(APQ)$ lies on line $XD$.

Two circles $ O, O'$ having same radius meet at two points, $ A,B (A \not = B) $. Point $ P,Q $ are each on circle $ O $ and $ O' $ $(P \not = A,B ~ Q\not = A,B )$. Select the point $ R $ such that $ PAQR $ is a parallelogram. Assume that $ B, R, P, Q $ is cyclic. Now prove that $ PQ = OO' $.

Consider the equation $x^4-24x^3+210x^2+mx+n=0$. Given that the roots of this equation are nonnegative reals, find the maximum possible value of a root of this equation across all values of $m$ and $n$. [i]Proposed by Andrew Zhao[/i]

Given a circumcircle $(O)$ and two fixed points $B,C$ on $(O)$. $BC$ is not the diameter of $(O)$. A point $A$ varies on $(O)$ such that $ABC$ is an acute triangle. $E,F$ is the foot of the altitude from $B,C$ respectively of $ABC$. $(I)$ is a variable circumcircle going through $E$ and $F$ with center $I$. a) Assume that $(I)$ touches $BC$ at $D$. Probe that $\frac{DB}{DC}=\sqrt{\frac{\cot B}{\cot C}}$. b) Assume $(I)$ intersects $BC$ at $M$ and $N$. Let $H$ be the orthocenter and $P,Q$ be the intersections of $(I)$ and $(HBC)$. The circumcircle $(K)$ going through $P,Q$ and touches $(O)$ at $T$ ($T$ is on the same side with $A$ wrt $PQ$). Prove that the interior angle bisector of $\angle{MTN}$ passes through a fixed point.

The function $f(n)$ satisfies $f(0)=0$, $f(n)=n-f \left( f(n-1) \right)$, $n=1,2,3 \cdots$. Find all polynomials $g(x)$ with real coefficient such that \[ f(n)= [ g(n) ], \qquad n=0,1,2 \cdots \] Where $[ g(n) ]$ denote the greatest integer that does not exceed $g(n)$.

Consider the parallelograms $ABCD$ and $AXYZ$, such that $X \in $[$BC$] and $D \in $[$YZ$]. Prove that the areas of the parallelograms are equal.

Prove that the sum of the squares of the distances from a point $P$ to the vertices of a triangle $ABC$ is minimum when $ P$ is the centroid of the triangle.

Prove that $ f(x)\equal{}\int_0^1 e^{\minus{}|t\minus{}x|}t(1\minus{}t)dt$ has maximal value at $ x\equal{}\frac 12$.

Helen has a wooden rectangle of unknown dimensions, a straightedge, and a pencil (no compass). Is it possible for her to construct a line segment on the rectangle connecting the midpoints of two opposite sides, where she cannot draw any lines or points outside the rectangle? Note: Helen is allowed to draw lines between two points she has already marked, and mark the intersection of any two lines she has already drawn, if the intersection lies on the rectangle. Further, Helen is allowed to mark arbitrary points either on the rectangle or on a segment she has previously drawn. Assume that only the four vertices of the rectangle have been marked prior to the beginning of this process.

Points $E$ and $F$ are the midpoints of sides $BC$ and $CD$ of square $ABCD$, respectively. Lines $AE$ and $BF$ meet at point $P$. Prove that $\angle PDA = \angle AED$.

What is the greatest three-digit divisor of $111777$?

Prove that there exist infinitely many integers $n$ such that $n, n + 1, n + 2$ are each the sum of two squares of integers.

Find all function $f:[0,\infty )\to\mathbb{R}$ such that $f$ is monotonic and \[ [f(x)+f(y)]^2=f(x^2-y^2)+f(2xy) \] for all $x\geq y\geq 0$

[b]N[/b]ew this year at HMNT: the exciting game of RNG baseball! In RNG baseball, a team of infinitely many people play on a square field, with a base at each vertex; in particular, one of the bases is called the home base. Every turn, a new player stands at home base and chooses a number n uniformly at random from $\{0, 1, 2, 3, 4\}$. Then, the following occurs: • If $n>0$, then the player and everyone else currently on the field moves (counterclockwise) around the square by n bases. However, if in doing so a player returns to or moves past the home base, he/she leaves the field immediately and the team scores one point. • If $n=0$ (a strikeout), then the game ends immediately; the team does not score any more points. What is the expected number of points that a given team will score in this game?

For a positive integer $n$, let $6^{(n)}$ be the natural number whose decimal representation consists of $n$ digits $6$. Let us define, for all natural numbers $m$, $k$ with $1 \leq k \leq m$ \[\left[\begin{array}{ccc}m\\ k\end{array}\right] =\frac{ 6^{(m)} 6^{(m-1)}\cdots 6^{(m-k+1)}}{6^{(1)} 6^{(2)}\cdots 6^{(k)}} .\] Prove that for all $m, k$, $ \left[\begin{array}{ccc}m\\ k\end{array}\right] $ is a natural number whose decimal representation consists of exactly $k(m + k - 1) - 1$ digits.

A group of students play the following game: they are counting one by one from $00$ to $99$ taking turns, but instead of every number they only say one of its digits. (The numbers in order are $00$, $01$, $02$, $...$., meaning that one-digit numbers are regarded as two-digit numbers with a first digit $0$.) One way of starting the counting could be for example $0$, $1$, $2$, $0$, $4$, $0$, $6$, $7$, $8$, $9,$ $1$, $1$, $2$, $1$, $1$, $5$, $6$, $1$, $8$, $1$, $0$, $2$ etc. When they reach $99$, the counting restarts from $00$. At some point Csongor enters the room and after listening to the counting for a while, he discovers that he is able to tell what number the counting is at. How many digits has Csongor heard at least?