Discrete

Mathematics
Recurrence
Relation

Dr. Nelson K.
Bii
Discrete Mathematics
Recurrence Relation

Dr. Nelson K. Bii

13/09/2021

Institute of Mathematical Sciences, Strathmore University

 Recurrence Relation

Discrete
Mathematics
Recurrence Definition:
Relation

Dr. Nelson K. A recurrence relation is an equation that recursively

Bii
defines a sequence where the next term is a function of
the previous terms.
A recurrence relation for the sequence {an } is an equation
that expresses an in terms of one or more of the previous
terms of the sequence i.e. a0 , a1 , a2 , · · · , an−1 for all
integers n such that n ≥ n0 where n0 is a non-negative
integer.
A sequence is called a solution of a recurrence relation
if its terms satisfy the recurrence relation.
The start-up values for a sequence of a recurrence relation
are called the initial conditions.
 Recurrence Relation contd...

Discrete
Mathematics
Recurrence
Relation

Dr. Nelson K.
Example 1:
Bii Let {an } be a sequence that satisfies the recurrence relation
an = an−1 − an−2 for n = 2, 3, 4, · · · . Suppose that a0 = 3 and
a1 = 5, find a2 and a3 .
Solution:
From an = an−1 − an−2
If n = 2; a2 = a(2−1) − a(2−2) =⇒ a2 = a1 − a0
a1 = 5, a0 = 3 ∴ a2 = 5 − 3 = 2
Similarly, a3 = a(3−1) − a(3−2) =⇒ a3 = a2 − a1
a2 = 2, a1 = 5 ∴ a3 = 2 − 5 = −3
 Recurrence Relation contd...

Discrete
Mathematics
Recurrence
Relation

Dr. Nelson K.
Bii

Example 2:
(a) Determine whether the sequence {an } is a solution of the
recurrence relation an = 2an−1 − an−2 for n = 2, 3, 4, · · ·
where an = 2n for every non-negative integer n.
(b) Answer the same question where an = 5 and
 Recurrence Relation contd...

Discrete
Mathematics
Recurrence
Relation

Dr. Nelson K. Solution 2 (a):

Bii
an = 2n , if n = 0 → a0 = 20 = 1
n = 1 → a1 = 21 = 2, n = 2 → a2 = 22 = 4
From an = 2an−1 − an−2
Let n = 2;
a2 = 2a2−1 − a2−2 = 2a1 − a0 =⇒ a2 = 2(2) − 1 = 3
a2 = 3 6= a2 = 4;
3 6= a2 (since a2 = 4)
∴ an = 2n is not a solution to the recurrence relation.
 Recurrence Relation contd...

Discrete
Mathematics
Recurrence
Relation

Dr. Nelson K.
Bii Solution 2 (b):
an = 5,

2an−1 − an−2 = 2[5 − 1] − (5 − 2)

= (10 − 2) − 3 = 8 − 3 = 5 =⇒ an = 5

∴ each and every term = 5

2an−1 − an−2 = 2(5) − 5 = 5 = an
∴ an = 5 is a solution to the recurrence relation.
 Exercise

Discrete
Mathematics
Recurrence
Relation

Dr. Nelson K.
Bii

Determine whether the sequence {an } is a solution of the

recurrence relation an = 2an−1 − an−2 for n = 2, 3, 4, · · · where
an = 3n for every non-negative integer n.
 Recurrence Relation contd...

Discrete
Mathematics
Recurrence Example 3:
Relation

Dr. Nelson K.
Suppose that a person invests $ 10, 000 in a savings account at
Bii a bank yielding 11% p.a with interest compounded annually.
How much will be in the account after 30 years?
Solution:
Let Pn = the amount in the account after n years
Amount at the start of the nth year is the principal
amount plus interest accumulated for (n − 1) years i.e.

Pn = Pn−1 + 0.11Pn−1
= (1 + 0.11)Pn−1
= 1.11Pn−1
 Recurrence Relation contd...

Discrete
Mathematics
Recurrence
Relation

Dr. Nelson K. Solution contd...:

Bii
Simplifying: If
n = 1; P1 = 1.11P1−1 = 1.11P0
n = 2; P2 = 1.11P2−1 = 1.11P1 = 1.11(1.11P0 )
n = 3;
P3 = 1.11P3−1 = 1.11P2 = 1.11(1.112 P0 ) = (1.11)3 P0
In general, Pn = (1.11)n P0 ,
where P0 = $ 10,000 (Principal amount)
∴ P30 = (1.11)30 × 10, 000 = $228, 922.97
 Exercise

Discrete
Mathematics
Recurrence
Relation

Dr. Nelson K.
1 Find if each of the following sequences form a solution to
Bii the recurrence relation an = 8an−1 − 16an−2 :
(a) an = 0 (b) an = 1 (c) an = 2
(d) an = 4n (e) an = n.4n (f) an = n2 .4n
2 A person deposits $ 1000 in an account that yields 9%
interest compounded annually. Set up a recurrence
relation for the amount in the account at the end of n
years. How much will be in the account after 100 years?
3 Assume that the population in the world in 2021 is 6
billion and is growing at the rate of 1.3% a year. What
will be the population in the world in 2050?
 Linear Homogeneous Recurrence Relation

Discrete
Mathematics
Recurrence
Relation A linear homogeneous recurrence relation of order k with
Dr. Nelson K. constant coefficients is a recurrence relation of the form
Bii
an = c1 an−1 + c2 an−2 + · · · + ck an−k where ck 6= 0.
Suppose: n = 0; a0 = c0
n = 1; a1 = c1 a0
n = 2; a2 = c1 a1 + c2 a0
n = 3; a3 = c1 a2 + c2 a1 + c3 a0
Example:
Assume that the deeper population of the country is 1000 at a
time n = 0 and that the increase from time n − 1 to time n is
10% of the size at time n − 1. Write a recurrence relation and
initial conditions that define the deeper population at time n
and hence solve the recurrence relation.
 Linear Homogeneous Recurrence Relation

Discrete
Mathematics
Recurrence Solution:
Relation

Dr. Nelson K.
Let dn = deeper population at time n; at n = 0, d0 = 1000
Bii
The increase from time (n − 1) to time (n) is given by
dn − dn−1 and since this increase is 10% of the size at
time n − 1, we obtain:
dn − dn−1 = 10% of dn−1
dn − dn−1 = 0.1dn−1
dn = 0.1dn−1 + dn−1
dn = 1.1dn−1
If n = 1; d1 = 1.1d0
n = 2; d2 = 1.1d1 = (1.1)(1.1d0 ) = (1.1)2 d0
n = 3; d3 = 1.1d2 = (1.1)(1.1)2 d0 = (1.1)3 d0
In general, dn = (1.1)n d0 =⇒ dn = (1.1)n (1000)