Question #176585

Find the general solution of the recurrence relation:

 an = an-1 + 2an-2 ,  with a0 = 2 and a1 = 7.


1
Expert's answer
2021-03-30T13:34:28-0400

Let us find the solution of the recurrence relation an=an1+2an2a_n = a_{n-1} + 2a_{n-2} ,  with a0=2a_0 = 2 and a1=7a_1 = 7. Let us solve the characteristic equation k2=k+2k^2=k+2 which is equivalent to k2k2=0k^2-k-2=0, and hence by Vieta's formulas has the solutions k1=1k_1=-1 and k2=2.k_2=2. It follows that the solution of the equation is an=C1(1)n+C22n.a_n=C_1\cdot (-1)^n+C_2\cdot 2^n. Since a0=2a_0 = 2 and a1=7a_1 = 7, we have that 2=a0=C1+C22=a_0=C_1+C_2 and 7=C1+2C2.7=-C_1+2C_2. Therefore, C2=3C_2=3 and C1=1.C_1=-1. We conclude that an=(1)n+1+32n.a_n=(-1)^{n+1}+3\cdot 2^n.



Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS