A floor has $2 \times 11$ dimension, and this floor covering with $1 \times 2$ rectangles. (No two rectangles overlap). How many cases we done this job?

Let $ABC$ an acute triangle. (a) Find the locus of points that are centers of rectangles whose vertices lie on the sides of $ABC$; (b) Determine if exist some points that are centers of $3$ distinct rectangles whose vertices lie on the sides of $ABC$.

Treasure was buried in a single cell of an $M\times N$ ($2\le M$, $N$) grid. Detectors were brought to find the cell with the treasure. For each detector, you can set it up to scan a specific subgrid $[a,b]\times[c,d]$ with $1\le a\le b\le M$ and $1\le c\le d\le N$. Running the detector will tell you whether the treasure is in the region or not, though it cannot say where in the region the treasure was detected. You plan on setting up $Q$ detectors, which may only be run simultaneously after all $Q$ detectors are ready. In terms of $M$ and $N$, what is the minimum $Q$ required to gaurantee to determine the location of the treasure?

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?

A cubic block with dimensions $n$ by $n$ by $n$ is made up of a collection of $1$ by $1$ by $1$ unit cubes. What is the smallest value of $n$ so that if the outer two layers of unit cubes are removed from the block, more than half the original unit cubes will still remain?

Determine the ratio of the sides of the rectangle circumscribed around a corner of five cells (see figure). (M. Evdokimov) [img]https://cdn.artofproblemsolving.com/attachments/f/f/9c3e345f33cabbbd83f65d7240aac29a163b19.png[/img]

Two circles of equal radius intersect at two distinct points $A$ and $B$. Let their radii $r$ and their midpoints respectively be $O_1$ and $O_2$. Find the greatest possible value of the area of the rectangle $O_1AO_2B$.

Prove that one can cut $a \times b$ rectangle, $\frac{b}{2} < a < b$, into three pieces and rearrange them into a square (without overlaps and holes).

Given an $ n\times n$ chessboard. a) Find the number of rectangles on the chessboard. b) Assume there exists an $ r\times r$ square (label $ B$) with $ r<n$ which is located on the upper left corner of the board. Define "inner border" of $ A$ as the border of $ A$ which is not the border of the chessboard. How many rectangles in $ B$ that touch exactly one inner border of $ B$?

A rectangle $ D$ is partitioned in several ($ \ge2$) rectangles with sides parallel to those of $ D$. Given that any line parallel to one of the sides of $ D$, and having common points with the interior of $ D$, also has common interior points with the interior of at least one rectangle of the partition; prove that there is at least one rectangle of the partition having no common points with $ D$'s boundary. [i]Author: Kei Irie, Japan[/i]

In the plane we are given $3 \cdot n$ points ($n>$1) no three collinear, and the distance between any two of them is $\leq 1$. Prove that we can construct $n$ pairwise disjoint triangles such that: The vertex set of these triangles are exactly the given 3n points and the sum of the area of these triangles $< 1/2$.

Let $ABCD$ be a rectangle and the arbitrary points $E\in (CD)$ and $F \in (AD)$. The perpendicular from point $E$ on the line $FB$ intersects the line $BC$ at point $P$ and the perpendicular from point $F$ on the line $EB$ intersects the line $AB$ at point $Q$. Prove that the points $P, D$ and $Q$ are collinear.

The rectangle is cut into $10$ squares as shown in the figure on the right. Find its sides if the side of the smallest square is $3$.[img]https://cdn.artofproblemsolving.com/attachments/e/5/1fe3a0e41b2d3182338a557d3d44ff5ef9385d.png[/img]

A rectangle $ABCD$ is given whose sides have lengths $3$ and $2n$, where $n$ is a natural number. Denote by $U(n)$ the number of ways in which one can cut the rectangle into rectangles of side lengths $1$ and $2$. $(a)$ Prove that \[U(n + 1)+U(n -1) = 4U(n);\] $(b)$ Prove that \[U(n) =\frac{1}{2\sqrt{3}}[(\sqrt{3} + 1)(2 +\sqrt{3})^n + (\sqrt{3} - 1)(2 -\sqrt{3})^n].\]

In the rectangle $ABCD$ with $|AB|<2 |AD|$, let $E$ be the midpoint of $AB$ and $F$ a point on the chord $CE$ such that $\angle CFD = 90^o$. Prove that $FAD$ is an isosceles triangle.

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?

Is it possible to cut a square with side $\sqrt{2015}$ into no more than five pieces so that these pieces can be rearranged into a rectangle with sides of integer length? (The cuts should be made using straight lines, and flipping of the pieces is disallowed.)

In rectangular coordinate system, the equation $\frac{|x+y|}{2a}+\frac{|x-y|}{2b}=1$ ($a,b$ are different positive numbers) refers to $\text{(A)}$ a triangle $\text{(B)}$ a square $\text{(C)}$ rectangle, not square $\text{(D)}$ rhombus, not square

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.

All sides of a rectangle are odd positive integers. Prove that there does not exist a point inside the rectangle whose distance to each of the vertices is an integer.

Let $ABCD$ be a rectangle of length $m$ and width $n$, with $m, n$ positive integers. Consider a ray of light that starts from $A$, reflects with an angle of $45^o$ on an opposite side and continues reflecting away at the same angle. $\bullet$ For any pair $(m,n)$, show that the ray meets a vertex at some point. $\bullet$ Suppose $m$ and $n$ are coprime. Determine the number of reflections made by the ray of light before encountering a vertex for the first time.

A figure is an equiangular parallelogram if and only if it is a $ \textbf{(A)}\ \text{rectangle}\qquad\textbf{(B)}\ \text{regular polygon}\qquad\textbf{(C)}\ \text{rhombus}\qquad\textbf{(D)}\ \text{square}\qquad\textbf{(E)}\ \text{trapezoid} $

Each cell of a $1000\times 1000$ table contains $0$ or $1$. Prove that one can either cut out $990$ rows so that at least one $1$ remains in each column, or cut out $990$ columns so that at least one $0$ remains in each row.

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 $8$ eyelets for the lace of a sneaker all lie on a rectangle, four equally spaced on each of the longer sides. The rectangle has a width of $50$ mm and a length of $80$ mm. There is one eyelet at each vertex of the rectangle. The lace itself must pass between the vertex eyelets along a width side of the rectangle and then crisscross between successive eyelets until it reaches the two eyelets at the other width side of the rectrangle as shown. After passing through these final eyelets, each of the ends of the lace must extend at least $200$ mm farther to allow a knot to be tied. Find the minimum length of the lace in millimeters. [asy] size(200); defaultpen(linewidth(0.7)); path laceL=(-20,-30)..tension 0.75 ..(-90,-135)..(-102,-147)..(-152,-150)..tension 2 ..(-155,-140)..(-135,-40)..(-50,-4)..tension 0.8 ..origin; path laceR=reflect((75,0),(75,-240))*laceL; draw(origin--(0,-240)--(150,-240)--(150,0)--cycle,gray); for(int i=0;i<=3;i=i+1) { path circ1=circle((0,-80*i),5),circ2=circle((150,-80*i),5); unfill(circ1); draw(circ1); unfill(circ2); draw(circ2); } draw(laceL--(150,-80)--(0,-160)--(150,-240)--(0,-240)--(150,-160)--(0,-80)--(150,0)^^laceR,linewidth(1));[/asy]