INDUCTION & RECURSION

CHAPTER 6

AZLINAJUMADI_MARCH2018
 SEQUENCE
• A Sequence is a list of things (usually numbers) that are in order.

• a1 = 1 st term, a2 = 2nd term, a3 = 3rd term, …, an = the nth term

 SUMMATIONS
• Summations or series are the sum of some or all terms in a sequence. 
• Given the sequence: a1, a2, …, an, …. The corresponding summation is
a1 + a2 + … + an + …
•  However, insteadn of writing: a1 + a2 + a3 + a4 + …, we'll write:

a
i m
i  am  am 1  ...  an
• The variable i is referred to as the index of summation.
• m is the lower limit and n is the upper limit of the summation.
 SUMMATIONS
• Example: Given a sequence 1, 4, 9, 16, 25, …. Write the given sequences in
summation symbol. Hence, find: i ai Pattern
1 1 1²
a) the 3rd term, 9
2 4 2²
b) the 8th term, 64 n

i
3 9 3²
2
c) the n term.
th
n² 4 16 4²
i 1 5 25 5²
… … …
n an n²
 SUMMATIONS
• Example: Given a sequence 1, 3, 5, 7, 9, …. Write the given sequences in summation
symbol. Hence, find: i ai Pattern
a) the 3rd term, 1 1 2(1)-1
5 2 3 2(2)-1
b) the 6th term, 11 n 3 5 2(3)-1
c) the nth term. 2n - 1
 2i  1
i 1
4
5
7
9
2(4)-1
2(5)-1
… … …
n an 2(n)-1
 SUMMATIONS
• Example: Write the given sequences below in summation symbol.
  𝑛
𝑖 −1
a) 1, 2, 4, 8, 16, … ∑2
𝑖=1

  𝑛
b) 3, 5, 7, 9, … ∑ 2 𝑖+1
𝑖=1
 SUMMATIONS
• Example:
  Find the first four terms for the following sequence. Hence, find their summations.
 𝑛
−1 𝑖
∑ 𝑖
𝑖=1
( )
a1 =  = -1
a2 =  = -1 + + +
a3 =  =
a4 =  =
 CONJECTURE
• A conjecture is a mathematical statement that has not yet been rigorously
proved.
• Conjectures arise when one notices a pattern that holds true for many
cases. However, just because a pattern holds true for many cases does not
mean that the pattern will hold true for all cases.
• Conjectures must be proved for the mathematical observation to be fully
accepted. When a conjecture is rigorously proved, it becomes a theorem.
 CONJECTURE
Find the conjecture for the following sequence: 1, 4, 9, 16, 25, …
i Summation Form Another Form
1 1 1 1²
 𝑛
2 4 1+3 2² 2

3 9 1+3+5 3²
Conjecture: ∑ ( 2 𝑖 −1 )=𝑛
𝑖=1
4 16 1+3+5+7 4²   for all integers .
5 25 1+3+5+7+9 5²
… … …
n 1+3+5+7+9+…+(2n-1) n²
 CONJECTURE
Find the conjecture for the following sequence: 2, 6, 12, 20, 30, …
i Summation Form Another Form
1 2 2
  𝑛
2 6 2+4 Conjecture:
3 12 2+4+6 ∑ 2 𝑖=𝑛 ( 𝑛+1 )
𝑖=1
4 20 2+4+6+8   for all integers .
5 30 2+4+6+8+10
… … …
n 2+4+6+8+10+…+(2n)
 CONJECTURE
Find the conjecture for the following sequence: 1, 3, 7, 15, 31, …
i Summation Form Another Form
Conjecture:
1 1 1
  𝑛
2 3 1+2
𝑖 −1 𝑛
3
4
7
15
1+2+4
1+2+4+8
∑ (2 ) =2 −1  
𝑖=1
5 31 1+2+4+8+16
  for all integers .
… … …
n 1+2+4+8+16+…+()
 MATHEMATICAL INDUCTION
• Mathematical Induction is a special way of proving things.
• It has only 2 steps.
• Step 1. Show it is true for the first one
• Step 2. Show that if any one is true then the next one is true
• Then all are true
 MATHEMATICAL INDUCTION
• Mathematically:
1) Define P(n)
2) Step 1. P(1) is true.
3) Define P(k). Assume P(k) is true.
4) Step 2. Prove P(k+1) is also true.
5) Therefore, P(n) is true.
 MATHEMATICAL INDUCTION
•  Example:
Use the principle of mathematical Induction to prove that the statement
below is true for all integers .
 MATHEMATICAL INDUCTION
•  Example:
Use principle of mathematical induction to prove that the conjecture
below is true for .
 MATHEMATICAL INDUCTION
•  Example:
Use the principle of mathematical Induction to prove that the following
conjecture is true for all .
Hence, evaluate .
 RECURSIVE
• Sometimes it is possible to define an object (function, sequence,
algorithm, structure) in terms of itself. This process is called recursion.
 RECURSIVE
•  Example:
Given the following sequence:

  a) List the first four terms of sequence. -2, -4, -6, -8, …
b) Give the recursive formula for that sequence.
𝟏 =− 𝟐 , 𝒂 𝒏 =𝒂 𝒏 −𝟏 − 𝟐 , 𝒏 ≥ 𝟐 , 𝒏 ∈ 𝒁
+¿ ¿
 𝒂
 RECURSIVE
•  Example:
Find the recursive formula for the following sequence.

𝟏 =𝟎 . 𝟐𝟓 , 𝒂𝒏 =− 𝟐 𝒂 𝒏− 𝟏 , 𝒏 ≥ 𝟐 ,𝒏 ∈ 𝒁
+¿ ¿
 𝒂
 RECURSIVE
•  Example:
The integer sequence is defined recursively by:

a) List the first

4
four terms of the sequence. 4, 11, 25, 53, …
 
b) Compute ∑ 𝑎𝑖 . 93
𝑖=1
 RECURSIVE
•  Example:
Given a recursive sequence where

List the first five terms.

-5, 7, -9, 11, -13, …