Math 2300 Recursive Sequences

Goal: An introduction to the idea of recursively defined sequences, meaning: sequences where each
term is defined by a formula involving the previous term (or terms).

1. Sometimes sequences can be described recursively in addition to their more familiar explicit
forms.

(a) Consider the sequence defined by a1 = 5, an = an−1 + 3. Write down the first 5 terms
of the sequence. Identify what type of sequence it is, and find an explicit formula for an .

Solution: The first few terms of the sequence are 5, 8, 11, 14, 17. There is a common
difference between the terms, so it is an arithmetic sequence. The formula will be linear,
an = 5 + 3(n − 1) = 2 + 3n.

(b) Now look at the sequence defined by a1 = 3, an = 2an−1 . Write down the first 5 terms
of the sequence. Identify what type of sequence it is, and find an explicit formula for an .

Solution: The first few terms of the sequence are 3, 6, 12, 24, 48. There is a common
ratio between the terms, so it is a geometric sequence. The formula will be linear,
an = 3 · 2n−1 .

(c) Now look at the sequence defined by a1 = 5, an = nan−1 . Write down the first 5 terms
of the sequence. Identify what type of sequence it is, and find an explicit formula for an .

Solution: The first few terms of the sequence are 5, 10, 30, 120, 600. To get from one
term to the next, I’m multiplying by the next integer. This is like the factorial sequence,
except that I started with 5 instead of 1. an = 5 · n!.

2. A sequence that is increasing and bounded above must converge. A sequence that is decreasing
and bounded below also must converge. Draw a picture and explain intuitively why this must
be so.

Solution: A sequence that is increasing keeps climbing, but if it is bounded above it runs
out of room and eventually must settle down on something. In fact, it converges to its
least upper bound. Similarly, decreasing sequences that are bounded below converge to their
greatest lower bound.

1
Math 2300 Recursive Sequences

3. Suppose that the sequence an converges and that lim an = L. Does the sequence an+1
n→∞
converge, and if so what is lim an+1 ? Explain.
n→∞

Solution: The sequence an+1 is essentially the same sequence as an , it is just one step
ahead. So their end behavior is the same, their limit must be the same. So lim an+1 = L,
n→∞
too.

√ √
4. Consider the recursive sequence defined by a1 = 2, an+1 = 2 + an

(a) Write out the first 4 terms, and calculate their approximate values.

√
Solution:
p √a1 = 2 ≈ 1.414
a2 = q2 + 2 ≈ 1.848
p √
a3 = 2 + 2 + 2 ≈ 1.961
r
√
q p
a4 = 2 + 2 + 2 + 2 ≈ 1.990

(b) Every term in thisrsequence is bounded above by 2. For example, let’s look at a4 .
√ √
q p q p
Explain why a4 = 2 + 2 + 2 + 2 < 2 + 2 + 2 + 2, then simplify to show
a4 < 2.
r
√ √
q p
Solution: Replacing the innermost 2 with a 2 in a4 = 2 + 2 + 2 + 2 in-
r
√ √
q p q p
creases its size. So a4 = 2 + 2 + 2 + 2 < 2 + 2 + 2 + 2. When we sim-
plify,
q the expression collapses for us, giving
√ √ √ √ √ √
p q p p p
2+ 2+ 2+2 = 2+ 2+ 4 = 2+ 2+2 = 2+ 4 = 2+2 = 4 =
2. So a4 < 2. This simplification works for any n, giving us an < 2. To show this
rigorously, we use proof by induction, a technique taught in Discrete Mathematics.

(c) Now show that an is increasing by showing that an+1 > an . You’ll need to use the fact
that 2 > an .
√ √ √ √
an+1 = 2 + an > an + an = 2an > an · an = an

(d) Explain why an must converge.

Solution: We showed an is bounded above by 2 and an is increasing, so an must
converge

2
Math 2300 Recursive Sequences

(e) Now we will figure out what it converges to. Let’s give a name to its limit, lim an = L.
n→∞
Take the limit of both sides of the equation below, and solve for L.
√
an+1 = 2 + an

Solution: √
lim an+1 = lim 2 + an
n→∞ n→∞
q
L= lim (2 + an )
n→∞
√
L= 2+L
L2 = 2 + L
L2 − L − 2 = 0
(L − 2)(L + 1) = 0
So L = 2 or L = −1. But L must be positive. So L = 2.
5. Here’s another recursively defined sequence {Fn }, called the sequence of Fibonacci numbers
(which are purported to show up in nature, science, art, architecture, etc.):
F1 = 1, F2 = 1, F3 = F1 + F2 = 1 + 1 = 2, F4 = F2 + F3 = 1 + 2 = 3, . . . ,
Fn = Fn−2 + Fn−1 .
That is, the first two terms are by definition set equal to 1, and each subsequent term is the
sum of the previous two.

(a) Compute and write down, F5 , F6 , F7 , F8 , F9 , and F10 .

Solution: 5, 8, 13, 21, 34, 55

(b) Does lim Fn look like it exists? If so, what do you think this limit is? If not, why not?
n→∞

Solution: It doesn’t look like it; it looks like lim Fn = ∞.

n→∞

(c) Now let’s look at the sequence {Rn } of ratios of successive Fibonacci numbers:
F2 1 F3 2 F4 3
R1 = = = 1, R2 = = = 2, R3 = = = 1.5,
F1 1 F2 1 F3 2
F5 5 Fn+1
R4 = = = 1.666 . . . , Rn = .
F4 3 Fn
Find the approximate value of R5 , R6 , R7 , R8 , and R9 .

Solution: 1.6, 1.625, 1.61538, 1.61905, 1.61765

3
Math 2300 Recursive Sequences

(d) Does lim Rn look like it exists? If so, what do you think this limit is? If not, why not?
n→∞

Solution: It looks like the limit is about 1.62.

(e) Let’s assume for now that lim Rn exists and is non-zero: let’s denote this limit by L.
n→∞
We’re going to sneakily compute L. Here’s how: start with the equation
Fn = Fn−2 + Fn−1
defining the Fibonacci numbers. Divide both sides by Fn−1 . This should give you an
equation relating Rn−1 and Rn−2 . Write down a simplified version of this equation.

Solution:
1
Rn−1 = + 1.
Rn−2

(f) Now, take the limit of both sides of your above equation. What equation do you get,
in terms of the limit L? (Hint: if the Rn ’s have a limit, then whatever they tend to as
n → ∞, Rn−1 and Rn−2 should tend to the same thing.)
Solution:
1
L= + 1.
L

(g) Now, solve your above equation for L. (Some hints: (a) you may want to first do some
algebra, and then apply the quadratic formula. (b) This will give you two possible
solutions; why can you disregard one of them?)
Solution: The equation becomes (multiplying both sides by L):

L2 = 1 + L

which has solution √

1± 5
L= .
2
But the limit must be positive (since all the terms are), so
√
1+ 5
L= ≈ 1.618.
2

∞
X 1
(h) Does the series converge or diverge?
Fn
n=1
1
Fn+1 Fn 1 1
Solution: Use the ratio test. lim = lim = lim ≈ ≈ .618 < 1.
n→∞ 1 n→∞ Fn+1 n→∞ Rn 1.618
Fn
So by the ratio test the series converges absolutely.