Mathematical

InductionNakib Hayat Chowdhury

Assistant Professor, Dept. of CSE, BAUST

I know I can change my life by changing my attitude. Everyday I am creating a better life by changing my attitude.
 License

Your are free –

• to Share – to copy, distribute and transmit the work
• to Remix – to adapt the work

For non commercial and educational purpose.

 References
Discrete Mathematics and its Applications by Kenneth H. Rosen
• Chapter 4 : Mathematical Reasoning, Induction, and Recursion
• 3.3 : Mathematical Induction
• 3.4 : Recursive Definitions and structural Induction
• 3.5 : Recursive Algorithm
• 3.6 : Program Correctness

Proofs (PPT) by H. Turgut Uyar Ay¸seg¨ ul Gen¸cata Yayımlı Emre Harmanc

Induction (PPT) by Zeph Grunschlag
 Introduction
Problem
What is the formula for the sum of the first n positive odd integers?

When n = 1, 2, 3, 4, 5
• 1=1
• 1+3=4
• 1+3+5=9
• 1 + 3 + 5 + 7 = 16
• 1 + 3 + 5 + 7 + 9 = 25
 Introduction
Problem
What is the formula for the sum of the first n positive odd integers?

When n = 1, 2, 3, 4, 5
• 1=1
From these values it is reasonable to
• 1+3=4 guess that the sum of the first n positive
• 1+3+5=9 odd integers is n2

• 1 + 3 + 5 + 7 = 16 How to prove it?

• 1 + 3 + 5 + 7 + 9 = 25
 Introduction
Problem
What is the formula for the sum of the first n positive odd integers?

When n = 1, 2, 3, 4, 5
• 1=1
From these values it is reasonable to
• 1+3=4 guess that the sum of the first n positive
• 1+3+5=9 odd integers is n2

• 1 + 3 + 5 + 7 = 16 How to prove it?

• 1 + 3 + 5 + 7 + 9 = 25
 Introduction
Problem
What is the formula for the sum of the first n positive odd integers?

When n = 1, 2, 3, 4, 5
• 1=1
From these values it is reasonable to
• 1+3=4 guess that the sum of the first n positive
• 1+3+5=9 odd integers is n2

• 1 + 3 + 5 + 7 = 16 How to prove it?

• 1 + 3 + 5 + 7 + 9 = 25
 Why should we know?

• An extremely important proof technique that can be used to assertions

of this type.
• Is used to prove results about a large variety of discrete objects.
• To prove results about the complexity of algorithms
• The correctness of certain type of computer program
• Theorem about graphs and trees
 Introduction

Extremely important to note

• Mathematical inductions can be used only to prove results
obtained in some other way.
• It is not a tool for discovering formulae or theorem
Illustrations of Mathematical Induction

• People telling secrets

• Fall of Dominos

Let, P(n) be the proposition that domino n is knocked

over.

If P(n)  P(n+1) is true – then all the dominos are

knocked over.
Illustrations of Mathematical Induction
Let sequence of propositions is a sequence of
dominos.

P (0) P (1) P (2) P (n) P (n+1)

L14 11
Illustrations of Mathematical Induction

When the domino falls, the corresponding

proposition is considered true:

P (n)

L14 12
Illustrations of Mathematical Induction
Mathematical Induction
When the domino falls (to right), the corresponding
proposition is considered true:

P (n)
true

L14 13
Illustrations of Mathematical Induction
Mathematical Induction
Suppose that the dominos satisfy two constraints.
1) Well-positioned: If any domino falls (to right),
next domino (to right) must fall also.
P (n) P (n+1)

2) First domino has fallen to right

P (0)
true

L14 14
Illustrations of Mathematical Induction
Mathematical Induction
Suppose that the dominos satisfy two constraints.
1) Well-positioned: If any domino falls to right, the
next domino to right must fall also.
P (n) P (n+1)

2) First domino has fallen to right P (0)

true

L14 15
Illustrations of Mathematical Induction
Mathematical Induction
Suppose that the dominos satisfy two constraints.
1) Well-positioned: If any domino falls to right, the
next domino to right must fall also.

P (n) P (n+1)
true true

2) First domino has fallen to right P (0)

true

L14 16
Illustrations of Mathematical Induction
Mathematical Induction
Then can conclude that all the dominos fall!

P (0) P (1) P (2) P (n) P (n+1)

L14 17
Illustrations of Mathematical Induction
Mathematical Induction
Then can conclude that all the dominos fall!

P (0) P (1) P (2) P (n) P (n+1)

L14 18
Illustrations of Mathematical Induction
Mathematical Induction
Then can conclude that all the dominos fall!

P (1) P (2) P (n) P (n+1)

P (0) …
true

L14 19
Illustrations of Mathematical Induction
Mathematical Induction
Then can conclude that all the dominos fall!

P (2) P (n) P (n+1)

P (0) P (1) …
true true

L14 20
Illustrations of Mathematical Induction
Mathematical Induction
Then can conclude that all the dominos fall!

P (n) P (n+1)

P (0) P (1) P (2) …

true true true

L14 21
Illustrations of Mathematical Induction
Mathematical Induction
Then can conclude that all the dominos fall!

P (n) P (n+1)

P (0) P (1) P (2) …

true true true

L14 22
Illustrations of Mathematical Induction
Mathematical Induction
Then can conclude that all the dominos fall!

P (n+1)

P (0) P (1) P (2) … P (n)

true true true true

L14 23
Illustrations of Mathematical Induction
Mathematical Induction
Then can conclude that all the dominos fall!

