Maths Olympiad Prep

Library / /2 of 120

Geometry Difficulty 4.4 AIME Prove it Saudi Arabia

Prove that for any positive integer nn there is an equiangular hexagon whose side-lengths are n+1,n+2,,n+6n+1, n+2, \ldots, n+6 in some order.

Solution

Assume that the equiangular hexagon has the side-lengths a1,a2,,a6a_{1}, a_{2}, \ldots, a_{6}. Since all angles of the hexagon are 120120^{\circ}, extending its sides we get an equilateral triangle.
It is clear that
a1+a2+a6=a2+a3+a4=a4+a5+a6 a_{1}+a_{2}+a_{6}=a_{2}+a_{3}+a_{4}=a_{4}+a_{5}+a_{6}
that is
a1+a6=a3+a4 and a2+a3=a5+a6(1) a_{1}+a_{6}=a_{3}+a_{4} \quad \text{ and } \quad a_{2}+a_{3}=a_{5}+a_{6} \tag{1}
which are the necessary and sufficient conditions for a hexagon with side-lengths a1,a2,,a6a_{1}, a_{2}, \ldots, a_{6} to be equiangular.

Figure 1

If a1=n+1a_{1}=n+1, a2=n+6a_{2}=n+6, a3=n+2a_{3}=n+2, a4=n+4a_{4}=n+4, a5=n+3a_{5}=n+3, a6=n+5a_{6}=n+5, then (1) is verified and we are done.

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 and solution reproduced as published; topic and difficulty added by this site.