Mathematical Induction

[Proofs by Mathematical Induction –

Mistakes in Mathematical Induction – Examples ]
Asim Raza
 Why Mathematical Induction is
Valid - Well Ordered Sets
Stair is in order (bottom-up or top-down)
Stair is in sequence (1, 2, 3, 4, .. ; 2, 4, 6, ; 1, 3, 5, …. )
Stair has a starting point (lowest number of the sequence)
One can reach k steps
If one can reach k steps then he can also reach K+1
Principle of Mathematical Induction –
Principle of Mathematical Induction
Principle of Mathematical Induction

3 steps to prove via Induction

1. P(Base Case, starting Point)

2. P(n = k) [Suppose]
3. Show that P(k)  P(k + 1)
Principle of Mathematical Induction

How many different types of questions

to be solved with Mathematical
Induction?

1. Equations (formula)
2. Inequality
3. Division
4. Fibonacci Sequences
Proof by Induction – Examples
Hint: we can make a new item
By replacing k with (k + 1)
And then by adding, we can solve it
Proof by Induction –
Our domain set is
Base Case: If ,
LHS = 1
RHS= ---- LHS = RHS
Hypothesis: Suppose the given expression is true for certain value of .

We need to show
 Proof by Induction –
Hypothesis: Suppose the given expression is true for certain value of .

Inductive Step: Let us show that the expression is true for .

LHS =
From hypothesis, we know the value of

This is same RHS of the given expression, with .

Proof by Induction – Examples
Proof by Induction
Our domain set is
Base Case: If ,
LHS =
RHS= ---- LHS = RHS
Hypothesis: Suppose the given expression is true for certain value of .

We need to show
Proof by Induction
Hypothesis: Suppose the given expression is true for certain value of .

Inductive Step: Let us show that the expression is true for .

LHS =
From hypothesis, we know the value of

This is same RHS of given expression, with .

Proof by Induction – Examples
 Proof by Induction – Examples

, Sum = .
odd integers
odd integers
odd integers
n = 5 odd integers 1 + 3 + 5 + 7 + 9 = 25
n = 6 odd integers 1 + 3 + 5 + 7 + 9 + 11 = 36
Conjecture: For first odd integers, sum is .
 Proof by Induction – Examples
Conjecture: For first odd integers, sum is .

Base Case: If ,
LHS =
RHS= ---- LHS = RHS
Hypothesis: Suppose the given expression is true for certain value of .

We need to show
 Proof by Induction – Examples
Conjecture: For first odd integers, sum is .

Hypothesis: Suppose the given expression is true for certain value of .

Inductive Step: Let us show that the expression is true for .

LHS =
From hypothesis, we know the value of

This is same RHS of given expression, with .

 Proof by Induction – Examples
Conjecture: For first even integers, sum is ??.

Hypothesis: Suppose the given expression is true for certain value of .

Inductive Step: Let us show that the expression is true for .

LHS =
From hypothesis, we know the value of

This is same RHS of given expression, with .

Proving Inequalities – Examples
Proving Inequalities –
Base Case: If ,
LHS =
RHS= 2 --- LHS < RHS
Hypothesis: Suppose the given expression is true for certain value of

We need to show
Proving Inequalities –
Hypothesis: Suppose the given expression is true for certain value of .

Inductive Step: Let us show that the expression is true for .

LHS =
From hypothesis, we know the value of
( because 1 < 2^k)

So , Hence given expression is TRUE, with .

Proof by Induction – Examples
 Proof by Induction – Examples

Base Case: If 4,
LHS =
RHS= 24 --- LHS < RHS
Hypothesis: Suppose the given expression is true for certain value of .

We need to show
 Proof by Induction – Examples
Hypothesis: Suppose the given expression is true for certain value of .

Inductive Step: Let us show that the expression is true for .

LHS =
From hypothesis, we know the value of

So , Hence given expression is TRUE, with .

Proof by Induction – Examples
Proof by Induction – Examples
Proof by Induction – Examples
Proof by Induction – Examples
 Please solve this problem
