Ten chairs are evenly spaced around a round table and numbered clockwise from $ 1$ through $ 10$. Five married couples are to sit in the chairs with men and women alternating, and no one is to sit either next to or directly across from his or her spouse. How many seating arrangements are possible? $ \textbf{(A)}\ 240\qquad \textbf{(B)}\ 360\qquad \textbf{(C)}\ 480\qquad \textbf{(D)}\ 540\qquad \textbf{(E)}\ 720$

Let $m,n\geq 2$. One needs to cover the table $m \times n$ using only the following tiles: Tile 1 - A square $2 \times 2$. Tile 2 - A L-shaped tile with five cells, in other words, the square $3 \times 3$ [b]without[/b] the upper right square $2 \times 2$. Each tile 1 covers exactly $4$ cells and each tile 2 covers exactly $5$ cells. Rotation is allowed. Determine all pairs $(m,n)$, such that the covering is possible.

Let $ Ax,By$ be two perpendicular semi-straight lines, being not complanar, (non-coplanar rays) such that $ AB$ is the their common perpendicular, and let $ M$ and $ N$ be the two variable points on $ Ax$ and $ Bx,$ respectively, such that $ AM \plus{} BN \equal{} MN.$ [b](a)[/b] Prove that there exist infinitely many lines being co-planar with each of the straight lines $ MN.$ [b](b)[/b] Prove that there exist infinitely many rotations around a fixed axis $ \delta$ mapping the line $ Ax$ onto a line coplanar with each of the lines $ MN.$

Region $ABCDEFGHIJ$ consists of $13$ equal squares and is inscribed in rectangle $PQRS$ with $A$ on $\overline{PQ}$, $B$ on $\overline{QR}$, $E$ on $\overline{RS}$, and $H$ on $\overline{SP}$, as shown in the figure on the right. Given that $PQ=28$ and $QR=26$, determine, with proof, the area of region $ABCDEFGHIJ$. [asy] size(200); defaultpen(linewidth(0.7)+fontsize(12)); pair P=(0,0), Q=(0,28), R=(26,28), S=(26,0), B=(3,28); draw(P--Q--R--S--cycle); picture p = new picture; draw(p, (0,0)--(3,0)^^(0,-1)--(3,-1)^^(0,-2)--(5,-2)^^(0,-3)--(5,-3)^^(2,-4)--(3,-4)^^(2,-5)--(3,-5)); draw(p, (0,0)--(0,-3)^^(1,0)--(1,-3)^^(2,0)--(2,-5)^^(3,0)--(3,-5)^^(4,-2)--(4,-3)^^(5,-2)--(5,-3)); transform t = shift(B) * rotate(-aSin(1/26^.5)) * scale(26^.5); add(t*p); label("$P$",P,SW); label("$Q$",Q,NW); label("$R$",R,NE); label("$S$",S,SE); label("$A$",t*(0,-3),W); label("$B$",B,N); label("$C$",t*(3,0),plain.ENE); label("$D$",t*(3,-2),NE); label("$E$",t*(5,-2),plain.E); label("$F$",t*(5,-3),plain.SW); label("$G$",t*(3,-3),(0.81,-1.3)); label("$H$",t*(3,-5),plain.S); label("$I$",t*(2,-5),NW); label("$J$",t*(2,-3),SW);[/asy]

Let $ P$ be a point in the interior of the equilateral triangle $ \triangle{}ABC$ such that $ PA \equal{} 5$, $ PB \equal{} 7$, $ PC \equal{} 8$. Find the length of the side of the triangle $ ABC$.

The rectangle with vertices $(0,0)$, $(0,3)$, $(2,0)$ and $(2,3)$ is rotated clockwise through a right angle about the point $(2,0)$, then about $(5,0)$, then about $(7,0$), and finally about $(10,0)$. The net effect is to translate it a distance $10$ along the $x$-axis. The point initially at $(1,1)$ traces out a curve. Find the area under this curve (in other words, the area of the region bounded by the curve, the $x$-axis and the lines parallel to the $y$-axis through $(1,0)$ and $(11,0)$).

A rectangle that is inscribed in a larger rectangle (with one vertex on each side) is called [i]unstuck[/i] if it is possible to rotate (however slightly) the smaller rectangle about its center within the confines of the larger. Of all the rectangles that can be inscribed unstuck in a 6 by 8 rectangle, the smallest perimeter has the form $\sqrt{N}$, for a positive integer $N$. Find $N$.

$ABCD$ is a square with centre $O$. Two congruent isosceles triangle $BCJ$ and $CDK$ with base $BC$ and $CD$ respectively are constructed outside the square. let $M$ be the midpoint of $CJ$. Show that $OM$ and $BK$ are perpendicular to each other.

The number of points equidistant from a circle and two parallel tangents to the circle is: $\textbf{(A) }0\qquad \textbf{(B) }2\qquad \textbf{(C) }3\qquad \textbf{(D) }4\qquad \textbf{(E) }\text{infinite}$

Is it possible to choose a set of $100$ (or $200$) points on the boundary of a cube such that this set is fixed under each isometry of the cube into itself? Justify your answer.

