For every integer $ a>1$ an infinite list of integers is constructed $ L(a)$, as follows: [list] $ a$ is the first number in the list $ L(a)$.[/list] [list] Given a number $ b$ in $ L(a)$, the next number in the list is $ b\plus{}c$, where $ c$ is the largest integer that divides $ b$ and is smaller than $ b$.[/list] Find all the integers $ a>1$ such that $ 2002$ is in the list $ L(a)$.

The expression $\sin2^\circ\sin4^\circ\sin6^\circ\cdots\sin90^\circ$ is equal to $p\sqrt{5}/2^{50}$, where $p$ is an integer. Find $p$.

Jonathan and Justin each flip a coin eight times. Jonathan and Justin get $m, n$ heads respectively. What is the probability that the difference of that $|m-n| \equiv 0 $ mod $4$? [i]Lightning 3.4[/i]

Squares of an $n \times n$ table ($n \ge 3$) are painted black and white as in a chessboard. A move allows one to choose any $2 \times 2$ square and change all of its squares to the opposite color. Find all such n that there is a finite number of the moves described after which all squares are the same color.

Jamal wants to store $ 30$ computer files on floppy disks, each of which has a capacity of $ 1.44$ megabytes (MB). Three of his files require $ 0.8$ MB of memory each, $ 12$ more require $ 0.7$ MB each, and the remaining $ 15$ require $ 0.4$ MB each. No file can be split between floppy disks. What is the minimal number of floppy disks that will hold all the files? $ \textbf{(A)}\ 12 \qquad \textbf{(B)}\ 13 \qquad \textbf{(C)}\ 14 \qquad \textbf{(D)}\ 15 \qquad \textbf{(E)}\ 16$

In each box of a $9\times 9$ grid we write a positive integer such that, between any $2$ boxes on the same row or column that have the same number $n$ written, there's at least $n$ boxes between them. What is the minimum sum possible for the numbers on the grid?

Let $$a_k = 0.\overbrace{0 \ldots 0}^{k - 1 \: 0's} 1 \overbrace{0 \ldots 0}^{k - 1 \: 0's} 1$$ The value of $\sum_{k = 1}^\infty a_k$ can be expressed as a rational number $\frac{p}{q}$ in simplest form. Find $p + q$.

Let $p$ be an odd prime integer and $k$ a positive integer not divisible by $p$, $1\le k<2(p+1)$, and let $N=2kp+1$. Prove that the following statements are equivalent: (i) $N$ is a prime number (ii) there exists a positive integer $a$, $2\le a<n$, such that $a^{kp}+1$ is divisible by $N$ and $\gcd\left(a^k+1,N\right)=1$.

An infinite road has traffic lights at intervals of 1500m. The lights are all synchronised and are alternately green for $\frac 32$ minutes and red for 1 minute. For which $v$ can a car travel at a constant speed of $v$m/s without ever going through a red light?

Let $a$, $b$, $c$ be positive real numbers. Determine the minimum value of the following expression $$ \frac{a^2+2b^2+4c^2}{b(a+2c)}$$

Let $ABC$ be a scalene, non-right triangle. Let $\omega$ be the incircle and let $\gamma$ be the nine-point circle (the circle through the feet of the altitudes) of $\triangle ABC$, with centers $I$ and $N$, respectively. Suppose $\omega$ and $\gamma$ are tangent at a point $F$. Let $D$ be the foot of the perpendicular from $A$ to line $BC$ and let $M$ be the midpoint of side $\overline{BC}$. The common tangent to $\omega$ and $\gamma$ at $F$ intersects lines $AB$ and $AC$ at points $P$ and $Q$, respectively. Let lines $DP$ and $DQ$ intersect $\gamma$ at points $P_1 \neq D$ and $Q_1 \neq D$, respectively. Suppose that point $Z$ lies on line $P_1Q_1$ such that $\angle MFZ=90^{\circ}$ and $MZ \perp DF$. Suppose that $\gamma$ has radius 11 and $\omega$ has radius 5. Then $DI=\frac{k\sqrt{m}}{n}$, where $k,m,$ and $n$ are positive integers such that $\gcd(k,n)=1$ and $m$ is not divisible by the square of any prime. Compute $100k+10m+n$. [i]Proposed by Luke Robitaille[/i]

Find all polynomyals $P(x)$ with real coefficients which satisfy the following equality for all real numbers $x$: \[ P(x^2)+x(3P(x)+P(-x))=(P(x))^2+2x^2 . \]

