Rectangle $ ABCD$ has area 2006. An ellipse with area $ 2006\pi$ passes through $ A$ and $ C$ and has foci at $ B$ and $ D$. What is the perimeter of the rectangle? (The area of an ellipse is $ \pi ab$, where $ 2a$ and $ 2b$ are the lengths of its axes.) $ \textbf{(A) } \frac {16\sqrt {2006}}{\pi} \qquad \textbf{(B) } \frac {1003}4 \qquad \textbf{(C) } 8\sqrt {1003} \qquad \textbf{(D) } 6\sqrt {2006} \qquad \textbf{(E) } \frac {32\sqrt {1003}}\pi$

The figure shows a rectangle, its circumscribed circle and four semicircles, which have the rectangle’s sides as diameters. Prove that the combined area of the four dark gray crescentshaped regions is equal to the area of the light gray rectangle. [img]https://1.bp.blogspot.com/-gojv6KfBC9I/XzT9ZMKrIeI/AAAAAAAAMVU/NB-vUldjULI7jvqiFWmBC_Sd8QFtwrc7wCLcBGAsYHQ/s0/2013%2BMohr%2Bp3.png[/img]

Three rectangles, each of area $6$ square inches, are placed inside a $4$ in. by $4$ in. square. Prove that, no matter how the three rectangles are shaped and arranged, (for example, like in the picture below), one can find two of them which have a common area of at least $2/3$ square inches.

The Proenc has a new $8\times 8$ chess board and requires composing it into rectangles that do not overlap, so that: (i) each rectangle has as many white squares as black ones; (ii) there are no two rectangles with the same number of squares. Determines the maximum value of $n$ for which such a decomposition is possible. For this value of $n$, determine all possible sets ${A_1,... ,A_n}$, where $A_i$ is the number of rectangle $i$ in squares, for which a decomposition of the board under the conditions intended actions is possible.

Let $n$ be a positive integer. Find the smallest positive integer $k$ such that for any set $S$ of $n$ points in the interior of the unit square, there exists a set of $k$ rectangles such that the following hold: [list=disc] [*]The sides of each rectangle are parallel to the sides of the unit square. [*]Each point in $S$ is [i]not[/i] in the interior of any rectangle. [*]Each point in the interior of the unit square but [i]not[/i] in $S$ is in the interior of at least one of the $k$ rectangles [/list] (The interior of a polygon does not contain its boundary.) [i]Holden Mui[/i]

A rectangular sheet of paper is folded so that one corner lies on top of the corner diagonally opposite. The resulting shape is a pentagon whose area is $20\%$ one-sheet thick, and $80\%$ two-sheets-thick. Determine the ratio of the two sides of the original sheet of paper.

Several pupils wrote a solution of a math problem on the blackboard on the break. When the teacher came in, a pupil was just clearing the blackboard, so the teacher could only observe that there was a rectangle with the sides of integer lenghts and a diagonal of lenght $ 2002$. Then the teacher pointed out that there was a computation error in pupils' solution. Why did he conclude that?

Is it possible to locate in a rectangle of $5$ cm by $ 8$ cm, $51$ circles of diameter $ 1$ cm, so that they don't overlap? Could it be possible for more than $40$ circles ?

Given a rectangle $ABCD$ with $AB> BC$. On the side $CD$, take a point $L$ such that $BL$ and $AC$ are perpendicular. Let $K$ be the intersection point of segments $BL$ and $AC$. It is known that segments $AL$. and $DK$ are perpendicular. Find $\angle ACB.$

Let $ABCD$ be a rectangle with center $O$ such that $\angle DAC = 60^o$. Bisector of $\angle DAC$ cuts a $DC$ at $S$, $OS$ and $AD$ intersect at $L$, $BL$ and $AC$ intersect at $M$. Prove that $SM \parallel CL$.

All $ 2n\ge 2 $ squares of a $ 2\times n $ rectangle are colored with three colors. We say that a color has a [i]cut[/i] if there is some column (from all $ n $) that has both squares colored with it. Determine: [b]a)[/b] the number of colorings that have no cuts. [b]b)[/b] the number of colorings that have a single cut.

