Steply

Solve a_n = 2a_(n-1) + 3a_(n-2), a_0 = 2, a_1 = 2

Step by step, with the reason for every step · Second-order recurrences · Discrete Math

Step by step

The question

Question: solve aₙ = 2aₙ₋₁ + 3aₙ₋₂, with a₀ = 2 and a₁ = 2.

an = 2an − 1 + 3an − 2, a0 = 2, a1 = 2

1 Everything on one side

Move everything to one side.

Each term changes its sign when it moves.

an − 2an − 1 − 3an − 2 = 0

2 The characteristic equation

Powers are good at this: try aₙ = x to the n, for some number x.

try an = xn

Put x to the n in for aₙ, x to the n minus 1 for aₙ₋₁, and so on.

xn − 2xn − 1 − 3xn − 2 = 0

Divide everything by x to the n minus 2: the powers drop to 2, 1 and 0.

This is the characteristic equation.

x2 − 2x − 3 = 0
÷ xn − 2 on both sides

Careful!

Watch the signs.

The terms moved to the left, so their signs changed.

Careful: not x2 − 2x + 3 = 0 ✗

3 Solve it

Factor: we need two numbers that multiply to −3 and add to −2: 1 and −3.

(x + 1)(x − 3) = 0
1 × (−3) = −3, 1 + (−3) = −2

So x = −1 or x = 3.

x = −1 or 3

4 The general form

Each root gives a power that works.

Any mix of them works too: A times −1 to the n, plus B times 3 to the n.

an = A × (−1)n + B × 3n

5 Use the start values

n = 0: every power to the 0 is 1.

So A + B = 2.

A + B = 2 ①

n = 1: −1A + 3B = 2.

−A + 3B = 2 ②

From equation 1: A = 2 − B.

A = 2 − B

Put it into equation 2.

-1(2 − B) + 3B = 2

Open the bracket.

−2 + 1B + 3B = 2

Like terms: 4B.

−2 + 4B = 2

Take away −2 on both sides.

4B = 4

Divide by 4: B = 1.

B = 1

And A = 2 minus B, that is 1.

A = 2 − 1 = 1

So aₙ = (−1)ⁿ + 3ⁿ.

an = (−1)n + 3n

6 Check

Check a₂.

The rule: 2 times 2, plus 3 times 2: 10.

rule: a2 = 2 × 2 + 3 × 2 = 10

The formula with n = 2 gives 10 too.

Right!

formula: a2 = 10

Let's look back.

First: everything on one side.

Then: the characteristic equation.

Then: solve it.

Then: the general form.

Then: use the start values.

Last: check.

Answer
an = (−1)n + 3n

Your turn

Try this one yourself, then check:

Solve an5an − 1 − 6an − 2, a0 = 3, a1 = 8
Show the answer
an = 2n + 2 × 3n

More from Second-order recurrences

The whole lesson: Second-order recurrences →