## Section 2.4 Solving Recurrence Relations

###### Investigate!

Consider the recurrence relation

What sequence do you get if the initial conditions are \(a_0 = 1\text{,}\) \(a_1 = 2\text{?}\) Give a closed formula for this sequence.

What sequence do you get if the initial conditions are \(a_0 = 1\text{,}\) \(a_1 = 3\text{?}\) Give a closed formula.

What if \(a_0 = 2\) and \(a_1 = 5\text{?}\) Find a closed formula.

We have seen that it is often easier to find recursive definitions than closed formulas. Lucky for us, there are a few techniques for converting recursive definitions to closed formulas. Doing so is called solving a recurrence relation. Recall that the recurrence relation is a recursive definition without the initial conditions. For example, the recurrence relation for the Fibonacci sequence is \(F_n = F_{n-1} + F_{n-2}\text{.}\) (This, together with the initial conditions \(F_0 = 0\) and \(F_1 = 1\) give the entire recursive *definition* for the sequence.)

###### Example 2.4.1.

Find a recurrence relation and initial conditions for \(1, 5, 17, 53, 161, 485\ldots\text{.}\)

Finding the recurrence relation would be easier if we had some context for the problem (like the Tower of Hanoi, for example). Alas, we have only the sequence. Remember, the recurrence relation tells you how to get from previous terms to future terms. What is going on here? We could look at the differences between terms: \(4, 12, 36, 108, \ldots\text{.}\) Notice that these are growing by a factor of 3. Is the original sequence as well? \(1\cdot 3 = 3\text{,}\) \(5 \cdot 3 = 15\text{,}\) \(17 \cdot 3 = 51\) and so on. It appears that we always end up with 2 less than the next term. Aha!

So \(a_n = 3a_{n-1} + 2\) is our recurrence relation and the initial condition is \(a_0 = 1\text{.}\)

We are going to try to *solve* these recurrence relations. By this we mean something very similar to solving differential equations: we want to find a function of \(n\) (a closed formula) which satisfies the recurrence relation, as well as the initial condition.^{ 2 } Just like for differential equations, finding a solution might be tricky, but checking that the solution is correct is easy.

###### Example 2.4.2.

Check that \(a_n = 2^n + 1\) is a solution to the recurrence relation \(a_n = 2a_{n-1} - 1\) with \(a_1 = 3\text{.}\)

First, it is easy to check the initial condition: \(a_1\) should be \(2^1 + 1\) according to our closed formula. Indeed, \(2^1 + 1 = 3\text{,}\) which is what we want. To check that our proposed solution satisfies the recurrence relation, try plugging it in.

That's what our recurrence relation says! We have a solution.

Sometimes we can be clever and solve a recurrence relation by inspection. We generate the sequence using the recurrence relation and keep track of what we are doing so that we can see how to jump to finding just the \(a_n\) term. Here are two examples of how you might do that.

Telescoping refers to the phenomenon when many terms in a large sum cancel out—so the sum “telescopes.” For example:

because every third term looks like: \(2 + -2 = 0\text{,}\) and then \(3 + -3 = 0\) and so on.

We can use this behavior to solve recurrence relations. Here is an example.

###### Example 2.4.3.

Solve the recurrence relation \(a_n = a_{n-1} + n\) with initial term \(a_0 = 4\text{.}\)

To get a feel for the recurrence relation, write out the first few terms of the sequence: \(4, 5, 7, 10, 14, 19, \ldots\text{.}\) Look at the difference between terms. \(a_1 - a_0 = 1\) and \(a_2 - a_1 = 2\) and so on. The key thing here is that the difference between terms is \(n\text{.}\) We can write this explicitly: \(a_n - a_{n-1} = n\text{.}\) Of course, we could have arrived at this conclusion directly from the recurrence relation by subtracting \(a_{n-1}\) from both sides.

Now use this equation over and over again, changing \(n\) each time:

Add all these equations together. On the right-hand side, we get the sum \(1 + 2 + 3 + \cdots + n\text{.}\) We already know this can be simplified to \(\frac{n(n+1)}{2}\text{.}\) What happens on the left-hand side? We get