A point $(x,y)$ in the first quadrant lies on a line with intercepts $(a,0)$ and $(0,b)$, with $a,b > 0$. Rectangle $M$ has vertices $(0,0)$, $(x,0)$, $(x,y)$, and $(0,y)$, while rectangle $N$ has vertices $(x,y)$, $(x,b)$, $(a,b)$, and $(a,y)$. What is the ratio of the area of $M$ to that of $N$? [i]Proposed by Eugene Chen[/i]

A square is divided into $5$ rectangles in such a way that its $4$ vertices belong to $4$ of the rectangles , whose areas are equal , and the fifth rectangle has no points in common with the side of the square (see diagram) . Prove that the fifth rectangle is a square. [img]https://3.bp.blogspot.com/-TQc1v_NODek/XWHHgmONboI/AAAAAAAAKi4/XES55OJS5jY9QpNmoURp4y80EkanNzmMwCK4BGAYYCw/s1600/TOT%2B1985%2BSpring%2BJ4.png[/img]

Let $p$ be a prime number and a table of size $(p^2+ p+1)\times (p^2+p + 1)$ which is divided into unit cells. The way to color some cells of this table is called nice if there are no four colored cells that form a rectangle (the sides of rectangle are parallel to the sides of given table). 1. Let $k$ be the number of colored cells in some nice coloring way. Prove that $k \le (p + 1)(p^2 + p + 1)$. Denote this number as $k_{max}$. 2. Prove that all ordered tuples $(a, b, c)$ with $0 \le a, b, c < p$ and $a + b + c > 0$ can be partitioned into $p^2 + p + 1$ sets $S_1, S_2, .. . S_{p^2+p+1}$ such that two tuples $(a_1, b_1, c_1)$ and $(a_2, b_2, c_2)$ belong to the same set if and only if $a_1 \equiv ka_2, b_1 \equiv kb_2, c_1 \equiv kc_2$ (mod $p$) for some $k \in \{1,2, 3, ... , p - 1\}$. 3. For $1 \le i, j \le p^2+p+1$, if there exist $(a_1, b_1, c_1) \in S_i$ and $(a_2, b_2, c_2) \in S_j$ such that $a_1a_2 + b_1b_2 + c_1c_2 \equiv 0$ (mod $p$), we color the cell $(i, j)$ of the given table. Prove that this coloring way is nice with $k_{max}$ colored cells

We are given a positive integer $ r$ and a rectangular board $ ABCD$ with dimensions $ AB \equal{} 20, BC \equal{} 12$. The rectangle is divided into a grid of $ 20 \times 12$ unit squares. The following moves are permitted on the board: one can move from one square to another only if the distance between the centers of the two squares is $ \sqrt {r}$. The task is to find a sequence of moves leading from the square with $ A$ as a vertex to the square with $ B$ as a vertex. (a) Show that the task cannot be done if $ r$ is divisible by 2 or 3. (b) Prove that the task is possible when $ r \equal{} 73$. (c) Can the task be done when $ r \equal{} 97$?

A square is cut into three rectangles along two lines parallel to a side, as shown. If the perimeter of each of the three rectangles is 24, then the area of the original square is [asy] draw((0,0)--(9,0)--(9,9)--(0,9)--cycle); draw((3,0)--(3,9), dashed); draw((6,0)--(6,9), dashed);[/asy] $\text{(A)} \ 24 \qquad \text{(B)} \ 36 \qquad \text{(C)} \ 64 \qquad \text{(D)} \ 81 \qquad \text{(E)} \ 96$