, for all integral values of .
 Please solve this problem
, for all integral values of .
Base Case:

Hypothesis:

Inductive Step:
 Please solve this problem
, for all integral values of .
Base Case: Show it for first value in the domain set

Hypothesis: Suppose the given formula is true for some value of

Inductive Step: We need to show that the given inequality is valid for the
next of value of that is for .
 Please solve this problem
, for all integral values of .
Base Case: Show it for first value in the domain set

Hypothesis: Suppose the given formula is true for some value of

 Please solve this problem
, for all integral values of .
Hypothesis: Suppose the given formula is true for some value of
Inductive Step: We need to show that the given inequality is valid for the
next of value of that is for .
Proof by Induction – Examples
Exercises: Do it by yourself
Exercises: Do it by yourself
Exercises: Do it by yourself
Exercises: Do it by yourself
Exercises: Do it by yourself [Divisibility]
Exercises: Do it by yourself [Inequalities]
Proof by Induction – Fibonacci Sequence Examples
Recall Fibonacci Sequence:

where
Fibonacci Identities:

Show that
Fibonacci Identities: Show that
Base Case: Let us use the two lowest number by taking where and for where . Hence, the
claim is true for the base case.
Hypothesis: for all k
Inductive Step Because where

and for all

By adding F(k - 1) and F(k) , we get

(proved)
Fibonacci Identities: Show that
Base Case: Let us use the two lowest number by taking where and for where . Hence, the
claim is true for the base case.
Hypothesis: and for all .

Inductive Step: We know that (using general formula of Fibonacci sequence). Using
inductive hypothesis, we can state that

Hence, the claim is true for all .

Prove the following identity involving Fibonacci numbers:

Base Case: Using the two lowest number where and where .
Hence, the claim is true for the base case.

Inductive Hypothesis: Assume the claim is true for some ,

and for all .
Prove the following identity involving Fibonacci numbers:

Hypothesis: Assume the claim is true for some , and for all .

Inductive Step: Using general definition of Fibonacci sequence, we can write that

Factor this to get

But
So,

Hence, the claim is true for all n.:

 Do it by yourself
Prove the Fibonacci identity using mathematical induction:
Base Case: n = 0,
Hypothesis: Suppose, for , and
Inductive Step: For ,

Hence, .
Proof by Induction – Fibonacci Sequence Identities
 Prove by mathematical induction that is an integer for all .

Base Case: For , .

Hypothesis: Suppose the claim is true for some , that is is an integer.
Inductive Step: Let us prove it for .

But is an integer, from hypothesis. Also is an integer.

Sum of two integers is also an integer. is an integer for all values of .
Show that product of any two consecutive even numbers is divisible by 8.

Let and be two consecutive even numbers. We need to show that or , where
is some quotient. Also is the -th even number.
Show that product of any two consecutive even numbers is divisible by 8.

Let and be two consecutive even numbers. We need to show that or , where is some
quotient. Also is the -th even number.
Base Case: Let and . Then is divisible by 8.
Hypothesis: Suppose the claim is true for some k-th even number, such that , it is divisible
by 8.
.
Inductive Step: Let us prove it for -th even number.
, and .

so product of -th even number and the next is divisible by 8.

Proof by Induction – Solved Example 1
Prove the following series formula by mathematical induction:
, for all integers .
Base Case: ,
L.H.S. =
R.H.S. = .

Hypothesis: Suppose the claim is true for .

Induction Step:
For ,
.
Hence proved.
Proof by Induction – Solved Example 2
Show by mathematical induction that for all integers .
Base Case: ,
.
Hypothesis: Suppose the claim is true for .

Induction Step:
For ,
.
Hence proved.
Proof by Induction – Solved Example 3
Prove the Fibonacci identity using mathematical induction: .
Base case: n = 0, .
Hypothesis: Suppose, for , and
Induction step: For ,
Hence, .
Covering Chessboard with Triminos