This sum telescopes. We are left with only the \(-a_0\) from the first equation and the \(a_n\) from the last equation. Putting this all together we have \(-a_0 + a_n = \frac{n(n+1)}{2}\) or \(a_n = \frac{n(n+1)}{2} + a_0\text{.}\) But we know that \(a_0 = 4\text{.}\) So the solution to the recurrence relation, subject to the initial condition is

(Now that we know that, we should notice that the sequence is the result of adding 4 to each of the triangular numbers.)

The above example shows a way to solve recurrence relations of the form \(a_n = a_{n-1} + f(n)\) where \(\sum_{k = 1}^n f(k)\) has a known closed formula. If you rewrite the recurrence relation as \(a_n - a_{n-1} = f(n)\text{,}\) and then add up all the different equations with \(n\) ranging between 1 and \(n\text{,}\) the left-hand side will always give you \(a_n - a_0\text{.}\) The right-hand side will be \(\sum_{k = 1}^n f(k)\text{,}\) which is why we need to know the closed formula for that sum.

However, telescoping will not help us with a recursion such as \(a_n = 3a_{n-1} + 2\) since the left-hand side will not telescope. You will have \(-3a_{n-1}\)'s but only one \(a_{n-1}\text{.}\) However, we can still be clever if we use iteration.

We have already seen an example of iteration when we found the closed formula for arithmetic and geometric sequences. The idea is, we *iterate* the process of finding the next term, starting with the known initial condition, up until we have \(a_n\text{.}\) Then we simplify. In the arithmetic sequence example, we simplified by multiplying \(d\) by the number of times we add it to \(a\) when we get to \(a_n\text{,}\) to get from \(a_n = a + d + d + d + \cdots + d\) to \(a_n = a + dn\text{.}\)

To see how this works, let's go through the same example we used for telescoping, but this time use iteration.

###### Example 2.4.4.

Use iteration to solve the recurrence relation \(a_n = a_{n-1} + n\) with \(a_0 = 4\text{.}\)

Again, start by writing down the recurrence relation when \(n = 1\text{.}\) This time, don't subtract the \(a_{n-1}\) terms to the other side:

Now \(a_2 = a_1 + 2\text{,}\) but we know what \(a_1\) is. By substitution, we get

Now go to \(a_3 = a_2 + 3\text{,}\) using our known value of \(a_2\text{:}\)

We notice a pattern. Each time, we take the previous term and add the current index. So

Regrouping terms, we notice that \(a_n\) is just \(a_0\) plus the sum of the integers from \(1\) to \(n\text{.}\) So, since \(a_0 = 4\text{,}\)

Of course in this case we still needed to know formula for the sum of \(1,\ldots,n\text{.}\) Let's try iteration with a sequence for which telescoping doesn't work.

###### Example 2.4.5.

Solve the recurrence relation \(a_n = 3a_{n-1} + 2\) subject to \(a_0 = 1\text{.}\)

Again, we iterate the recurrence relation, building up to the index \(n\text{.}\)

It is difficult to see what is happening here because we have to distribute all those 3's. Let's try again, this time simplifying a bit as we go.

Now we simplify. \(a_0 = 1\text{,}\) so we have \(3^n + \langle\text{stuff}\rangle\text{.}\) Note that all the other terms have a 2 in them. In fact, we have a geometric sum with first term \(2\) and common ratio \(3\text{.}\) We have seen how to simplify \(2 + 2\cdot 3 + 2 \cdot 3^2 + \cdots + 2\cdot 3^{n-1}\text{.}\) We get \(\frac{2-2\cdot 3^n}{-2}\) which simplifies to \(3^n - 1\text{.}\) Putting this together with the first \(3^n\) term gives our closed formula:

Iteration can be messy, but when the recurrence relation only refers to one previous term (and maybe some function of \(n\)) it can work well. However, trying to iterate a recurrence relation such as \(a_n = 2 a_{n-1} + 3 a_{n-2}\) will be way too complicated. We would need to keep track of two sets of previous terms, each of which were expressed by two previous terms, and so on. The length of the formula would grow exponentially (double each time, in fact). Luckily there happens to be a method for solving recurrence relations which works very well on relations like this.

