Maths Olympiad Prep

Library / /83 of 377

Geometry Difficulty 4.7 AIME Prove it United States

Problem:
What is the smallest number of regular hexagons of side length 11 needed to completely cover a disc of radius 11?

Solution

Solution:
First, we show that two hexagons do not suffice. Specifically, we claim that a hexagon covers less than half of the disc's boundary. First, a hexagon of side length 11 may be inscribed in a circle, and this covers just 66 points. Translating the hexagon vertically upward (regardless of its orientation) will cause it to no longer touch any point on the lower half of the circle, so that it now covers less than half of the boundary. By rotational symmetry, the same argument applies to translation in any other direction, proving the claim. Then, two hexagons cannot possibly cover the disc.

The disc can be covered by three hexagons as follows. Let PP be the center of the circle. Put three non-overlapping hexagons together at point PP. This will cover the circle, since each hexagon will cover a 120120^{\circ} sector of the circle.

Figure 1

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.