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.

A rectangle is inscribed in a circle of area $32\pi$ and the area of the rectangle is $34$. Find its perimeter. [i]2017 CCA Math Bonanza Individual Round #2[/i]

Let $\{R_i\}_{1\leq i\leq n}$ be a family of disjoint closed rectangular surfaces with total area 4 such that their projections of the $Ox$ axis is an interval. Prove that there exist a triangle with vertices in $\displaystyle \bigcup_{i=1}^n R_i$ which has an area of at least 1. [Thanks Grobber for the correction]

In a rectangle triangle, let $I$ be its incenter and $G$ its geocenter. If $IG$ is parallel to one of the catheti and measures $10 cm$, find the lengths of the two catheti of the triangle.

Consider a $ n\times n $ square grid which is divided into $ n^2 $ unit squares(think of a chess-board). The set of all unit squares intersecting the main diagonal of the square or lying under it is called an $n$-staircase. Find the number of ways in which an $n$-stair case can be partitioned into several rectangles, with sides along the grid lines, having mutually distinct areas.

On a $49\times 69$ rectangle formed by a grid of lattice squares, all $50\cdot 70$ lattice points are colored blue. Two persons play the following game: In each step, a player colors two blue points red, and draws a segment between these two points. (Different segments can intersect in their interior.) Segments are drawn this way until all formerly blue points are colored red. At this moment, the first player directs all segments drawn - i. e., he takes every segment AB, and replaces it either by the vector $\overrightarrow{AB}$, or by the vector $\overrightarrow{BA}$. If the first player succeeds to direct all the segments drawn in such a way that the sum of the resulting vectors is $\overrightarrow{0}$, then he wins; else, the second player wins. Which player has a winning strategy?

We are given a positive integer $ r$ and a rectangular board $ ABCD$ with dimensions $ AB \equal{} 20, BC \equal{} 12$. The rectangle is divided into a grid of $ 20 \times 12$ unit squares. The following moves are permitted on the board: one can move from one square to another only if the distance between the centers of the two squares is $ \sqrt {r}$. The task is to find a sequence of moves leading from the square with $ A$ as a vertex to the square with $ B$ as a vertex. (a) Show that the task cannot be done if $ r$ is divisible by 2 or 3. (b) Prove that the task is possible when $ r \equal{} 73$. (c) Can the task be done when $ r \equal{} 97$?

Let $ABCD$ be a square with the side of $20$ units. Amir divides this square into $400$ unit squares. Reza then picks $4$ of the vertices of these unit squares. These vertices lie inside the square $ABCD$ and define a rectangle with the sides parallel to the sides of the square $ABCD.$ There are exactly $24$ unit squares which have at least one point in common with the sides of this rectangle. Find all possible values for the area of a rectangle with these properties. [hide="Note"][i]Note:[/i] Vid changed to Amir, and Eva change to Reza![/hide]

A rectangle with sides of lengths $a$ and $b$ ($a > b$) is cut into rightangled triangles so that any two of these triangles either have a common side, a common vertex or no common points. Moreover, any common side of two triangles is a leg of one of them and the hypotenuse of the other. Prove that $a > 2b$. (A Shapovalov)

Point $P$ lies in the interior of rectangle $ABCD$ such that $AP + CP = 27$, $BP - DP = 17$, and $\angle DAP \cong \angle DCP$. Compute the area of rectangle $ABCD$. [i]Proposed by Aaron Lin[/i]

In the diagram below, how many rectangles can be drawn using the grid lines which contain none of the letters $N$, $I$, $M$, $O$? [asy] size(4cm); for(int i=0;i<6;++i)draw((i,0)--(i,5)^^(0,i)--(5,i)); label("$N$", (1.5, 2.5)); label("$I$", (2.5, 3.5)); label("$M$", (3.5, 2.5)); label("$O$", (2.5, 1.5)); [/asy] [i]Proposed by Michael Tang[/i]

Two nonadjacent vertices of a rectangle are $(4,3)$ and $(-4,-3)$, and the coordinates of the other two vertices are integers. The number of such rectangles is $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

A rectangle $ABCD$ is given. Segment $DK$ is equal to $BD$ and lies on the half-line $DC$. $M$ is the midpoint of $BK$. Prove that $AM$ is the angle bisector of $\angle BAC$. [i]Proposed by S. Berlov[/i]

Cut a rectangle into $18$ rectangles so that no two adjacent ones form a rectangle.

Let $ABCD$ be a rectangle of centre $O$, such that $\angle DAC=60^{\circ}$. The angle bisector of $\angle DAC$ meets $DC$ at $S$. Lines $OS$ and $AD$ meet at $L$, and lines $BL$ and $AC$ meet at $M$. Prove that lines $SM$ and $CL$ are parallel.