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.

Rectangle $ABCD$ is inscribed in a semicircle with diameter $\overline{FE},$ as shown in the figure. Let $DA=16,$ and let $FD=AE=9.$ What is the area of $ABCD?$ [asy] // diagram by SirCalcsALot draw(arc((0,0),17,180,0)); draw((-17,0)--(17,0)); fill((-8,0)--(-8,15)--(8,15)--(8,0)--cycle, 1.5*grey); draw((-8,0)--(-8,15)--(8,15)--(8,0)--cycle); dot("$A$",(8,0), 1.25*S); dot("$B$",(8,15), 1.25*N); dot("$C$",(-8,15), 1.25*N); dot("$D$",(-8,0), 1.25*S); dot("$E$",(17,0), 1.25*S); dot("$F$",(-17,0), 1.25*S); label("$16$",(0,0),N); label("$9$",(12.5,0),N); label("$9$",(-12.5,0),N); [/asy] $\textbf{(A) }240 \qquad \textbf{(B) }248 \qquad \textbf{(C) }256 \qquad \textbf{(D) }264 \qquad \textbf{(E) }272$

Suppose we are given a $19\times19$ chessboard (a table with $19^2$ squares) and remove the central square. Is it possible to tile the remaining $19^2-1=360$ squares with $4\times1$ and $1\times4$ rectangles? (So that each of the $360$ squares is covered by exactly one rectangle.) Justify your answer.

Two circles of equal radius can tightly fit inside right triangle $ABC$, which has $AB=13$, $BC=12$, and $CA=5$, in the three positions illustrated below. Determine the radii of the circles in each case. [asy] size(400); defaultpen(linewidth(0.7)+fontsize(12)); picture p = new picture; pair s1 = (20,0), s2 = (40,0); real r1 = 1.5, r2 = 10/9, r3 = 26/7; pair A=(12,5), B=(0,0), C=(12,0); draw(p,A--B--C--cycle); label(p,"$B$",B,SW); label(p,"$A$",A,NE); label(p,"$C$",C,SE); add(p); add(shift(s1)*p); add(shift(s2)*p); draw(circle(C+(-r1,r1),r1)); draw(circle(C+(-3*r1,r1),r1)); draw(circle(s1+C+(-r2,r2),r2)); draw(circle(s1+C+(-r2,3*r2),r2)); pair D=s2+156/17*(A-B)/abs(A-B), E=s2+(169/17,0), F=extension(D,E,s2+A,s2+C); draw(incircle(s2+B,D,E)); draw(incircle(s2+A,D,F)); label("Case (i)",(6,-3)); label("Case (ii)",s1+(6,-3)); label("Case (iii)",s2+(6,-3));[/asy]

Circles $S_1$ and $S_2$ intersect at points $M$ and $N$. Prove that if vertices $A$ and $ C$ of some rectangle $ABCD$ lie on the circle $S_1$, and the vertices $B$ and $D$ lie on the circle $S_2$, then the point of intersection of its diagonals lies on the line $MN$.

Let $a,b$ be positive even integers. A rectangle with side lengths $a$ and $b$ is split into $a \cdot b$ unit squares. Anja and Bernd take turns and in each turn they color a square that is made of those unit squares. The person that can't color anymore, loses. Anja starts. Find all pairs $(a,b)$, such that she can win for sure. [b]Extension:[/b] Solve the problem for positive integers $a,b$ that don't necessarily have to be even. [b]Note:[/b] The [i]extension[/i] actually was proposed at first. But since this is a homework competition that goes over three months and some cases were weird, the problem was changed to even integers.

A rectangle $3 \times 5$ is divided into $15$ $1 \times 1$ cells. The middle $3$ cells that have no common points with the border of the rectangle are deleted. Is it possible to put in the remaining $12$ cells numbers $1, 2, \ldots, 12$ in some order, so that the sums of the numbers in the cells along each of the four sides of the rectangle are equal? [i]Proposed by Mariia Rozhkova[/i]

