Difference between revisions of "2008 AMC 12B Problems/Problem 24"
|Line 20:||Line 20:|
Revision as of 22:02, 20 July 2020
Let . Distinct points lie on the -axis, and distinct points lie on the graph of . For every positive integer is an equilateral triangle. What is the least for which the length ?
Let . We need to rewrite the recursion into something manageable. The two strange conditions, 's lie on the graph of and is an equilateral triangle, can be compacted as follows: which uses , where is the height of the equilateral triangle and therefore times its base.
The relation above holds for and for , so Or, This implies that each segment of a successive triangle is more than the last triangle. To find , we merely have to plug in into the aforementioned recursion and we have . Knowing that is , we can deduce that .Thus, , so . We want to find so that . is our answer.
Consider two adjacent equilateral triangles obeying the problem statement. For each, drop an altitude to the axis and denote the resulting heights and . From 30-60-90 rules, the difference between the base of these altitudes is
But the square root curve means that this distance is also expressible as (the coordinates are the squares of the heights). Setting these expressions equal and dividing throughout by leaves . So the difference in height of successive triangles is , meaning their bases are wider and wider each time. From here, one can proceed as in Solution 1 to arrive at .
|2008 AMC 12B (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25|
|All AMC 12 Problems and Solutions|
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.