Recursive Sequence
Uploaded by
nzoborRecursive Sequence
Uploaded by
nzoborNAU 07212: LINEAR ALGEBRA AND DISCREET
MATHEMATICS
Rosemary Jasson Nzobo ([email protected])
Dar-es-Salaam Maritime Institute (DMI)
April 2024
Contents
1 Recursive Sequence and Induction. 2
1.1 Sequence. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2 Recursive Sequence. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.3 Mathematical Induction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1
1. Recursive Sequence and Induction.
1.1 Sequence.
Definition 1.1.1. A sequence is an arrangement of numbers in a definite order according to
some rule.
A sequence can be defined by giving an explicit formula for its nth term. For example, a sequence
1, 3, 5, 7, . . . can be represented explicitly as an = 2n − 1, n ≥ 1.
Exercise 1.1.2. Sequence
1. Represent the sequence 7, 14, 28, 56, . . . explicitly.
(−1)n
2. Write the first 5 terms of the sequence represented by the formula an = n+1
.
1.2 Recursive Sequence.
Another way to define a sequence is to use recurrence relation which is similar to the principle of
mathematical induction. Recurrence relation defines each later term in the sequence by reference
to earlier terms (induction step) and also one or more initial values for the sequence (basis step).
A recursive rule gives the beginning term(s) of a sequence and a recursive equation that tells how
an is related to one or more preceding terms.
Example 1.2.1. Recall the arithmetic and geometric progression.
1. The recursive equation for arithmetic progression with common difference d is an = an−1 +d.
2. The recursive equation for geometric progression with common ratio r is gn = gn−1 r.
Exercise 1.2.2. Recursive sequence.
1. Define a sequence a0 , a1 , a2 , . . . recursively as follows: For all integers k ≥ 2,
ak = ak−1 − 2ak−2 + 1 Recurrence relation
a0 = 1 and a1 = 2 Initial conditions
Find a3 , a4 , a5 and a6 .
2. Write an explicit rule for each of the following recursive rule.
(a) a1 = 25, an = an−1 − 10.
(b) a1 = 6, an = −0.5an−1 .
(c) a1 = 13, an = −3an−1 .
(d) a1 = −2, an = 9an−1 .
2
Section 1.2. Recursive Sequence. Page 3
3. Write a recursive rule for each of the following explicit rule.
(a) an = −2n + 3.
(b) an = −3(2)n−1 .
(c) an = −81( 32 )n−1 .
4. Write a recursive rule and an explicit rule for each of the following sequences.
(a) The first term of a sequence is 9. Each term of the sequence is 11 more than the
preceding term.
(b) The first term of a sequence is 32. Each term of the sequence is half the preceding
term.
(c) The first term of a sequence is −3. Each term of the sequence is −3 times the
preceding term.
(d) The first term of a sequence is −7. Each term of the sequence is −9 less than the
preceding term.
Solving recurrence relation by iteration
Definition 1.2.3. Suppose an is a sequence that satisfies a certain recurrence relation and initial
conditions. An explicit formula for an called a solution to the recurrence relation.
Iteration method is the basic method for finding an explicit formula (solution) for a recursively
defined sequence.
Given a sequence a0 , a1 , a2 , . . . an be a sequence defined by a recurrence relation and initial
conditions, iteration method requires one to start from the initial conditions, calculate successive
terms of the sequence until a pattern is developed and use the obtained pattern to guess an
explicit formula.
Example 1.2.4. Consider the sequence an = 2an−1 + 1, n ≥ 2, n1 = 1. To solve this sequence
by iteration, we have:
a1 =1
a2 = 2(1) + 2 = 21 + 1
a3 = 2(21 + 1) + 1 = 22 + 21 + 1
a4 = 2(22 + 21 + 1) + 1 = 23 + 22 + 21 + 1
..
.
an = 2n−1 + 2n−2 +· · · + 22 + 21 + 1
which is a geometric series with r = 2.
a1 (rn −1) 1(2n −1)
From Sn = r−1
, an = 2−1
= 2n − 1.
Therefore, the solution to the given recurrence relation is an = 2n − 1 for all integers n ≥ 1.
Section 1.3. Mathematical Induction. Page 4
Since iteration method involves guessing of a formula from established patterns, it is easy to
make a mistake. We check the correctness of the obtained explicit formula by the method of
mathematical induction.
1.3 Mathematical Induction.
Theorem 1.3.1 (Principle of mathematical induction). Let an be a statement with variable n.
1. The initial step: Show that an is true for initial condition(s).
2. Inductive step: Prove that if an is true for n = k, then it must also be true for n = k + 1.
Example 1.3.2. We use mathematical induction to check the correctness of the explicit formula
obtained in Example 1.2.4.
Initial step: 2an−1 + 1 = 2n − 1, LHS: a1 = 1 (Given) and RHS a1 = 21 − 1 = 1 hence an is
true for initial conditions.
Inductive step: Suppose that an is true for an arbitrary integer k i.e ak = 2k − 1. We want to
show that an is true for n = k + 1.
From an = 2an−1 + 1,
ak+1 = 2ak + 1
= 2(2k − 1) + 1
= 2k+1 − 1
Also from an = 2n − 1, we have ak+1 = 2k+1 − 1. Since the basis and inductive steps have been
proved, it follows by mathematical induction that the given formula holds for all integers n ≥ 1.
