A rectangle $ABCD$ is given. On the side $AB$, n different points are chosen strictly between $A$ and $B$. Similarly, $m$ different points are chosen on the side $AD$ between $A$ and $D$. Lines are drawn from the points parallel to the sides. How many rectangles are formed in this way? An example of a particular rectangle $ABCD$ is shown with a shaded one rectangle that may be formed in this way. [img]https://cdn.artofproblemsolving.com/attachments/e/4/f7a04300f0c846fb6418d12dc23f5c74b54242.png[/img]

Let's take a $ABCD$ rectangle of paper; the side $AB$ measures $5$ cm and the side $BC$ measures $9$ cm. We do three folds: 1.We take the $AB$ side on the $BC$ side and call $P$ the point on the $BC$ side that coincides with $A$. A right trapezoid $BCDQ$ is then formed. 2. We fold so that $B$ and $Q$ coincide. A $5$-sided polygon $RPCDQ$ is formed. 3. We fold again by matching $D$ with $C$ and $Q$ with $P$. A new right trapezoid $RPCS$. After making these folds, we make a cut perpendicular to $SC$ by its midpoint $T$, obtaining the right trapezoid $RUTS$. Calculate the area of the figure that appears as we unfold the last trapezoid $RUTS$.

A bug travels in the coordinate plane, moving only along the lines that are parallel to the $x$-axis or $y$-axis. Let $A=(-3, 2)$ and $B=(3, -2)$. Consider all possible paths of the bug from $A$ to $B$ of length at most $20$. How many points with integer coordinates lie on at least one of these paths? $ \textbf{(A)}\ 161 \qquad \textbf{(B)}\ 185 \qquad \textbf{(C)}\ 195 \qquad \textbf{(D)}\ 227 \qquad \textbf{(E)}\ 255 $

Given a scalene acute triangle $ABC$, let M be the midpoints of its side $BC$ and $N$ the midpoint of the arc $BAC$ of its circumcircle. Let $\omega$ be the circle with diameter $BC$ and $D$, $E$ its intersections with the bisector of angle $\angle BAC$. Points $D'$, $E'$ lie on $\omega$ such that $DED'E' $ is a rectangle. Prove that $D'$, $E'$, $M$, $N$ lie on a single circle. [i] (Patrik Bak)[/i]

In a multiple choice test there were 4 questions and 3 possible answers for each question. A group of students was tested and it turned out that for any three of them there was a question which the three students answered differently. What is the maximum number of students tested?

A rectangular floor is covered by a certain number of equally large quadratic tiles. The tiles along the edge are red, and the rest are white. There are equally many red and white tiles. How many tiles can there be?

The $8$ eyelets for the lace of a sneaker all lie on a rectangle, four equally spaced on each of the longer sides. The rectangle has a width of $50$ mm and a length of $80$ mm. There is one eyelet at each vertex of the rectangle. The lace itself must pass between the vertex eyelets along a width side of the rectangle and then crisscross between successive eyelets until it reaches the two eyelets at the other width side of the rectrangle as shown. After passing through these final eyelets, each of the ends of the lace must extend at least $200$ mm farther to allow a knot to be tied. Find the minimum length of the lace in millimeters. [asy] size(200); defaultpen(linewidth(0.7)); path laceL=(-20,-30)..tension 0.75 ..(-90,-135)..(-102,-147)..(-152,-150)..tension 2 ..(-155,-140)..(-135,-40)..(-50,-4)..tension 0.8 ..origin; path laceR=reflect((75,0),(75,-240))*laceL; draw(origin--(0,-240)--(150,-240)--(150,0)--cycle,gray); for(int i=0;i<=3;i=i+1) { path circ1=circle((0,-80*i),5),circ2=circle((150,-80*i),5); unfill(circ1); draw(circ1); unfill(circ2); draw(circ2); } draw(laceL--(150,-80)--(0,-160)--(150,-240)--(0,-240)--(150,-160)--(0,-80)--(150,0)^^laceR,linewidth(1));[/asy]

Two decompositions of a square into three rectangles are called substantially different, if reordering the rectangles does not change one into the other. How many substantially different decompositions of a $2010 \times 2010$ square in three rectangles with integer side lengths are there such that the area of one rectangle is equal to the arithmetic mean of the areas of the other rectangles?

Consider two polygons $ P$ and $ Q$. We want to cut $ P$ into some smaller polygons and put them together in such a way to obtain $ Q$. We can translate the pieces but we can not rotate them or reflect them. We call $ P,Q$ equivalent if and only if we can obtain $ Q$ from $ P$(which is obviously an equivalence relation). [img]http://i3.tinypic.com/4lrb43k.png[/img] a) Let $ P,Q$ be two rectangles with the same area(their sides are not necessarily parallel). Prove that $ P$ and $ Q$ are equivalent. b) Prove that if two triangles are not translation of each other, they are not equivalent. c) Find a necessary and sufficient condition for polygons $ P,Q$ to be equivalent.

