A rectangular pool table has a hole at each of three of its corners. The lengths of sides of the table are the real numbers $a$ and $b$. A billiard ball is shot from the fourth corner along its angle bisector. The ball falls in one of the holes. What should the relation between $a$ and $b$ be for this to happen?

A square is divided by horizontal and vertical lines that form $n^2$ squares each with side $1$. What is the greatest possible value of $n$ such that it is possible to select $n$ squares such that any rectangle with area $n$ formed by the horizontal and vertical lines would contain at least one of the selected $n$ squares.

I'd really appreciate help on this. (a) Given a set $X$ of points in the plane, let $f_{X}(n)$ be the largest possible area of a polygon with at most $n$ vertices, all of which are points of $X$. Prove that if $m, n$ are integers with $m \geq n > 2$ then $f_{X}(m) + f_{X}(n) \geq f_{X}(m + 1) + f_{X}(n - 1)$. (b) Let $P_0$ be a $1 \times 2$ rectangle (including its interior) and inductively define the polygon $P_i$ to be the result of folding $P_{i-1}$ over some line that cuts $P_{i-1}$ into two connected parts. The diameter of a polygon $P_i$ is the maximum distance between two points of $P_i$. Determine the smallest possible diameter of $P_{2013}$.

Let us consider all rectangles with sides of length $a,b$ both of which are whole numbers. Do more of these rectangles have perimeter $2000$ or perimeter $2002$?

Two $5\times1$ rectangles have 2 vertices in common as on the picture. (a) Determine the area of overlap (b) Determine the length of the segment between the other 2 points of intersection, $A$ and $B$. [img]https://cdn.artofproblemsolving.com/attachments/9/0/4f1721c7ccdecdfe4d9cc05a17a553a0e9f670.png[/img]

Two congruent rectangles are located as shown in the figure. Find the area of the shaded part. [img]https://cdn.artofproblemsolving.com/attachments/2/e/10b164535ab5b3a3b98ce1a0b84892cd11d76f.png[/img]

This is the one with the 8 circles? I made each circle into the square in which the circle is inscribed, then calculated it with that. It got the right answer but I don't think that my method is truly valid...

A rectangular sheet of paper (white on one side and gray on the other) was folded three times, as shown in the figure: Rectangle $1$, which was white after the first fold, has $20$ cm more perimeter than rectangle $2$, which was white after the second fold, and this in turn has $16$ cm more perimeter than rectangle $3$, which was white after the third fold. Determine the area of the sheet. [img]https://cdn.artofproblemsolving.com/attachments/d/f/8e363b40654ad0d8e100eac38319ee3784a7a7.png[/img]

Rectangle $ ABCD$, pictured below, shares $50\%$ of its area with square $ EFGH$. Square $ EFGH$ shares $20\%$ of its area with rectangle $ ABCD$. What is $ \frac{AB}{AD}$? [asy]unitsize(5mm); defaultpen(linewidth(0.8pt)+fontsize(10pt)); pair A=(0,3), B=(8,3), C=(8,2), D=(0,2), Ep=(0,4), F=(4,4), G=(4,0), H=(0,0); fill(shift(0,2)*xscale(4)*unitsquare,grey); draw(Ep--F--G--H--cycle); draw(A--B--C--D); label("$A$",A,W); label("$B$",B,E); label("$C$",C,E); label("$D$",D,W); label("$E$",Ep,NW); label("$F$",F,NE); label("$G$",G,SE); label("$H$",H,SW);[/asy]$ \textbf{(A)}\ 4\qquad \textbf{(B)}\ 5\qquad \textbf{(C)}\ 6\qquad \textbf{(D)}\ 8\qquad \textbf{(E)}\ 10$

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

