Olympiad problems

2012 Tournament of Towns, 6

We attempt to cover the plane with an infinite sequence of rectangles, overlapping allowed. (a) Is the task always possible if the area of the $n$th rectangle is $n^2$ for each $n$? (b) Is the task always possible if each rectangle is a square, and for any number $N$, there exist squares with total area greater than $N$?

1956 Moscow Mathematical Olympiad, 340

Tags: combinatorics , combinatorial geometry , areas , Rectangles , geometry , rectangle

a) * In a rectangle of area $5$ sq. units, $9$ rectangles of area $1$ are arranged. Prove that the area of the overlap of some two of these rectangles is $\ge 1/9$ b) In a rectangle of area $5$ sq. units, lie $9$ arbitrary polygons each of area $1$. Prove that the area of the overlap of some two of these rectangles is $\ge 1/9$

1984 Tournament Of Towns, (063) O4

Tags: function , graph , Rectangles , combinatorics , combinatorial geometry , geometry , rectangle

Prove that, for any natural number $n$, the graph of any increasing function $f : [0,1] \to [0, 1]$ can be covered by $n$ rectangles each of area whose sides are parallel to the coordinate axes. Assume that a rectangle includes both its interior and boundary points. (a) Assume that $f(x)$ is continuous on $[0,1]$. (b) Do not assume that $f(x)$ is continuous on $[0,1]$. (A Andjans, Riga) PS. (a) for O Level, (b) for A Level

1998 Tournament Of Towns, 2

Tags: combinatorics , combinatorial geometry , Tiling , Rectangles , geometry , rectangle

A square of side $1$ is divided into rectangles . We choose one of the two smaller sides of each rectangle (if the rectangle is a square, then we choose any of the four sides) . Prove that the sum of the lengths of all the chosen sides is at least $1$ . (Folklore)

Geometry Mathley 2011-12, 8.1

Tags: bisects segment , Rectangles , similar , geometry

Let $ABC$ be a triangle and $ABDE, BCFZ, CAKL$ be three similar rectangles constructed externally of the triangle. Let $A'$ be the intersection of $EF$ and $ZK, B'$ the intersection of $KZ$ and $DL$, and $C'$ the intersection of $DL$ and $EF$. Prove that $AA'$ passes through the midpoint of the line segment $B'C'$. Kostas Vittas

1994 Argentina National Olympiad, 4

Tags: geometry , areas , Rectangles , rectangle

A rectangle is divided into $9$ small rectangles if by parallel lines to its sides, as shown in the figure. [img]https://cdn.artofproblemsolving.com/attachments/e/d/1fd545862a3c7950249ec54a631c74e59fb9ed.png[/img] The four numbers written indicate the areas of the four corresponding rectangles. Prove that the total area of the rectangle is greater than or equal to $90$.

2021 Regional Olympiad of Mexico West, 6

Tags: geometry , combinatorics , combinatorial geometry , Rectangles , tiles

Let $n$ be an integer greater than $3$. Show that it is possible to divide a square into $n^2 + 1$ or more disjointed rectangles and with sides parallel to those of the square so that any line parallel to one of the sides intersects at most the interior of $n$ rectangles. Note: We say that two rectangles are [i]disjointed [/i] if they do not intersect or only intersect at their perimeters.

2010 Malaysia National Olympiad, 1

Tags: geometry , Rectangles

In the diagram, congruent rectangles $ABCD$ and $DEFG$ have a common vertex $D$. Sides $BC$ and $EF$ meet at $H$. Given that $DA = DE = 8$, $AB = EF = 12$, and $BH = 7$. Find the area of $ABHED$. [img]https://cdn.artofproblemsolving.com/attachments/f/b/7225fa89097e7b20ea246b3aa920d2464080a5.png[/img]

Geometry Mathley 2011-12, 9.2

Tags: collinear , geometry , Rectangles

Let $ABDE, BCFZ$ and $CAKL$ be three arbitrary rectangles constructed outside a triangle $ABC$. Let $EF$ meet $ZK$ at $M$, and $N$ be the intersection of the lines through $F,Z$ perpendicular to $FL,ZD$. Prove that $A,M,N$ are collinear. Kostas Vittas

2001 Saint Petersburg Mathematical Olympiad, 11.7

Tags: combinatorics , Tiling , Coloring , Rectangles , dominos

Rectangles $1\times20$, $1\times 19$, ..., $1\times 1$ were cut out of $20\times20$ table. Prove that at least 85 dominoes(1×2 rectangle) can be removed from the remainder. Proposed by S. Berlov