Olympiad problems

1979 IMO Shortlist, 1

Prove that in the Euclidean plane every regular polygon having an even number of sides can be dissected into lozenges. (A lozenge is a quadrilateral whose four sides are all of equal length).

1966 IMO Longlists, 52

Tags: combinatorics , combinatorial geometry , area , geometry , dissection

A figure with area $1$ is cut out of paper. We divide this figure into $10$ parts and color them in $10$ different colors. Now, we turn around the piece of paper, divide the same figure on the other side of the paper in $10$ parts again (in some different way). Show that we can color these new parts in the same $10$ colors again (hereby, different parts should have different colors) such that the sum of the areas of all parts of the figure colored with the same color on both sides is $\geq \frac{1}{10}.$

1967 IMO Longlists, 10

Tags: geometry , perimeter , square , dissection , triangulation

The square $ABCD$ has to be decomposed into $n$ triangles (which are not overlapping) and which have all angles acute. Find the smallest integer $n$ for which there exist a solution of that problem and for such $n$ construct at least one decomposition. Answer whether it is possible to ask moreover that (at least) one of these triangles has the perimeter less than an arbitrarily given positive number.

1966 IMO Shortlist, 52

Tags: combinatorics , geometry , area , combinatorial geometry , dissection

A figure with area $1$ is cut out of paper. We divide this figure into $10$ parts and color them in $10$ different colors. Now, we turn around the piece of paper, divide the same figure on the other side of the paper in $10$ parts again (in some different way). Show that we can color these new parts in the same $10$ colors again (hereby, different parts should have different colors) such that the sum of the areas of all parts of the figure colored with the same color on both sides is $\geq \frac{1}{10}.$

2008 Germany Team Selection Test, 3

Tags: rectangle , combinatorics , geometry , dissection

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]

1969 IMO Shortlist, 32

Tags: sphere , combinatorics , 3d geometry , dissection , geometry

$(GDR 4)$ Find the maximal number of regions into which a sphere can be partitioned by $n$ circles.