Chapter 5 (I)
INDUCTION AND
RECURSION
MAT1217 ADVANCED MATHEMATICS
Objectives
The main objective of this chapter is to introduce recursion.
Besides, this chapter will also introduce the method of proof by
induction.
Learning Outcomes:
By the end of this chapter, students will be able to apply the
principles of mathematical induction and recursion.
Sequences
A sequence is a list of numbers in a particular order.
In general, a sequence is denoted by:
A sequence can be defined by giving a formula for the
general term in terms of the variable .
Sequences
Examples:
2, 4, 6, 8, 10, 12, …
3, 5, 7, 9, 11, 13, …
0.2, 0.9, 1.6, 2.3, 3.0, …
1, 4, 9 ,16, 25, 36, …
0, 1, 0, 1, 0, 1, …
Recurrence Relation
Another way to express a sequence is to specify how is related
to its predecessors called the recurrence relation together
with some initial conditions.
Example:
Sequence Recurrence relation Initial conditions
Even numbers
Geometric
Fibonacci
Fibonacci Sequence
Non- recursive formula:
Example
Find the recursive and non-recursive definition for the following
sequence:
Try this
Find the recursive and non-recursive definition for the
sequence:
2, 7, 12, 17, 22, 27, …
Example
Given the following recurrence relation and initial conditions,
for all integers
and
find .
Try this
Given the following recurrence relation and initial conditions,
for all integers
and
find .
Try this
Evaluate and for the following recursively defined sequences:
(a)
(b)
Solving Linear Recurrence
In this part, we will look into a method that can be
used to find a non-recursive formula for provided
that is defined by a recurrence of a particular form
called “homogeneous second-order linear with
constant coefficients”.
Second-order Linear Homogeneous
Recurrence Relation with Constant Coefficients
A second-order linear homogeneous recurrence
relation with constant coefficients is a recurrence
relation of the form:
for all integers some fixed integer,
where A, B, and C are real number constants.
Remarks
Second- order refers to the fact that the expression for is
expressed in terms of the previous two terms of the sequence.
Linear refers to the fact that the highest power of is . For
example, the recurrence relation doesn’t involve .
Homogeneous refers to the fact that the right-hand side is zero
(no constant term)
Constant coefficients refers to the fact that and are fixed real
numbers that do not depend on .
Example
State whether each of the following is a second-order linear
homogeneous recurrence relation with constant coefficients:
a)
b)
c)
d)
e)
f)
g)
h)
Finding explicit formulas for
second-order relations
We are looking for an explicit formula of the form for some
number of .
A sequence satisfies the second-order linear homogeneous
recurrence relation iff
We say that is the characteristic equation of the recurrence.
Finding explicit formulas for
second-order relations
If the equation has two distinct roots, and , then the explicit
formula for is given by
If the equation has only one root, , then the explicit formula for
is given by
where D and E are the numbers whose values are determined by the
values of initial conditions.
Example
Find the general solution of the recurrence , given , .
Step 1: Write it in the form
Step 2: Let
Step 3: Form the characteristic equation of the recurrence
by taking out the common factor of
Example
Find the general solution of the recurrence , given , .
Step 4: Solve for the root(s).
Step 5: General form
Distinct roots :
Same root :
Step 6: Substitute the initial conditions to obtain D and E
Step 7: Solution of the recurrence
Try this
Find the solution of the recurrence for which and .
Try this
Solve the recurrence with initial conditions and .
Try this
Solve the recurrence with initial conditions and .
Thank You
