Chim Tu has a large rectangular table. On it, there are finitely many pieces of paper with nonoverlapping interiors, each one in the shape of a convex polygon. At each step, Chim Tu is allowed to slide one piece of paper in a straight line such that its interior does not touch any other piece of paper during the slide. Can Chim Tu always slide all the pieces of paper off the table in finitely many steps?

Prove that circles constructed on the sides of a convex quadrilateral as diameters completely cover this quadrilateral.

A $ 9 \times 12$ rectangle is partitioned into unit squares. The centers of all the unit squares, except for the four corner squares and eight squares sharing a common side with one of them, are coloured red. Is it possible to label these red centres $ C_1,C_2,\ldots ,C_{96}$ in such way that the following to conditions are both fulfilled i) the distances $C_1C_2,\ldots ,C_{95}C_{96}, C_{96}C_{1}$ are all equal to $ \sqrt {13}$, ii) the closed broken line $ C_1C_2\ldots C_{96}C_1$ has a centre of symmetry? [i]Bulgaria[/i]

A rectangle with a diagonal of length $ x$ is twice as long as it is wide. What is the area of the rectangle? $ \textbf{(A)}\ \frac14x^2 \qquad \textbf{(B)}\ \frac25x^2 \qquad \textbf{(C)}\ \frac12x^2 \qquad \textbf{(D)}\ x^2 \qquad \textbf{(E)}\ \frac32x^2$

A tortoise walks $60$ meters per hour and a lizard walks at $240$ meters per hour. There is a rectangle $ABCD$ where $AB =60$ and $AD =120$. Both start from the vertex $A$ and in the same direction ($A \to B \to D \to A$), crossing the edge of the rectangle. The lizard has the habit of advancing two consecutive sides of the rectangle, turning to go back one, turning to go forward two, turning to go back one and so on. How many times and in what places do the tortoise and the lizard meet when the tortoise completes its third turn?

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?

In rectangle $ ADEH$, points $ B$ and $ C$ trisect $ \overline{AD}$, and points $ G$ and $ F$ trisect $ \overline{HE}$. In addition, $ AH \equal{} AC \equal{} 2.$ What is the area of quadrilateral $ WXYZ$ shown in the figure? [asy]defaultpen(linewidth(0.7));pointpen=black; pathpen=black; size(7cm); pair A,B,C,D,E,F,G,H,W,X,Y,Z; A=(0,2); B=(1,2); C=(2,2); D=(3,2); H=(0,0); G=(1,0); F=(2,0); E=(3,0); D('A',A, N); D('B',B,N); D('C',C,N); D('D',D,N); D('E',E,NE); D('F',F,NE); D('G',G,NW); D('H',H,NW); D(A--F); D(B--E); D(D--G); D(C--H); Z=IP(A--F, C--H); Y=IP(A--F, D--G); X=IP(B--E,D--G); W=IP(B--E,C--H); D('W',W,N); D('X',X,plain.E); D('Y',Y,S); D('Z',Z,plain.W); D(A--D--E--H--cycle);[/asy] $ \textbf{(A) } \frac 12 \qquad \textbf{(B) } \frac {\sqrt {2}}2\qquad \textbf{(C) } \frac {\sqrt {3}}2 \qquad \textbf{(D) } \frac {2\sqrt {2}}3 \qquad \textbf{(E) } \frac {2\sqrt {3}}3$

For which integers $n>1$ does there exist a rectangle that can be subdivided into $n$ pairwise noncongruent rectangles similar to the original rectangle?

Triangle $ABC$ has side lengths $AB=12$, $BC=25$, and $CA=17$. Rectangle $PQRS$ has vertex $P$ on $\overline{AB}$, vertex $Q$ on $\overline{AC}$, and vertices $R$ and $S$ on $\overline{BC}$. In terms of the side length $PQ=w$, the area of $PQRS$ can be expressed as the quadratic polynomial \[\text{Area}(PQRS)=\alpha w-\beta\cdot w^2\] Then the coefficient $\beta=\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

$ ABCD$ is a rectangle (see the accompanying diagram) with $ P$ any point on $ \overline{AB}$. $ \overline{PS} \perp \overline{BD}$ and $ \overline{PR} \perp \overline{AC}$. $ \overline{AF} \perp \overline{BD}$ and $ \overline{PQ} \perp \overline{AF}$. Then $ PR \plus{} PS$ is equal to: [asy]defaultpen(linewidth(.8pt)); unitsize(3cm); pair D = origin; pair C = (2,0); pair B = (2,1); pair A = (0,1); pair P = waypoint(B--A,0.2); pair S = foot(P,D,B); pair R = foot(P,A,C); pair F = foot(A,D,B); pair Q = foot(P,A,F); pair T = intersectionpoint(P--Q,A--C); pair X = intersectionpoint(A--C,B--D); draw(A--B--C--D--cycle); draw(A--C); draw(B--D); draw(P--S); draw(A--F); draw(P--R); draw(P--Q); label("$A$",A,NW); label("$B$",B,NE); label("$C$",C,SE); label("$D$",D,SW); label("$P$",P,N); label("$S$",S,SE); label("$T$",T,N); label("$E$",X,SW+SE); label("$R$",R,SW); label("$F$",F,SE); label("$Q$",Q,SW);[/asy] $ \textbf{(A)}\ PQ\qquad \textbf{(B)}\ AE\qquad \textbf{(C)}\ PT \plus{} AT\qquad \textbf{(D)}\ AF\qquad \textbf{(E)}\ EF$

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?

