Olympiad Maths Prep

Track / Stage 5 / 290 of 400 #890 of 2000

Problem 890

AIME late
Algebra Difficulty 5.7 Find the answer

Example 3.13 Solve the recurrence relation
{an=5an16an2+n+2(n2),a0=274,a1=494. \left\{\begin{array}{l} a_{n}=5 a_{n-1}-6 a_{n-2}+n+2 \quad(n \geqslant 2), \\ a_{0}=\frac{27}{4}, \quad a_{1}=\frac{49}{4} . \end{array}\right.

Official solution

The characteristic equation of the recurrence relation
an=5an16an2(n2) a_{n}=5 a_{n-1}-6 a_{n-2} \quad(n \geqslant 2)

is x25x+6=0x^{2}-5 x+6=0, with characteristic roots x1=2,x2=3x_{1}=2, x_{2}=3. Therefore, the general solution is
an=c12n+c23n. a_{n}=c_{1} \cdot 2^{n}+c_{2} \cdot 3^{n} .

Since (3.7) does not have a characteristic root equal to 1, the recurrence relation
an=5an16an2+n+2(n2) a_{n}=5 a_{n-1}-6 a_{n-2}+n+2 \quad(n \geqslant 2)

has a particular solution an=An+Ba_{n}=A n+B, where AA and BB are constants to be determined. Substituting into (3.8) yields
An+B=5[A(n1)+B]6[A(n2)+B]+n+2, \begin{aligned} A n+B= & 5[A(n-1)+B]- \\ & 6[A(n-2)+B]+n+2, \end{aligned}

simplifying to
2An+2B7A=n+2, 2 A n+2 B-7 A=n+2,

so
{2A=12B7A=2 \left\{\begin{array}{l} 2 A=1 \\ 2 B-7 A=2 \end{array}\right.

Solving these, we get A=12,B=114A=\frac{1}{2}, B=\frac{11}{4}. Thus,
an=c12n+c23n+12n+114, a_{n}=c_{1} \cdot 2^{n}+c_{2} \cdot 3^{n}+\frac{1}{2} n+\frac{11}{4},

where c1,c2c_{1}, c_{2} are constants to be determined. Using the initial conditions, we have
{c1+c2+114=274,2c1+3c2+12+114=494. \left\{\begin{array}{l} c_{1}+c_{2}+\frac{11}{4}=\frac{27}{4}, \\ 2 c_{1}+3 c_{2}+\frac{1}{2}+\frac{11}{4}=\frac{49}{4} . \end{array}\right.

Solving these, we get c1=3,c2=1c_{1}=3, c_{2}=1. Therefore,
an=32n+3n+12n+114(n0). a_{n}=3 \cdot 2^{n}+3^{n}+\frac{1}{2} n+\frac{11}{4} \quad(n \geqslant 0) .

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.