### Subsection The Characteristic Root Technique

Suppose we want to solve a recurrence relation expressed as a combination of the two previous terms, such as \(a_n = a_{n-1} + 6a_{n-2}\text{.}\) In other words, we want to find a function of \(n\) which satisfies \(a_n - a_{n-1} - 6a_{n-2} = 0\text{.}\) Now iteration is too complicated, but think just for a second what would happen if we *did* iterate. In each step, we would, among other things, multiply a previous iteration by 6. So our closed formula would include \(6\) multiplied some number of times. Thus it is reasonable to guess the solution will contain parts that look geometric. Perhaps the solution will take the form \(r^n\) for some constant \(r\text{.}\)

The nice thing is, we know how to check whether a formula is actually a solution to a recurrence relation: plug it in. What happens if we plug in \(r^n\) into the recursion above? We get

Now solve for \(r\text{:}\)

so by factoring, \(r = -2\) or \(r = 3\) (or \(r = 0\text{,}\) although this does not help us). This tells us that \(a_n = (-2)^n\) is a solution to the recurrence relation, as is \(a_n = 3^n\text{.}\) Which one is correct? They both are, unless we specify initial conditions. Notice we could also have \(a_n = (-2)^n + 3^n\text{.}\) Or \(a_n = 7(-2)^n + 4\cdot 3^n\text{.}\) In fact, for any \(a\) and \(b\text{,}\) \(a_n = a(-2)^n + b 3^n\) is a solution (try plugging this into the recurrence relation). To find the values of \(a\) and \(b\text{,}\) use the initial conditions.

This points us in the direction of a more general technique for solving recurrence relations. Notice we will always be able to factor out the \(r^{n-2}\) as we did above. So we really only care about the other part. We call this other part the characteristic equation for the recurrence relation. We are interested in finding the roots of the characteristic equation, which are called (surprise) the characteristic roots.

###### Characteristic Roots.

Given a recurrence relation \(a_n + \alpha a_{n-1} + \beta a_{n-2} = 0\text{,}\) the characteristic polynomial is

giving the characteristic equation:

If \(r_1\) and \(r_2\) are two distinct roots of the characteristic polynomial (i.e., solutions to the characteristic equation), then the solution to the recurrence relation is

where \(a\) and \(b\) are constants determined by the initial conditions.

###### Example 2.4.6.

Solve the recurrence relation \(a_n = 7a_{n-1} - 10 a_{n-2}\) with \(a_0 = 2\) and \(a_1 = 3\text{.}\)

Rewrite the recurrence relation \(a_n - 7a_{n-1} + 10a_{n-2} = 0\text{.}\) Now form the characteristic equation:

and solve for \(x\text{:}\)

so \(x = 2\) and \(x = 5\) are the characteristic roots. We therefore know that the solution to the recurrence relation will have the form

To find \(a\) and \(b\text{,}\) plug in \(n =0\) and \(n = 1\) to get a system of two equations with two unknowns:

Solving this system gives \(a = \frac{7}{3}\) and \(b = -\frac{1}{3}\) so the solution to the recurrence relation is

Perhaps the most famous recurrence relation is \(F_n = F_{n-1} + F_{n-2}\text{,}\) which together with the initial conditions \(F_0 = 0\) and \(F_1= 1\) defines the Fibonacci sequence. But notice that this is precisely the type of recurrence relation on which we can use the characteristic root technique. When you do, the only thing that changes is that the characteristic equation does not factor, so you need to use the quadratic formula to find the characteristic roots. In fact, doing so gives the third most famous irrational number, \(\varphi\text{,}\) the golden ratio.

Before leaving the characteristic root technique, we should think about what might happen when you solve the characteristic equation. We have an example above in which the characteristic polynomial has two distinct roots. These roots can be integers, or perhaps irrational numbers (requiring the quadratic formula to find them). In these cases, we know what the solution to the recurrence relation looks like.