The fence consists of $25$ vertical bars. The heights of the bars are pairwise distinct positive integers from $1$ to $25$. The width of every bar is $1$. Find the maximum $S$ for which regardless of the order of the bars one can find a rectangle of area $S$ formed by the fence.

For a positive integer $n$, let denote $C_n$ the figure formed by the inside and perimeter of the circle with center the origin, radius $n$ on the $x$-$y$ plane. Denote by $N(n)$ the number of a unit square such that all of unit square, whose $x,\ y$ coordinates of 4 vertices are integers, and the vertices are included in $C_n$. Prove that $\lim_{n\to\infty} \frac{N(n)}{n^2}=\pi$.

A large rectangle is tiled by some $1\times1$ tiles. In the center there is a small rectangle tiled by some white tiles. The small rectangle is surrounded by a red border which is five tiles wide. That red border is surrounded by a white border which is five tiles wide. Finally, the white border is surrounded by a red border which is five tiles wide. The resulting pattern is pictured below. In all, $2900$ red tiles are used to tile the large rectangle. Find the perimeter of the large rectangle. [asy] import graph; size(5cm); fill((-5,-5)--(0,-5)--(0,35)--(-5,35)--cycle^^(50,-5)--(55,-5)--(55,35)--(50,35)--cycle,red); fill((0,30)--(0,35)--(50,35)--(50,30)--cycle^^(0,-5)--(0,0)--(50,0)--(50,-5)--cycle,red); fill((-15,-15)--(-10,-15)--(-10,45)--(-15,45)--cycle^^(60,-15)--(65,-15)--(65,45)--(60,45)--cycle,red); fill((-10,40)--(-10,45)--(60,45)--(60,40)--cycle^^(-10,-15)--(-10,-10)--(60,-10)--(60,-15)--cycle,red); fill((-10,-10)--(-5,-10)--(-5,40)--(-10,40)--cycle^^(55,-10)--(60,-10)--(60,40)--(55,40)--cycle,white); fill((-5,35)--(-5,40)--(55,40)--(55,35)--cycle^^(-5,-10)--(-5,-5)--(55,-5)--(55,-10)--cycle,white); for(int i=0;i<16;++i){ draw((-i,-i)--(50+i,-i)--(50+i,30+i)--(-i,30+i)--cycle,linewidth(.5)); } [/asy]

Let $ABCD$ be a convex circumscribed quadrilateral such that $\angle ABC+\angle ADC<180^{\circ}$ and $\angle ABD+\angle ACB=\angle ACD+\angle ADB$. Prove that one of the diagonals of quadrilateral $ABCD$ passes through the other diagonals midpoint.

Rectangle $ PQRS$ lies in a plane with $ PQ = RS = 2$ and $ QR = SP = 6$. The rectangle is rotated $ 90^\circ$ clockwise about $ R$, then rotated $ 90^\circ$ clockwise about the point that $ S$ moved to after the first rotation. What is the length of the path traveled by point $ P$? ${ \textbf{(A)}\ (2\sqrt3 + \sqrt5})\pi \qquad \textbf{(B)}\ 6\pi \qquad \textbf{(C)}\ (3 + \sqrt {10})\pi \qquad \textbf{(D)}\ (\sqrt3 + 2\sqrt5)\pi \\ \textbf{(E)}\ 2\sqrt {10}\pi$

What is the smallest number of $5\times 1$ tiles which must be placed on a $31\times 5$ rectangle (each covering exactly $5$ unit squares) so that no further tiles can be placed? How many different ways are there of placing the minimal number (so that further tiles are blocked)? What are the answers for a $52\times 5$ rectangle?

In a $4 \times 6$ grid, all edges and diagonals are drawn (see attachment). Determine the number of parallelograms in the grid that uses only the line segments drawn and none of its four angles are right.

What is the perimeter of a rectangle of area $32$ inscribed in a circle of radius $4$?

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]

Consider two circles, tangent at $T$, both inscribed in a rectangle of height $2$ and width $4$. A point $E$ moves counterclockwise around the circle on the left, and a point $D$ moves clockwise around the circle on the right. $E$ and $D$ start moving at the same time; $E$ starts at $T$, and $D$ starts at $A$, where $A$ is the point where the circle on the right intersects the top side of the rectangle. Both points move with the same speed. Find the locus of the midpoints of the segments joining $E$ and $D$.

In the rectangle $ABCD, M, N, P$ and $Q$ are the midpoints of the sides. If the area of the shaded triangle is $1$, calculate the area of the rectangle $ABCD$. [img]https://2.bp.blogspot.com/-9iyKT7WP5fc/XNYuXirLXSI/AAAAAAAAKK4/10nQuSAYypoFBWGS0cZ5j4vn_hkYr8rcwCK4BGAYYCw/s400/may3.gif[/img]

Is it possible to divide a $8 \times 8$ chessboard into $32$ 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)

Problem 4. A chessboard with $2n \times 2n$ tiles is coloured such that every tile is coloured with one out of $n$ colours. Prove that there exists 2 tiles in either the same column or row such that if the colours of both tiles are swapped, then there exists a rectangle where all its four corner tiles have the same colour.

Let $p,q$ be positive integers. Consider a rectangle $ABCD$ with lengths of sides $p$ and $q$ that consists of $pq$ unital squares. How many of these squares are crossed by diagonal $AC$?