Question #349270

Show that the explicit sequence {an} where an= 2n+1





-1 for n > or = to 1 is a





solution of the recurrence relation: an= 3an-1 – 2an-2 , n >or = to 3

1
Expert's answer
2022-06-09T14:00:57-0400

Given an=2n+11,n1.a_n=2^{n+1}-1, n\ge 1.

Then


an1=2n1+11=2n1a_{n-1}=2^{n-1+1}-1=2^n-1

an2=2n2+11=2n11a_{n-2}=2^{n-2+1}-1=2^{n-1}-1

Substitute


3an12an2=3(2n1)2(2n11)3a_{n-1}-2a_{n-2}=3(2^n-1)-2(2^{n-1}-1)

=3(2n)32n+2=2n+11=an,n3=3(2^n)-3-2^n+2=2^{n+1}-1=a_n, n\ge 3

Since the last equation is true, then the explicit sequence {an}\{a_n\} where an=2n+11,n1a_n=2^{n+1}-1, n\ge 1 is a solution of the recurrence relation:


an=3an12an2,n3a_n=3a_{n-1}-2a_{n-2}, n\ge 3


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