Determine the number of non-degenerate rectangles whose edges lie completely on the grid lines of the following figure. $ \begin{tabular}{|c|c|c|c|c|c|} \hline & & & & & \\ \hline & & & & & \\ \hline & & \multicolumn{1}{c}{} & & & \\ \cline{1 \minus{} 2}\cline{5 \minus{} 6} & & \multicolumn{1}{c}{} & & & \\ \hline & & & & & \\ \hline & & & & & \\ \hline \end{tabular}$

We divide up the plane into disjoint regions using a circle, a rectangle and a triangle. What is the greatest number of regions that we can get?

A square with sides of length $6$ has the same area as a rectangle with a length of $9$. What is the width of the rectangle? $\textbf{(A) } 2\qquad\textbf{(B) } \frac73\qquad\textbf{(C) } 3\qquad\textbf{(D) } \frac{10}{3}\qquad\textbf{(E) } 4$

Let $n$ be a positive integer and $P_1, P_2, \ldots, P_n$ be different points on the plane such that distances between them are all integers. Furthermore, we know that the distances $P_iP_1, P_iP_2, \ldots, P_iP_n$ forms the same sequence for all $i=1,2, \ldots, n$ when these numbers are arranged in a non-decreasing order. Find all possible values of $n$.

Every cell of a $m \times n$ chess board, $m\ge 2,n\ge 2$, is colored with one of four possible colors, e.g white, green, red, blue. We call such coloring good if the four cells of any $2\times 2$ square of the chessboard are colored with pairwise different colors. Determine the number of all good colorings of the chess board. [i]Proposed by N. Beluhov[/i]

How many rectangles are there in the diagram below such that the sum of the numbers within the rectangle is a multiple of 7? [asy] int n; n=0; for (int i=0; i<=7;++i) { draw((i,0)--(i,7)); draw((0,i)--(7,i)); for (int a=0; a<=7;++a) { if ((a != 7)&&(i != 7)) { n=n+1; label((string) n,(a,i),(1.5,2)); } } } [/asy]

In rectangle $ ABCD$, points $ F$ and $ G$ lie on $ \overline{AB}$ so that $ AF \equal{} FG \equal{} GB$ and $ E$ is the midpoint of $ \overline{DC}$. Also, $ \overline{AC}$ intersects $ \overline{EF}$ at $ H$ and $ \overline{EG}$ at $ J$. The area of the rectangle $ ABCD$ is $ 70$. Find the area of triangle $ EHJ$. [asy] size(180); pair A, B, C, D, E, F, G, H, J; A = origin; real length = 6; real width = 3.5; B = length*dir(0); C = (length, width); D = width*dir(90); F = length/3*dir(0); G = 2*length/3*dir(0); E = (length/2, width); H = extension(A, C, E, F); J = extension(A, C, E, G); draw(A--B--C--D--cycle); draw(G--E--F); draw(A--C); label("$A$", A, dir(180)); label("$D$", D, dir(180)); label("$B$", B, dir(0)); label("$C$", C, dir(0)); label("$F$", F, dir(270)); label("$E$", E, dir(90)); label("$G$", G, dir(270)); label("$H$", H, dir(140)); label("$J$", J, dir(340)); [/asy] $ \displaystyle \textbf{(A)} \ \frac {5}{2} \qquad \textbf{(B)} \ \frac {35}{12} \qquad \textbf{(C)} \ 3 \qquad \textbf{(D)} \ \frac {7}{2} \qquad \textbf{(E)} \ \frac {35}{8}$

The midpoints of the four sides of a rectangle are $(-3, 0), (2, 0), (5, 4)$ and $(0, 4)$. What is the area of the rectangle? $\textbf{(A)} ~20\qquad\textbf{(B)} ~25\qquad\textbf{(C)} ~40\qquad\textbf{(D)} ~50\qquad\textbf{(E)} ~80\qquad$