Given three parallel lines on the plane. Find the locus of incenters of triangles with vertices lying on these lines (a single vertex on each line).

Let $T$ be an acute triangle. Inscribe a rectangle $R$ in $T$ with one side along a side of $T.$ Then inscribe a rectangle $S$ in the triangle formed by the side of $R$ opposite the side on the boundary of $T,$ and the other two sides of $T,$ with one side along the side of $R.$ For any polygon $X,$ let $A(X)$ denote the area of $X.$ Find the maximum value, or show that no maximum exists, of $\tfrac{A(R)+A(S)}{A(T)},$ where $T$ ranges over all triangles and $R,S$ over all rectangles as above.

The hexagon has five $90^o$ angles and one $270^o$ angle (see picture). Use a straight-line ruler to divide it into two equal-sized polygons. [img]https://cdn.artofproblemsolving.com/attachments/d/8/cdd4df68644bb8e04adbe1b265039b82a5382b.png[/img]

Three given rectangles cover the sides of a triangle completely and each rectangle has a side parallel to a given line. Show that the rectangles also cover the interior of the triangle.

The diagram below shows a rectangle with side lengths $4$ and $8$ and a square with side length $5$. Three vertices of the square lie on three different sides of the rectangle, as shown. What is the area of the region inside both the square and the rectangle? [asy] size(5cm); filldraw((4,0)--(8,3)--(8-3/4,4)--(1,4)--cycle,mediumgray); draw((0,0)--(8,0)--(8,4)--(0,4)--cycle,linewidth(1.1)); draw((1,0)--(1,4)--(4,0)--(8,3)--(5,7)--(1,4),linewidth(1.1)); label("$4$", (8,2), E); label("$8$", (4,0), S); label("$5$", (3,11/2), NW); draw((1,.35)--(1.35,.35)--(1.35,0),linewidth(.4)); draw((5,7)--(5+21/100,7-28/100)--(5-7/100,7-49/100)--(5-28/100,7-21/100)--cycle,linewidth(.4)); [/asy] $\textbf{(A) } 15\dfrac{1}{8} \qquad \textbf{(B) } 15\dfrac{3}{8} \qquad \textbf{(C) } 15\dfrac{1}{2} \qquad \textbf{(D) } 15\dfrac{5}{8} \qquad \textbf{(E) } 15\dfrac{7}{8}$

The area of polygon $ ABCDEF$, in square units, is [asy]draw((0,0)--(4,0)--(4,9)--(-2,9)--(-2,4)--(0,4)--cycle); label("A",(-2,9),NW); label("B",(4,9),NE); label("C",(4,0),SE); label("D",(0,0),SW); label("E",(0,4),NE); label("F",(-2,4),SW); label("5",(-2,6.5),W); label("4",(2,0),S); label("9",(4,4.5),E); label("6",(1,9),N); label("All angles in this diagram are right.",(0,-3),S);[/asy] \[ \textbf{(A)}\ 24 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 46 \qquad \textbf{(D)}\ 66 \qquad \textbf{(E)}\ 74 \]

A square with sides of length $1$ cm is given. There are many different ways to cut the square into four rectangles. Let $S$ be the sum of the four rectangles’ perimeters. Describe all possible values of $S$ with justification.

To each side of the regular $p$-gon of side length $1$ there is attached a $1 \times k$ rectangle, partitioned into $k$ unit cells, where $k$ and $p$ are given positive integers and p an odd prime. Let $P$ be the resulting nonconvex star-like polygonal figure consisting of $kp + 1$ regions ($kp$ unit cells and the $p$-gon). Each region is to be colored in one of three colors, adjacent regions having different colors. Furthermore, it is required that the colored figure should not have a symmetry axis. In how many ways can this be done?

