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.

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$

Show that for each integer $n > 0$, there is a polygon with vertices at lattice points and all sides parallel to the axes, which can be dissected into $1 \times 2$ (and / or $2 \times 1$) rectangles in exactly $n$ ways.

Located on the plane $\left[ \frac43 n \right]$ rectangles with sides parallel to the coordinate axes. It is known that any rectangle intersects at least n rectangles. Prove that exists a rectangle that intersects all rectangles.

Let $p$ be a prime number and a table of size $(p^2+ p+1)\times (p^2+p + 1)$ which is divided into unit cells. The way to color some cells of this table is called nice if there are no four colored cells that form a rectangle (the sides of rectangle are parallel to the sides of given table). 1. Let $k$ be the number of colored cells in some nice coloring way. Prove that $k \le (p + 1)(p^2 + p + 1)$. Denote this number as $k_{max}$. 2. Prove that all ordered tuples $(a, b, c)$ with $0 \le a, b, c < p$ and $a + b + c > 0$ can be partitioned into $p^2 + p + 1$ sets $S_1, S_2, .. . S_{p^2+p+1}$ such that two tuples $(a_1, b_1, c_1)$ and $(a_2, b_2, c_2)$ belong to the same set if and only if $a_1 \equiv ka_2, b_1 \equiv kb_2, c_1 \equiv kc_2$ (mod $p$) for some $k \in \{1,2, 3, ... , p - 1\}$. 3. For $1 \le i, j \le p^2+p+1$, if there exist $(a_1, b_1, c_1) \in S_i$ and $(a_2, b_2, c_2) \in S_j$ such that $a_1a_2 + b_1b_2 + c_1c_2 \equiv 0$ (mod $p$), we color the cell $(i, j)$ of the given table. Prove that this coloring way is nice with $k_{max}$ colored cells

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 that is inscribed in a larger rectangle (with one vertex on each side) is called [i]unstuck[/i] if it is possible to rotate (however slightly) the smaller rectangle about its center within the confines of the larger. Of all the rectangles that can be inscribed unstuck in a 6 by 8 rectangle, the smallest perimeter has the form $\sqrt{N}$, for a positive integer $N$. Find $N$.

Suppose $F$ is a polygon with lattice vertices and sides parralell to x-axis and y-axis.Suppose $S(F),P(F)$ are area and perimeter of $F$. Find the smallest k that: $S(F) \leq k.P(F)^2$

In rectangle $ABCD$, $AB=6$ and $AD=8$. Point $M$ is the midpoint of $\overline{AD}$. What is the area of $\triangle AMC$? $\textbf{(A) }12\qquad\textbf{(B) }15\qquad\textbf{(C) }18\qquad\textbf{(D) }20\qquad \textbf{(E) }24$

Let $ ABCD$ a cuadrilateral inscribed in a circumference. Suppose that there is a semicircle with its center on $ AB$, that is tangent to the other three sides of the cuadrilateral. (i) Show that $ AB \equal{} AD \plus{} BC$. (ii) Calculate, in term of $ x \equal{} AB$ and $ y \equal{} CD$, the maximal area that can be reached for such quadrilateral.

A rectangle has sides of length $\sin x$ and $\cos x$ for some $x$. What is the largest possible area of such a rectangle?

We are given sufficiently many stones of the forms of a rectangle $2\times 1$ and square $1\times 1$. Let $n > 3$ be a natural number. In how many ways can one tile a rectangle $3 \times n$ using these stones, so that no two $2 \times 1$ rectangles have a common point, and each of them has the longer side parallel to the shorter side of the big rectangle?

Determine all positive integers $m$ satisfying the condition that there exists a unique positive integer $n$ such that there exists a rectangle which can be decomposed into $n$ congruent squares and can also be decomposed into $m+n$ congruent squares.

A square has been divided into $2022$ rectangles with no two of them having a common interior point. What is the maximal number of distinct lines that can be determined by the sides of these rectangles?

Let $ m,n\ge 2 $ and consider a rectangle formed by $ m\times n $ unit squares that are colored, either white, or either black. A [i]step[/i] is the action of selecting from it a rectangle of dimensions $ 1\times k, $ where $ k $ is an odd number smaller or equal to $ n, $ or a rectangle of dimensions $ l\times 1, $ where $ l $ is and odd number smaller than $ m, $ and coloring all the unit squares of this chosen rectangle with the color that appears the least in it. [b]a)[/b] Show that, for any $ m,n\ge 5, $ there exists a succession of [i]steps[/i] that make the rectagle to be single-colored. [b]b)[/b] What about $ m=n+1=5? $

There are some counters in some cells of $100\times 100$ board. Call a cell [i]nice[/i] if there are an even number of counters in adjacent cells. Can exactly one cell be [i]nice[/i]? [i]K. Knop[/i]