A Tetris Figure is every figure in the plane which consists of $4$ unit squares connected by their sides (and don’t overlap). Two Tetris Figures are the same if one can be rotated in the plane to become the other. a) Prove that there exist exactly $7$ different Tetris Figures. b) Is it possible to fill a $4 \times 7$ rectangle by using once each of the $7$ different Tetris Figures?

Four congruent rectangles are placed as shown. The area of the outer square is $ 4$ times that of the inner square. What is the ratio of the length of the longer side of each rectangle to the length of its shorter side? [asy]unitsize(6mm); defaultpen(linewidth(.8pt)); path p=(1,1)--(-2,1)--(-2,2)--(1,2); draw(p); draw(rotate(90)*p); draw(rotate(180)*p); draw(rotate(270)*p);[/asy]$ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ \sqrt {10} \qquad \textbf{(C)}\ 2 \plus{} \sqrt2 \qquad \textbf{(D)}\ 2\sqrt3 \qquad \textbf{(E)}\ 4$

In a concyclic quadrilateral $PQRS$,$\angle PSR=\frac{\pi}{2}$ , $H,K$ are perpendicular foot from $Q$ to sides $PR,RS$ , prove that $HK$ bisect segment$SQ$.

Given a positive integer $n$, determine the largest real number $\mu$ satisfying the following condition: for every set $C$ of $4n$ points in the interior of the unit square $U$, there exists a rectangle $T$ contained in $U$ such that $\bullet$ the sides of $T$ are parallel to the sides of $U$; $\bullet$ the interior of $T$ contains exactly one point of $C$; $\bullet$ the area of $T$ is at least $\mu$.

A triangle $KLM$ is given in the plane together with a point $A$ lying on the half-line opposite to $KL$. Construct a rectangle $ABCD$ whose vertices $B, C$ and $D$ lie on the lines $KM, KL$ and $LM$, respectively. (We allow the rectangle to be a square.)

Rhombus $PQRS$ is inscribed in rectangle $ABCD$ so that vertices $P$, $Q$, $R$, and $S$ are interior points on sides $\overline{AB}$, $\overline{BC}$, $\overline{CD}$, and $\overline{DA}$, respectively. It is given that $PB=15$, $BQ=20$, $PR=30$, and $QS=40$. Let $m/n$, in lowest terms, denote the perimeter of $ABCD$. Find $m+n$.

The diagram below shows a rectangle with side lengths $36$ and $48$. Each of the sides is trisected and edges are added between the trisection points as shown. Then the shaded corner regions are removed, leaving the octagon which is not shaded in the diagram. Find the perimeter of this octagon. [asy] size(4cm); dotfactor=3.5; pair A,B,C,D,E,F,G,H,W,X,Y,Z; A=(0,12); B=(0,24); C=(16,36); D=(32,36); E=(48,24); F=(48,12); G=(32,0); H=(16,0); W=origin; X=(0,36); Y=(48,36); Z=(48,0); filldraw(W--A--H--cycle^^B--X--C--cycle^^D--Y--E--cycle^^F--Z--G--cycle,rgb(.76,.76,.76)); draw(W--X--Y--Z--cycle,linewidth(1.2)); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); dot(G); dot(H); [/asy]

Circles $A, B,$ and $C$ each have radius 1. Circles $A$ and $B$ share one point of tangency. Circle $C$ has a point of tangency with the midpoint of $\overline{AB}$. What is the area inside Circle $C$ but outside circle $A$ and circle $B$ ? [asy] pathpen = linewidth(.7); pointpen = black; pair A=(-1,0), B=-A, C=(0,1); fill(arc(C,1,0,180)--arc(A,1,90,0)--arc(B,1,180,90)--cycle, gray(0.5)); D(CR(D("A",A,SW),1)); D(CR(D("B",B,SE),1)); D(CR(D("C",C,N),1));[/asy] ${ \textbf{(A)}\ 3 - \frac{\pi}{2} \qquad \textbf{(B)}\ \frac{\pi}{2} \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ \frac{3\pi}{4} \qquad \textbf{(E)}\ 1+\frac{\pi}{2}} $

Find the least possible area of a convex set in the plane that intersects both branches of the hyperbola $ xy\equal{}1$ and both branches of the hyperbola $ xy\equal{}\minus{}1.$ (A set $ S$ in the plane is called [i]convex[/i] if for any two points in $ S$ the line segment connecting them is contained in $ S.$)

Many television screens are rectangles that are measured by the length of their diagonals. The ratio of the horizontal length to the height in a standard television screen is $ 4 : 3$. The horizontal length of a “$ 27$-inch” television screen is closest, in inches, to which of the following? [asy]import math; unitsize(7mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); draw((0,0)--(4,0)--(4,3)--(0,3)--(0,0)--(4,3)); fill((0,0)--(4,0)--(4,3)--cycle,mediumgray); label(rotate(aTan(3.0/4.0))*"Diagonal",(2,1.5),NW); label(rotate(90)*"Height",(4,1.5),E); label("Length",(2,0),S);[/asy]$ \textbf{(A)}\ 20 \qquad \textbf{(B)}\ 20.5 \qquad \textbf{(C)}\ 21 \qquad \textbf{(D)}\ 21.5 \qquad \textbf{(E)}\ 22$

