Wednesday, 10 September 2014

sequences and series - How to find the general formula for this recursive problem?



I want to ask about recursive problem.




Given: a0=11,a1=13,

and an=an1+2an2.



What is the general formula for an

?



I've already tried to find the first terms of this series. From there, I got:



a2=35,a3=61,

and a4=131.



From there, I think I need to use the rule from arithmetic and geometric series to find the general formula that I want to find.




But, I cannot find the certain pattern from this series, because the differences is always changing, such that -24, 48, -96, 192.



From there I think the general formula for a_n should be including (-1)ⁿ. But, how can we deal with series 24,48,96,192?



It seems the series is geometric, but how can we find the formula?



Thanks


Answer



Linear Recurrence Equations have typical solutions an=λn. Using this, we can compute the possible values of λ for this equation from
λn=λn1+2λn2


which means, assuming λ0, that
λ2+λ2=0

This is the characteristic polynomial for the recurrence
an=an2+2an2




The characteristic polynomial is x2+x2 which has roots 1 and 2. Thus, the sequence is an=b(1)n+c(2)n. Plugging in the values for n=0 and n=1 gives
an=3+8(2)n


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...