Maths Olympiad Prep

Library / /885 of 1394

, 2019

Geometry Difficulty 5.4 AIME, harder Prove it United States

Problem:

An equiangular hexagon has side lengths 1,2,3,4,5,61,2,3,4,5,6 in some order. Find the nonnegative difference between the largest and the smallest possible area of this hexagon.

Solution

Solution:

Extending three sides of the equiangular hexagon gives an equilateral triangle. Thus, if the sides are a,b,c,d,e,fa, b, c, d, e, f, in order, then a+b+c=a+f+eb+c=e+ffc=bea+b+c = a+f+e \Rightarrow b+c = e+f \Rightarrow f-c = b-e. By a symmetric argument, we see that da=fc=bed-a = f-c = b-e holds, which means that they must be separated into three groups of two with equal differences.

If the grouping is (1,2),(3,4),(5,6)(1,2),(3,4),(5,6), then we have 1,4,5,2,3,61,4,5,2,3,6 around the hexagon. If the grouping is (1,4),(2,5),(3,6)(1,4),(2,5),(3,6), then we get 1,5,3,4,2,61,5,3,4,2,6 as the other possibility. Finally, we can use our equilateral triangle trick to find the areas.

For the first, we get a big triangle of side 1+4+5=101+4+5=10, and must subtract smaller triangles of sides 1,5,31,5,3. This gives (1001259)3/4=653/4(100-1-25-9) \sqrt{3} / 4 = 65 \sqrt{3} / 4.

For the other, we get (81194)3/4=673/4(81-1-9-4) \sqrt{3} / 4 = 67 \sqrt{3} / 4.

The positive difference between these is 3/2\sqrt{3} / 2.

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.