Consider 2n+1 coins lying in a circle. At the beginning, all the coins are heads up. Moving clockwise, 2n+1 flips are performed: one coin is flipped, the next coin is skipped, the next coin is flipped, the next two coins are skipped, the next coin is flipped,the next three coins are skipped and so on, until finally 2n coins are skipped and the next coin is flipped.Prove that at the end of this procedure,exactly one coin is heads down.

The diagram below shows four regular hexagons each with side length $1$ meter attached to the sides of a square. This figure is drawn onto a thin sheet of metal and cut out. The hexagons are then bent upward along the sides of the square so that $A_1$ meets $A_2$, $B_1$ meets $B_2$, $C_1$ meets $C_2$, and $D_1$ meets $D_2$. If the resulting dish is filled with water, the water will rise to the height of the corner where the $A_1$ and $A_2$ meet. there are relatively prime positive integers $m$ and $n$ so that the number of cubic meters of water the dish will hold is $\sqrt{\frac{m}{n}}$. Find $m+n$. [asy] /* File unicodetex not found. */ /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki, go to User:Azjps/geogebra */ import graph; size(7cm); 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 = -4.3, xmax = 14.52, ymin = -8.3, ymax = 6.3; /* image dimensions */ draw((0,1)--(0,0)--(1,0)--(1,1)--cycle); draw((1,1)--(1,0)--(1.87,-0.5)--(2.73,0)--(2.73,1)--(1.87,1.5)--cycle); draw((0,1)--(1,1)--(1.5,1.87)--(1,2.73)--(0,2.73)--(-0.5,1.87)--cycle); draw((0,0)--(1,0)--(1.5,-0.87)--(1,-1.73)--(0,-1.73)--(-0.5,-0.87)--cycle); draw((0,1)--(0,0)--(-0.87,-0.5)--(-1.73,0)--(-1.73,1)--(-0.87,1.5)--cycle); /* draw figures */ draw((0,1)--(0,0)); draw((0,0)--(1,0)); draw((1,0)--(1,1)); draw((1,1)--(0,1)); draw((1,1)--(1,0)); draw((1,0)--(1.87,-0.5)); draw((1.87,-0.5)--(2.73,0)); draw((2.73,0)--(2.73,1)); draw((2.73,1)--(1.87,1.5)); draw((1.87,1.5)--(1,1)); draw((0,1)--(1,1)); draw((1,1)--(1.5,1.87)); draw((1.5,1.87)--(1,2.73)); draw((1,2.73)--(0,2.73)); draw((0,2.73)--(-0.5,1.87)); draw((-0.5,1.87)--(0,1)); /* dots and labels */ dot((1.87,-0.5),dotstyle); label("$C_1$", (1.72,-0.1), NE * labelscalefactor); dot((1.87,1.5),dotstyle); label("$B_2$", (1.76,1.04), NE * labelscalefactor); dot((1.5,1.87),dotstyle); label("$B_1$", (0.96,1.8), NE * labelscalefactor); dot((-0.5,1.87),dotstyle); label("$A_2$", (-0.26,1.78), NE * labelscalefactor); dot((-0.87,1.5),dotstyle); label("$A_1$", (-0.96,1.08), NE * labelscalefactor); dot((-0.87,-0.5),dotstyle); label("$D_2$", (-1.02,-0.18), NE * labelscalefactor); dot((-0.5,-0.87),dotstyle); label("$D_1$", (-0.22,-0.96), NE * labelscalefactor); dot((1.5,-0.87),dotstyle); label("$C_2$", (0.9,-0.94), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy]

Let $E$ be an ellipse where the length of the major axis is $26$, the length of the minor axis is $24$, and the foci are at points $R$ and $S$. Let $A$ and $B$ be points on the ellipse such that $RASB$ forms a non-degenerate quadrilateral, lines $RA$ and $SB$ intersect at $P$ with segment $PR$ containing $A$, and lines $RB$ and $AS$ intersect at Q with segment $QR$ containing $B$. Given that $RA = AS$, $AP = 26$, the perimeter of the non-degenerate quadrilateral $RP SQ$ is $m +\sqrt{n}$, where $m$ and $n$ are integers. Compute $m + n$.

A sphere inscribed in a tetrahedron touches one face at the intersection of its angle bisectors, a second face at the intersection of its altitudes, and a third face at the intersection of its medians. Show that the tetrahedron is regular. [i]N. Agakhanov[/i]

Three faces $X , Y, Z$ of a unit cube share a common vertex. Suppose the projections of $X , Y, Z$ onto a fixed plane $P$ have areas $x, y, z$, respectively. If $x : y : z = 6 : 10 : 15$, then $x + y + z$ can be written as $m/n$ , where $m, n$ are positive integers and $gcd(m, n) = 1$. Find $100m + n$.

In the year $ 2001$, the United States will host the International Mathematical Olympiad. Let $ I$, $ M$, and $ O$ be distinct positive integers such that the product $ I\cdot M \cdot O \equal{} 2001$. What's the largest possible value of the sum $ I \plus{} M \plus{} O$? $ \textbf{(A)}\ 23 \qquad \textbf{(B)}\ 55 \qquad \textbf{(C)}\ 99 \qquad \textbf{(D)}\ 111 \qquad \textbf{(E)}\ 671$

Inside a rectangular piece of paper $n$ rectangular holes with sides parallel to the sides of the paper have been cut out. Into what minimal number of rectangular pieces (without holes) is it always possible to cut this piece of paper? (A Shapovalov)

Two regular tetrahedrons $A$ and $B$ are made with the 8 vertices of a unit cube. (this way is unique) What's the volume of $A\cup B$?

Show that \[ \max\limits_{|x|\leq t} |1 - a \cos x| \geq \tan^2 \frac{t}{2} \] for $a$ positive and $t \in (0, \frac{\pi}{2})$.

Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer. Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers. [i]Proposed by Matthew Babbitt[/i]