Mark $4 \cdot k$ points in a circle and number them arbitrarily with numbers from $1$ to $4 \cdot k$. The chords cannot share common endpoints, also, the endpoints of these chords should be among the $4 \cdot k$ points. [b]i.[/b] Prove that $2 \cdot k$ pairwisely non-intersecting chords can be drawn for each of whom its endpoints differ in at most $3 \cdot k - 1$. [b]ii.[/b] Prove that the $3 \cdot k - 1$ cannot be improved.

Given is an acute triangle $ABC$ $\left(AB<AC<BC\right)$,inscribed in circle $c(O,R)$.The perpendicular bisector of the angle bisector $AD$ $\left(D\in BC\right)$ intersects $c$ at $K,L$ ($K$ lies on the small arc $\overarc{AB}$).The circle $c_1(K,KA)$ intersects $c$ at $T$ and the circle $c_2(L,LA)$ intersects $c$ at $S$.Prove that $\angle{BAT}=\angle{CAS}$. [hide=Diagram][asy]import graph; size(10cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -6.94236331697463, xmax = 15.849400903703716, ymin = -5.002235438802758, ymax = 7.893104843949444; /* image dimensions */ pen aqaqaq = rgb(0.6274509803921569,0.6274509803921569,0.6274509803921569); pen uququq = rgb(0.25098039215686274,0.25098039215686274,0.25098039215686274); pen qqqqtt = rgb(0.,0.,0.2); draw((1.8318261909633622,3.572783369254345)--(0.,0.)--(6.,0.)--cycle, aqaqaq); draw(arc((1.8318261909633622,3.572783369254345),0.6426249310341638,-117.14497824050169,-101.88970202103212)--(1.8318261909633622,3.572783369254345)--cycle, qqqqtt); draw(arc((1.8318261909633622,3.572783369254345),0.6426249310341638,-55.85706977865775,-40.60179355918817)--(1.8318261909633622,3.572783369254345)--cycle, qqqqtt); /* draw figures */ draw((1.8318261909633622,3.572783369254345)--(0.,0.), uququq); draw((0.,0.)--(6.,0.), uququq); draw((6.,0.)--(1.8318261909633622,3.572783369254345), uququq); draw(circle((3.,0.7178452373968209), 3.0846882800136055)); draw((2.5345020274407277,0.)--(1.8318261909633622,3.572783369254345)); draw(circle((-0.01850947366601585,1.3533783539547308), 2.889550258039566)); draw(circle((5.553011501106743,2.4491551634556963), 3.887127532933951)); draw((-0.01850947366601585,1.3533783539547308)--(5.553011501106743,2.4491551634556963), linetype("2 2")); draw((1.8318261909633622,3.572783369254345)--(0.7798408954511686,-1.423695174396108)); draw((1.8318261909633622,3.572783369254345)--(5.22015910454883,-1.4236951743961088)); /* dots and labels */ dot((1.8318261909633622,3.572783369254345),linewidth(3.pt) + dotstyle); label("$A$", (1.5831274347452782,3.951671933606579), NE * labelscalefactor); dot((0.,0.),linewidth(3.pt) + dotstyle); label("$B$", (-0.6,0.05), NE * labelscalefactor); dot((6.,0.),linewidth(3.pt) + dotstyle); label("$C$", (6.188606107156787,0.07450151636712989), NE * labelscalefactor); dot((2.5345020274407277,0.),linewidth(3.pt) + dotstyle); label("$D$", (2.3,-0.7), NE * labelscalefactor); dot((-0.01850947366601585,1.3533783539547308),linewidth(3.pt) + dotstyle); label("$K$", (-0.3447473583572136,1.6382221818835927), NE * labelscalefactor); dot((5.553011501106743,2.4491551634556963),linewidth(3.pt) + dotstyle); label("$L$", (5.631664500260511,2.580738747400365), NE * labelscalefactor); dot((0.7798408954511686,-1.423695174396108),linewidth(3.pt) + dotstyle); label("$T$", (0.5977692071595602,-1.960477431907719), NE * labelscalefactor); dot((5.22015910454883,-1.4236951743961088),linewidth(3.pt) + dotstyle); label("$S$", (5.160406217502124,-1.8747941077698307), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */[/asy][/hide]

Let $ABC$ be a triangle with $\angle BAC=60$. Let $B_1$ and $C_1$ be the feet of the bisectors from $B$ and $C$. Let $A_1$ be the symmetrical of $A$ according to line $B_1C_1$. Prove that $A_1, B, C$ are colinear.

Which of these numbers is the largest? $\textbf{(A)} \sqrt{\sqrt[3]{5\cdot 6}}\qquad \textbf{(B)} \sqrt{6\sqrt[3]{5}}\qquad \textbf{(C)} \sqrt{5\sqrt[3]{6}}\qquad \textbf{(D)} \sqrt[3]{5\sqrt{6}}\qquad \textbf{(E)} \sqrt[3]{6\sqrt{5}}$

Six teams participate in a hockey tournament. Each team plays exactly once against each other team. A team is awarded $3$ points for each game they win, $1$ point for each draw, and $0$ points for each game they lose. After the tournament, a ranking is made. There are no ties in the list. Moreover, it turns out that each team (except the very last team) has exactly $2$ points more than the team ranking one place lower. Prove that the team that finished fourth won exactly two games.

A deck of forty cards consists of four 1's, four 2's,..., and four 10's. A matching pair (two cards with the same number) is removed from the deck. Given that these cards are not returned to the deck, let $m/n$ be the probability that two randomly selected cards also form a pair, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Show that $\displaystyle{\sum_{i=1}^{n}(-1)^{n+i}\binom{n}{i}\binom{in}{n} = n^{n}}$.

Let $T$ be the intersection of the common internal tangents of circles $C_1$, $C_2$ with centers $O_1$, $O_2$ respectively. Let $P$ be one of the points of tangency on $C_1$ and let line $\ell$ bisect angle $O_1TP$ . Label the intersection of $\ell$ with $C_1$ that is farthest from $T$, $R$, and label the intersection of $\ell$ with $C_2$ that is closest to $T$, $S$. If $C_1$ has radius $4$, $C_2$ has radius $6$, and $O_1O_2= 20$ , calculate $(TR)(TS) $. [img]https://cdn.artofproblemsolving.com/attachments/3/c/284f17bb0dd73eab93132e41f27ecc121f496d.png[/img]

Show that the inequality \[\sum_{i=1}^n \sum_{j=1}^n \sqrt{|x_i-x_j|}\leqslant \sum_{i=1}^n \sum_{j=1}^n \sqrt{|x_i+x_j|}\]holds for all real numbers $x_1,\ldots x_n.$

Consider all nine-digit numbers, consisting of non-repeating digits from $1$ to $9$ in an arbitrary order. A pair of such numbers is called “conditional” if their sum is equal to $987654321$. (a) Prove that there exist at least two conditional pairs (noting that ($a,b$) and ($b,a$) is considered to be one pair). (b) Prove that the number of conditional pairs is odd. (G Galperin, Moscow)

There are $2n + 1$ tickets, each with a unique positive integer as the ticket number. It is known that the sum of all ticket numbers is more than $2330$, but the sum of any $n$ ticket numbers is at most $1165$. What is the maximum value of $n$?

We are given a convex quadrilateral $ABCD$ whose angles are not right. Assume there are points $P, Q, R, S$ on its sides $AB, BC, CD, DA$, respectively, such that $PS \parallel BD$, $SQ \perp BC$, $PR \perp CD$. Furthermore, assume that the lines $PR, SQ$, and $AC$ are concurrent. Prove thatthe points $P, Q, R, S$ are concyclic.

Let $\vartriangle A_0B_0C_0$ be an equilateral triangle with area $1$, and let $A_1$, $B_1$, $C_1$ be the midpoints of $\overline{A_0B_0}$, $\overline{B_0C_0}$, and $\overline{C_0A_0}$, respectively. Furthermore, set $A_2$, $B_2$, $C_2$ as the midpoints of segments $\overline{A_0A_1}$, $\overline{B_0B_1}$, and $\overline{C_0C_1}$ respectively. For $n \ge 1$, $A_{2n+1}$ is recursively defined as the midpoint of $A_{2n}A_{2n-1}$, and $A_{2n+2}$ is recursively defined as the midpoint of $\overline{A_{2n+1}A_{2n-1}}$. Recursively define $B_n$ and $C_n$ the same way. Compute the value of $\lim_{n \to \infty }[A_nB_nC_n]$, where $[A_nB_nC_n]$ denotes the area of triangle $\vartriangle A_nB_nC_n$.