However, it is possible for the characteristic polynomial to have only one root. This can happen if the characteristic polynomial factors as \((x - r)^2\text{.}\) It is still the case that \(r^n\) would be a solution to the recurrence relation, but we won't be able to find solutions for all initial conditions using the general form \(a_n = ar_1^n + br_2^n\text{,}\) since we can't distinguish between \(r_1^n\) and \(r_2^n\text{.}\) We are in luck though:

###### Characteristic Root Technique for Repeated Roots.

Suppose the recurrence relation \(a_n = \alpha a_{n-1} + \beta a_{n-2}\) has a characteristic polynomial with only one root \(r\text{.}\) Then the solution to the recurrence relation is

where \(a\) and \(b\) are constants determined by the initial conditions.

Notice the extra \(n\) in \(bnr^n\text{.}\) This allows us to solve for the constants \(a\) and \(b\) from the initial conditions.

###### Example 2.4.7.

Solve the recurrence relation \(a_n = 6a_{n-1} - 9a_{n-2}\) with initial conditions \(a_0 = 1\) and \(a_1 = 4\text{.}\)

The characteristic polynomial is \(x^2 - 6x + 9\text{.}\) We solve the characteristic equation

by factoring:

so \(x =3\) is the only characteristic root. Therefore we know that the solution to the recurrence relation has the form

for some constants \(a\) and \(b\text{.}\) Now use the initial conditions:

Since \(a = 1\text{,}\) we find that \(b = \frac{1}{3}\text{.}\) Therefore the solution to the recurrence relation is

Although we will not consider examples more complicated than these, this characteristic root technique can be applied to much more complicated recurrence relations. For example, \(a_n = 2a_{n-1} + a_{n-2} - 3a_{n-3}\) has characteristic polynomial \(x^3 - 2 x^2 - x + 3\text{.}\) Assuming you see how to factor such a degree 3 (or more) polynomial you can easily find the characteristic roots and as such solve the recurrence relation (the solution would look like \(a_n = ar_1^n + br_2^n + cr_3^n\) if there were 3 distinct roots). It is also possible that the characteristics roots are complex numbers.

However, the characteristic root technique is only useful for solving recurrence relations in a particular form: \(a_n\) is given as a linear combination of some number of previous terms. These recurrence relations are called linear homogeneous recurrence relations with constant coefficients. The “homogeneous” refers to the fact that there is no additional term in the recurrence relation other than a multiple of \(a_j\) terms. For example, \(a_n = 2a_{n-1} + 1\) is *non-homogeneous* because of the additional constant 1. There are general methods of solving such things, but we will not consider them here, other than through the use of telescoping or iteration described above.

### Exercises Exercises

###### 1.

Find the next two terms in \((a_n)_{n\ge 0}\) beginning \(3, 5, 11, 21, 43, 85\ldots\text{.}\) Then give a recursive definition for the sequence. Finally, use the characteristic root technique to find a closed formula for the sequence.

171 and 341. \(a_n = a_{n-1} + 2a_{n-2}\) with \(a_0 = 3\) and \(a_1 = 5\text{.}\) Closed formula: \(a_n = \frac{8}{3}2^n + \frac{1}{3}(-1)^n\text{.}\) To find this solve the characteristic equation, \(x^2 - x - 2 = 0\text{,}\) to get characteristic roots \(x = 2\) and \(x=-1\text{.}\) Then solve the system

###### 2.

Consider the sequences \(2, 5, 12, 29, 70, 169, 408,\ldots\) (with \(a_0 = 2\)).

Describe the rate of growth of this sequence.

Find a recursive definition for the sequence.

Find a closed formula for the sequence.

If you look at the sequence of differences between terms, and then the sequence of second differences, the sequence of third differences, and so on, will you ever get a constant sequence? Explain how you know.

###### 3.

Solve the recurrence relation \(a_n = a_{n-1} + 2^n\) with \(a_0 = 5\text{.}\)

Use telescoping or iteration.

\(a_n = 3 + 2^{n+1}\text{.}\) We should use telescoping or iteration here. For example, telescoping gives

which sums to \(a_n - a_0 = 2^{n+1} - 2\) (using the multiply-shift-subtract technique from Section 3.2 for the right-hand side). Substituting \(a_0 = 5\) and solving for \(a_n\) completes the solution.

