Problem 1.

For each integer a_{0 }> 1, define the sequence a_{0}, a_{1}, a_{2}, … … by:

Determine all values of a_{0} for which there is a number A such that a_{n} = A for infinitely many values of n.

**Problem 2. **Let ℝ be the set of real numbers. Determine all functions *f *: ℝ → ℝ such that, for all real numbers *x *and *y*,

*f *(*f*(*x*)*f*(*y*)) + *f*(*x *+ *y*) = *f*(*xy*)*.*

**Problem 3. **A hunter and an invisible rabbit play a game in the Euclidean plane. The rabbit’s starting point, *A*_{0}, and the hunter’s starting point, *B*_{0}, are the same. After *n-*1 rounds of the game,

the rabbit is at point *A _{n-}*

_{1 }and the hunter is at point

*B*

_{n-}_{1}. In the

*n*

^{th}round of the game, three things occur in order.

(i) The rabbit moves invisibly to a point

*A*such that the distance between

_{n}*A*

_{n-}_{1}and

*A*is exactly 1.

_{n}(ii) A tracking device reports a point

*P*to the hunter. The only guarantee provided by the tracking device to the hunter is that the distance between

_{n}*P*and

_{n}*A*is at most 1.

_{n}(iii) The hunter moves visibly to a point

*Bn*such that the distance between

*B*

_{n-}_{1}and

*B*is exactly 1.

_{n}Is it always possible, no matter how the rabbit moves, and no matter what points are reported by the tracking device, for the hunter to choose her moves so that after 109 rounds she can ensure that the distance between her and the rabbit is at most 100?

**Problem 4. **Let *R *and *S *be different points on a circle Ω such that *RS *is not a diameter. Let *ℓ**
*be the tangent line to Ω at

*R*. Point

*T*is such that

*S*is the midpoint of the line segment

*RT*. Point

*J*is chosen on the shorter arc

*RS*of Ω so that the circumcircle Γ of triangle

*JST*intersects

*ℓ*at two distinct points. Let

*A*be the common point of Γ and

*ℓ*

*that*is closer to

*R*. Line

*AJ*meets Ω again at

*K*. Prove that the line

*KT*is tangent to Γ.

**Problem 5. **An integer *N *> 2 is given. A collection of *N*(*N *+ 1) soccer players, no two of whom are of the same height, stand in a row. Sir Alex wants to remove *N*(*N **– *1) players from this row leaving a new row of 2*N *players in which the following *N *conditions hold:

(1) no one stands between the two tallest players,

(2) no one stands between the third and fourth tallest players,

…

(*N*) no one stands between the two shortest players.

Show that this is always possible.

**Problem 6. **An ordered pair (*x, y*) of integers is a *primitive point *if the greatest common divisor of *x *and *y *is 1. Given a finite set *S *of primitive points, prove that there exists a positive integer *n *and integers *a*_{0}, *a*_{1}, …, *a** _{n}* such that, for each (

*x, y*) in

*S*, we have:

*a*_{0}*x** ^{n}* +

*a*

_{1}

*x*

^{n}

^{–}^{1}

*y*+

*a*

_{2}

*x*

^{n}

^{–}^{2}

*y*

^{2}+

*· · ·*+

*a*

_{n}

_{–}_{1}

*xy*

^{n}

^{–}^{1}+

*a*

_{n}*y*

*= 1*

^{n}*.*