Let be a positive integer. Determine the least number of equilateral triangles of side which can cover an equilateral triangle of side .
Solution
The ratio of the areas of the equilateral triangle of side and that of the equilateral triangle of side is the square of the ratio of the lengths of their sides, i.e.
hence at least triangles are needed.
For we can do that by placing three triangles at the corners.
Assume now this proven until , and prove by induction for . A of side triangle placed at the top corner will use triangles , according with the induction hypothesis. It remains a trapezoidal strip at the bottom, of length of the nonparallel sides
and basis lengths and , with triangles available to cover it.
Place triangles one next to another, every second one "slid" downwards by . They will cover a trapezoidal strip of exactly the dimensions of the above, since
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.