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

Click For Summary

Homework Help Overview

The problem involves solving a recurrence relation of the form a_n + 3a_{n-1} - 10a_{n-2} = 2^n, which includes a non-homogeneous term. Participants are exploring methods to approach this type of recurrence relation.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • The original poster expresses uncertainty about solving non-homogeneous recurrence relations, particularly after missing relevant lectures. They inquire about special cases and methods for handling such problems.
  • Some participants suggest transforming the relation into a homogeneous form, while others note the complexity involved in this process.
  • One participant seeks further clarification, indicating a need for more detailed guidance.
  • Another participant provides a manipulation of the original equation, leading to a new homogeneous relation, which they believe is solvable.

Discussion Status

Contextual Notes

The original poster has missed lectures that would have covered the necessary techniques for solving this type of problem, which may impact their understanding. There is also a mention of different handling for specific cases of recurrence relations, indicating a need for clarification on these points.

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:
 

Similar threads

Replies
8
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
3
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
12
Views
2K
Replies
3
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K