Upon cutting a certain rectangle in half, you obtain two rectangles that are scaled down versions of the original. What is the ratio of the longer side length to the shorter side length?

Does a convex heptagon exist which can be divided into 2011 equal triangles?

An $8\times 8$ chessboard is to be tiled (i.e., completely covered without overlapping) with pieces of the following shapes: [asy] unitsize(.6cm); draw(unitsquare,linewidth(1)); draw(shift(1,0)*unitsquare,linewidth(1)); draw(shift(2,0)*unitsquare,linewidth(1)); label("\footnotesize $1\times 3$ rectangle",(1.5,0),S); draw(shift(8,1)*unitsquare,linewidth(1)); draw(shift(9,1)*unitsquare,linewidth(1)); draw(shift(10,1)*unitsquare,linewidth(1)); draw(shift(9,0)*unitsquare,linewidth(1)); label("\footnotesize T-shaped tetromino",(9.5,0),S); [/asy] The $1\times 3$ rectangle covers exactly three squares of the chessboard, and the T-shaped tetromino covers exactly four squares of the chessboard. [list](a) What is the maximum number of pieces that can be used? (b) How many ways are there to tile the chessboard using this maximum number of pieces?[/list]

In trapezoid $ ABCD$ we have $ \overline{AB}$ parallel to $ \overline{DC}$, $ E$ as the midpoint of $ \overline{BC}$, and $ F$ as the midpoint of $ \overline{DA}$. The area of $ ABEF$ is twice the area of $ FECD$. What is $ AB/DC$? $ \textbf{(A)}\ 2\qquad \textbf{(B)}\ 3\qquad \textbf{(C)}\ 5\qquad \textbf{(D)}\ 6\qquad \textbf{(E)}\ 8$

Divide a $ 2\times 4 $ rectangle into $ 8 $ unit squares to obtain a set of $ 15 $ vertices denoted by $ \mathcal{M} . $ Find the points $ A\in\mathcal{M} $ that have the property that the set $ \mathcal{M}\setminus \{ A\} $ can form $ 7 $ pairs $ \left( A_1,B_1\right) ,\left( A_2,B_2\right) ,\ldots ,\left( A_7,B_7\right)\in\mathcal{M}\times\mathcal{M} $ such that $$ \overrightarrow{A_1B_1} +\overrightarrow{A_2B_2} +\cdots +\overrightarrow{A_7B_7} =\overrightarrow{O} . $$

Let $ABCD$ be a quadrilateral inscribed in the circle $O$. For a point $E\in O$, its projections $K,L,M,N$ on the lines $DA,AB,BC,CD$, respectively, are considered. Prove that if $N$ is the orthocentre of the triangle $KLM$ for some point $E$, different from $A,B,C,D$, then this holds for every point $E$ of the circle.

Pawns are arranged on an $8 \times 8$ chessboard such that: Each $2 \times 1$ or $1 \times 2$ rectangle has at least $1$ pawn; Each $7 \times 1$ or $1 \times 7$ rectangle has at least $1$ pair of adjacent pawns. What is the minimum number of pawns in such an arrangement?

Every point in the plane is coloured one of seven distinct colours. Is there an inscribed trapezoid whose vertices are all of the same colour?

Cells of a $n*n$ square are filled with positive integers in the way that in the intersection of the $i-$th column and $j-$th row, the number $i+j$ is written. In every step, we can choose two non-intersecting equal rectangles with one dimension equal to $n$ and swap all the numbers inside these two rectangles with one another. ( without reflection or rotation ) Find the minimum number of moves one should do to reach the position where the intersection of the $i-$th column and $j-$row is written $2n+2-i-j$.

The lateral sides of a box with base $a\times b$ and height $c$ (where $a$; $b$;$ c$ are natural numbers) are completely covered without overlap by rectangles whose edges are parallel to the edges of the box, each containing an even number of unit squares. (Rectangles may cross the lateral edges of the box.) Prove that if $c$ is odd, then the number of possible coverings is even. [i]D. Karpov, C. Gukshin, D. Fon-der-Flaas[/i]

Let $ABCD$ be a rectangle and $E$ the reflection of $A$ with respect to the diagonal $BD$. If $EB = EC$, what is the ratio $\frac{AD}{AB}$ ?

Let $ABCD$ be a fixed convex quadrilateral. Say a point $K$ is [i]pastanaga[/i] if there's a rectangle $PQRS$ centered at $K$ such that $A\in PQ, B\in QR, C\in RS, D\in SP$. Prove there exists a circle $\omega$ depending only on $ABCD$ that contains all pastanaga points.

The length of rectangle R is $ 10$ percent more than the side of square S. The width of the rectangle is $ 10$ percent less than the side of the square. The ratio of the areas, R:S, is: $ \textbf{(A)}\ 99: 100 \qquad \textbf{(B)}\ 101: 100 \qquad \textbf{(C)}\ 1: 1 \qquad \textbf{(D)}\ 199: 200 \qquad \textbf{(E)}\ 201: 200$

