Given rectangle $ R_1$ with one side $ 2$ inches and area $ 12$ square inches. Rectangle $ R_2$ with diagonal $ 15$ inches is similar to $ R_1.$ Expressed in square inches the area of $ R_2$ is: $ \textbf{(A)}\ \frac92 \qquad \textbf{(B)}\ 36 \qquad \textbf{(C)}\ \frac{135}{2} \qquad \textbf{(D)}\ 9 \sqrt{10} \qquad \textbf{(E)}\ \frac{27 \sqrt{10}}{4}$

In a $5 \times 5$ grid of squares, how many nonintersecting pairs rectangles of rectangles are there? (Note sharing a vertex or edge still means the rectangles intersect.)

Two congruent squares, $ABCD$ and $PQRS$, have side length $15$. They overlap to form the $15$ by $25$ rectangle $AQRD$ shown. What percent of the area of rectangle $AQRD$ is shaded? [asy] filldraw((0,0)--(25,0)--(25,15)--(0,15)--cycle,white,black); label("D",(0,0),S); label("R",(25,0),S); label("Q",(25,15),N); label("A",(0,15),N); filldraw((10,0)--(15,0)--(15,15)--(10,15)--cycle,mediumgrey,black); label("S",(10,0),S); label("C",(15,0),S); label("B",(15,15),N); label("P",(10,15),N); [/asy] $\textbf{(A)}\ 15\qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 25$

Into each box of a $ 2012 \times 2012 $ square grid, a real number greater than or equal to $ 0 $ and less than or equal to $ 1 $ is inserted. Consider splitting the grid into $2$ non-empty rectangles consisting of boxes of the grid by drawing a line parallel either to the horizontal or the vertical side of the grid. Suppose that for at least one of the resulting rectangles the sum of the numbers in the boxes within the rectangle is less than or equal to $ 1 $, no matter how the grid is split into $2$ such rectangles. Determine the maximum possible value for the sum of all the $ 2012 \times 2012 $ numbers inserted into the boxes.

Let $ ABC$ be an acute-angled triangle such that there exist points $ D,E,F$ on side $ BC,CA,AB$, respectively such that the inradii of triangle $ AEF,BDF,CDE$ are all equal to $ r_0$. If the inradii of triangle $ DEF$ and $ ABC$ are $ r$ and $ R$, respectively, prove that \[ r\plus{}r_0\equal{}R.\] [i]Soewono, Bandung[/i]

Tracey baked a square cake whose surface is dissected in a $ 10 \times 10$ grid. In some of the fields she wants to put a strawberry such that for each four fields that compose a rectangle whose edges run in parallel to the edges of the cake boundary there is at least one strawberry. What is the minimum number of required strawberries?

Given a rectangle $\mathcal{R}$ of area $100000 $, Pancho must completely cover the rectangle $\mathcal{R}$ with a finite number of rectangles with sides parallel to the sides of $\mathcal{R}$ . Next, Martín colors some rectangles of Pancho's cover red so that no two red rectangles have interior points in common. If the red area is greater than $0.00001$, Martin wins. Otherwise, Pancho wins. Prove that Pancho can cover to ensure victory,

A $10 \times 10$ table consists of $100$ unit cells. A [i]block[/i] is a $2 \times 2$ square consisting of $4$ unit cells of the table. A set $C$ of $n$ blocks covers the table (i.e. each cell of the table is covered by some block of $C$ ) but no $n -1$ blocks of $C$ cover the table. Find the largest possible value of $n$.

In the figure, $ABCD$ is a square of side length 1. The rectangles $JKHG$ and $EBCF$ are congruent. What is $BE$? [asy] unitsize(150); pair A,B,C,D,E,F,G,H,J,K; A=(1,0); B=(0,0); C=(0,1); D=(1,1); draw(A--B--C--D--A); E=(2-sqrt(3),0); F=(2-sqrt(3),1); draw(E--F); G=(1,sqrt(3)/2); H=(2.5-sqrt(3),1); K=(2-sqrt(3),1-sqrt(3)/2); J=(0.5,0); draw(G--H--K--J--G); label("$A$",A,SE); label("$B$",B,SW); label("$C$",C,NW); label("$D$",D,NE); label("$E$",E,S); label("$F$",F,N); label("$G$",G,E); label("$H$",H,N); label("$K$",K,W); label("$J$",J,S); [/asy] $ \textbf{(A) }\dfrac{1}{2}(\sqrt{6}-2)\qquad\textbf{(B) }\dfrac{1}{4}\qquad\textbf{(C) }2-\sqrt{3}\qquad\textbf{(D) }\dfrac{\sqrt{3}}{6}\qquad\textbf{(E) }1-\dfrac{\sqrt{2}}{2} $

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

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.

Let $ABCD$ be a rectangle with $AB=a >CD =b$. Given circles $(K_1,r_1) , (K_2,r_2)$ with $r_1<r_2$ tangent externally at point $K$ and also tangent to the sides of the rectangle, circle $(K_1,r_1)$ tangent to both $AD$ and $AB$, circle $(K_2,r_2)$ tangent to both $AB$ and $BC$. Let also the internal common tangent of those circles pass through point $D$. (i) Express sidelengths $a$ and $b$ in terms of $r_1$ and $r_2$. (ii) Calculate the ratios $\frac{r_1}{r_2}$ and $\frac{a}{b}$ . (iii) Find the length of $DK$ in terms of $r_1$ and $r_2$.