Circles centered at $ A$ and $ B$ each have radius $ 2$, as shown. Point $ O$ is the midpoint of $ \overline{AB}$, and $ OA \equal{} 2\sqrt {2}$. Segments $ OC$ and $ OD$ are tangent to the circles centered at $ A$ and $ B$, respectively, and $ EF$ is a common tangent. What is the area of the shaded region $ ECODF$? [asy]unitsize(6mm); defaultpen(fontsize(10pt)+linewidth(.8pt)); dotfactor=3; pair O=(0,0); pair A=(-2*sqrt(2),0); pair B=(2*sqrt(2),0); pair G=shift(0,2)*A; pair F=shift(0,2)*B; pair C=shift(A)*scale(2)*dir(45); pair D=shift(B)*scale(2)*dir(135); pair X=A+2*dir(-60); pair Y=B+2*dir(240); path P=C--O--D--Arc(B,2,135,90)--G--Arc(A,2,90,45)--cycle; fill(P,gray); draw(Circle(A,2)); draw(Circle(B,2)); dot(A); label("$A$",A,W); dot(B); label("$B$",B,E); dot(C); label("$C$",C,W); dot(D); label("$D$",D,E); dot(G); label("$E$",G,N); dot(F); label("$F$",F,N); dot(O); label("$O$",O,S); draw(G--F); draw(C--O--D); draw(A--B); draw(A--X); draw(B--Y); label("$2$",midpoint(A--X),SW); label("$2$",midpoint(B--Y),SE);[/asy]$ \textbf{(A)}\ \frac {8\sqrt {2}}{3}\qquad \textbf{(B)}\ 8\sqrt {2} \minus{} 4 \minus{} \pi \qquad \textbf{(C)}\ 4\sqrt {2}$ $ \textbf{(D)}\ 4\sqrt {2} \plus{} \frac {\pi}{8}\qquad \textbf{(E)}\ 8\sqrt {2} \minus{} 2 \minus{} \frac {\pi}{2}$

A line passes through $ A(1,1)$ and $ B(100,1000)$. How many other points with integer coordinates are on the line and strictly between $ A$ and $ B$? $ \textbf{(A)}\ 0\qquad \textbf{(B)}\ 2\qquad \textbf{(C)}\ 3\qquad \textbf{(D)}\ 8\qquad \textbf{(E)}\ 9$

A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even. [i]Proposed by Jeck Lim, Singapore[/i]

Let $ ABC$ be an acute triangle. Point $ D$ lies on side $ BC$. Let $ O_B, O_C$ be the circumcenters of triangles $ ABD$ and $ ACD$, respectively. Suppose that the points $ B, C, O_B, O_C$ lies on a circle centered at $ X$. Let $ H$ be the orthocenter of triangle $ ABC$. Prove that $ \angle{DAX} \equal{} \angle{DAH}$. [i]Zuming Feng.[/i]

Points $P,Q,R,S$ lie on a circle and $\angle PSR$ is right. $H,K$ are the projections of $Q$ on lines $PR,PS$. Prove that $HK$ bisects segment $ QS$.

An angle of size $n \times m$, where $m, n \ge 2$, is called a figure, resulting from a rectangle of size $n \times m$ cells by removing the rectangle size $(n - 1) \times (m - 1)$ cells. Two players take turns making moves consisting in painting in a corner an arbitrary non-zero number of cells forming a rectangle or square.

Let $ABCD$ be a rectangle of sides $AB = 4$ and $BC = 3$. The perpendicular on the diagonal $BD$ drawn from $A$ cuts $BD$ at point $H$. We call $M$ the midpoint of $BH$ and $N$ the midpoint of $CD$. Calculate the measure of the segment $MN$.

The figure below shows a polygon $ABCDEFGH$, consisting of rectangles and right triangles. When cut out and folded on the dotted lines, the polygon forms a triangular prism. Suppose that $AH = EF = 8$ and $GH = 14$. What is the volume of the prism? [asy] // djmathman diagram unitsize(1cm); defaultpen(linewidth(0.7)+fontsize(11)); real r = 2, s = 2.5, theta = 14; pair G = (0,0), F = (r,0), C = (r,s), B = (0,s), M = (C+F)/2, I = M + s/2 * dir(-theta); pair N = (B+G)/2, J = N + s/2 * dir(180+theta); pair E = F + r * dir(- 45 - theta/2), D = I+E-F; pair H = J + r * dir(135 + theta/2), A = B+H-J; draw(A--B--C--I--D--E--F--G--J--H--cycle^^rightanglemark(F,I,C)^^rightanglemark(G,J,B)); draw(J--B--G^^C--F--I,linetype ("4 4")); dot("$A$",A,N); dot("$B$",B,1.2*N); dot("$C$",C,N); dot("$D$",D,dir(0)); dot("$E$",E,S); dot("$F$",F,1.5*S); dot("$G$",G,S); dot("$H$",H,W); dot("$I$",I,NE); dot("$J$",J,1.5*S); [/asy] $\textbf{(A)} ~112\qquad\textbf{(B)} ~128\qquad\textbf{(C)} ~192\qquad\textbf{(D)} ~240\qquad\textbf{(E)} ~288\qquad$