We define a [i]chessboard polygon[/i] to be a polygon whose sides are situated along lines of the form $ x \equal{} a$ or $ y \equal{} b$, where $ a$ and $ b$ are integers. These lines divide the interior into unit squares, which are shaded alternately grey and white so that adjacent squares have different colors. To tile a chessboard polygon by dominoes is to exactly cover the polygon by non-overlapping $ 1 \times 2$ rectangles. Finally, a [i]tasteful tiling[/i] is one which avoids the two configurations of dominoes shown on the left below. Two tilings of a $ 3 \times 4$ rectangle are shown; the first one is tasteful, while the second is not, due to the vertical dominoes in the upper right corner. [asy]size(300); pathpen = linewidth(2.5); void chessboard(int a, int b, pair P){ for(int i = 0; i < a; ++i) for(int j = 0; j < b; ++j) if((i+j) % 2 == 1) fill(shift(P.x+i,P.y+j)*unitsquare,rgb(0.6,0.6,0.6)); D(P--P+(a,0)--P+(a,b)--P+(0,b)--cycle); } chessboard(2,2,(2.5,0));fill(unitsquare,rgb(0.6,0.6,0.6));fill(shift(1,1)*unitsquare,rgb(0.6,0.6,0.6)); chessboard(4,3,(6,0)); chessboard(4,3,(11,0)); MP("\mathrm{Distasteful\ tilings}",(2.25,3),fontsize(12)); /* draw lines */ D((0,0)--(2,0)--(2,2)--(0,2)--cycle); D((1,0)--(1,2)); D((2.5,1)--(4.5,1)); D((7,0)--(7,2)--(6,2)--(10,2)--(9,2)--(9,0)--(9,1)--(7,1)); D((8,2)--(8,3)); D((12,0)--(12,2)--(11,2)--(13,2)); D((13,1)--(15,1)--(14,1)--(14,3)); D((13,0)--(13,3));[/asy] a) Prove that if a chessboard polygon can be tiled by dominoes, then it can be done so tastefully. b) Prove that such a tasteful tiling is unique.

The diagram below is an example of a ${\textit{rectangle tiled by squares}}$: [center][img]http://i.imgur.com/XCPQJgk.png[/img][/center] Each square has been labeled with its side length. The squares fill the rectangle without overlapping. In a similar way, a rectangle can be tiled by nine squares whose side lengths are $2,5,7,9,16,25,28,33$, and $36$. Sketch one such possible arrangement of those squares. They must fill the rectangle without overlapping. Label each square in your sketch by its side length as in the picture above.

Ali Barber, the carpet merchant, has a rectangular piece of carpet whose dimensions are unknown. Unfortunately, his tape measure is broken and he has no other measuring instruments. However, he finds that if he lays it flat on the floor of either of his storerooms, then each corner of the carpet touches a different wall of that room. He knows that the sides of the carpet are integral numbers of feet and that his two storerooms have the same (unknown) length, but widths of 38 feet and 50 feet respectively. What are the carpet dimensions?

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})$.

An angle is given in a plane. Using only a compass, one must find out $(a)$ if this angle is acute. Find the minimal number of circles one must draw to be sure. $(b)$ if this angle equals $31^{\circ}$.(One may draw as many circles as one needs).

Is it possible to cut a square with side $\sqrt{2015}$ into no more than five pieces so that these pieces can be rearranged into a rectangle with sides of integer length? (The cuts should be made using straight lines, and flipping of the pieces is disallowed.)

a) $n$ $2\times2$ squares are drawn on the Cartesian plane. The sides of these squares are parallel to the coordinate axes. It is known that the center of any square is not an inner point of any other square. Let $\Pi$ be a rectangle such that it contains all these $n$ squares and its sides are parallel to the coordinate axes. Prove that the perimeter of $\Pi$ is greater than or equal to $4(\sqrt{n}+1)$. b) Prove the sharp estimate: the perimeter of $\Pi$ is greater than or equal to $2\lceil \sqrt{n}+1) \rceil$ (here $\lceil a\rceil$ stands for the smallest integer which is greater than or equal to $a$).

