Jonathan and Eric are standing one kilometer apart on a large, flat, empty field. Jonathan rotates an angle of $\theta = 120^o$ counterclockwise around Eric, then Eric moves half of the distance to Jonathan. They keep repeating the previous two movements in this order. After a very long time, their locations approach a point $P$ on the field. What is the distance, in kilometers, from Jonathan’s starting location to $P$?

Let $ABCD$ be a quadrilateral with $AB\parallel CD$ and $AC \perp BD$. Let $O$ be the intersection of $AC$ and $BD$. On the rays $(OA$ and $(OB$ we consider the points $M$ and $N$ respectively such that $\angle ANC = \angle BMD = 90^\circ$. We denote with $E$ the midpoint of the segment $MN$. Prove that a) $\triangle OMN \sim \triangle OBA$; b) $OE \perp AB$. [i]Claudiu-Stefan Popa[/i]

Let $ ABCDEF$ be a regular hexagon. Let $ G$, $ H$, $ I$, $ J$, $ K$, and $ L$ be the midpoints of sides $ AB$, $ BC$, $ CD$, $ DE$, $ EF$, and $ AF$, respectively. The segments $ AH$, $ BI$, $ CJ$, $ DK$, $ EL$, and $ FG$ bound a smaller regular hexagon. Let the ratio of the area of the smaller hexagon to the area of $ ABCDEF$ be expressed as a fraction $ \frac {m}{n}$ where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$.

Let the points $D$ and $E$ lie on the sides $BC$ and $AC$, respectively, of the triangle $ABC$, satisfying $BD=AE$. The line joining the circumcentres of the triangles $ADC$ and $BEC$ meets the lines $AC$ and $BC$ at $K$ and $L$, respectively. Prove that $KC=LC$.

The entries in a $ 3\times3$ array include all the digits from 1 through 9, arranged so that the entries in every row and column are in increasing order. How many such arrays are there? $ \textbf{(A)}\ 18\qquad\textbf{(B)}\ 24\qquad\textbf{(C)}\ 36\qquad\textbf{(D)}\ 42\qquad\textbf{(E)}\ 60$

Players $ A,B$ alternately move a knight on a $ 1994\times 1994$ chessboard. Player $ A$ makes only horizontal moves, i.e. such that the knight is moved to a neighboring row, while $ B$ makes only vertical moves. Initally player $ A$ places the knight to an arbitrary square and makes the first move. The knight cannot be moved to a square that was already visited during the game. A player who cannot make a move loses. Prove that player $ A$ has a winning strategy.

Square $ABCD$ is rotated $20^\circ$ clockwise about its center to obtain square $EFGH$, as shown below. What is the degree measure of $\angle EAB$? [asy] size(170); defaultpen(linewidth(0.6)); real r = 25; draw(dir(135)--dir(45)--dir(315)--dir(225)--cycle); draw(dir(135-r)--dir(45-r)--dir(315-r)--dir(225-r)--cycle); label("$A$",dir(135),NW); label("$B$",dir(45),NE); label("$C$",dir(315),SE); label("$D$",dir(225),SW); label("$E$",dir(135-r),N); label("$F$",dir(45-r),E); label("$G$",dir(315-r),S); label("$H$",dir(225-r),W); [/asy] $\textbf{(A) }20^\circ\qquad\textbf{(B) }30^\circ\qquad\textbf{(C) }32^\circ\qquad\textbf{(D) }35^\circ\qquad\textbf{(E) }45^\circ$

The diagram below shows the first three figures of a sequence of figures. The first figure shows an equilateral triangle $ABC$ with side length $1$. The leading edge of the triangle going in a clockwise direction around $A$ is labeled $\overline{AB}$ and is darkened in on the figure. The second figure shows the same equilateral triangle with a square with side length $1$ attached to the leading clockwise edge of the triangle. The third figure shows the same triangle and square with a regular pentagon with side length $1$ attached to the leading clockwise edge of the square. The fourth figure in the sequence will be formed by attaching a regular hexagon with side length $1$ to the leading clockwise edge of the pentagon. The hexagon will overlap the triangle. Continue this sequence through the eighth figure. After attaching the last regular figure (a regular decagon), its leading clockwise edge will form an angle of less than $180^\circ$ with the side $\overline{AC}$ of the equilateral triangle. The degree measure of that angle can be written in the form $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [asy] size(250); defaultpen(linewidth(0.7)+fontsize(10)); pair x[],y[],z[]; x[0]=origin; x[1]=(5,0); x[2]=rotate(60,x[0])*x[1]; draw(x[0]--x[1]--x[2]--cycle); for(int i=0;i<=2;i=i+1) { y[i]=x[i]+(15,0); } y[3]=rotate(90,y[0])*y[2]; y[4]=rotate(-90,y[2])*y[0]; draw(y[0]--y[1]--y[2]--y[0]--y[3]--y[4]--y[2]); for(int i=0;i<=4;i=i+1) { z[i]=y[i]+(15,0); } z[5]=rotate(108,z[4])*z[2]; z[6]=rotate(108,z[5])*z[4]; z[7]=rotate(108,z[6])*z[5]; draw(z[0]--z[1]--z[2]--z[0]--z[3]--z[4]--z[2]--z[7]--z[6]--z[5]--z[4]); dot(x[2]^^y[2]^^z[2],linewidth(3)); draw(x[2]--x[0]^^y[2]--y[4]^^z[2]--z[7],linewidth(1)); label("A",(x[2].x,x[2].y-.3),S); label("B",origin,S); label("C",x[1],S);[/asy]

