Maths Olympiad Prep

Library / /8 of 27

Geometry Difficulty 5.5 AIME, harder Prove it Romania

Let nn be a positive integer. Determine the least number of equilateral triangles of side 11 which can cover an equilateral triangle of side n+12nn + \frac{1}{2n}.

Solution

The ratio of the areas of the equilateral triangle Δ\Delta of side n+12nn + \frac{1}{2n} and that of the equilateral triangle Δ1\Delta_1 of side 11 is the square of the ratio of the lengths of their sides, i.e.
(n+12n)2>n2+1,(n + \frac{1}{2n})^2 > n^2 + 1,
hence at least n2+2n^2 + 2 triangles Δ1\Delta_1 are needed.

For n=1n = 1 we can do that by placing three Δ1\Delta_1 triangles at the corners.

Assume now this proven until nn, and prove by induction for n+1n+1. A Δ\Delta of side n+1n+1 triangle placed at the top corner will use n2+2n^2 + 2 triangles Δ1\Delta_1, according with the induction hypothesis. It remains a trapezoidal strip at the bottom, of length of the nonparallel sides
n+1+12(n+1)n12n=112n(n+1),n + 1 + \frac{1}{2(n+1)} - n - \frac{1}{2n} = 1 - \frac{1}{2n(n+1)},
and basis lengths n+12nn + \frac{1}{2n} and n+1+12(n+1)n + 1 + \frac{1}{2(n+1)}, with (n+1)2+2n22=2n+1(n+1)^2 + 2 - n^2 - 2 = 2n + 1 triangles Δ1\Delta_1 available to cover it.

Place 2n+12n+1 triangles Δ1\Delta_1 one next to another, every second one "slid" downwards by 12n(n+1)\frac{1}{2n(n+1)}. They will cover a trapezoidal strip of exactly the dimensions of the above, since
(n+1)1+n12n(n+1)=n+1+12(n+1).(n+1) \cdot 1 + n \cdot \frac{1}{2n(n+1)} = n + 1 + \frac{1}{2(n+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 and solution reproduced as published; topic and difficulty added by this site.