Solving Recurrence Relation: a_n+3a_{n-1}-10a_{n-2}=2^n

Mentallic
Homework Helper
Messages
3,802
Reaction score
95

Homework Statement


a_n+3a_{n-1}-10a_{n-2}=2^n


The Attempt at a Solution


I missed the lectures that addressed how to solve these kinds of problems, and while studying my recommended textbook it only went as far as solving recurrence relations that are equal to 0 as opposed to 2n. I understand how to solve the simple recurrence relations but I have no clue as to what to do with these.

Also, if you may, can you please explain any special cases that I should be looking for?

For example,

a_n+2a_{n-1}+a_{n-2}=0 would need to be handled differently because of the double root associated with it.
 
Physics news on Phys.org
This should be transformable into a homogenous recurrence though it might be a bit messy. Consider 2n+1-2n = 2n
 
Sorry but I'm going to need a little more than that, this is my first time answering questions of this form.
 
a_{n} + 3a_{n-1} - 10a_{n-2} - (a_{n-1} + 3a_{n-2} - 10a_{n-3}) = 2^{n} - 2^{n-1} = 2^{n-1}

also 2^{n-1} = a_{n-1} + 3a_{n-2} - 10a_{n-3}

so a_{n} + 2a_{n-1} -13a_{n-2} + 10a_{n-3} = a_{n-1} + 3a_{n-2} - 10a_{n-3}
or a_{n} + a_{n-1} - 16a_{n-2} + 20a_{n-3} = 0

This is a homogenous recurrence and should be solvable.
 
Oh thank you so much! I hadn't actually looked at the exponent of 2n in that way. This was very helpful :smile:
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top