Scribd
Upload
41 views

Unit - 5-DM

The document discusses recurrence relations in discrete mathematics. It covers first order recurrence relations with constant coefficients, solving homogeneous and non-homogeneous relations by substitution, and solving problems involving finding general terms and relations for sequences. Specific topics covered include generating functions, functions of sequences, calculating coefficients, and solving recurrence relations by substitution and generating functions.

Uploaded by

samharisson1986
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views

Unit - 5-DM

The document discusses recurrence relations in discrete mathematics. It covers first order recurrence relations with constant coefficients, solving homogeneous and non-homogeneous relations by substitution, and solving problems involving finding general terms and relations for sequences. Specific topics covered include generating functions, functions of sequences, calculating coefficients, and solving recurrence relations by substitution and generating functions.

Uploaded by

samharisson1986
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

Discrete Mathematics (DM)- (7F302)

Unit 5 - Recurrence relations


5.1. Generating functions
5.2. Function of sequences
5.3. Calculating the Coefficient of Generating Functions
5.5. Solving recurrence relations
5.5.1. By Substitution and
5.5.2. Generating Functions
5.6. Characteristic Roots
5.7. Solution of Inhomogeneous Recurrence Relations

2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 1


5.5. Recurrence relations
Sequences are generally defined by specifying their general terms. Alternatively,
a sequence may be defined by indicating a relation connecting its general term
with one or more of the preceding terms.
A recurrence relation is an equation that recursively defines a sequence where
the next term is a function of the previous terms. (or) The procedure for
finding the terms of a sequence is called the recurrence relation.
The process of determining an from a recurrence relation is called “Solving” of
the relation.
A value an that satisfies a recurrence relation is called “General Solution”
If the values of some particular terms of the sequence are specified, then by
making of use of these values in the general solution we obtain the “Particular
Solution” that uniquely determines the sequence.
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 2
First order Recurrence Relation:
First we consider for solution recurrence relation of the form
an = C an-1 + f(n) for n ≥ 1 -------------------→ (1)
Here C is constant, f(n) is function
Such a relation is called “A linear recurrence relation of first order with
constant coefficients”.
If f(n) = 0 then the relation is called “Homogeneous”. Otherwise, it is called “
Non-homogeneous” or “Inhomogeneous”.
The relation (1) can be solved in a trivial way.
First we note that this relation may be rewritten as ( by changing n to n+1)
an+1 = C an + f(n+1) for n ≥ 0 -------------------→ (2)
For n=0,1,2,3……. This relation yields respectively.

2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 3


a1 = C a0 + f(1)
a2 = C a1 + f(2)
= C { C a0 + f(1) } + f(2)
= C2 a0 + C f(1) + f(2)
a3 = C a2 + f(3)
= C{C2 a0 + C f(1) + f(2) } + f(3)
= C3 a0 + C2 f(1) + C f(2) + f(3)
Examine these, we obtain, by induction
an = Cn a0 + Cn-1 f(1) + Cn-2 f(2) + Cn-3 f(3)+………………..+ C f(n-1) + f(n)

This is the general solution of the recurrence relation (2) which is equivalent
to the relation (1).
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 4
If f(n) = 0, that is, if the recurrence relation is homogeneous.
The solution (3) becomes
an = Cn a0 for n ≥ 1 -------------------→ (4)
The solutions (3) and (4) yield particular solution if a0 is specified.
The specific value of a0 is called the initial solution.

2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 5


Example 1: Solve the Recurrence relation an+1 = 4 an for n>=1 given that a0 = 3

Sol:
Given that the Recurrence relation is an+1 = 4 an for n ≥ 1.
It is homogeneous because f(n) = 0.
It is given that a0 = 3 and C = 4.
The particular solution is
an = Cn a0 for n ≥ 1
Putting this a0 = 3 and C = 4 into particular solution, we get
an = 4n X 3 for n ≥ 1
This is a particular solution of the relation, satisfying the initial condition a0 = 3.

2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 6


Example 2: Solve the Recurrence relation an = 7 an-1 for n ≥ 1 given that a2 = 98.

Sol:
Given that the Recurrence relation may be rewritten as an+1 = 7 an for n ≥ 1.
It is homogeneous because f(n) = 0.
It is given that a2 = 98 and C = 7.
The particular solution is
an = Cn a0 for n ≥ 1
To find a0, 98 = a2 = 72 a0 = 49 a0
Therefore, a0 = 98/49 = 2
Putting this a0 = 2 and C = 7 into particular solution, we get
an = 7n X 2 for n ≥ 1
This is a particular solution of the relation, satisfying the initial condition a2 =
98.
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 7
Example 3: if an is a solution of the Recurrence relation an+1=Kan for n≥ 0,
given that a3 = 153/49 and a5 = 1377/ 2401, what is K.

