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

Cut $2003$ disjoint rectangles from an acute-angled triangle $ABC$, such that any of them has a parallel side to $AB$ and the sum of their areas is maximal.

In the coordinate space, each of the eight vertices of a rectangular box has integer coordinates. If the volume of the solid is $2011$, prove that the sides of the rectangular box are parallel to the coordinate axes.

The adjacent map is part of a city: the small rectangles are rocks, and the paths in between are streets. Each morning, a student walks from intersection A to intersection B, always walking along streets shown, and always going east or south. For variety, at each intersection where he has a choice, he chooses with probability $\frac{1}{2}$ whether to go east or south. Find the probability that through any given morning, he goes through $C$. [asy] defaultpen(linewidth(0.7)+fontsize(8)); size(250); path p=origin--(5,0)--(5,3)--(0,3)--cycle; path q=(5,19)--(6,19)--(6,20)--(5,20)--cycle; int i,j; for(i=0; i<5; i=i+1) { for(j=0; j<6; j=j+1) { draw(shift(6*i, 4*j)*p); }} clip((4,2)--(25,2)--(25,21)--(4,21)--cycle); fill(q^^shift(18,-16)*q^^shift(18,-12)*q, black); label("A", (6,19), SE); label("B", (23,4), NW); label("C", (23,8), NW); draw((26,11.5)--(30,11.5), Arrows(5)); draw((28,9.5)--(28,13.5), Arrows(5)); label("N", (28,13.5), N); label("W", (26,11.5), W); label("E", (30,11.5), E); label("S", (28,9.5), S);[/asy] $\textbf {(A) } \frac{11}{32} \qquad \textbf {(B) } \frac 12 \qquad \textbf {(C) } \frac 47 \qquad \textbf {(D) } \frac{21}{32} \qquad \textbf {(E) } \frac 34$

A circle passes through the vertex of a rectangle $ABCD$ and touches its sides $AB$ and $AD$ at $M$ and $N$ respectively. If the distance from $C$ to the line segment $MN$ is equal to $5$ units, find the area of rectangle $ABCD$.

A sheet of rectangular $ABCD$ paper, of area $1$, is folded along its diagonal $AC$ and then unfolded, then it is bent so that vertex $A$ coincides with vertex $C$ and then unfolded, leaving the crease $MN$, as shown below. a) Show that the quadrilateral $AMCN$ is a rhombus. b) If the diagonal $AC$ is twice the width $AD$, what is the area of the rhombus $AMCN$? [img]https://2.bp.blogspot.com/-TeQ0QKYGzOQ/Xp9lQcaLbsI/AAAAAAAAL2E/JLXwEIPSr4U79tATcYzmcJjK5bGA6_RqACK4BGAYYCw/s400/2001%2Baomb%2Bl2.png[/img]

Let $A_1A_2$ and $B_1B_2$ be the diagonals of a rectangle, and let $O$ be its center. Find and construct the set of all points $P$ that satisfy simultaneously the four inequaliies: $$A_1P > OP , \\A_2P > OP, \ \ B_1P > OP , \ \ B_2P > OP.$$

Let $ I(A)$ and $ I(B)$ be the centers of the excircles of a triangle $ ABC,$ which touches the sides $ BC$ and $ CA$ in its interior. Furthermore let $ P$ a point on the circumcircle $ \omega$ of the triangle $ ABC.$ Show that the center of the segment which connects the circumcenters of the triangles $ I(A)CP$ and $ I(B)CP$ coincides with the center of the circle $ \omega.$

In rectangle $ABCD$, $AD=1$, $P$ is on $AB$ and $DB$ and $DP$ trisect $\angle ADC$. What is the perimeter $\triangle BDP$ [list=1] [*] $3+\frac{\sqrt{3}}{3}$ [*] $2+\frac{4\sqrt{3}}{3}$ [*] $2+2\sqrt{2}$ [*] $\frac{3+3\sqrt{5}}{2}$ [/list]

In the rectangle $ABCD$, point $M$ is the midpoint of the side $BC$. The points $P$ and $Q$ lie on the diagonal $AC$ such that $\angle DPC = \angle DQM = 90^o$. Prove that $Q$ is the midpoint of the segment $AP$.

Every natural number is coloured in one of the $ k$ colors. Prove that there exist four distinct natural numbers $ a, b, c, d$, all coloured in the same colour, such that $ ad \equal{} bc$, $ \displaystyle \frac b a$ is power of 2 and $ \displaystyle \frac c a$ is power of 3.

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.

