One side of the rectangle is $1$ cm. It is known that the rectangle can be divided by two orthogonal lines onto four rectangles, and each of the smaller rectangles has the area not less than $1$ square centimetre, and one of them is not less than $2$ square centimetres. What is the least possible length of another side of big rectangle?

The square was cut into $n^2$ rectangles with sides $a_i \times b_j, i , j= 1,..., n$. For what is the smallest $n$ in the set $\{a_1, b_1, ..., a_n, b_n\}$ all the numbers can be different?

The diagram shows a rectangle that has been dissected into nine non-overlapping squares. Given that the width and the height of the rectangle are relatively prime positive integers, find the perimeter of the rectangle. [asy] defaultpen(linewidth(0.7)); draw((0,0)--(69,0)--(69,61)--(0,61)--(0,0));draw((36,0)--(36,36)--(0,36)); draw((36,33)--(69,33));draw((41,33)--(41,61));draw((25,36)--(25,61)); draw((34,36)--(34,45)--(25,45)); draw((36,36)--(36,38)--(34,38)); draw((36,38)--(41,38)); draw((34,45)--(41,45));[/asy]

A rectangle with area $n$ with $n$ positive integer, can be divided in $n$ squares(this squares are equal) and the rectangle also can be divided in $n + 98$ squares (the squares are equal). Find the sides of this rectangle

Suppose that $ABCD$ is a rectangle with sides of length $12$ and $18$. Let $S$ be the region of points contained in $ABCD$ which are closer to the center of the rectangle than to any of its vertices. Find the area of $S$.

A square-shaped pizza with side length $30$ cm is cut into pieces (not necessarily rectangular). All cuts are parallel to the sides, and the total length of the cuts is $240$ cm. Show that there is a piece whose area is at least $36$ cm$^2$

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]

Each of $n$ black squares and $n$ white squares can be obtained by a translation from each other. Every two squares of different colours have a common point. Prove that ther is a point belonging at least to $n$ squares. [i](V. Dolnikov)[/i]

In a $12\times 12$ grid, colour each unit square with either black or white, such that there is at least one black unit square in any $3\times 4$ and $4\times 3$ rectangle bounded by the grid lines. Determine, with proof, the minimum number of black unit squares.

Point $K$ is marked on the diagonal $AC$ in rectangle $ABCD$ so that $CK = BC$. On the side $BC$, point $M$ is marked so that $KM = CM$. Prove that $AK + BM = CM$.

Do there exist a rectangle that can be partitioned into a regular hexagon with side length $1$, and several right triangles with side lengths $1, \sqrt3 , 2$?

Cut the $19 \times 20$ grid rectangle along the grid lines into several squares so that there are exactly four of them with odd sidelengths.

A game is played on a $23\times 23$ board. The first player controls two white chips which start in the bottom left and top right corners. The second player controls two black ones which start in bottom right and top left corners. The players move alternately. In each move, a player moves one of the chips under control to a square which shares a side with the square the chip is currently in. The first player wins if he can bring the white chips to squares which share a side with each other. Can the second player prevent the first player from winning?

Given a matrix $\{a_{ij}\}_{i,j=0}^{9}$, $a_{ij}=10i+j+1$. Andrei is going to cover its entries by $50$ rectangles $1\times 2$ (each such rectangle contains two adjacent entries) so that the sum of $50$ products in these rectangles is minimal possible. Help him. [i]A. Badzyan[/i]

Let us consider all rectangles with sides of length $a,b$ both of which are whole numbers. Do more of these rectangles have perimeter $2000$ or perimeter $2002$?

Let $\vartriangle ABC$ be an acute triangle with altitudes $AA_1, BB_1, CC_1$ and orthocenter $H$. Let $K, L$ be the midpoints of $BC_1, CB_1$. Let $\ell_A$ be the external angle bisector of $\angle BAC$. Let $\ell_B, \ell_C$ be the lines through $B, C$ perpendicular to $\ell_A$. Let $\ell_H$ be the line through $H$ parallel to $\ell_A$. Prove that the centers of the circumcircles of $\vartriangle A_1B_1C_1, \vartriangle AKL$ and the rectangle formed by $\ell_A, \ell_B, \ell_C, \ell_H$ lie on the same line.

Given three parallel lines on the plane. Find the locus of incenters of triangles with vertices lying on these lines (a single vertex on each line).

Tanya and Serezha take turns putting chips in empty squares of a chessboard. Tanya starts with a chip in an arbitrary square. At every next move, Serezha must put a chip in the column where Tanya put her last chip, while Tanya must put a chip in the row where Serezha put his last chip. The player who cannot make a move loses. Which of the players has a winning strategy? [i]Proposed by A. Golovanov[/i]

Let $AXYZB$ be a convex pentagon inscribed in a semicircle of diameter $AB$. Denote by $P$, $Q$, $R$, $S$ the feet of the perpendiculars from $Y$ onto lines $AX$, $BX$, $AZ$, $BZ$, respectively. Prove that the acute angle formed by lines $PQ$ and $RS$ is half the size of $\angle XOZ$, where $O$ is the midpoint of segment $AB$.

Mustafa bought a big rug. The seller measured the rug with a ruler that was supposed to measure one meter. As it turned out to be $30$ meters long by $20$ meters wide, he charged Rs $120.000$ Rs. When Mustafa arrived home, he measured the rug again and realized that the seller had overcharged him by $9.408$ Rs. How many centimeters long is the ruler used by the seller?

Let $f(x)=2x^3-2x$. For what positive values of $a$ do there exist distinct $b,c,d$ such that $(a,f(a)),(b,f(b)),(c,f(c)),(d,f(d))$ is a rectangle?

$ABCD$ is a rectangle. The segment $MA$ is perpendicular to plane $ABC$ . $MB= 15$ , $MC=24$ , $MD=20$. Find the length of $MA$ .

A rectangle-shaped puzzle is assembled with $2000$ pieces that are all equal rectangles, and similar to the large rectangle, so that the sides of the small rectangles are parallel to those of the large one. The shortest side of each piece measures $1$. Determine what is the minimum possible value of the area of the large rectangle.

On the cartesian plane are drawn several rectangles with the sides parallel to the coordinate axes. Assume that any two rectangles can be cut by a vertical or a horizontal line. Show that it's possible to draw one horizontal and one vertical line such that each rectangle is cut by at least one of these two lines.

An interior point in a rectangle is connected by line segments to the midpoints of its four sides. Thus four domains (polygons) with the areas $a, b, c$ and $d$ appear (see the figure). Prove that $a + c = b + d$. [img]https://1.bp.blogspot.com/-BipDNHELjJI/XzcCa68P3HI/AAAAAAAAMXY/H2Iqya9VItMLXrRqsdyxHLTXCAZ02nEtgCLcBGAsYHQ/s0/2002%2BMohr%2Bp1.png[/img]