Solving Linear Recurrences
Use the characteristic equation.
Key idea
Use the characteristic equation.
In depth
For aₙ = c₁aₙ₋₁ + c₂aₙ₋₂, solve the characteristic equation r² = c₁r + c₂. Distinct roots r₁, r₂ give aₙ = Ar₁ⁿ + Br₂ⁿ; a repeated root r gives (A + Bn)rⁿ. Match initial values to find A and B.
Worked example
aₙ = 5aₙ₋₁ − 6aₙ₋₂, a₀ = 1, a₁ = 4: roots 2, 3; aₙ = A·2ⁿ + B·3ⁿ with A + B = 1 and 2A + 3B = 4, so B = 2, A = −1 and aₙ = 2·3ⁿ − 2ⁿ.
Formula
Real-world uses
- Finding a formula for a sequence in finance, biology and algorithm analysis
Common mistake
Forgetting the n factor for repeated roots.
How to learn this
- Read the key idea and say it in your own words.
- Work through the worked example, then try a similar problem.
- Use the interactive lesson’s visual and mini-quiz to check the pattern.
Frequently asked questions
What is Solving Linear Recurrences?
Use the characteristic equation. It is a topic at the expert level in Discrete Math & Number Theory.
What is the formula for Solving Linear Recurrences?
The key formula is r² = r + 1.
Where is Solving Linear Recurrences used in real life?
Real-world examples: Finding a formula for a sequence in finance, biology and algorithm analysis.
What should I learn before Solving Linear Recurrences?
Make sure you are comfortable with Recurrence Relations, the previous topic in Discrete Math & Number Theory.
What is a common mistake with Solving Linear Recurrences?
Forgetting the n factor for repeated roots.
How can I practise Solving Linear Recurrences?
Open the interactive lesson, play with the visual, then answer the three-question mini-quiz. Getting two right marks the topic complete.
What comes after Solving Linear Recurrences?
Move on to Closed Form of Fibonacci (Binet) next.
Related expert topics in Discrete Math & Number Theory
- Strong Induction – Assume all earlier cases to prove the next.
- Well-Ordering Principle – Every nonempty set of positive integers has a least element.
- Partial Orders – Reflexive, antisymmetric, transitive relations.
- Cardinality of Sets – Comparing sizes of infinite sets.
- Countable and Uncountable Sets – ℕ and ℚ are countable; ℝ is not.
- Cantor’s Diagonal Argument – Proof that real numbers are uncountable.