###### 4.

Show that \(4^n\) is a solution to the recurrence relation \(a_n = 3a_{n-1} + 4a_{n-2}\text{.}\)

We claim \(a_n = 4^n\) works. Plug it in: \(4^n = 3(4^{n-1}) + 4(4^{n-2})\text{.}\) This works - just simplify the right-hand side.

###### 5.

Find the solution to the recurrence relation \(a_n = 3a_{n-1} + 4a_{n-2}\) with initial terms \(a_0 = 2\) and \(a_1 = 3\text{.}\)

By the Characteristic Root Technique. \(a_n = 4^n + (-1)^n\text{.}\)

###### 6.

Find the solution to the recurrence relation \(a_n = 3a_{n-1} + 4a_{n-2}\) with initial terms \(a_0 = 5\) and \(a_1 = 8\text{.}\)

\(a_n = \frac{13}{5} 4^n + \frac{12}{5} (-1)^n\text{.}\)

###### 7.

###### 8.

Suppose that \(r^n\) and \(q^n\) are both solutions to a recurrence relation of the form \(a_n = \alpha a_{n-1} + \beta a_{n-2}\text{.}\) Prove that \(c\cdot r^n + d \cdot q^n\) is also a solution to the recurrence relation, for any constants \(c, d\text{.}\)

###### 9.

Think back to the magical candy machine at your neighborhood grocery store. Suppose that the first time a quarter is put into the machine 1 Skittle comes out. The second time, 4 Skittles, the third time 16 Skittles, the fourth time 64 Skittles, etc.

Find both a recursive and closed formula for how many Skittles the

*n*th customer gets.Check your solution for the closed formula by solving the recurrence relation using the Characteristic Root technique.

###### 10.

Let \(a_n\) be the number of \(1 \times n\) tile designs you can make using \(1 \times 1\) squares available in 4 colors and \(1 \times 2\) dominoes available in 5 colors.

First, find a recurrence relation to describe the problem. Explain why the recurrence relation is correct (in the context of the problem).

Write out the first 6 terms of the sequence \(a_1, a_2, \ldots\text{.}\)

Solve the recurrence relation. That is, find a closed formula for \(a_n\text{.}\)

\(a_n = 4a_{n-1} + 5a_{n-2}\text{.}\)

4, 21, 104, 521, 2604, 13021

\(a_n = \frac{5}{6} 5^n + \frac{1}{6}(-1)^n \text{.}\)

###### 11.

You have access to \(1 \times 1\) tiles which come in 2 different colors and \(1\times 2\) tiles which come in 3 different colors. We want to figure out how many different \(1 \times n\) path designs we can make out of these tiles.

Find a recursive definition for the sequence \(a_n\) of paths of length \(n\text{.}\)

Solve the recurrence relation using the Characteristic Root technique.

###### 12.

Solve the recurrence relation \(a_n = 2a_{n-1} - a_{n-2}\text{.}\)

What is the solution if the initial terms are \(a_0 = 1\) and \(a_1 = 2\text{?}\)

What do the initial terms need to be in order for \(a_9 = 30\text{?}\)

For which \(x\) are there initial terms which make \(a_9 = x\text{?}\)

We have characteristic polynomial \(x^2 - 2x + 1\text{,}\) which has \(x = 1\) as the only repeated root. Thus using the characteristic root technique for repeated roots, the general solution is \(a_n = a + bn\) where \(a\) and \(b\) depend on the initial conditions.

- \(a_n = 1 + n\text{.}\)
For example, we could have \(a_0 = 21\) and \(a_1 = 22\text{.}\)

For every \(x\text{.}\) Take \(a_0 = x-9\) and \(a_1 = x-8\text{.}\)

###### 13.

Consider the recurrence relation \(a_n = 4a_{n-1} - 4a_{n-2}\text{.}\)

Find the general solution to the recurrence relation (beware the repeated root).

Find the solution when \(a_0 = 1\) and \(a_1 = 2\text{.}\)

Find the solution when \(a_0 = 1\) and \(a_1 = 8\text{.}\)