Steply

Solve a_n = 7a_(n-1) - 12a_(n-2), a_0 = 0, a_1 = 1

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

Step by step

The question

Question: solve aₙ = 7aₙ₋₁ − 12aₙ₋₂, with a₀ = 0 and a₁ = 1.

an = 7an − 1 − 12an − 2, a0 = 0, a1 = 1

1 Everything on one side

Move everything to one side.

Each term changes its sign when it moves.

an − 7an − 1 + 12an − 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 − 7xn − 1 + 12xn − 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 − 7x + 12 = 0
÷ xn − 2 on both sides

Careful!

Watch the signs.

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

Careful: not x2 − 7x − 12 = 0 ✗

3 Solve it

Factor: we need two numbers that multiply to 12 and add to −7: −3 and −4.

(x − 3)(x − 4) = 0
(−3) × (−4) = 12, (−3) + (−4) = −7

So x = 3 or x = 4.

x = 3 or 4

4 The general form

Each root gives a power that works.

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

an = A × 3n + B × 4n

5 Use the start values

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

So A + B = 0.

A + B = 0 ①

n = 1: 3A + 4B = 1.

3A + 4B = 1 ②

From equation 1: A = 0 − B.

A = 0 − B

Put it into equation 2.

3(0 − B) + 4B = 1

Open the bracket.

0 − 3B + 4B = 1

Like terms: B.

0 + B = 1

Take away 0 on both sides.

B = 1

And A = 0 minus B, that is −1.

A = 0 − 1 = −1

So aₙ = −3ⁿ + 4ⁿ.

an = −3n + 4n

6 Check

Check a₂.

The rule: 7 times 1, minus 12 times 0: 7.

rule: a2 = 7 × 1 − 12 × 0 = 7

The formula with n = 2 gives 7 too.

Right!

formula: a2 = 7

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 = −3n + 4n

Your turn

Try this one yourself, then check:

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

More from Second-order recurrences

The whole lesson: Second-order recurrences →