Find the largest positive integer $n$ with the following property: there are rectangles $A_1, ... , A_n$ and $B_1,... , B_n,$ on the plane , each with sides parallel to the axis of the coordinate system, such that the rectangles $A_i$ and $B_i$ are disjoint for all $i \in \{1,..., n\}$, but the rectangles $A_i$ and $B_j$ have a common point for all $i, j \in \{1,..., n\}$, $i \ne j$. [i]Note: By points belonging to a rectangle we mean all points lying either in its interior, or on any of its sides, including its vertices [/i]

A rectangle formed by the lines of checkered paper is divided into figures of three kinds: isosceles right triangles (1) with base of two units, squares (2) with unit side, and parallelograms (3) formed by two sides and two diagonals of unit squares (figures may be oriented in any way). Prove that the number of figures of the third kind is even. [img]http://up.iranblog.com/Files7/dda310bab8b6455f90ce.jpg[/img]

Let $ABCD$ be a cyclic convex quadrilateral and let $r_a,r_b,r_c,r_d$ be the radii of the circles inscribed in the triangles $BCD, ACD, ABD, ABC$, respectively. Prove that $r_a+r_c=r_b+r_d$.

Let $ n$ be a positive integer. Consider a rectangle $ (90n\plus{}1)\times(90n\plus{}5)$ consisting of unit squares. Let $ S$ be the set of the vertices of these squares. Prove that the number of distinct lines passing through at least two points of $ S$ is divisible by $ 4$.

Akello divides a square up into finitely many white and red rectangles, each (rectangle) with sides parallel to the sides of the parent square. Within each white rectangle, she writes down the value of its width divided by its height, while within each red rectangle, she writes down the value of its height divided by its width. Finally, she calculates $x$, the sum of these numbers. If the total area of the white rectangles equals the total area of the red rectangles, what is the least possible value of $x$ she can get?

Given real $a$. Find the least possible area of the rectangle with the sides parallel to the coordinate axes and containing the figure determined by the system of inequalities $$y \le -x^2 \,\,\, and \,\,\, y \ge x^2 - 2x + a$$

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 $ABCD$ be a rectangle consisting of unit squares. All vertices of these unit squares inside the rectangle and on its sides have been colored in four colors. Additionally, it is known that: [list] [*] every vertex that lies on the side $AB$ has been colored in either the $1.$ or $2.$ color; [*] every vertex that lies on the side $BC$ has been colored in either the $2.$ or $3.$ color; [*] every vertex that lies on the side $CD$ has been colored in either the $3.$ or $4.$ color; [*] every vertex that lies on the side $DA$ has been colored in either the $4.$ or $1.$ color; [*] no two neighboring vertices have been colored in $1.$ and $3.$ color; [*] no two neighboring vertices have been colored in $2.$ and $4.$ color. [/list] Notice that the constraints imply that vertex $A$ has been colored in $1.$ color etc. Prove that there exists a unit square that has all vertices in different colors (in other words it has one vertex of each color).

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.

A ball was launched on a rectangular billiard table at an angle of $45^o$ to one of the sides. Reflected from all sides (the angle of incidence is equal to the angle of reflection), he returned to his original position . It is known that one of the sides of the table has a length of one meter. Find the length of the second side. [img]https://cdn.artofproblemsolving.com/attachments/3/d/e0310ea910c7e3272396cd034421d1f3e88228.png[/img]

Andy has 2010 square tiles, each of which has a side length of one unit. He plans to arrange the tiles in an m x n rectangle, where mn = 2010. Compute the sum of the perimeters of all of the different possible rectangles he can make. Two rectangles are considered to be the same if one can be rotated to become the other, so, for instance, a 1 x 2010 rectangle is considered to be the same as a 2010 x 1 rectangle.

There are two paper figures: an equilateral triangle and a rectangle. The height of rectangle is equal to the height of the triangle and the base of the rectangle is equal to the base of the triangle. Divide the triangle into three parts and the rectangle into two, using straight cuts, so that with the five pieces can be assembled, without gaps or overlays, a equilateral triangle. To assemble the figure, each part can be rotated and / or turned around.

In each unit square of square $100*100$ write any natural number. Called rectangle with sides parallel sides of square $good$ if sum of number inside rectangle divided by $17$. We can painted all unit squares in $good$ rectangle. One unit square cannot painted twice or more. Find maximum $d$ for which we can guaranteed paint at least $d$ points.