LECTURE # 12a

PRINCIPLE OF MATHEMATICAL INDUCTION

Let P(n) be a propositional function defined for all positive integers n. P(n)
is true for every positive integer n if
1. Basis Step:
The proposition P(1) is true.
2. Inductive Step:
If P(k) is true then P(k + 1) is true for all integers k  1.
i.e.  k p(k)  P(k + 1)

EXAMPLE

Use Mathematical Induction to prove that

n(n  1)
1  2  3   n  for all integers n 1
2
SOLUTION
Let
n(n  1)
P ( n) : 1  2  3    n 
2
1. Basis Step: P(1) is true.
For n = 1, left hand side of P(1) is the sum of all the successive integers
starting at 1 and ending at 1, so LHS = 1 and RHS
1(1 1) 2
R.H .S   1
2 2
so the proposition is true for n = 1. 1
 2. Inductive Step: Suppose P(k) is true for, some integers k  1.

k (k  1) (1)
1  2  3   k 
2
To prove P(k + 1) is true. That is,

(k  1)(k  2)
1  2  3    (k  1)  (2)
2
Consider L.H.S. of (2)

1  2  3    (k  1) 1  2  3    k  (k  1)
k (k  1)
  (k  1) using (1)
2
k 
(k  1)   1
2 
 k  2
(k  1)  
 2 
(k  1)(k  2)
 RHS of (2)
2
Hence by principle of Mathematical Induction the given result true for
all integers greater or equal to 1.

2
 EXERCISE

Use mathematical induction to prove that

1+3+5+…+(2n -1) = n2 for all integers n 1.
SOLUTION
Let P(n) be the equation
1+3+5+…+(2n -1) = n2
1. Basis Step: P(1) is true
For n = 1, LHS of P(1) = 1and
RHS = 12 = 1
Hence the equation is true for n = 1
2. Inductive Step: Suppose P(k) is true for some integer k  1. That is,
1 + 3 + 5 + … + (2k - 1) = k2 …………………(1)
To prove P(k+1) is true; i.e.,
1 + 3 + 5 + … +[2(k+1)-1] = (k+1)2 ………….……(2)
Consider L.H.S. of (2)
1  3  5    [2(k  1)  1] 1  3  5    (2k  1)
1  3  5    (2k  1)  (2k  1)
k 2  (2k  1) using (1)
(k  1) 2
R.H.S. of (2)

Thus P(k+1) is also true. Hence by mathematical induction, the given

equation is true for all integers n1.

3
 EXERCISE
Use mathematical induction to prove that

1+2+22 + … + 2n = 2n+1 - 1 for all integers n

0
SOLUTION
Let P(n): 1 + 2 + 22 + … + 2n = 2n+1 - 1
1. Basis Step: P(0) is true.
For n = 0
LHS of P(0) = 1
RHS Step
2. Inductive of P(0)Suppose
= 2 - 1 P(k)
0+1
= 2 - is
1 =true
1 for
Hence
someP(0) is true.
integer k
 0; i.e.,
1+2+22+…+2k = 2k+1 – 1……………………(1)
To prove P(k+1) is true, i.e.,
1+2+22+…+2k+1 = 2k+1+1 – 1…………………(2)
Consider LHS of equation (2)
1+2+22+…+2k+1 = (1+2+22+…+2k) + 2k+1
= (2k+1 - 1) +2k+1
= 2·2k+1 - 1
= 2k+1+1 - 1 = RHS of (2)
Hence P(k+1) is true and consequently by mathematical4
induction the given propositional function is true for all
integers n0.
 EXERCISE

Prove by mathematical induction

n(n  1)(2n  1) for all integers n 1.

12  2 2  32    n 2 
6
SOLUTION
Let P(n) denotes the given equation
1. Basis step: P(1) is true
For n = 1
LHS of P(1) = 12 = 1
1(1 1)(2(1)  1)
RHS of
P(1)
6
(1)(2)(3) 6
  1
6 6
So LHS = RHS of P(1).Hence P(1) is true

2. Inductive Step: Suppose P(k) is true for some integer k 1;

k (k  1)(2k  1) ………(1)
12  2 2  32    k 2 
6
To prove P(k+1) is true; i.e.;

(k  1)( k  1  1)( 2(k  1)  1)

12  2 2  32    (k  1) 2  …(2)
6

5
 Consider LHS of above equation (2)

12  2 2  32    (k  1) 2 12  2 2  32    k 2  (k  1) 2
k (k  1)(2k  1) Using (1)
  (k  1) 2
6
 k (2k  1) 
(k  1)   (k  1)
 6 
 k (2k  1)  6(k  1) 
(k  1)  
 6 
 2k 2  k  6k  6 
(k  1)  
 6 
(k  1)(2k 2  7 k  6)

6
(k  1)(k  2)(2k  3)

6
(k  1)(k  1  1)(2(k  1)  1)

6
= RHS of (2)

Hence P(k+1) is true and by principle of Mathematical Induction we

can say that the given proposition is true. That is

n(n  1)(2n  1)
12  2 2  32    n 2  n 1.
6

6
 EXERCISE

Prove by mathematical induction

1 1 1 n
    for all integers n1
1 2 2 3 n(n  1) n  1
SOLUTION
Let P(n) be the given equation.
1. Basis Step: P(1) is true
For n = 1
1 1 1
LHS of P(1) =  
1 2 12 2
1 1
RHS of P(1) = 
1 1 2
Hence P(1) is true
2. Inductive Step: Suppose P(k) is true, for some integer k1. That is
1 1 1 k
    …………….(1)
