Skip to main content

2024 AMC 12A Problem 21

Problem 21 of 25HarderAlgebra

Suppose that a1=2a_1=2 and the sequence (an)(a_n) satisfies the recurrence relation an1n1=an1+1(n1)+1 \frac{a_n-1}{n-1}=\frac{a_{n-1}+1}{(n-1)+1} for all n2.n\ge2. What is the greatest integer less than or equal to n=1100an2? \sum_{n=1}^{100}a_n^2?

Answer choices

Show solution

Solution

The recurrence rearranges to an=1+n1n(an1+1).a_n=1+\tfrac{n-1}{n}(a_{n-1}+1). Computing early terms 2,52,103,174,2,\tfrac52,\tfrac{10}3,\tfrac{17}4,\ldots suggests an=n+1n.a_n=n+\tfrac1n. This follows by induction: substituting an1=n1+1n1a_{n-1}=n-1+\tfrac1{n-1} into the recurrence gives an=1+n1n(n+1n1)a_n=1+\tfrac{n-1}{n}(n+\tfrac1{n-1}) =n+1n.=n+\tfrac1n. Then an2=n2+2+1n2,a_n^2=n^2+2+\tfrac1{n^2}, so n=1100an2=n=1100n2+200+n=11001n2=338350+200+S, \begin{aligned} &\sum_{n=1}^{100}a_n^2 \\ &=\sum_{n=1}^{100}n^2+200 \\ &\quad {}+\sum_{n=1}^{100}\frac1{n^2} \\ &=338350+200+S, \end{aligned} where S>1S\gt1 and S<1+1x2dx=2.S\lt1+\int_1^\infty x^{-2}\,dx=2. Hence the sum is between 338551338551 and 338552,338552, and its floor is 338551.338551. Thus, the correct answer is B.

More practice

Concepts: recursion · sum of first n squares · bounding to limit cases

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