Skip to main content

2008 AMC 12B Problem 24

Problem 24 of 25HarderAlgebraGeometry

Let A0=(0,0).A_0 = (0, 0). Distinct points A1,A_1, A2,A_2, \ldots lie on the xx-axis, and distinct points B1,B_1, B2,B_2, \ldots lie on the graph of y=x.y = \sqrt{x}. For every positive integer n,n, An1BnAnA_{n-1}B_nA_n is an equilateral triangle. What is the least nn for which the length A0An100?A_0A_n \ge 100?

Answer choices

Show solution

Solution

Let an=A0Ana_n = A_0A_n and cn=anan1c_n = a_n - a_{n-1} be the base of the nnth equilateral triangle. Its apex BnB_n lies above the midpoint at height 32cn,\tfrac{\sqrt3}{2}c_n, and being on y=xy = \sqrt{x} gives (32cn)2=an1+cn2, \left(\tfrac{\sqrt3}{2}c_n\right)^2 = a_{n-1} + \tfrac{c_n}{2}, i.e. 34cn2=an1+cn2. \tfrac34 c_n^2 = a_{n-1} + \tfrac{c_n}{2}. Writing the same relation for the previous triangle and subtracting gives cn=cn1+23,c_n = c_{n-1} + \tfrac23, and with c1=23c_1 = \tfrac23 we get cn=2n3.c_n = \tfrac{2n}{3}. Summing, an=k=1n2k3=n(n+1)3. a_n = \sum_{k=1}^n \frac{2k}{3} = \frac{n(n + 1)}{3}. We need n(n+1)3100,\tfrac{n(n + 1)}{3} \ge 100, i.e. n(n+1)300.n(n + 1) \ge 300. Since 1617=27216 \cdot 17 = 272 and 1718=306,17 \cdot 18 = 306, the least such nn is 17.17. Thus, the correct answer is C.

More practice

Concepts: recursion · equilateral triangle · summation

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.