In rectangle $ ABCD$, we have $ AB\equal{}8$, $ BC\equal{}9$, $ H$ is on $ \overline{BC}$ with $ BH\equal{}6$, $ E$ is on $ \overline{AD}$ with $ DE\equal{}4$, line $ EC$ intersects line $ AH$ at $ G$, and $ F$ is on line $ AD$ with $ \overline{GF}\perp\overline{AF}$. Find the length $ GF$. [asy]unitsize(3mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); pair D=(0,0), Ep=(4,0), A=(9,0), B=(9,8), H=(3,8), C=(0,8), G=(-6,20), F=(-6,0); draw(D--A--B--C--D--F--G--Ep); draw(A--G); label("$F$",F,W); label("$G$",G,W); label("$C$",C,WSW); label("$H$",H,NNE); label("$6$",(6,8),N); label("$B$",B,NE); label("$A$",A,SW); label("$E$",Ep,S); label("$4$",(2,0),S); label("$D$",D,S);[/asy]$ \textbf{(A)}\ 16 \qquad \textbf{(B)}\ 20 \qquad \textbf{(C)}\ 24 \qquad \textbf{(D)}\ 28 \qquad \textbf{(E)}\ 30$

Three acute triangles are inscribed in the same circle with their vertices being nine distinct points. Show that one can choose a vertex from each triangle so that the three chosen points determine a triangle each of whose angles is at most $90^\circ$.

Consider a convex $n$-gon $A_1A_2 \dots A_n$. (Note: In a convex polygon, all interior angles are less than $180 \circ$.) Let $h$ be a positive number. Using the sides of the polygon as bases, we draw $n$ rectangles, each of height $h$, so that each rectangle is either entirely inside the $n$-gon or partially overlaps the inside of the $n$-gon. As an example, the left figure below shows a pentagon with a correct configuration of rectangles, while the right figure shows an incorrect configuration of rectangles (since some of the rectangles do not overlap with the pentagon):

We have a $10 \times 10$ table. $T$ is a set of rectangles with vertices from the table and sides parallel to the sides of the table such that no rectangle from the set is a subrectangle of another rectangle from the set. $t$ is the maximum number of elements of $T$. (a) Prove that $t>300$. (b) Prove that $t<600$. [i]Proposed by Mir Omid Haji Mirsadeghi and Kasra Alishahi[/i]

Three circular arcs of radius $5$ units bound the region shown. Arcs $AB$ and $AD$ are quarter-circles, and arc $BCD$ is a semicircle. What is the area, in square units, of the region? [asy] pair A,B,C,D; A = (0,0); B = (-5,5); C = (0,10); D = (5,5); draw(arc((-5,0),A,B,CCW)); draw(arc((0,5),B,D,CW)); draw(arc((5,0),D,A,CCW)); label("$A$",A,S); label("$B$",B,W); label("$C$",C,N); label("$D$",D,E); [/asy] $\text{(A)}\ 25 \qquad \text{(B)}\ 10 + 5\pi \qquad \text{(C)}\ 50 \qquad \text{(D)}\ 50 + 5\pi \qquad \text{(E)}\ 25\pi$

Suppose from $(m+2)\times(n+2)$ rectangle we cut $4$, $1\times1$ corners. Now on first and last row first and last columns we write $2(m+n)$ real numbers. Prove we can fill the interior $m\times n$ rectangle with real numbers that every number is average of it's $4$ neighbors.

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?

Two opposite sides of a rectangle are each divided into $n$ congruent segments, and the endpoints of one segment are joined to the center to form triangle $A$. The other sides are each divided into $m$ congruent segments, and the endpoints of one of these segments are joined to the center to form triangle $B$. [See figure for $n = 5, m = 7$.] What is the ratio of the area of triangle $A$ to the area of triangle $B$? [asy] int i; for(i=0; i<8; i=i+1) { dot((i,0)^^(i,5)); } for(i=1; i<5; i=i+1) { dot((0,i)^^(7,i)); } draw(origin--(7,0)--(7,5)--(0,5)--cycle, linewidth(0.8)); pair P=(3.5, 2.5); draw((0,4)--P--(0,3)^^(2,0)--P--(3,0)); label("$B$", (2.3,0), NE); label("$A$", (0,3.7), SE);[/asy] $\text{(A)} \ 1 \qquad \text{(B)} \ m/n \qquad \text{(C)} \ n/m \qquad \text{(D)} \ 2m/n \qquad \text{(E)} \ 2n/m$