Unit square $ABCD$ is divided into four rectangles by $EF$ and $GH$, with $BF = \frac14$. $EF$ is parallel to $AB$ and $GH$ parallel to $BC$. $EF$ and $GH$ meet at point $P$. Suppose $BF + DH = FH$, calculate the nearest integer to the degree of $\angle FAH$. [asy] size(100); defaultpen(linewidth(0.7)+fontsize(10)); pair D2(pair P) { dot(P,linewidth(3)); return P; } // NOTE: I've tampered with the angles to make the diagram not-to-scale. The correct numbers should be 72 instead of 76, and 45 instead of 55. pair A=(0,1), B=(0,0), C=(1,0), D=(1,1), F=intersectionpoints(A--A+2*dir(-76),B--C)[0], H=intersectionpoints(A--A+2*dir(-76+55),D--C)[0], E=F+(0,1), G=H-(1,0), P=intersectionpoints(E--F,G--H)[0]; draw(A--B--C--D--cycle); draw(F--A--H); draw(E--F); draw(G--H); label("$A$",D2(A),NW); label("$B$",D2(B),SW); label("$C$",D2(C),SE); label("$D$",D2(D),NE); label("$E$",D2(E),plain.N); label("$F$",D2(F),S); label("$G$",D2(G),W); label("$H$",D2(H),plain.E); label("$P$",D2(P),SE); [/asy]

Six small circles of radius $1$ are drawn so that they are all tangent to a larger circle, and two of them are tangent to sides $BC$ and $AD$ of a rectangle $ABCD$ at their midpoints $K$ and $L$. Each of the remaining four small circles is tangent to two sides of the rectangle. The large circle is tangent to sides $AB$ and $CD$ of the rectangle and cuts the other two sides. Find the radius of the large circle. [img]https://cdn.artofproblemsolving.com/attachments/b/4/a134da78d709fe7162c48d6b5c40bd1016c355.png[/img]

Prove that the bisectors of the angles of a rectangle, extended to their mutual intersection, form a square.

Let $S$ be a planar region. A $\emph{domino-tiling}$ of $S$ is a partition of $S$ into $1\times2$ rectangles. (For example, a $2\times3$ rectangle has exactly $3$ domino-tilings, as shown below.) [asy] import graph; size(7cm); pen dps = linewidth(0.7); defaultpen(dps); draw((0,0)--(3,0)--(3,2)--(0,2)--cycle, linewidth(2)); draw((4,0)--(4,2)--(7,2)--(7,0)--cycle, linewidth(2)); draw((8,0)--(8,2)--(11,2)--(11,0)--cycle, linewidth(2)); draw((1,0)--(1,2)); draw((2,1)--(3,1)); draw((0,1)--(2,1), linewidth(2)); draw((2,0)--(2,2), linewidth(2)); draw((4,1)--(7,1)); draw((5,0)--(5,2), linewidth(2)); draw((6,0)--(6,2), linewidth(2)); draw((8,1)--(9,1)); draw((10,0)--(10,2)); draw((9,0)--(9,2), linewidth(2)); draw((9,1)--(11,1), linewidth(2)); [/asy] The rectangles in the partition of $S$ are called $\emph{dominoes}$. (a) For any given positive integer $n$, find a region $S_n$ with area at most $2n$ that has exactly $n$ domino-tilings. (b) Find a region $T$ with area less than $50000$ that has exactly $100002013$ domino-tilings.

Point $K$ is marked on the diagonal $AC$ in rectangle $ABCD$ so that $CK = BC$. On the side $BC$, point $M$ is marked so that $KM = CM$. Prove that $AK + BM = CM$.

Let $ n$ be a positive integer. Consider a rectangle $ (90n\plus{}1)\times(90n\plus{}5)$ consisting of unit squares. Let $ S$ be the set of the vertices of these squares. Prove that the number of distinct lines passing through at least two points of $ S$ is divisible by $ 4$.

How many ways are there to remove an $11\times11$ square from a $2011\times2011$ square so that the remaining part can be tiled with dominoes ($1\times 2$ rectangles)?

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

Let $ABCD$ be a square, and $C$ the circle whose diameter is $AB.$ Let $Q$ be an arbitrary point on the segment $CD.$ We know that $QA$ meets $C$ on $E$ and $QB$ meets it on $F.$ Also $CF$ and $DE$ intersect in $M.$ show that $M$ belongs to $C.$