Maths Olympiad Prep

Library / /33 of 68

Geometry Difficulty 5.3 AIME, harder Prove it Estonia

For which positive integers nn can one exactly cover an equilateral triangle of side length nn by trapeziums of the shape shown in the figure, consisting of three equilateral triangles of side length 1? Trapeziums are allowed to be rotated but not to cover each other.

Figure 1

Solution

An equilateral triangle of side length 3 can be covered by three trapeziums (Fig. 4). All equilateral triangles with side length being divisible by 3 can be partitioned into equilateral triangles of side length 3. Hence all equilateral triangles with side length being divisible by 3 can be covered by trapeziums of given shape.

Figure 2
Fig. 4

On the other hand, whenever one partitions an equilateral triangle of side length nn into equilateral triangles of side length 1, the number of the small triangles is n2n^2 since multiplying the side length by nn causes the area to increase n2n^2 times. Consequently, the desired covering is possible only if the number n2n^2 is divisible by 3. The latter condition implies that nn must be divisible by 3 since 3 is prime.

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.