Given a convex figure in the Cartesian plane that is symmetric with respect of both axis, we construct a rectangle $A$ inside it with maximum area (over all posible rectangles). Then we enlarge it with center in the center of the rectangle and ratio lamda such that is covers the convex figure. Find the smallest lamda such that it works for all convex figures.

Rectangle $p*q,$ where $p,q$ are relatively coprime positive integers with $p <q$ is divided into squares $1*1$.Diagonal which goes from lowest left vertice to highest right cuts triangles from some squares.Find sum of perimeters of all such triangles.

Circle $\omega_1$ with radius $6$ centered at point $A$ is internally tangent at point $B$ to circle $\omega_2$ with radius $15$. Points $C$ and $D$ lie on $\omega_2$ such that $\overline{BC}$ is a diameter of $\omega_2$ and $\overline{BC} \perp \overline{AD}$. The rectangle $EFGH$ is inscribed in $\omega_1$ such that $\overline{EF} \perp \overline{BC}$, $C$ is closer to $\overline{GH}$ than to $\overline{EF}$, and $D$ is closer to $\overline{FG}$ than to $\overline{EH}$, as shown. Triangles $\triangle DGF$ and $\triangle CHG$ have equal areas. The area of rectangle $EFGH$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] size(5cm); defaultpen(fontsize(10pt)); pair A = (9, 0), B = (15, 0), C = (-15, 0), D = (9, 12), E = (9+12/sqrt(5), -6/sqrt(5)), F = (9+12/sqrt(5), 6/sqrt(5)), G = (9-12/sqrt(5), 6/sqrt(5)), H = (9-12/sqrt(5), -6/sqrt(5)); filldraw(G--H--C--cycle, lightgray); filldraw(D--G--F--cycle, lightgray); draw(B--C); draw(A--D); draw(E--F--G--H--cycle); draw(circle(origin, 15)); draw(circle(A, 6)); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); dot(G); dot(H); label("$A$", A, (.8, -.8)); label("$B$", B, (.8, 0)); label("$C$", C, (-.8, 0)); label("$D$", D, (.4, .8)); label("$E$", E, (.8, -.8)); label("$F$", F, (.8, .8)); label("$G$", G, (-.8, .8)); label("$H$", H, (-.8, -.8)); label("$\omega_1$", (9, -5)); label("$\omega_2$", (-1, -13.5)); [/asy]

Let $ O$ be the circumcenter of an acute triangle $ ABC$ and let $ k$ be the circle with center $ P$ that is tangent to $ O$ at $ A$ and tangent to side $ BC$ at $ D$. Circle $ k$ meets $ AB$ and $ AC$ again at $ E$ and $ F$ respectively. The lines $ OP$ and $ EP$ meet $ k$ again at $ I$ and $ G$. Lines $ BO$ and $ IG$ intersect at $ H$. Prove that $ \frac{{DF}^2}{AF}\equal{}GH$.

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.

Let $ R$ be a rectangle that is the union of a finite number of rectangles $ R_i,$ $ 1 \leq i \leq n,$ satisfying the following conditions: [b](i)[/b] The sides of every rectangle $ R_i$ are parallel to the sides of $ R.$ [b](ii)[/b] The interiors of any two different rectangles $ R_i$ are disjoint. [b](iii)[/b] Each rectangle $ R_i$ has at least one side of integral length. Prove that $ R$ has at least one side of integral length. [i]Variant:[/i] Same problem but with rectangular parallelepipeds having at least one integral side.

A $9\times 7$ rectangle is tiled with tiles of the two types: L-shaped tiles composed by three unit squares (can be rotated repeatedly with $90^\circ$) and square tiles composed by four unit squares. Let $n\ge 0$ be the number of the $2 \times 2 $ tiles which can be used in such a tiling. Find all the values of $n$.

Let $n \ge 3$ be an integer, and consider a $n \times n$-board, divided into $n^2$ unit squares. For all $m \ge 1$, arbitrarily many $1\times m$-rectangles (type I) and arbitrarily many $m\times 1$-rectangles (type II) are available. We cover the board with $N$ such rectangles, without overlaps, and such that every rectangle lies entirely inside the board. We require that the number of type I rectangles used is equal to the number of type II rectangles used.(Note that a $1 \times 1$-rectangle has both types.) What is the minimal value of $N$ for which this is possible?

Triangle $ABC$ has orthocentre $H$. The feet of the perpendiculars from $H$ to the internal and external bisectors of $\hat{A}$ are $P$ and $Q$ respectively. Prove that $P$ is on the line that passes through $Q$ and the midpoint of $BC$. (Note: The ortohcentre of a triangle is the point where the three altitudes intersect.)

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]

Given a natural number $n$, calculate the number of rectangles in the plane, the coordinates of whose vertices are integers in the range $0$ to $n$, and whose sides are parallel to the axes.

A rectangle can be divided into $n$ equal squares. The same rectangle can also be divided into $n+76$ equal squares. Find $n$.