Maths Olympiad Prep

Library / /68 of 84

, 2013

Geometry Difficulty 5.8 AIME, harder Prove it United States

Problem:

Wesyu is a farmer, and she's building a cao (a relative of the cow) pasture. She starts with a triangle A0A1A2A_{0} A_{1} A_{2} where angle A0A_{0} is 9090^{\circ}, angle A1A_{1} is 6060^{\circ}, and A0A1A_{0} A_{1} is 11. She then extends the pasture. First, she extends A2A0A_{2} A_{0} to A3A_{3} such that A3A0=12A2A0A_{3} A_{0} = \frac{1}{2} A_{2} A_{0} and the new pasture is triangle A1A2A3A_{1} A_{2} A_{3}. Next, she extends A3A1A_{3} A_{1} to A4A_{4} such that A4A1=16A3A1A_{4} A_{1} = \frac{1}{6} A_{3} A_{1}. She continues, each time extending AnAn2A_{n} A_{n-2} to An+1A_{n+1} such that An+1An2=12n2AnAn2A_{n+1} A_{n-2} = \frac{1}{2^{n} - 2} A_{n} A_{n-2}. What is the smallest KK such that her pasture never exceeds an area of KK?

Solution

Solution:

Answer: 3\sqrt{3}

First, note that for any ii, after performing the operation on triangle AiAi+1Ai+2A_{i} A_{i+1} A_{i+2}, the resulting pasture is triangle Ai+1Ai+2Ai+3A_{i+1} A_{i+2} A_{i+3}. Let KiK_{i} be the area of triangle AiAi+1Ai+2A_{i} A_{i+1} A_{i+2}. From An+1An2=12n2AnAn2A_{n+1} A_{n-2} = \frac{1}{2^{n} - 2} A_{n} A_{n-2} and AnAn+1=AnAn2+An2An+1A_{n} A_{n+1} = A_{n} A_{n-2} + A_{n-2} A_{n+1}, we have AnAn+1=(1+12n2)AnAn2A_{n} A_{n+1} = \left(1 + \frac{1}{2^{n} - 2}\right) A_{n} A_{n-2}.

We also know that the area of a triangle is half the product of its base and height, so if we let the base of triangle An2An1AnA_{n-2} A_{n-1} A_{n} be AnAn2A_{n} A_{n-2}, its area is Kn2=12hAnAn2K_{n-2} = \frac{1}{2} h A_{n} A_{n-2}. The area of triangle An1AnAn+1A_{n-1} A_{n} A_{n+1} is Kn1=12hAnAn+1K_{n-1} = \frac{1}{2} h A_{n} A_{n+1}. The hh's are equal because the distance from An1A_{n-1} to the base does not change.

We now have Kn1Kn2=AnAn+1AnAn2=1+12n2=2n12n2\frac{K_{n-1}}{K_{n-2}} = \frac{A_{n} A_{n+1}}{A_{n} A_{n-2}} = 1 + \frac{1}{2^{n} - 2} = \frac{2^{n} - 1}{2^{n} - 2}. Therefore, K1K0=32\frac{K_{1}}{K_{0}} = \frac{3}{2}, K2K0=K2K1K1K0=7632=74\frac{K_{2}}{K_{0}} = \frac{K_{2}}{K_{1}} \frac{K_{1}}{K_{0}} = \frac{7}{6} \cdot \frac{3}{2} = \frac{7}{4}, K3K0=K3K2K2K0=151474=158\frac{K_{3}}{K_{0}} = \frac{K_{3}}{K_{2}} \frac{K_{2}}{K_{0}} = \frac{15}{14} \cdot \frac{7}{4} = \frac{15}{8}.

We see the pattern KnK0=2n+112n\frac{K_{n}}{K_{0}} = \frac{2^{n+1} - 1}{2^{n}}, which can be easily proven by induction. As nn approaches infinity, KnK0\frac{K_{n}}{K_{0}} grows arbitrarily close to 22, so the smallest KK such that the pasture never exceeds an area of KK is 2K0=32 K_{0} = \sqrt{3}.

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.