Fold the next seven corners into a rectangle. [img]https://cdn.artofproblemsolving.com/attachments/b/b/2b8b9d6d4b72024996a66d41f865afb91bb9b7.png[/img]

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]

Let $S$ be the square one of whose diagonals has endpoints $(0.1,0.7)$ and $(-0.1,-0.7)$. A point $v=(x,y)$ is chosen uniformly at random over all pairs of real numbers $x$ and $y$ such that $0\le x \le 2012$ and $0 \le y \le 2012$. Let $T(v)$ be a translated copy of $S$ centered at $v$. What is the probability that the square region determined by $T(v)$ contains exactly two points with integer coordinates in its interior? $ \textbf{(A)}\ 0.125\qquad\textbf{(B)}\ 0.14\qquad\textbf{(C)}\ 0.16\qquad\textbf{(D)}\ 0.25\qquad\textbf{(E)}\ 0.32 $

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 quadrilateral inscribed in circle $\omega$. Define $E = AA \cap CD$, $F = AA \cap BC$, $G = BE \cap \omega$, $H = BE \cap AD$, $I = DF \cap \omega$, and $J = DF \cap AB$. Prove that $GI$, $HJ$, and the $B$-symmedian are concurrent. [i]Proposed by Robin Park[/i]

Let $ABC$ be an equilateral triangle. Let $P$ and $S$ be points on $AB$ and $AC$, respectively, and let $Q$ and $R$ be points on $BC$ such that $PQRS$ is a rectangle. If $PQ = \sqrt3 PS$ and the area of $PQRS$ is $28\sqrt3$, what is the length of $PC$?

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]

In the following figure, the largest square is divided into two squares and three rectangles, as shown: The area of each smaller square is equal to $a$ and the area of each small rectangle is equal to $b$. If $a+b=24$ and the root square of $a$ is a natural number, find all possible values for the area of the largest square. [img]https://cdn.artofproblemsolving.com/attachments/f/a/0b424d9c293889b24d9f31b1531bed5081081f.png[/img]

[asy] //rectangles above problem statement size(15cm); for(int i=0;i<5;++i){ draw((6*i-14,-1.2)--(6*i-14,1.2)--(6*i-10,1.2)--(6*i-10,-1.2)--cycle); } label("$A$", (-12,2.25)); label("$B$", (-6,2.25)); label("$C$", (0,2.25)); label("$D$", (6,2.25)); label("$E$", (12,2.25)); //top numbers label("$1$", (-12,1.25),dir(-90)); label("$0$", (-6,1.25),dir(-90)); label("$8$", (0,1.25),dir(-90)); label("$5$", (6,1.25),dir(-90)); label("$2$", (12,1.25),dir(-90)); //bottom numbers label("$9$", (-12,-1.25),dir(90)); label("$6$", (-6,-1.25),dir(90)); label("$2$", (0,-1.25),dir(90)); label("$8$", (6,-1.25),dir(90)); label("$0$", (12,-1.25),dir(90)); //left numbers label("$4$", (-14,0),dir(0)); label("$1$", (-8,0),dir(0)); label("$3$", (-2,0),dir(0)); label("$7$", (4,0),dir(0)); label("$9$", (10,0),dir(0)); //right numbers label("$6$", (-10,0),dir(180)); label("$3$", (-4,0),dir(180)); label("$5$", (2,0),dir(180)); label("$4$", (8,0),dir(180)); label("$7$", (14,0),dir(180)); [/asy] Each of the sides of the five congruent rectangles is labeled with an integer, as shown above. These five rectangles are placed, without rotating or reflecting, in positions $I$ through $V$ so that the labels on coincident sides are equal. [asy] //diagram below problem statement size(7cm); for(int i=-3;i<=1;i+=2){ for(int j=-1;j<=0;++j){ if(i==1 && j==-1) continue; draw((i,j)--(i+2,j)--(i+2,j-1)--(i,j-1)--cycle); }} label("$I$",(-2,-0.5)); label("$II$",(0,-0.5)); label("$III$",(2,-0.5)); label("$IV$",(-2,-1.5)); label("$V$",(0,-1.5)); [/asy] Which of the rectangles is in position $I$? $\textbf{(A)} \ A \qquad \textbf{(B)} \ B \qquad \textbf{(C)} \ C \qquad \textbf{(D)} \ D \qquad \textbf{(E)} \ E$

A cardboard box in the shape of a rectangular parallelopiped is to be enclosed in a cylindrical container with a hemispherical lid. If the total height of the container from the base to the top of the lid is $60$ centimetres and its base has radius $30$ centimetres, find the volume of the largest box that can be completely enclosed inside the container with the lid on.

