Prove that for all positive integers $n,m$, with $m$ odd, the following number is an integer \[ \frac 1{3^mn}\sum^m_{k=0} { 3m \choose 3k } (3n-1)^k. \]

The straight line $ \overline{AB}$ is divided at $ C$ so that $ AC\equal{}3CB$. Circles are described on $ \overline{AC}$ and $ \overline{CB}$ as diameters and a common tangent meets $ AB$ produced at $ D$. Then $ BD$ equals: $ \textbf{(A)}\ \text{diameter of the smaller circle} \\ \textbf{(B)}\ \text{radius of the smaller circle} \\ \textbf{(C)}\ \text{radius of the larger circle} \\ \textbf{(D)}\ CB\sqrt{3}\\ \textbf{(E)}\ \text{the difference of the two radii}$

A "spherical ellipse" with foci $A,B$ on a given sphere is defined as the set of all points $P$ on the sphere such that $\overset{\Large\frown}{PA}+\overset{\Large\frown}{PB}=$ constant. Here $\overset{\Large\frown}{PA}$ denotes the shortest distance on the sphere between $P$ and $A$. Determine the entire class of real spherical ellipses which are circles.

Let $O, I$ be the circumcenter and the incenter of triangle $ABC$, $P$ be an arbitrary point on segment $OI$, $P_A$, $P_B$, and $P_C$ be the second common points of lines $PA$, $PB$, and $PC$ with the circumcircle of triangle $ABC$. Prove that the bisectors of angles $BP_AC$, $CP_BA$, and $AP_CB$ concur at a point lying on $OI$.

Points $ A_1$, $ A_2$, $ ...$ are placed on a circle with center $ O$ such that $ \angle OA_n A_{n\plus{}1}\equal{}35^\circ$ and $ A_n\neq A_{n\plus{}2}$ for all positive integers $ n$. What is the smallest $ n>1$ for which $ A_n\equal{}A_1$?

In a triangle $ABC,$ the internal and external bisectors of the angle $A$ intersect the line $BC$ at $D$ and $E$ respectively. The line $AC$ meets the circle with diameter $DE$ again at $F.$ The tangent line to the circle $ABF$ at $A$ meets the circle with diameter $DE$ again at $G.$ Show that $AF = AG.$

Among 6 coins one is counterfeit (its weight differs from that real one and neither weights is known). Using scales that show the total weight of coins placed on the cup, find the counterfeit coin in 3 weighings. [i](5 points)[/i]

Given triangle $ABC$ with the inner - bisector $AD$. The line passes through $D$ and perpendicular to $BC$ intersects the outer - bisector of $\angle BAC$ at $I$. Circle $(I,ID)$ intersects $CA$, $AB$ at $E$, $F$, reps. The symmedian line of $\triangle AEF$ intersects the circle $(AEF)$ at $X$. Prove that the circles $(BXC)$ and $(AEF)$ are tangent. [Hide=Diagram] [asy]import graph; size(7.04cm); 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 = 7.02, xmax = 14.06, ymin = -1.54, ymax = 4.08; /* image dimensions */ /* draw figures */ draw((8.62,3.12)--(7.58,-0.38)); draw((7.58,-0.38)--(13.68,-0.38)); draw((13.68,-0.38)--(8.62,3.12)); draw((8.62,3.12)--(9.85183961338573,3.5535510951732316)); draw((9.85183961338573,3.5535510951732316)--(9.851839613385732,-0.38)); draw((9.851839613385732,-0.38)--(8.62,3.12)); draw(circle((10.012708209519483,1.129702986881574), 2.4291805937992947)); draw((8.62,3.12)--(9.470868507287285,-1.238276762688951), red); draw(shift((9.85183961338573,3.553551095173232))*xscale(3.9335510951732324)*yscale(3.9335510951732324)*arc((0,0),1,237.85842690125605,309.7357733435313), linetype("4 4")); draw(shift((10.63,3.8274278922585725))*xscale(5.196628663716066)*yscale(5.196628663716066)*arc((0,0),1,234.06132677886183,305.9386732211382), blue); /* dots and labels */ dot((8.62,3.12),linewidth(3.pt) + dotstyle); label("$A$", (8.48,3.24), NE * labelscalefactor); dot((7.58,-0.38),linewidth(3.pt) + dotstyle); label("$B$", (7.3,-0.58), NE * labelscalefactor); dot((13.68,-0.38),linewidth(3.pt) + dotstyle); label("$C$", (13.76,-0.26), NE * labelscalefactor); dot((9.851839613385732,-0.38),linewidth(3.pt) + dotstyle); label("$D$", (9.94,-0.26), NE * labelscalefactor); dot((9.85183961338573,3.5535510951732316),linewidth(3.pt) + dotstyle); label("$I$", (9.94,3.68), NE * labelscalefactor); dot((7.759138898806625,0.22287129406075654),linewidth(3.pt) + dotstyle); label("$F$", (7.46,0.16), NE * labelscalefactor); dot((12.36635458796946,0.5286480122740898),linewidth(3.pt) + dotstyle); label("$E$", (12.44,0.64), NE * labelscalefactor); dot((9.470868507287285,-1.238276762688951),linewidth(3.pt) + dotstyle); label("$X$", (9.56,-1.12), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] [/Hide]