1 2 2 3 k (k  1) k  1
To prove P(k+1) is true. That is

1 1 1 k 1
    ……..(2)
1 2 2 3 (k  1)(k  1  1) (k  1)  1

Now we will consider the L.H.S of the equation (2) and will try to get the
R.H.S by using equation ( 1) and some simple computation.

7
Consider LHS of (2)
1 1 1
  
1 2 2 3 ( k  1)( k  2)
1 1 1 1
    
1 2 2 3 k ( k  1) ( k  1)( k  2)
k 1
 
k  1 (k  1)(k  2)
k (k  2)  1

(k  1)(k  2)
k 2  2k  1

(k  1)(k  2)
(k  1) 2

(k  1)(k  2)
k 1

(k  2)
RHS of (2)
Hence P(k+1) is also true and so by Mathematical induction the given
equation is true for all integers n 1.

8
 EXERCISE

Use mathematical induction to prove that

n 1
 i 1 i 2 i
n 2 n 2
 2,
for all integers n 0

SOLUTION
1. Basis Step: To prove the formula for n = 0, we need to
show that
0 1
i 1 i. 2 i
0 2 02
2

i 1
1 i 1
Now, LHS = i 2 (1) 2 2
RHS = 0·22 + 2 = 0 + 2 = 2
Hence the formula is true for n = 0
2. Inductive Step: Suppose for some integer n=k 0

k 1
i 1 i 2 i
k 2 k 2
2 ………………(1)

We must show that

k 2 i
 i 1
i 2 (k  1) 2 k 12  2 ………..(2)

9
 Consider LHS of (2)
k 2 i k 1 i
 i 1
i 2 i 1 i 2  (k  2) 2 k 2
(k 2 k 2  2)  (k  2) 2 k 2
(k  k  2)2 k 2  2
(2k  2) 2 k 2  2
(k  1)2 2 k 2  2
(k  1) 2 k 12  2
RHS of equation (2)
Hence the inductive step is proved as well. Accordingly by mathematical
induction the given formula is true for all integers n0.

EXERCISE
Use mathematical induction to prove that

 1  1  1  n 1
 1  
2  
1  2 
  1  2 
 for all integers n 2
 2   3   n  2n

SOLUTION
1. Basis Step: For n = 2
1 1 3
1 
LHS 2
1  
2 4 4
2 1 3
RHS  
2( 2) 4
Hence the given formula is true for n = 2 10
 2. Inductive Step: Suppose for some integer k 2

 1  1  1  k 1
 1  2   1  2    1  2   ………………….(1)
 2   3   k  2k
We must show that

 1  1  1  (k  1)  1
 1  
2  
1  2 
 
 1  
2 
…………..(2)
 2   3   (k  1)  2(k  1)
Consider LHS of (2)

 1  1  1 
 1  
2  
1  2 
 
 1  
2 
 2   3   (k  1) 
 1  1  1   1 
  1  2   1  2    1  2    1  
2 
 2   3   k   ( k  1) 
 k 1  1  using (1)
   1  
2 
 2k   (k  1) 
 k  1   (k  1)  1 
2
   2 

 2k   (k  1) 
 1   k  2k  1  1 
2
   
2 k
  ( k  1) 
k 2  2k k (k  2)
 
2k (k  1) 2k (k  1)
k  1 1
  RHS of (2)
2(k  1)
Hence by mathematical induction the given equation is true 11
 EXERCISE

Prove by mathematical induction


n
i 1
i (i!) (n  1)! 1 for all integers n1

SOLUTION
1. Basis step: For n = 1

 i 1 i(i !) (1)(1!) 1
n

LHS

RHS = (1+1)! - 1 = 2! - 1
= 2 -1 = 1


1
Hence
i 1
i (i!) (1  1)! 1
which proves the basis step.
2. Inductive Step: Suppose for any integer k 1


k
i 1
i (i! ) ( k  1)! 1 ………………………..(1)

We need to prove that

k 1
 i 1
i (i!) (k  1  1)! 1 ……………………(2)
Consider LHS of (2)
k 1
 i 1 i(i !)  i 1 i(i !)  (k 1)(k 1)!
k

(k  1)! 1  ( k  1)( k  1)! Using (1)

(k  1)! ( k  1)( k  1)! 1
[1  ( k  1)](k  1)! 1
(k  2)(k  1)! 1
(k  2)! 1
12
RHS of (2)
Thank You

13
Hence the inductive step is also true.
Accordingly, by mathematical induction, the given formula is true for all
integers n 1.
EXERCISE
Use mathematical induction to prove the generalization of the following
DeMorgan’s Law:
n n
 j 1
Aj j 1 Aj
where A1, A2, …, An are subsets of a universal set U and n2.
SOLUTION
Let P(n) be the given propositional function
1. Basis Step: P(2) is true.

2

LHS of P(2) j=1 A j  A1 A 2

 A A
1 2
By DeMorgan’s Law
2
 A i 1 j RHS of P(2)

2. Inductive Step: Assume that P(k) is true for some integer k 2; i.e.,

k k
j 1 j j 1 Aj ………………….(1)
A 

where A1, A2, …, Ak are subsets of the universal set U. If Ak+1 is another set
of U, then we need to show that
k 1 k 1 ………………..(2)
 j 1
A j j 1 A j
14
Consider LHS of (2)


k 1
j 1
Aj   A  A
k
j 1 j k 1

 j 1 Aj   Ak 1
k
By DeMorgan’s Law
 
  k
j 1 
Aj  Ak 1
k 1
j 1 Aj
RHS of (2)
Hence by mathematical induction, the given generalization of DeMorgan’s
Law holds.

15