Mathematical

Induction
P(1)
 (P(k)  P(k+1))
k
---------------------
 n (P(n)

Dr Harsh Dev 1
 What is induction?
• A method of proof
• It does not generate answers: it
only can prove them

n.(n  1)
1  2  3  ..  n  , n  1
2
12 + 22 + 32….+ n2 = n ( n  1)(2n  1)
6
n! < nn for all n > 1
• -----------------------------------------

P(n): n.(n  1)
1  2  3  ..  n 
2
P(n): n! < nn for all n > 1

2 Dr Harsh Dev
 Mathematical Induction
• Mathematical Induction is a technique of proving
a statement, theorem or formula which is
thought to be true, for each and every natural
number n.
• By generalizing this in form of a principle which
we would use to prove any mathematical
statement is 'Principle of Mathematical
Induction'.

Dr Harsh Dev 3
 Three step process
1. Basis step : We prove P(1) is True
2. Inductive hypothesis : We assume P(k) is true.
3. Inductive step : We show that P(k+1) is true, i.e., P(k) → P(k+1)
• -----------------------------------------------------------------------------------------
• We know P(1) is true
• Because of P(k) → P(k+1), if it’s true for P(1), then it’s true for P(2)
• Because of P(k) → P(k+1), if it’s true for P(2), then it’s true for P(3)
• Because of P(k) → P(k+1), if it’s true for P(3), then it’s true for P(4)
• Because of P(k) → P(k+1), if it’s true for P(4), then it’s true for P(5)
• .
• .
• .
• Onwards to infinity
• It is true for all possible values of n
• ------------------------------------------------------------------------------------------
• In other words,
P(1)  k P( k )  P( k  1)  n P(n)

4 Dr Harsh Dev
 n.(n  1)
Q: Prove that, 1  2  3  ..  n  for all n ≥ 1
2
1. Basis step : We have to prove P(1) is true
• P(1) : 1 = 1.(1+1)/2
• 1 = 1, Which is True P(1) is True
2. Inductive hypothesis: Let P(k) is true, i.e.
• k.(k  1)
1  2  3  ..  k  ...........(1)
2
3. Inductive step: We have to show that P(k+1) is True, i.e.
• (k  1).(k  2)
1  2  3  ..  (k  1) 
• 2
• L.H.S. k.(k  1)
1  2  3  ..  k  (k  1)   (k  1) from eq (1)
2
k
 (k  1)(  1)
2
(k  1).(k  2)
  R.H.S.
• 2
• P(k+1) is True) P(n) is True for all values of n ≥ 1
Dr Harsh Dev 5
 n.(n  1).(2n  1)
Q : Prove that 1  2  3  ..  n 
2 2 2 2
, n  1
6
1. Basis step : We have to prove P(1) is true
• P(1) : 12 = 1.(1+1)(2.1+1)/6
• 1 = 1, Which is True P(1) is True
2. Inductive hypothesis: Let P(k) is true, i.e.
• k.(k  1).(2k  1)
12  2 2  32  ..  k 2  ..........(1)
6
3. Inductive step: We have to show that P(k+1) is True, i.e.
•
(k  1).(k  2).(2.(k  1)  1)
• 1  2  3  ..  (k  1) 
2 2 2 2

• L.H.S. 6
k.(k  1).(2k  1)
12  2 2  32  ..  k 2  (k  1) 2   (k  1) 2
6 from eq (1)
 k.(2k  1) 
 (k  1)   (k  1) 
 6 6
Dr Harsh Dev
• L.H.S.
k.(k  1).(2k  1)
12  2 2  32  ..  k 2  (k  1) 2   (k  1) 2
6 from eq (1)
 k.(2k  1) 
 (k  1)   (k  1)
 6 
 k.(2k  1)  6.(k  1) 
 (k  1)  
 6 
 2k 2  k  6.k  6) 
 (k  1)  
 6 
 2k 2  7.k  6) 
 (k  1)  
 6 
 (k  2)(2k  3) 
 (k  1)  
 6 
 (k  2)(2(k  1)  1) 
 (k  1)    R.H.S
 6 
• P(k+1) is True) P(n) is True for all values of n ≥1
Dr Harsh Dev 7
 Inequality example
Q: Show that n! < nn for all n > 1
1. Basis step : We have to show that P(2) is True
P(2): 2! < 22
2<4 Which is True P(2) is True
2. Inductive hypothesis: Let P(k) is True, i.e. k! < kk …....(1)
3. Inductive step: We have to show that P(k+1) is True, i.e.
(k+1)! < (k+1)k+1
L.H.S. (k  1)!  (k  1)k!
 (k  1)k k from eq (1)
 (k  1)(k  1) k
 (k  1) k 1  R.H.S
(k+1)! < (k+1)k+1
8 P(k+1) is True P(n) is True for all values of n >1
Dr Harsh Dev
 Inequality example
Q: Show that n! > 2n for all n ≥ 4
1. Basis step : We have to show that P(4) is True
P(4): 4! > 24
24 > 16 Which is True P(4) is True
2. Inductive hypothesis: Let P(k) is True, i.e. k! > 2k ……..(1)
3. Inductive step: We have to show that P(k+1) is True, i.e.
(k+1)! > 2k+1
(k+1)! = (k+1).k!
> (k+1).2k (from eqn 1)
> 2.2k (Since (k+1)> 2)
(k+1)! > 2k+1
P(k+1) is True P(n) is True for all values of n ≥4

9 Dr Harsh Dev
Q: Show that 2n > n3, for all n > 9
• Inductive step:
• We have to prove that 2k+1 > (k+1)3
• L.H.S. 2k+1=2 2k
• >2k3 from inductive hypothesis
• =k3+k3
• >k3+9k2
• =k3+3k2+6k2
• >k3+3k2+6.9.k
• = k3+3k2+54k
• =k3+3k2+3k+51k
• >k3+3k2+3k+1
• =(k+1)3 = R.H.S.
Dr Harsh Dev 10
Q: Show that 1 + 3 + 5 + ......... + (2n – 1) = n2 , n N
n
i.e.n,  2i  1  n 2
i 1

Sol: Let the given statement P(n) be defined as

• P(n) : 1 + 3 + 5 +...+ (2n – 1) = n2 , for n N.
1. Basis step: We have to show that P(1) is true,
• P(1) : 1 = 12 , which is True P(1) is True
2. Inductive hypothesis: Let P(k) is True for some k N,
i.e., P(k) : 1 + 3 + 5 + ... + (2k – 1) = k2 ...............(1)
3. Inductive step: We have to prove that P(k + 1) is true, i.e.
1 + 3 + 5 + ... + (2k – 1) + (2k + 1) = (k+1)2

L.H.S. k2 + (2k + 1) (from eq (1))

= k2 + 2k + 1 = (k + 1)2 = R.H.S.
P(k+1) is True P(n) is True for all values of n ≥1
Dr Harsh Dev 11