Is it possible to cut a rectangle $2001\times2003$ into pieces of the form [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvNS82L2RjZTZjNzc0M2YxMzM1ZDIzZTY2Zjc2NGJlMWJlMWUwMmU2ZWRlLnBuZw==&rn=U2NyZWVuIFNob3QgMjAyMS0wNS0xMyBhdCAzLjQ2LjQ2IFBNLnBuZw==[/img] each consisting of three unit squares?

On a $49\times 69$ rectangle formed by a grid of lattice squares, all $50\cdot 70$ lattice points are colored blue. Two persons play the following game: In each step, a player colors two blue points red, and draws a segment between these two points. (Different segments can intersect in their interior.) Segments are drawn this way until all formerly blue points are colored red. At this moment, the first player directs all segments drawn - i. e., he takes every segment AB, and replaces it either by the vector $\overrightarrow{AB}$, or by the vector $\overrightarrow{BA}$. If the first player succeeds to direct all the segments drawn in such a way that the sum of the resulting vectors is $\overrightarrow{0}$, then he wins; else, the second player wins. Which player has a winning strategy?

Consider a rhombus $ABCD$ with center $O$. A point $P$ is given inside the rhombus, but not situated on the diagonals. Let $M,N,Q,R$ be the projections of $P$ on the sides $(AB), (BC), (CD), (DA)$, respectively. The perpendicular bisectors of the segments $MN$ and $RQ$ meet at $S$ and the perpendicular bisectors of the segments $NQ$ and $MR$ meet at $T$. Prove that $P, S, T$ and $O$ are the vertices of a rectangle.

A large square is divided into a small square surrounded by four congruent rectangles as shown. The perimeter of each of the congruent rectangles is 14. What is the area of the large square? [asy]unitsize(3mm); defaultpen(linewidth(.8pt)); draw((0,0)--(7,0)--(7,7)--(0,7)--cycle); draw((1,0)--(1,6)); draw((7,1)--(1,1)); draw((6,7)--(6,1)); draw((0,6)--(6,6));[/asy]$ \textbf{(A)}\ \ 49 \qquad \textbf{(B)}\ \ 64 \qquad \textbf{(C)}\ \ 100 \qquad \textbf{(D)}\ \ 121 \qquad \textbf{(E)}\ \ 196$

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

Consider on the coordinate plane all rectangles whose (i) vertices have integer coordinates; (ii) edges are parallel to coordinate axes; (iii) area is $2^k$, where $k = 0,1,2....$ Is it possible to color all points with integer coordinates in two colors so that no such rectangle has all its vertices of the same color?

The incircle $\mathcal{C}_1$ of triangle $ABC$ touches the sides $AB$ and $AC$ at the points $D$ and $E$, respectively. The incircle $\mathcal{C}_2$ of the triangle $ADE$ touches the sides $AB$ and $AC$ at the points $P$ and $Q$, and intersects the circle $\mathcal{C}_1$ at the points $M$ and $n$. Prove that (a) the center of the circle $\mathcal{C}_2$ lies on the circle $\mathcal{C}_1$. (b) the four points $M,N,P,Q$ in appropriate order form a rectangle if and only if twice the radius of $\mathcal{C}_1$ is three times the radius of $\mathcal{C}_2$.

Inside the $7\times8$ rectangle below, one point is chosen a distance $\sqrt2$ from the left side and a distance $\sqrt7$ from the bottom side. The line segments from that point to the four vertices of the rectangle are drawn. Find the area of the shaded region. [asy] import graph; size(4cm); pair A = (0,0); pair B = (9,0); pair C = (9,7); pair D = (0,7); pair P = (1.5,3); draw(A--B--C--D--cycle,linewidth(1.5)); filldraw(A--B--P--cycle,rgb(.76,.76,.76),linewidth(1.5)); filldraw(C--D--P--cycle,rgb(.76,.76,.76),linewidth(1.5)); [/asy]

$ABCD$ is a cyclic quadrilateral with $AC \perp BD$; $AC$ meets $BD$ at $E$. Prove that \[ EA^2 + EB^2 + EC^2 + ED^2 = 4 R^2 \] where $R$ is the radius of the circumscribing circle.

A dart board is a regular octagon divided into regions as shown. Suppose that a dart thrown at the board is equally likely to land anywhere on the board. What is probability that the dart lands within the center square? [asy] unitsize(10mm); defaultpen(linewidth(.8pt)+fontsize(10pt)); dotfactor=4; pair A=(0,1), B=(1,0), C=(1+sqrt(2),0), D=(2+sqrt(2),1), E=(2+sqrt(2),1+sqrt(2)), F=(1+sqrt(2),2+sqrt(2)), G=(1,2+sqrt(2)), H=(0,1+sqrt(2)); draw(A--B--C--D--E--F--G--H--cycle); draw(A--D); draw(B--G); draw(C--F); draw(E--H); [/asy] $ \textbf{(A)}\ \frac{\sqrt{2} - 1}{2} \qquad\textbf{(B)}\ \frac{1}{4} \qquad\textbf{(C)}\ \frac{2 - \sqrt{2}}{2} \qquad\textbf{(D)}\ \frac{\sqrt{2}}{4} \qquad\textbf{(E)}\ 2 - \sqrt{2}$

Consider decompositions of an $8\times 8$ chessboard into $p$ non-overlapping rectangles subject to the following conditions: (i) Each rectangle has as many white squares as black squares. (ii) If $a_i$ is the number of white squares in the $i$-th rectangle, then $a_1<a_2<\ldots <a_p$. Find the maximum value of $p$ for which such a decomposition is possible. For this value of $p$, determine all possible sequences $a_1,a_2,\ldots ,a_p$.

In the arrow-shaped polygon [see figure], the angles at vertices $A$, $C$, $D$, $E$ and $F$ are right angles, $BC = FG = 5$, $CD = FE = 20$, $DE = 10$, and $AB = AG$. The area of the polygon is closest to [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=origin, B=(10,10), C=(10,5), D=(30,5), E=(30,-5), F=(10,-5), G=(10,-10); draw(A--B--C--D--E--F--G--A); label("$A$", A, W); label("$B$", B, NE); label("$C$", C, S); label("$D$", D, NE); label("$E$", E, SE); label("$F$", F, N); label("$G$", G, SE); label("$5$", (11,7.5)); label("$5$", (11,-7.5)); label("$20$", (C+D)/2, N); label("$20$", (F+E)/2, S); label("$10$", (31,0)); [/asy] $ \textbf{(A)}\ 288\qquad\textbf{(B)}\ 291\qquad\textbf{(C)}\ 294\qquad\textbf{(D)}\ 297\qquad\textbf{(E)}\ 300 $

Inside a rectangle is inscribed a quadrilateral, which has a vertex on each side of the rectangle. Prove that the perimeter of the inscribed quadrilateral is not smaller than double the length of a diagonal of the rectangle. (V. V . Proizvolov , Moscow)

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?

Let $N_{14}$ be the answer to problem 14. Rectangle $ABCD$ has area $\sqrt{2N_{14}}$. Points $E$, $F$, $G$, and $H$ lie on the rays $\overrightarrow{AB}$, $\overrightarrow{BC}$, $\overrightarrow{CD}$, and $\overrightarrow{DA}$, respectively, such that $EFGH$ is a rectangle with area $2\sqrt{2N_{14}}$ that contains all of $ABCD$ in its interior. If \[ \tan\angle AEH = \tan\angle BFE = \tan\angle CGF = \tan\angle DHG = \sqrt{\frac{1}{48}}, \] then $EG=\tfrac{m\sqrt{n}}{p}$, where $m$, $n$, and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime. Compute $m + n + p$.