Two players play a game involving an $n \times n$ grid of chocolate. Each turn, a player may either eat a piece of chocolate (of any size), or split an existing piece of chocolate into two rectangles along a grid-line. The player who moves last loses. For how many positive integers $n$ less than $1000$ does the second player win? (Splitting a piece of chocolate refers to taking an $a \times b$ piece, and breaking it into an $(a-c) \times b$ and a $c \times b$ piece, or an $a \times (b-d)$ and an $a \times d$ piece.) [i]Proposed by Lewis Chen[/i]

Find the volume of the solid generated by a rotation of the region enclosed by the curve $y=x^3-x$ and the line $y=x$ about the line $y=x$ as the axis of rotation.

There is a square sheet of paper. How to get a rectangular sheet of paper with an aspect ratio equal to $\sqrt2$? (There are no tools, the sheet can only be bent.)

Cut the $10$ cm $\times 25$ cm rectangle into two pieces with one straight cut so that they can fit inside the $22.1 $ cm circle without crossing.

A rectangle is divided into $9$ small rectangles if by parallel lines to its sides, as shown in the figure. [img]https://cdn.artofproblemsolving.com/attachments/e/d/1fd545862a3c7950249ec54a631c74e59fb9ed.png[/img] The four numbers written indicate the areas of the four corresponding rectangles. Prove that the total area of the rectangle is greater than or equal to $90$.

The dimensions of a rectangle $R$ are $a$ and $b$, $a < b$. It is required to obtain a rectangle with dimensions $x$ and $y$, $x < a$, $y < a$, so that its perimeter is one-third that of $R$, and its area is one-third that of $R$. The number of such (different) rectangles is: $\textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1\qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ \text{infinitely many}$

For a real number $ a$, let $ \lfloor a \rfloor$ denominate the greatest integer less than or equal to $ a$. Let $ \mathcal{R}$ denote the region in the coordinate plane consisting of points $ (x,y)$ such that \[\lfloor x \rfloor ^2 \plus{} \lfloor y \rfloor ^2 \equal{} 25.\] The region $ \mathcal{R}$ is completely contained in a disk of radius $ r$ (a disk is the union of a circle and its interior). The minimum value of $ r$ can be written as $ \tfrac {\sqrt {m}}{n}$, where $ m$ and $ n$ are integers and $ m$ is not divisible by the square of any prime. Find $ m \plus{} n$.

What is the probability that an integer in the set $ \{1,2,3,\ldots,100\}$ is divisible by $ 2$ and not divisible by $ 3$? $ \textbf{(A)}\ \frac{1}{6} \qquad \textbf{(B)}\ \frac{33}{100} \qquad \textbf{(C)}\ \frac{17}{50} \qquad \textbf{(D)}\ \frac{1}{2} \qquad \textbf{(E)}\ \frac{18}{25}$

With $76$ tiles, of which some are white, other blue and the remaining red, they form a rectangle of $4 \times 19$. Show that there is a rectangle, inside the largest, that has its vertices of the same color.

Charlyn walks completely around the boundary of a square whose sides are each $5$ km long. From any point on her path she can see exactly $1$ km horizontally in all directions. What is the area of the region consisting of all points Charlyn can see during her walk, expressed in square kilometers and rounded to the nearest whole number? $\text{(A)}\ 24 \qquad\text{(B)}\ 27\qquad\text{(C)}\ 39\qquad\text{(D)}\ 40 \qquad\text{(E)}\ 42$

Cut the $9 \times 10$ grid rectangle along the grid lines into several squares so that there are exactly two of them with odd sidelengths.

Congruent rectangles with sides $m(cm)$ and $n(cm)$ are given ($m, n$ positive integers). Characterize the rectangles that can be constructed from these rectangles (in the fashion of a jigsaw puzzle). (The number of rectangles is unbounded.)

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

A rectangular piece of of paper measures 4 units by 5 units. Several lines are drawn parallel to the edges of the paper. A rectangle determined by the intersections of some of these lines is called [i]basic [/i]if (i) all four sides of the rectangle are segments of drawn line segments, and (ii) no segments of drawn lines lie inside the rectangle. Given that the total length of all lines drawn is exactly 2007 units, let $N$ be the maximum possible number of basic rectangles determined. Find the remainder when $N$ is divided by 1000.

A square and a rectangle of the same perimeter have a common corner. Prove that the intersection point of the diagonals of the rectangle lies on the diagonal of the square. (Yu. Blinkov)