Maths Olympiad Prep

Library / /37 of 71

Algebra Difficulty 5.1 AIME, harder Prove it United States

Problem:

Define a sequence of polynomials as follows: let a1=3x2xa_{1}=3 x^{2}-x, let a2=3x27x+3a_{2}=3 x^{2}-7 x+3, and for n1n \geq 1, let an+2=52an+1ana_{n+2}=\frac{5}{2} a_{n+1}-a_{n}. As nn tends to infinity, what is the limit of the sum of the roots of ana_{n}?

Solution

Solution:

Answer: 133\frac{13}{3} By using standard methods for solving linear recurrences {}2\{ \}^2, we see that this recurrence has a characteristic polynomial of x252x+1=(x12)(x2)x^{2}-\frac{5}{2} x+1=\left(x-\frac{1}{2}\right)(x-2), hence an(x)=c(x)2n+d(x)2na_{n}(x)=c(x) \cdot 2^{n}+d(x) \cdot 2^{-n} for some polynomials cc and dd. Plugging in n=1n=1 and n=2n=2 gives
2c(x)+12d(x)=3x2x 2 c(x)+\frac{1}{2} d(x)=3 x^{2}-x
and
4c(x)+14d(x)=3x27x+3 4 c(x)+\frac{1}{4} d(x)=3 x^{2}-7 x+3
Subtracting the first equation from two times the second equation gives 6c(x)=3x213x+66 c(x)=3 x^{2}-13 x+6, so c(x)=3x213x+66c(x)=\frac{3 x^{2}-13 x+6}{6}. As nn grows large, the c(x)2nc(x) 2^{n} term dominates compared to the d(x)2nd(x) 2^{-n} term, so the roots of an(x)a_{n}(x) converge to the roots of c(x)c(x). Thus the roots of an(x)a_{n}(x) converge to the roots of 3x213x+63 x^{2}-13 x+6, which by Vieta's formula {}3\{ \}^3 have a sum of 133\frac{13}{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.