$ABC$ is an acute triangle. Points $M$ and $K$ on side $AC$ are such that $\angle ABM = \angle CBK$. Prove that the circumcenters of triangles $ABM$, $ABK$, $CBM$ and $CBK$ are concyclic. (Author: T. Emelyanova)

Let $ABC$ be a triangle with $\angle C=60^\circ$ and $AC<BC$. The point $D$ lies on the side $BC$ and satisfies $BD=AC$. The side $AC$ is extended to the point $E$ where $AC=CE$. Prove that $AB=DE$.

Let points $A_1$, $A_2$ and $A_3$ lie on the circle $\Gamma$ in a counter-clockwise order, and let $P$ be a point in the same plane. For $i \in \{1,2,3\}$, let $\tau_i$ denote the counter-clockwise rotation of the plane centred at $A_i$, where the angle of rotation is equial to the angle at vertex $A_i$ in $\triangle A_1A_2A_3$. Further, define $P_i$ to be the point $\tau_{i+2}(\tau_{i}(\tau_{i+1}(P)))$, where the indices are taken modulo $3$ (i.e., $\tau_4 = \tau_1$ and $\tau_5 = \tau_2$). Prove that the radius of the circumcircle of $\triangle P_1P_2P_3$ is at most the radius of $\Gamma$. [i]Proposed by Anant Mudgal[/i]

Eight all different sushis are placed evenly on the edge of a round table, whose surface can rotate around the center. Eight people also evenly sit around the table, each with one sushi in front. Each person has one favorite sushi among these eight, and they are all distinct. They find that no matter how they rotate the table, there are never more than three people who have their favorite sushis in front of them simultaneously. By this requirement, how many different possible arrangements of the eight sushis are there? Two arrangements that differ by a rotation are considered the same.

A game is played by $n$ girls ($n \geq 2$), everybody having a ball. Each of the $\binom{n}{2}$ pairs of players, is an arbitrary order, exchange the balls they have at the moment. The game is called nice [b]nice[/b] if at the end nobody has her own ball and it is called [b]tiresome[/b] if at the end everybody has her initial ball. Determine the values of $n$ for which there exists a nice game and those for which there exists a tiresome game.

A circular disk is partitioned into $ 2n$ equal sectors by $ n$ straight lines through its center. Then, these $ 2n$ sectors are colored in such a way that exactly $ n$ of the sectors are colored in blue, and the other $ n$ sectors are colored in red. We number the red sectors with numbers from $ 1$ to $ n$ in counter-clockwise direction (starting at some of these red sectors), and then we number the blue sectors with numbers from $ 1$ to $ n$ in clockwise direction (starting at some of these blue sectors). Prove that one can find a half-disk which contains sectors numbered with all the numbers from $ 1$ to $ n$ (in some order). (In other words, prove that one can find $ n$ consecutive sectors which are numbered by all numbers $ 1$, $ 2$, ..., $ n$ in some order.) [hide="Problem 8 from CWMO 2007"]$ n$ white and $ n$ black balls are placed at random on the circumference of a circle.Starting from a certain white ball,number all white balls in a clockwise direction by $ 1,2,\dots,n$. Likewise number all black balls by $ 1,2,\dots,n$ in anti-clockwise direction starting from a certain black ball.Prove that there exists a chain of $ n$ balls whose collection of numbering forms the set $ \{1,2,3\dots,n\}$.[/hide]

A spherical shell of mass $M$ and radius $R$ is completely filled with a frictionless fluid, also of mass M. It is released from rest, and then it rolls without slipping down an incline that makes an angle $\theta$ with the horizontal. What will be the acceleration of the shell down the incline just after it is released? Assume the acceleration of free fall is $g$. The moment of inertia of a thin shell of radius $r$ and mass $m$ about the center of mass is $I = \frac{2}{3}mr^2$; the momentof inertia of a solid sphere of radius r and mass m about the center of mass is $I = \frac{2}{5}mr^2$. $\textbf{(A) } g \sin \theta \\ \textbf{(B) } \frac{3}{4} g \sin \theta\\ \textbf{(C) } \frac{1}{2} g \sin \theta\\ \textbf{(D) } \frac{3}{8} g \sin \theta\\ \textbf{(E) } \frac{3}{5} g \sin \theta$

For a given positive integer $n >2$, let $C_{1},C_{2},C_{3}$ be the boundaries of three convex $n-$ gons in the plane , such that $C_{1}\cap C_{2}, C_{2}\cap C_{3},C_{1}\cap C_{3}$ are finite. Find the maximum number of points of the sets $C_{1}\cap C_{2}\cap C_{3}$.

Lines $l_1$ and $l_2$ both pass through the origin and make first-quadrant angles of $\frac{\pi}{70}$ and $\frac{\pi}{54}$ radians, respectively, with the positive x-axis. For any line $l$, the transformation $R(l)$ produces another line as follows: $l$ is reflected in $l_1$, and the resulting line is reflected in $l_2$. Let $R^{(1)}(l)=R(l)$ and $R^{(n)}(l)=R\left(R^{(n-1)}(l)\right)$. Given that $l$ is the line $y=\frac{19}{92}x$, find the smallest positive integer $m$ for which $R^{(m)}(l)=l$.