P (0) P (1) P (2) … P (n) P (n+1)

true true true true true

L14 24
Illustrations of Mathematical Induction
Mathematical Induction
Principle of Mathematical Induction:
If:
1) [basis] P (0) is true
2) [induction] k P(k)P(k+1) is true

P (0) P (1) P (2) … P (k) P (k+1)

true true true true true

Then:
n P(n) is true
This formalizes what occurred to dominos.
L14 25
 Mathematical Induction
A proof by Mathematical Induction that P(n) is true for every positive integer n consists of
two steps:

• Basic Step: The proposition P(n0) usually P(1) is shown to be true

• Inductive Step: The implication P(k) ⇒ P(k + 1) is shown to be true for
every positive integer k.

• When we complete both steps of a proof. We prove that P(n) is true for
all positive integers n.
• That is we have shown that ∀n P(n) is true
 Mathematical Induction

Theorem
• P(n): a predicate defined on n ∈ Z+
• P(n0) ∧ (∀k ≥ n0 [P(k) ⇒ P(k + 1)]) ⇒ ∀n ≥ n0 P(n)

• P(n0): Base Step

• (∀k ≥ n0 [P(k) ⇒ P(k + 1)) : Induction step
 Mathematical Induction

Theorem : Discrete Mathematics and its Applications by Kenneth H. Rosen

• P(n): a predicate defined on n ∈ Z+
• [P(1) ∧ ∀k P(k) ⇒ P(k + 1)] ⇒ ∀n P(n)
 Introduction Example
Problem: Use mathematical induction to prove that the sum of the first n odd positive
integers in n2
 Answer in the Examination
Q1: Use mathematical induction to prove that the sum of the first n odd positive integers in n2

Answer
Solution: Let P(n) denote the proposition that the sum of the first n odd positive
integers is n2. That is,
P(n) : ∀n ∈ Z+ , [1 + 3 + 5 + · · · + (2n − 1) = n2]
Basic Step: P(1) state that the sum of the first one odd positive integer is 1. This is
true since the sum of the first odd positive integer is 1.
Inductive Step: Suppose that P(k) is true for a positive integer k, that is
1 + 3 + 5 + · · · + (2k − 1) = k2
 Answer in the Examination
Q1: Use mathematical induction to prove that the sum of the first n odd positive integers in n2

Answer……
…….
Now, we have to show that P(k + 1) is true, assuming that P(k) is true. That is we
have to show that
1 + 3 + 5 + · · · + (2k − 1) + (2k + 1) = (k + 1) 2
So, assuming that P(k) is true, it follows that
1 + 3 + 5 + · · · + (2k − 1) + (2k + 1) = [1 + 3 + 5 + · · · + (2k − 1)] + (2k + 1)
 Answer in the Examination
Q1: Use mathematical induction to prove that the sum of the first n odd positive integers in n2

Answer……
…….
1 + 3 + 5 + · · · + (2k − 1) + (2k + 1) = [1 + 3 + 5 + · · · + (2k − 1)] + (2k + 1)
= k2 + (2k + 1)
= k2 + 2k + 1
= (k + 1)2
That is shows that P(k+1) is true if P(k) is true.
 Answer in the Examination
Q1: Use mathematical induction to prove that the sum of the first n odd positive integers in n2

Answer……
…….
Science P(1) is true and the implication P(k) ⇒ P(k + 1) is true for all positive
integers k, the principle of mathematical induction shows that P(n) is true for all
positive integers n. (Proved)
 Introduction Example

Geometric interpretation. To get next square, need to add next odd

number:

L14 34
 Introduction Example

Geometric interpretation. To get next square, need to add next odd

number:
1

L14 35
 Introduction Example

Geometric interpretation. To get next square, need to add next odd

number:
1
+3

L14 36
 Introduction Example

Geometric interpretation. To get next square, need to add next odd

number:
1
+3
+5

L14 37
 Introduction Example

Geometric interpretation. To get next square, need to add next odd

number:
1
+3
+5
+7

L14 38
 Introduction Example

Geometric interpretation. To get next square, need to add next odd

number:
1
+3
+5
+7
+9

L14 39
 Introduction Example

Geometric interpretation. To get next square, need

to add next odd number:
1
+3
+5
+7
+9
+11

L14 40
 Introduction Example

Geometric interpretation. To get next square, need

to add next odd number:
1
+3
+5
+7
+9
+11
+13
L14 41
 Introduction Example
Geometric interpretation. To get next square, need
to add next odd number:
1
+3
+5
+7
+9
+11
+13 =72
L14 42
 Introduction Example
Problem: Use mathematical induction to prove the inequality n < 2n

• P(n) : n < 2n
• P(1) : 1 < 21
• P(k) : assume k < 2k
• P (k + 1) : have to show that k + 1 < 2k + 1
Adding 1 both sides of K < 2k
• K + 1 < 2k + 1 <= 2k + 2k = 2k + 1
Introduction Example
Introduction Example
 Strong Induction

• Another form of mathematical induction

• Basic step is same as before
• In inductive step, we assume that P(j) is true for j = 1, 2 ….k and show
that P(k+1) must also be true based on this assumption.
 Strong Induction
Principle of Mathematical Induction:
P(n) : The proposition
If:
1) [basis] P (0)
(sometimes need more base cases)

2) [strong induction]
k [P (0)P (1) … P (k)]  P(k+1)
Then:
n P(n)

L14 47
Strong Induction Example
Flawed Induction Example