Let $ABCD$ be a rectangle and denote by $M$ and $N$ the midpoints of $AD$ and $BC$ respectively. The point $P$ is on $(CD$ such that $D\in (CP)$, and $PM$ intersects $AC$ in $Q$. Prove that $m(\angle{MNQ})=m(\angle{MNP})$.

We inscribed in triangle $ABC$ the rectangle $DEFG$ such that $D$ and $E$ fall on side $AB$, $F$ on side $BC$, and $G$ on side $AC$. We know that $AF$ bisects angle $\angle BAC$, and that $\frac{AD}{DE} = \frac12$. What is the measure of angle $\angle CAB$?

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?

Point $K$ lies on the circumcircle of a rectangle $ABCD$. Line $CK$ intersects line segment $AD$ at point $M$ so that $AM:MD=2$. $O$ is the center the rectangle. Prove that the centroid of triangle $OKD$ belongs to the circumcircle of triangle $COD$. (Author: V. Shmarov)

In rectangle $ABCD$, angle $C$ is trisected by $\overline{CF}$ and $\overline{CE}$, where $E$ is on $\overline{AB}$, $F$ is on $\overline{AD}$, $BE = 6,$ and $AF = 2$. Which of the following is closest to the area of the rectangle $ABCD$? [asy] size(140); pair A, B, C, D, E, F, X, Y; real length = 12.5; real width = 10; A = origin; B = (length, 0); C = (length, width); D = (0, width); X = rotate(330, C)*B; E = extension(C, X, A, B); Y = rotate(30, C)*D; F = extension(C, Y, A, D); draw(E--C--F); label("$2$", A--F, dir(180)); label("$6$", E--B, dir(270)); draw(A--B--C--D--cycle); dot(A);dot(B);dot(C);dot(D);dot(E);dot(F); label("$A$", A, dir(225)); label("$B$", B, dir(315)); label("$C$", C, dir(45)); label("$D$", D, dir(135)); label("$E$", E, dir(270)); label("$F$", F, dir(180)); [/asy] $\textbf{(A)} \ 110 \qquad \textbf{(B)} \ 120 \qquad \textbf{(C)} \ 130 \qquad \textbf{(D)} \ 140 \qquad \textbf{(E)} \ 150$

A computer screen shows a $98 \times 98$ chessboard, colored in the usual way. One can select with a mouse any rectangle with sides on the lines of the chessboard and click the mouse button: as a result, the colors in the selected rectangle switch (black becomes white, white becomes black). Find, with proof, the minimum number of mouse clicks needed to make the chessboard all one color.

Let $ABC$ be the right-angled isosceles triangle whose equal sides have length 1. $P$ is a point on the hypotenuse, and the feet of the perpendiculars from $P$ to the other sides are $Q$ and $R$. Consider the areas of the triangles $APQ$ and $PBR$, and the area of the rectangle $QCRP$. Prove that regardless of how $P$ is chosen, the largest of these three areas is at least $2/9$.

The points $P$ and $Q$ are the midpoints of the edges $AE$ and $CG$ on the cube $ABCD.EFGH$ respectively. If the length of the cube edges is $1$ unit, determine the area of the quadrilateral $DPFQ$ .

Given a positive integer $n$, determine the largest real number $\mu$ satisfying the following condition: for every set $C$ of $4n$ points in the interior of the unit square $U$, there exists a rectangle $T$ contained in $U$ such that $\bullet$ the sides of $T$ are parallel to the sides of $U$; $\bullet$ the interior of $T$ contains exactly one point of $C$; $\bullet$ the area of $T$ is at least $\mu$.

Consider a chess board, with the numbers $1$ through $64$ placed in the squares as in the diagram below. \[\begin{tabular}{| c | c | c | c | c | c | c | c |} \hline 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 \\ \hline 9 & 10 & 11 & 12 & 13 & 14 & 15 & 16 \\ \hline 17 & 18 & 19 & 20 & 21 & 22 & 23 & 24 \\ \hline 25 & 26 & 27 & 28 & 29 & 30 & 31 & 32 \\ \hline 33 & 34 & 35 & 36 & 37 & 38 & 39 & 40 \\ \hline 41 & 42 & 43 & 44 & 45 & 46 & 47 & 48 \\ \hline 49 & 50 & 51 & 52 & 53 & 54 & 55 & 56 \\ \hline 57 & 58 & 59 & 60 & 61 & 62 & 63 & 64 \\ \hline \end{tabular}\] Assume we have an infinite supply of knights. We place knights in the chess board squares such that no two knights attack one another and compute the sum of the numbers of the cells on which the knights are placed. What is the maximum sum that we can attain? Note. For any $2\times3$ or $3\times2$ rectangle that has the knight in its corner square, the knight can attack the square in the opposite corner.