MathDB
Regular hexagons in a non-overlapping way

Source: AIMO 6/2, German TST 2010

July 16, 2011
geometrygeometric transformationrotationgeometry unsolved

Problem Statement

Determine all nZ+n \in \mathbb{Z}^+ such that a regular hexagon (i.e. all sides equal length, all interior angles same size) can be partitioned in finitely many nn-gons such that they can be composed into nn congruent regular hexagons in a non-overlapping way upon certain rotations and translations.