In the plane we consider rectangles whose sides are parallel to the coordinate axes and have positive length. Such a rectangle will be called a [i]box[/i]. Two boxes [i]intersect[/i] if they have a common point in their interior or on their boundary. Find the largest $ n$ for which there exist $ n$ boxes $ B_1$, $ \ldots$, $ B_n$ such that $ B_i$ and $ B_j$ intersect if and only if $ i\not\equiv j\pm 1\pmod n$. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

Prove that there exists a positive real number $N$ such that for arbitrary real numbers $a,b>N$ it is possible to cover the perimeter of a rectangle with side lengths $a$ and $b$ using non-overlapping unit disks (the unit disks can be tangent to each other). [i]Submitted by Benedek Váli, Budapest[/i]

In how many ways can we place the numbers from $1$ to $100$ in a $2\times 50$ rectangle (divided into $100$ unit squares) so that any two consecutive numbers are always placed in squares with a common side?

Is it possible to divide a $6 \times 6$ chessboard into $18$ rectangles, each either $1 \times 2$ or $2 \times 1$, and to draw exactly one diagonal on each rectangle such that no two of these diagonals have a common endpoint? (A Shapovalov)

Let $ ABCD $ be a rectangle that has $ M $ on its $ BD $ diagonal. If $ N,P $ are the projections of $ M $ on $ AB, $ respectively, $ AD, $ what's the locus of the intersection between $ CP $ and $ DN? $

Let $ABCD$ be a rectangle. Two perpendicular lines pass through point $B$. One of them meets segment $AD$ at point $K$, and the second one meets the extension of side $CD$ at point $L$. Let $F$ be the common point of $KL$ and $AC$. Prove that $BF\perp KL$.

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?

The midpoints of the four sides of a rectangle are $(-3, 0), (2, 0), (5, 4)$ and $(0, 4)$. What is the area of the rectangle? $\textbf{(A)} ~20\qquad\textbf{(B)} ~25\qquad\textbf{(C)} ~40\qquad\textbf{(D)} ~50\qquad\textbf{(E)} ~80\qquad$

Let points $A=(0,0,0)$, $B=(1,0,0)$, $C=(0,2,0)$, and $D=(0,0,3)$. Points $E,F,G$, and $H$ are midpoints of line segments $\overline{BD},\overline{AB},\overline{AC}$, and $\overline{DC}$ respectively. What is the area of $EFGH$? $ \textbf{(A)}\ \sqrt2 \qquad\textbf{(B)}\ \frac{2\sqrt5}{3} \qquad\textbf{(C)}\ \frac{3\sqrt5}{4} \qquad\textbf{(D)}\ \sqrt3 \qquad\textbf{(E)}\ \frac{2\sqrt7}{3} $

Circles with centers $ O$ and $ P$ have radii 2 and 4, respectively, and are externally tangent. Points $ A$ and $ B$ are on the circle centered at $ O$, and points $ C$ and $ D$ are on the circle centered at $ P$, such that $ \overline{AD}$ and $ \overline{BC}$ are common external tangents to the circles. What is the area of hexagon $ AOBCPD$? [asy] unitsize(0.4 cm); defaultpen(linewidth(0.7) + fontsize(11)); pair A, B, C, D; pair[] O; O[1] = (6,0); O[2] = (12,0); A = (32/6,8*sqrt(2)/6); B = (32/6,-8*sqrt(2)/6); C = 2*B; D = 2*A; draw(Circle(O[1],2)); draw(Circle(O[2],4)); draw((0.7*A)--(1.2*D)); draw((0.7*B)--(1.2*C)); draw(O[1]--O[2]); draw(A--O[1]); draw(B--O[1]); draw(C--O[2]); draw(D--O[2]); label("$A$", A, NW); label("$B$", B, SW); label("$C$", C, SW); label("$D$", D, NW); dot("$O$", O[1], SE); dot("$P$", O[2], SE); label("$2$", (A + O[1])/2, E); label("$4$", (D + O[2])/2, E);[/asy] $ \textbf{(A) } 18\sqrt {3} \qquad \textbf{(B) } 24\sqrt {2} \qquad \textbf{(C) } 36 \qquad \textbf{(D) } 24\sqrt {3} \qquad \textbf{(E) } 32\sqrt {2}$

A computer screen shows a $98 \times 98$ chessboard, colored in the usual way. One can select with a mouse any rectangle with sides on the lines of the chessboard and click the mouse button: as a result, the colors in the selected rectangle switch (black becomes white, white becomes black). Find, with proof, the minimum number of mouse clicks needed to make the chessboard all one color.

Let's call $1 \times 2$ rectangle, which can be a rotated, a domino. Prove that there exists polygon, who can be covered by dominoes in exactly $2021$ different ways.