Alice and Bob play the following game. It begins with a set of $1000$ $1\times 2$ rectangles. A [i]move[/i] consists of choosing two rectangles (a rectangle may consist of one or several $1\times 2$ rectangles combined together) that share a common side length and combining those two rectangles into one rectangle along those sides sharing that common length. The first player who cannot make a move loses. Alice moves first. Describe a winning strategy for Bob.

Divide a $ 2\times 4 $ rectangle into $ 8 $ unit squares to obtain a set of $ 15 $ vertices denoted by $ \mathcal{M} . $ Find the points $ A\in\mathcal{M} $ that have the property that the set $ \mathcal{M}\setminus \{ A\} $ can form $ 7 $ pairs $ \left( A_1,B_1\right) ,\left( A_2,B_2\right) ,\ldots ,\left( A_7,B_7\right)\in\mathcal{M}\times\mathcal{M} $ such that $$ \overrightarrow{A_1B_1} +\overrightarrow{A_2B_2} +\cdots +\overrightarrow{A_7B_7} =\overrightarrow{O} . $$

A square with side length $8$ is cut in half, creating two congruent rectangles. What are the dimensions of one of these rectangles? $ \textbf{(A)}\ 2\text{ by }4 \qquad\textbf{(B)}\ 2\text{ by }6 \qquad\textbf{(C)}\ 2\text{ by }8 \qquad\textbf{(D)}\ 4\text{ by }4 \qquad\textbf{(E)}\ 4\text{ by }8 $

The diagram shows twenty congruent circles arranged in three rows and enclosed in a rectangle. The circles are tangent to one another and to the sides of the rectangle as shown in the diagram. The ratio of the longer dimension of the rectangle to the shorter dimension can be written as $\frac{1}{2}\left(\sqrt{p}-q\right),$ where $p$ and $q$ are positive integers. Find $p+q.$ [asy] size(250);real x=sqrt(3); int i; draw(origin--(14,0)--(14,2+2x)--(0,2+2x)--cycle); for(i=0; i<7; i=i+1) { draw(Circle((2*i+1,1), 1)^^Circle((2*i+1,1+2x), 1)); } for(i=0; i<6; i=i+1) { draw(Circle((2*i+2,1+x), 1)); }[/asy]

The projection of the vertex $C$ of the rectangle $ABCD$ on the diagonal $BD$ is $E$. The projections of $E$ on $AB$ and $AD$ are $F$ and $G$ respectively. Prove that $$AF^{2/3} + AG^{2/3} = AC^{2/3}$$ .

Twenty-one rectangles of size $3\times 1$ are placed on an $8\times 8$ chessboard, leaving only one free unit square. What position can the free square lie at?

Let $ABCDEF$ be a convex hexagon containing a point $P$ in its interior such that $PABC$ and $PDEF$ are congruent rectangles with $PA = BC = P D = EF$ (and $AB = PC = DE = PF$). Let $\ell$ be the line through the midpoint of $AF$ and the circumcentre of $PCD$. Prove that $\ell$ passes through $P$.

Let $X$ be an interior point of a rectangle $ABCD$. Let the bisectors of $\angle DAX$ and $\angle CBX$ intersect in $P$. A point $Q$ satisfies $\angle QAP=\angle QBP=90^\circ$. Show that $PX=QX$.

In the Cartesian plane, a line segment is called [i]tame[/i] if it lies parallel to one of the coordinate axes and its distance to this axis is an integer. Otherwise it is called [i]wild[/i]. Let $m$ and $n$ be odd positive integers. The rectangle with vertices $(0,0),(m,0),(m,n)$ and $(0,n)$ is partitioned into finitely many triangles. Let $M$ be the set of these triangles. Assume that (1) Each triangle from $M$ has at least one tame side. (2) For each tame side of a triangle from $M$, the corresponding altitude has length $1$. (3) Each wild side of a triangle from $M$ is a common side of exactly two triangles from $M$. Show that at least two triangles from $M$ have two tame sides each.

A rectangular floor measures $ a$ by $ b$ feet, where $ a$ and $ b$ are positive integers with $ b > a$. An artist paints a rectangle on the floor with the sides of the rectangle parallel to the sides of the floor. The unpainted part of the floor forms a border of width $ 1$ foot around the painted rectangle and occupies half of the area of the entire floor. How many possibilities are there for the ordered pair $ (a,b)$? $ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5$

A regular tetrahedron has side $L$. What is the smallest $x$ such that the tetrahedron can be passed through a loop of twine of length $x$?

Let $n$ be an integer greater than $3$. Show that it is possible to divide a square into $n^2 + 1$ or more disjointed rectangles and with sides parallel to those of the square so that any line parallel to one of the sides intersects at most the interior of $n$ rectangles. Note: We say that two rectangles are [i]disjointed [/i] if they do not intersect or only intersect at their perimeters.

Prove that it is not possible to cover a $6\times 6$ square board with eighteen $2\times 1$ rectangles, in such a way that each of the lines going along the interior gridlines cuts at least one of the rectangles. Show also that it is possible to cover a $6\times 5$ rectangle with fifteen $2\times 1 $ rectangles so that the above condition is fulfilled.

A $ 6\times 6$ square is dissected in to 9 rectangles by lines parallel to its sides such that all these rectangles have integer sides. Prove that there are always [b]two[/b] congruent rectangles.

We call a rectangle of the size $1 \times 2$ a domino. Rectangle of the $2 \times 3$ removing two opposite (under center of rectangle) corners we call tetramino. These figures can be rotated. It requires to tile rectangle of size $2008 \times 2010$ by using dominoes and tetraminoes. What is the minimal number of dominoes should be used?

Square $ABCD$ has side length $13$, and points $E$ and $F$ are exterior to the square such that $BE=DF=5$ and $AE=CF=12$. Find $EF^{2}$. [asy] size(200); defaultpen(fontsize(10)); real x=22.61986495; pair A=(0,26), B=(26,26), C=(26,0), D=origin, E=A+24*dir(x), F=C+24*dir(180+x); draw(B--C--F--D--C^^D--A--E--B--A, linewidth(0.7)); dot(A^^B^^C^^D^^E^^F); pair point=(13,13); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F));[/asy]

$m\times n$ grid is tiled by mosaics $2\times2$ and $1\times3$ (horizontal and vertical). Prove that the number of ways to choose a $1\times2$ rectangle (horizontal and vertical) such that one of its cells is tiled by $2\times2$ mosaic and the other cell is tiled by $1\times3$ mosaic [horizontal and vertical] is an even number.