Ali Baba and the $40$ thieves want to cross Bosporus strait. They made a line so that any two people standing next to each other are friends. Ali Baba is the first, he is also a friend with the thief next to his neighbour. There is a single boat that can carry $2$ or $3$ people and these people must be friends. Can Ali Baba and the $40$ thieves always cross the strait if a single person cannot sail?

Two squares on an $8\times 8$ chessboard are called adjacent if they have a common edge or common corner. Is it possible for a king to begin in some square and visit all squares exactly once in such a way that all moves except the first are made into squares adjacent to an even number of squares already visited?

Find the greatest real number $C$ such that, for all real numbers $x$ and $y \neq x$ with $xy = 2$ it holds that \[\frac{((x + y)^2 - 6)((x - y)^2 + 8)}{(x-y)^2}\geq C.\] When does equality occur?

Let $k$ be a positive integer. Prove that: (a) If $k=m+2mn+n$ for some positive integers $m,n$, then $2k+1$ is composite. (b) If $2k+1$ is composite, then there exist positive integers $m,n$ such that $k=m+2mn+n$.

Prove that for any integer $n \ge 3$, the least common multiple of the numbers $1,2, ... ,n$ is greater than $2^{n-1}$.

Prove that the polynomial $x^4+\lambda x^3+\mu x^2+\nu x+1$ has no real roots if $\lambda, \mu , \nu $ are real numbers satisfying \[|\lambda |+|\mu |+|\nu |\le \sqrt{2} \]

If $a,b,c$ are positive real numbers such that $a+b+c=abc$ prove that $$\frac{abc}{3\sqrt{2}}\left ( \sum_{cyc}\frac{\sqrt{a^3+b^3}}{ab+1} \right )\geq \sum_{cyc}\frac{a}{a^2+1}$$

Let $a_{n+1} = a_n + \frac{1}{{a_n}^{2005}}$ and $a_1=1$. Show that $\sum^{\infty}_{n=1}{\frac{1}{n a_n}}$ converge.

Suppose that $ 4^{x_1} \equal{} 5, 5^{x_2} \equal{} 6, 6^{x_3} \equal{} 7,...,127^{x_{124}} \equal{} 128$. What is $ x_1x_2 \cdots x_{124}$? $ \textbf{(A)}\ 2\qquad \textbf{(B)}\ \frac {5}{2}\qquad \textbf{(C)}\ 3\qquad \textbf{(D)}\ \frac {7}{2}\qquad \textbf{(E)}\ 4$

A sequence of distinct circles $\omega_1, \omega_2, \cdots$ is inscribed in the parabola $y=x^2$ so that $\omega_n$ and $\omega_{n+1}$ are tangent for all $n$. If $\omega_1$ has diameter $1$ and touches the parabola at $(0,0)$, find the diameter of $\omega_{1998}$.

The real numbers $a_0,a_1,a_2,\ldots$ satisfy $1=a_0\le a_1\le a_2\le\ldots. b_1,b_2,b_3,\ldots$ are defined by $b_n=\sum_{k=1}^n{1-{a_{k-1}\over a_k}\over\sqrt a_k}$. [b]a.)[/b] Prove that $0\le b_n<2$. [b]b.)[/b] Given $c$ satisfying $0\le c<2$, prove that we can find $a_n$ so that $b_n>c$ for all sufficiently large $n$.

What is the minimum possible perimeter of a right triangle with integer side lengths whose perimeter is equal to its area? [i]Individual #4[/i]

Seven people of seven different ages are attending a meeting. The seven people leave the meeting one at a time in random order. Given that the youngest person leaves the meeting sometime before the oldest person leaves the meeting, the probability that the third, fourth, and fifth people to leave the meeting do so in order of their ages (youngest to oldest) is $\frac{m}{n}$ , where m and n are relatively prime positive integers. Find $m + n$.

Let $\Delta ABC$ be an acute triangle. $D,E,F$ are the touch points of incircle with $BC,CA,AB$ respectively. $AD,BE,CF$ intersect incircle at $K,L,M$ respectively. If,$$\sigma = \frac{AK}{KD} + \frac{BL}{LE} + \frac{CM}{MF}$$ $$\tau = \frac{AK}{KD}.\frac{BL}{LE}.\frac{CM}{MF}$$ Then prove that $\tau = \frac{R}{16r}$. Also prove that there exists integers $u,v,w$ such that, $uvw \neq 0$, $u\sigma + v\tau +w=0$.

Prove that if $m,n,r$ are positive integers, and: \[1+m+n\sqrt{3}=(2+\sqrt{3})^{2r-1} \] then $m$ is a perfect square.

$\dfrac{1}{10} + \dfrac{9}{100} + \dfrac{9}{1000} + \dfrac{7}{10000} = $ $\textbf{(A)}\ 0.0026 \qquad \textbf{(B)}\ 0.0197 \qquad \textbf{(C)}\ 0.1997 \qquad \textbf{(D)}\ 0.26 \qquad \textbf{(E)}\ 1.997$

At a circular track, $10$ cyclists started from some point at the same time in the same direction with different constant speeds. If any two cyclists are at some point at the same time again, we say that they meet. No three or more of them have met at the same time. Prove that by the time every two cyclists have met at least once, each cyclist has had at least $25$ meetings.