Rose fills each of the rectangular regions of her rectangular flower bed with a different type of flower. The lengths, in feet, of the rectangular regions in her flower bed are as shown in the figure. She plants one flower per square foot in each region. Asters cost $ \$$1 each, begonias $ \$$1.50 each, cannas $ \$$2 each, dahlias $ \$$2.50 each, and Easter lilies $ \$$3 each. What is the least possible cost, in dollars, for her garden? [asy]unitsize(5mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); draw((6,0)--(0,0)--(0,1)--(6,1)); draw((0,1)--(0,6)--(4,6)--(4,1)); draw((4,6)--(11,6)--(11,3)--(4,3)); draw((11,3)--(11,0)--(6,0)--(6,3)); label("1",(0,0.5),W); label("5",(0,3.5),W); label("3",(11,1.5),E); label("3",(11,4.5),E); label("4",(2,6),N); label("7",(7.5,6),N); label("6",(3,0),S); label("5",(8.5,0),S);[/asy]$ \textbf{(A)}\ 108 \qquad \textbf{(B)}\ 115 \qquad \textbf{(C)}\ 132 \qquad \textbf{(D)}\ 144 \qquad \textbf{(E)}\ 156$

A rectangle of size $ m \times n$ has been filled completely by trominoes (a tromino is an L-shape consisting of 3 unit squares). There are four ways to place a tromino 1st way: let the "corner" of the L be on top left 2nd way: let the "corner" of the L be on top right 3rd way: let the "corner" of the L be on bottom left 4th way: let the "corner" of the L be on bottom right Prove that the difference between the number of trominoes placed in the 1st and the 4th way is divisible by $ 3$.

The base of a new rectangle equals the sum of the diagonal and the greater side of a given rectangle, while the altitude of the new rectangle equals the difference of the diagonal and the greater side of the given rectangle. The area of the new rectangle is: $ \textbf{(A)}$ greater than the area of the given rectangle $ \textbf{(B)}$ equal to the area of the given rectangle $ \textbf{(C)}$ equal to the area of a square with its side equal to the smaller side of the given rectangle $ \textbf{(D)}$ equal to the area of a square with its side equal to the greater side of the given rectangle $ \textbf{(E)}$ equal to the area of a rectangle whose dimensions are the diagonal and the shorter side of the given rectangle

A square-shaped pizza with side length $30$ cm is cut into pieces (not necessarily rectangular). All cuts are parallel to the sides, and the total length of the cuts is $240$ cm. Show that there is a piece whose area is at least $36$ cm$^2$

Four circles in a plane have a common center. Their radii form a strictly increasing arithmetic progression. Prove that there is no square with each vertex lying on a different circle.

Let $H$ be a rectangle with angle between two diagonal $\leq 45^{0}$. Rotation $H$ around the its center with angle $0^{0}\leq x\leq 360^{0}$ we have rectangle $H_{x}$. Find $x$ such that $[H\cap H_{x}]$ minimum, where $[S]$ is area of $S$.

In the Cartesian coordinate plane define the strips $ S_n \equal{} \{(x,y)|n\le x < n \plus{} 1\}$, $ n\in\mathbb{Z}$ and color each strip black or white. Prove that any rectangle which is not a square can be placed in the plane so that its vertices have the same color. [b]IMO Shortlist 2007 Problem C5 as it appears in the official booklet:[/b] In the Cartesian coordinate plane define the strips $ S_n \equal{} \{(x,y)|n\le x < n \plus{} 1\}$ for every integer $ n.$ Assume each strip $ S_n$ is colored either red or blue, and let $ a$ and $ b$ be two distinct positive integers. Prove that there exists a rectangle with side length $ a$ and $ b$ such that its vertices have the same color. ([i]Edited by Orlando Döhring[/i]) [i]Author: Radu Gologan and Dan Schwarz, Romania[/i]

One side of the rectangle is $1$ cm. It is known that the rectangle can be divided by two orthogonal lines onto four rectangles, and each of the smaller rectangles has the area not less than $1$ square centimetre, and one of them is not less than $2$ square centimetres. What is the least possible length of another side of big rectangle?

Let $P$ be a point in the plane and let $\gamma$ be a circle which does not contain $P$. Two distinct variable lines $\ell$ and $\ell'$ through $P$ meet the circle $\gamma$ at points $X$ and $Y$, and $X'$ and $Y'$, respectively. Let $M$ and $N$ be the antipodes of $P$ in the circles $PXX'$ and $PYY'$, respectively. Prove that the line $MN$ passes through a fixed point. [i]Mihai Chis[/i]

A square is divided into congruent rectangles with sides of integer lengths. A rectangle is important if it has at least one point in common with a given diagonal of the square. Prove that this diagonal bisects the total area of the important rectangles