The vertices of two regular octagons are numbered from $1$ to $8$, in some order, which may vary between both octagons (each octagon must have all numbers from $1$ to $8$). After this, one octagon is placed on top of the other so that every vertex from one octagon touches a vertex from the other. Then, the numbers of the vertices which are in contact are multiplied (i.e., if vertex $A$ has a number $x$ and is on top of vertex $A'$ that has a number $y$, then $x$ and $y$ are multiplied), and the $8$ products are then added. Prove that, for any order in which the vertices may have been numbered, it is always possible to place one octagon on top of the other so that the final sum is at least $162$. Note: the octagons can be rotated.

Let $A,B$ be adjacent vertices of a regular $n$-gon ($n\ge5$) with center $O$. A triangle $XYZ$, which is congruent to and initially coincides with $OAB$, moves in the plane in such a way that $Y$ and $Z$ each trace out the whole boundary of the polygon, with $X$ remaining inside the polygon. Find the locus of $X$.

Let $ABCD$ be a quadrilateral and $M$ the midpoint of the segment $AB$. Outside of the quadrilateral are constructed the equilateral triangles $BCE$, $CDF$ and $DAG$. Let $P$ and $N$ be the midpoints of the segments $GF$ and $EF$. Prove that the triangle $MNP$ is equilateral.

USAYNO: \url{http://goo.gl/wVR25} % USAYNO link: http://goo.gl/wVR25 [i]Proposed by Lewis Chen, Evan Chen, Eugene Chen[/i]

Determine all $n \in \mathbb{Z}^+$ such that a regular hexagon (i.e. all sides equal length, all interior angles same size) can be partitioned in finitely many $n-$gons such that they can be composed into $n$ congruent regular hexagons in a non-overlapping way upon certain rotations and translations.

Kati cut two equal regular $ n\minus{}gons$ out of paper. To the vertices of both $ n\minus{}gons$, she wrote the numbers 1 to $ n$ in some order. Then she stabbed a needle through the centres of these $ n\minus{}gons$ so that they could be rotated with respect to each other. Kati noticed that there is a position where the numbers at each pair of aligned vertices are different. Prove that the $ n\minus{}gons$ can be rotated to a position where at least two pairs of aligned vertices contain equal numbers.

Prove no three lattice points in the plane form an equilateral triangle.

A board of $2n$ x $2n$ is colored chess style, a movement is the changing of colors of a $2$ x $2$ square. For what integers $n$ is possible to complete the board with one color using a finite number of movements?

A point $P$ is given in the square $ABCD$ such that $\overline{PA}=3$, $\overline{PB}=7$ and $\overline{PD}=5$. Find the area of the square.

Let $n$ be a positive integer, $n \ge 2$, and put $\theta=\frac{2\pi}{n}$. Define points $P_k=(k,0)$ in the [i]xy[/i]-plane, for $k=1,2,\dots,n$. Let $R_k$ be the map that rotates the plane counterclockwise by the angle $\theta$ about the point $P_k$. Let $R$ denote the map obtained by applying in order, $R_1$, then $R_2$, ..., then $R_n$. For an arbitrary point $(x,y)$, find and simplify the coordinates of $R(x,y)$.

Consider a regular $2^k$-gon with center $O$ and label its sides clockwise by $l_1,l_2,...,l_{2^k}$. Reflect $O$ with respect to $l_1$, then reflect the resulting point with respect to $l_2$ and do this process until the last side. Prove that the distance between the final point and $O$ is less than the perimeter of the $2^k$-gon. [i]Proposed by Hesam Rajabzade[/i]

A series of figures is shown in the picture below, each one of them created by following a secret rule. If the leftmost figure is considered the first figure, how many squares will the 21st figure have? [img]http://www.artofproblemsolving.com/Forum/download/file.php?id=49934[/img] Note: only the little squares are to be counted (i.e., the $2 \times 2$ squares, $3 \times 3$ squares, $\dots$ should not be counted) Extra (not part of the original problem): How many squares will the 21st figure have, if we consider all $1 \times 1$ squares, all $2 \times 2$ squares, all $3 \times 3$ squares, and so on?.

In a group of $n$ people, each one knows exactly three others. They are seated around a table. We say that the seating is $perfect$ if everyone knows the two sitting by their sides. Show that, if there is a perfect seating $S$ for the group, then there is always another perfect seating which cannot be obtained from $S$ by rotation or reflection.

The diagram below shows the circular face of a clock with radius $20$ cm and a circular disk with radius $10$ cm externally tangent to the clock face at $12$ o'clock. The disk has an arrow painted on it, initially pointing in the upward vertical direction. Let the disk roll clockwise around the clock face. At what point on the clock face will the disk be tangent when the arrow is next pointing in the upward vertical direction? [asy] size(170); defaultpen(linewidth(0.9)+fontsize(13pt)); draw(unitcircle^^circle((0,1.5),0.5)); path arrow = origin--(-0.13,-0.35)--(-0.06,-0.35)--(-0.06,-0.7)--(0.06,-0.7)--(0.06,-0.35)--(0.13,-0.35)--cycle; for(int i=1;i<=12;i=i+1) { draw(0.9*dir(90-30*i)--dir(90-30*i)); label("$"+(string) i+"$",0.78*dir(90-30*i)); } dot(origin); draw(shift((0,1.87))*arrow); draw(arc(origin,1.5,68,30),EndArrow(size=12));[/asy] $ \textbf{(A) }\text{2 o'clock} \qquad\textbf{(B) }\text{3 o'clock} \qquad\textbf{(C) }\text{4 o'clock} \qquad\textbf{(D) }\text{6 o'clock} \qquad\textbf{(E) }\text{8 o'clock} $

An ant walks across the floor of a circular path of radius $r$ and moves in a straight line, but sometimes stops. Each time it stops, before resuming the march, it rotates $60^o$ alternating the direction (if the last time it turned $60^o$ to its right, the next one does it $60^o$ to its left, and vice versa). Find the maximum possible length of the path the ant goes through. Prove that the length found is, in fact, as long as possible. Figure: turn $60^o$ to the right .