Let $ABCD$ be a rectangle and let $E \in (BD)$ such that $m( \angle DAE) =15^o$. Let $F \in AB$ such that $EF \perp AB$. It is known that $EF=\frac12 AB$ and $AD = a$. Find the measure of the angle $\angle EAC$ and the length of the segment $(EC)$.

Given three congruent rectangles in the space. Their centers coincide, but the planes they lie in are mutually perpendicular. For any two of the three rectangles, the line of intersection of the planes of these two rectangles contains one midparallel of one rectangle and one midparallel of the other rectangle, and these two midparallels have different lengths. Consider the convex polyhedron whose vertices are the vertices of the rectangles. [b]a.)[/b] What is the volume of this polyhedron ? [b]b.)[/b] Can this polyhedron turn out to be a regular polyhedron ? If yes, what is the condition for this polyhedron to be regular ?

Find all values of $n$ such that there exists a rectangle with integer side lengths, perimeter $n$, and area $2n$.

A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even. [i]Proposed by Jeck Lim, Singapore[/i]

Prove that for any real $r>0$, one can cover the circumference of a $1\times r$ rectangle with non-intersecting disks of unit radius.

Let $C (O)$ be a circle (with center $O$ ) and $A, B$ points on the circle with $\angle AOB = 90^o$. Circles $C_1 (O_1)$ and $C_2 (O_2)$ are tangent internally with circle $C$ at $A$ and $B$, respectively, and, also, are tangent to each other. Consider another circle $C_3 (O_3)$ tangent externally to the circles $C_1, C_2$ and tangent internally to circle $C$, located inside angle $\angle AOB$. Show that the points $O, O_1, O_2, O_3$ are the vertices of a rectangle.

A circle that passes through the vertex $A$ of a rectangle $ABCD$ intersects the side $AB$ at a second point $E$ different from $B.$ A line passing through $B$ is tangent to this circle at a point $T,$ and the circle with center $B$ and passing through $T$ intersects the side $BC$ at the point $F.$ Show that if $\angle CDF= \angle BFE,$ then $\angle EDF=\angle CDF.$

Let $ ABC$ be an acute-angled triangle such that there exist points $ D,E,F$ on side $ BC,CA,AB$, respectively such that the inradii of triangle $ AEF,BDF,CDE$ are all equal to $ r_0$. If the inradii of triangle $ DEF$ and $ ABC$ are $ r$ and $ R$, respectively, prove that \[ r\plus{}r_0\equal{}R.\] [i]Soewono, Bandung[/i]

Is it possible to write a positive integer in every cell of an infinite chessboard, in such a manner that, for all positive integers $m, n$, the sum of numbers in every $m\times n$ rectangle is divisible by $m + n$ ?

All of the rectangles in the figure below, which is drawn to scale, are similar to the enclosing rectangle. Each number represents the area of the rectangle. What is length $AB$? [img]https://cdn.artofproblemsolving.com/attachments/3/b/298cf96ec8fc90c438e4936a05c260170eda01.png[/img] $\textbf{(A) }4+4\sqrt5\qquad\textbf{(B) }10\sqrt2\qquad\textbf{(C) }5+5\sqrt5\qquad\textbf{(D) }10\sqrt[4]{8}\qquad\textbf{(E) }20$

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$?

In the rectangle $ABCD, BC = 5, EC = 1/3 CD$ and $F$ is the point where $AE$ and $BD$ are cut. The triangle $DFE$ has area $12$ and the triangle $ABF$ has area $27$. Find the area of the quadrilateral $BCEF$ . [img]https://1.bp.blogspot.com/-4w6e729AF9o/XNY9hqHaBaI/AAAAAAAAKL0/eCaNnWmgc7Yj9uV4z29JAvTcWCe21NIMgCK4BGAYYCw/s400/may%2B2011%2Bl1.png[/img]

Let $ ABC $ be an obtuse triangle with $ \angle A > 90^{\circ} $. Let circle $ O $ be the circumcircle of $ ABC $. $ D $ is a point lying on segment $ AB $ such that $ AD = AC $. Let $ AK $ be the diameter of circle $ O $. Two lines $ AK $ and $ CD $ meet at $ L $. A circle passing through $ D, K, L $ meets with circle $ O $ at $ P ( \ne K ) $ . Given that $ AK = 2, \angle BCD = \angle BAP = 10^{\circ} $, prove that $ DP = \sin ( \frac{ \angle A}{2} )$.

For an integer $m\geq 1$, we consider partitions of a $2^m\times 2^m$ chessboard into rectangles consisting of cells of chessboard, in which each of the $2^m$ cells along one diagonal forms a separate rectangle of side length $1$. Determine the smallest possible sum of rectangle perimeters in such a partition. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

$200 \times 200$ square is colored in chess order. In one move we can take every $2 \times 3$ rectangle and change color of all its cells. Can we make all cells of square in same color ?