Sol:
Given that the Recurrence relation may be rewritten as an+1 = K an for n ≥ 0.
It is homogeneous because f(n) = 0.
It is given that a3 = 153/49, a5 = 1377 / 2401 and C = K.
The particular solution is an = Cn a0 for n ≥ 1
To find a0,
a5 = K5 a0 = 1377/ 2401
a3 = K3 a0 = 153/49
a5 K5 a 0
----- = ---------- = K2 = (1377/2401) X (49/153) = 9/49
a3 K3 a 0
Therefore, K = ± (3/7).
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 8
Example 4: Find a12 if an+12 = 5 an2 where an > 0 for n≥ 0, given that a0 = 2.

Sol:
Setting bn = an2 Given Recurrence relation is bn+1 = 5 bn for n ≥ 0.
It is homogeneous because f(n) = 0.
It is given that a0 = 2 and C = 5.
The particular solution is bn = 5n b0 for n ≥ 1
Using b0 = a02 = (2)2 = 4. therefore we get bn = 4 X 5n
Thus we have an2 = 4 X 5n since an > 0 for n ≥ 0
This yields an = 2(√5)n for n ≥ 0
Therefore a12 = 2(√5)12 = 2(5)6 = 31,250

2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 9


Example 5: Solve the recurrence relation an - 3 an-1 = 5 X3n for n≥ 1, given that
a0 = 2.

Sol:
By changing n to n+1
an+1 - 3 an = 5 X3n+1 for n≥ 0,
an+1 = 3 an + f(n+1) where f(n) = 5 X3n
the general solution of non homogeneous relation is

With the given condition a0 = 2, we get


an = 2 X 3n + 3n-1 f(1) + 3n-2 f(2) + 3n-3 f(3) + ……………+ 30 f(n)
Substituting for f(n) n=1,2,3,………..,n this becomes
an = 2 X 3n + 5 X { (3n-1 X 3) + (3n-2 X 32) + (3n-3 X 33)+…….+ (3n-n X 3n)}
an = 2 X 3n + 5 X { (3n X n) = (2 + 5n) 3n this is a required solution
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 10
Example 6: Find the recurrence relation and initial condition for the sequence
2, 10, 50, 250, ……… hence find the general term of the sequence

Sol: th given sequence is <ar> where a0 = 2, a1 = 10, a2 = 50, a3 = 250.


Evidently
a1 = 5 a 0
a2 = 5 a 1
a3 = 5 a 2
From these, we readily note that the recurrence relation for the given sequence
is an = 5 an-1 for n≥ 1 with a0 = 2 as the initial condition
The solution of this relation is an = 5n a0 = 5n X 2 this is the general term of the
given sequence.

2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 11


Example 7: Find the recurrence relation and initial condition for the sequence
0, 2, 6, 12, 20, 30, 42,……. hence find the general term of the sequence

Sol: the given sequence is <ar> where a0 = 0, a1 = 2, a2 = 6, a3 = 12.


Evidently
a1 - a0 = 2-0 = 2
a2 - a1 = 6 – 2 = 4
a3 – a2 = 12 – 6 = 6
a4 – a3 = 20 – 12 = 8
a5 – a4 = 30 – 20 = 10
a6 – a5 = 42 – 30 = 12
……………………….
an – an-1 = 2 X n or an = an-1 + 2 X n for n≥ 1
This is the recurrence relation for the given sequence with a0 = 0 as the initial
condition.
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 12
From this recurrence relation, we note that,
an – an-1 = 2 X n
an-1 – an-2 = 2 X (n-1)
an-2 – an-3 = 2 X (n-2)
an-3 – an-4 = 2 X (n-3)
………………………
………………………
a3 – a2 = 2 X (3)
a2 – a1 = 2 X (2)
a1 – a0 = 2 X (1)
Adding all the above, we get
an – a0 = 2 X {n + (n-1) + (n-2) +……. + 3+ 2+1}
= 2 X n(n+1)/2 = n(n+1)
Or an = n(n+1) - a0 = n(n+1) - 0 = n(n+1) = n2 + n
This is the general term of the given sequence.
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 13
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 14
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 15
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 16
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 17
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 18
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 19
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 20
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 21
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 22
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 23
2/22/2021 D Sreenivasarao-DM-UNIT-5-II CSE-A 24

You might also like