Recurrence Relationshard
0:00.0

For the recurrence an=c1an1+c2an2a_n = c_1 a_{n-1} + c_2 a_{n-2} with characteristic roots r1=5r_1 = 5 and r2=3r_2 = 3, the general solution is an=A5n+B3na_n = A \cdot 5^n + B \cdot 3^n. For large nn, which term dominates the behavior of the sequence?