GeometryDifficulty 5.8AIME, harderProve itUnited States
Problem:
Wesyu is a farmer, and she's building a cao (a relative of the cow) pasture. She starts with a triangle A0A1A2 where angle A0 is 90∘, angle A1 is 60∘, and A0A1 is 1. She then extends the pasture. First, she extends A2A0 to A3 such that A3A0=21A2A0 and the new pasture is triangle A1A2A3. Next, she extends A3A1 to A4 such that A4A1=61A3A1. She continues, each time extending AnAn−2 to An+1 such that An+1An−2=2n−21AnAn−2. What is the smallest K such that her pasture never exceeds an area of K?
Solution
Solution:
Answer: 3
First, note that for any i, after performing the operation on triangle AiAi+1Ai+2, the resulting pasture is triangle Ai+1Ai+2Ai+3. Let Ki be the area of triangle AiAi+1Ai+2. From An+1An−2=2n−21AnAn−2 and AnAn+1=AnAn−2+An−2An+1, we have AnAn+1=(1+2n−21)AnAn−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 An−2An−1An be AnAn−2, its area is Kn−2=21hAnAn−2. The area of triangle An−1AnAn+1 is Kn−1=21hAnAn+1. The h's are equal because the distance from An−1 to the base does not change.
We now have Kn−2Kn−1=AnAn−2AnAn+1=1+2n−21=2n−22n−1. Therefore, K0K1=23, K0K2=K1K2K0K1=67⋅23=47, K0K3=K2K3K0K2=1415⋅47=815.
We see the pattern K0Kn=2n2n+1−1, which can be easily proven by induction. As n approaches infinity, K0Kn grows arbitrarily close to 2, so the smallest K such that the pasture never exceeds an area of K is 2K0=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.