0% found this document useful (0 votes)
72 views24 pages

Unit 7. Recurrence Relations.

The document discusses recurrence relations, including first and second order linear recurrence relations, and their solutions. It provides examples of problems involving virus spread and investment growth, demonstrating how to formulate and solve recurrence relations. Additionally, it outlines steps to solve second order homogeneous recurrence relations and presents several exercises for practice.

Uploaded by

JINESH VARIA
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
0% found this document useful (0 votes)
72 views24 pages

Unit 7. Recurrence Relations.

The document discusses recurrence relations, including first and second order linear recurrence relations, and their solutions. It provides examples of problems involving virus spread and investment growth, demonstrating how to formulate and solve recurrence relations. Additionally, it outlines steps to solve second order homogeneous recurrence relations and presents several exercises for practice.

Uploaded by

JINESH VARIA
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

Recurrence Relations

Unit – VII
Prof. Sridhar K.R
1. Introduction.
2. First Order Linear Recurrence Relation
3. Second Order Linear Homogeneous Recurrence Relation
with Constant Coefficients
Recurrence Relations: Sequences are generally defined by specifying their general terms.
Alternately, a sequence may be defined by indicating a relation connecting its general term with one
or more of the preceding terms. In other words, a sequence may be defined by indicating a
relation connecting its general term with etc. Such a relation is called a
for the sequence. The process of finding from a recurrence relation is called
“solving” of a recurrence relation. A value of from a recurrence relation is called its “general
solution”. If the values of some particular terms of the sequence are specified, then by making use of
these values in the general solution, we obtain the “particular solution” that uniquely determines the
sequence.
First order Recurrence Relations:
A recurrence relation of the form is called a first order recurrence relation. Solution of
this recurrence relation is given by
Problem 1. The number of virus affected files in a system is 1000(to begin with) and this increases
250% every two hours. Use a recurrence relation to determine the number of virus affected files in
the system after one day.
Solution:
In the beginning, the number of virus affected files is 1000. We shall denote it by
Let denote the number of virus affected files after hours. Then the number increases by
in next two hours. Thus, after hours, the number is
This is the recurrence relation for the number of virus affected files. Solving this relation, we get,

This gives the number of virus affected files after hours. From this, we get (for ,

Problem 2: A person invests Rs. 10,000/- at 10.5% interest (per year) compounded monthly. Find
and solve a recurrence relation for the value of the investment at the end of months. What is the
value of the investment at the end of first year? How long does it take to double the investment?
Solution:
Since the annual interest is 10.5%, the monthly interest comes to
Let the initial investment. Let denote the value of the investment at the end of
months.
Then

And
This is the required recurrence relation. Solving this recurrence relation, we get,

This gives the value of the investment after months.


Therefore, the value of the investment at the end of one year ( is

Next, we find when

Thus, the value of the investment doubles in about 6years and 8 months.
Second Order Homogeneous Recurrence Relations
A recurrence relation of the form ------------
is called a second order homogeneous recurrence relation.
Working rule to solve
Step1: Write down the auxiliary equation and find the roots .
Step 2: The general solution of is obtained as follows:
Case 1: General solution is if are real and distinct.
Case 2: General solution is if are real and equal.
Case 3: If are complex(imaginary),
then, general solution is
and

Step 4: If initial conditions are given find the values of constants and hence find the particular
solution.
Q 1. Solve the Recurrence Relation 𝑎𝑛 + 𝑎𝑛−1 − 6𝑎𝑛−2 = 0 𝑤𝑖𝑡ℎ 𝑎0 = −1 𝑎𝑛𝑑 𝑎1 = 8.
Q 2. Solve the Recurrence Relation 𝑎𝑛 = 3𝑎𝑛−1 − 2𝑎𝑛−2 𝑤𝑖𝑡ℎ 𝑎1 = 5 𝑎𝑛𝑑 𝑎2 = 3.
Q 3.Solve the Recurrence Relation 2𝑎𝑛 = 7𝑎𝑛−1 − 3𝑎𝑛−2 = 0 𝑤𝑖𝑡ℎ 𝑎0 = 2 𝑎𝑛𝑑 𝑎1 = 5.
Q 4. Solve the Recurrence Relation 𝑎𝑛 − 6𝑎𝑛−1 + 9𝑎𝑛−2 = 0 𝑤𝑖𝑡ℎ 𝑎0 = 5 𝑎𝑛𝑑 𝑎1 = 12.
5
Q 5. Solve the Recurrence Relation 𝑎𝑛 − 4𝑎𝑛−1 + 4𝑎𝑛−2 = 0 𝑤𝑖𝑡ℎ 𝑎0 = 𝑎𝑛𝑑 𝑎1 = 8.
2
Q 6. Solve the Recurrence Relation 𝑎𝑛 + 𝑎𝑛−1 − 6𝑎𝑛−2 = 0 𝑤𝑖𝑡ℎ 𝑎0 = −1 𝑎𝑛𝑑 𝑎1 = 8.
Q 7. Find and solve a Recurrence Relation for the number of binary sequences of length 𝑛 ≥
1 that have no consecutive 0’s.

You might also like