ssMathematical Induction

Mathematical induction is a concept that helps to prove mathematical results and theorems
for all natural numbers. Mathematical induction is a technique used to prove certain
statements in algebra formulated in terms of n, where n is a natural number. Any
mathematical statement or expression is proved based on the premise that it is true for n = 1,
n = k, and then it is proved for n = k + 1.

Let us understand the concept of the principle of mathematical induction, its statement, and
its application for proving various mathematical theorems and statements for natural
numbers.

What is Mathematical Induction?

Mathematical Induction is a technique used to prove that a mathematical statement P(n) holds
for all natural numbers n = 1, 2, 3, 4, ... It is often referred to as the principle of mathematical
induction. To prove a result P(n) using the principle of mathematical induction, we prove that
P(1) holds. If P(1) is true, then we assume that P(k) holds for some natural number k, and
using this hypothesis, we prove that P(k+ 1) is true. If P(k+1) holds true, then the statement
P(n) becomes true for all natural numbers.
Principle of Mathematical Induction Statement

Now, let us state the principle of mathematical induction and understand how it is used to
prove statements step-wise:

Suppose there is a given statement P(n) involving the natural number n such that

 The statement is true for n = 1, i.e., P(1) is true.

 If the statement is true n = k, where k is some natural number, then the statement is also
true for n = k+1, i.e., the truth of P(k) implies the truth of P(k+1)

Then, P(n) is true for all natural numbers n.

Now before we move on to solve a few examples using the principle of mathematical
induction, let us go through some points that are important to understand:

 The first step is a statement of fact. Some mathematical statements hold true for n ≥ 5. In
this case, to prove the result using the Principle of Mathematical Induction, step 1 will
start from n = 5.
 Step 2 is a conditional property. It does not assert that the statement P(n) is true for n = k.
It says that if the statement is true for n = k, then it is also true for n = k+1. In other
words, we can say that we assume P(k) is true for some natural number k and then prove
that P(k+1) is true.
Mathematical Induction - Steps To Solve

Now, each step that is used to prove the theorem or statement using mathematical induction
has a defined name. Each step is named as follows:
 Base step: To prove P(1) is true.
 Assumption step: Assume that P(k) is true for some k in N.
 Induction step: Prove that P(k+1) is true.

After proving these 3 steps, we can say, “By the principle of mathematical induction, P(n) is
true for all n in N". The assumption that we make in the second step that P(n) holds for some
natural number n = k is called the induction hypothesis.

Application of Mathematical Induction

Now that we have understood the concept of mathematical induction, let us solve an example
to understand its application better.

Example 1: Prove that the formula for the sum of n natural numbers holds for all natural
numbers, that is, 1 + 2 + 3 + 4 + 5 + .... + n = n(n+1)/2 using the principle of mathematical
induction.

Solution: Suppose P(n): 1 + 2 + 3 + 4 + 5 + .... + n = n(n+1)/2

Here we use the concept of mathematical induction and prove this across the following three
steps.

Base Step: To prove P(1) is true.

For n = 1, LHS = 1

RHS = 1(1+1)/2 = 2/2 = 1

Hence LHS = RHS ⇒ P(1) is true.

Assumption Step: Assume that P(n) holds for n = k, i.e., P(k) is true

⇒ 1 + 2 + 3 + 4 + 5 + .... + k = k(k+1)/2 --- (1)

Induction Step: Now we will prove that P(k+1) is true.

To prove: 1 + 2 + 3 + 4 + ... + (k+1) = (k+1)(k+2)/2

Consider LHS = 1 + 2 + 3 + 4 + ... + (k+1)

= 1 + 2 + 3 + 4 + ... k + (k+1)

= (1 + 2 + 3 + 4 + ... + k) + k+1

= k(k+1)/2 + k+1 [Using (1)]

= [k(k+1) + 2(k+1)]/2

= (k+1)(k+2)/2
= RHS

⇒ P(n) is true for n = k+1

Hence, by the principle of mathematical induction, P(n) is true for all natural numbers n.

Important Notes on the Principle of Mathematical Induction

 Each mathematical statement is assumed as P(n) for a natural number n.

 First, we prove for n = 1, then assume for n = k and finally prove for n = k+1.
 The result of the "assumption step" is used after writing the k th term (before the
(k+1)th term).
 If getting the RHS from the LHS seems difficult, simplify the LHS and the RHS
separately and prove that they are equal.

 Example 1: Prove the following formula using the Principle of Mathematical Induction.

n (2 n−1)(2 n+1)
12 +32 +52 +...+(2 n−1)2 =
3
2 2 2 2 n (2 n−1)(2 n+1)
Solution: Assume P(n): 1 +3 +5 +...+(2 n−1) =
3

Here we use the concept of mathematical induction across the following three steps.

Base Step: To prove P(1) is true.

For n = 1, LHS = 12 = 1

1×(2 ×1−1)(2 ×1+1) 3

RHS = = =1
3 3

Hence LHS = RHS ⇒ P(1) is true.

Assumption Step: Assume that P(n) holds for n = k, i.e., P(k) is true

k (2 k −1)(2 k +1)
⇒ 12 +32 +52 +...+(2 k−1)2= --- (1)
3

Induction Step: Now we will prove that P(k+1) is true.

( k +1 ) [ 2 ( k +1 ) −1 ] [2 [ k +1 ) +1]
To prove: 12 +32 +52 +...+(2 k −1)2+[2(k +1)−1]2=
3
2 2 2 2 2
Consider LHS ¿ 1 +3 +5 +...+(2 k −1) +[2 (k +1)−1]
2 2 2 2 2
¿ [1 +3 +5 +...+ ( 2 k−1 ) ]+[2(k +1)−1]
k (2 k −1)(2k + 1)
¿ +[2(k + 1)−1] 2 Using equation 1
3
 k (2 k −1)(2k + 1)
¿ +(2 k +1)2
3
2
k ( 2 k−1 ) ( 2 k +1 ) +3(2 k +1)
¿
3
( 2 k +1 ) [k ( 2 k−1 ) +3 ( 2 k +1 ) ]
¿
3
2
( 2 k +1 ) (2 k −k +6 k +3)
¿
3
( 2 k +1 ) (2 k 2 +5 k +3)
¿
3
( 2 k +1 ) (2 k +3)(k +1)
¿
3
( k +1 ) [ 2 ( k +1 )−1 ] [2 [ k +1 ) +1]
¿ =RHS
3

⇒ P(n) is true for n = k+1

Hence, by the principle of mathematical induction, P(n) is true for all natural numbers n.

2 2 2 2 k (2 k−1)(2 k +1)
Answer: 1 +3 +5 +...+(2 k −1) = is true for all positive integers n.
3
 Example 2: Prove that 2n > n for all positive integers n.

Solution: We will prove the result using the principle of mathematical induction.

Assume P(n): 2n > n

Base Step: To prove P(1) is true.

For n = 1, we have 21 = 2 > 1

⇒ P(1) is true.

Assumption Step: Assume that P(n) holds for n = k, i.e., P(k) is true

⇒ 2k > k --- (1)

Induction Step: Now we will prove that P(k+1) is true.

To prove: 2k+1 > k + 1

Consider 2k+1
= 2.2k

> 2k [Using (1)]

=k+k

> k + 1 [Because any natural number other than 1 is greater than 1.]
 ⇒ P(n) is true for n = k+1

Hence, by the principle of mathematical induction, P(n) is true for all natural numbers n.

Answer: 2n > n is true for all positive integers n.

 Example 3: Show that 102n-1 + 1 is divisible by 11 for all natural numbers.
Solution: Assume P(n): 102n-1 + 1 is divisible by 11

Base Step: To prove P(1) is true.

For n = 1, 102×1-1 + 1 = 101 + 1 = 11, which is divisible by 11.

⇒ P(1) is true.

Assumption Step: Assume that P(n) holds for n = k, i.e., P(k) is true

⇒ 102k-1 + 1 is divisible by 11
⇒ 102k-1 + 1 = 11a, for some integer 'a' --- (1)

Induction Step: Now we will prove that P(k+1) is true.

To prove: 102(k+1)-1 + 1 is divisible by 11

Consider 102(k+1)-1 + 1
= 102k+2-1 + 1
= 102.102k-1 + 1
= 102.(102k-1 + 1 - 1) + 1
= 102.(11a - 1) + 1 [Using (1)]
= 102.11a - 102 + 1
= 102.11a - 100 + 1
= 102.11a - 99
= 11(102a - 9)

= 11(100a - 9), which is divisible by 11.

⇒ P(n) is true for n = k+1

Hence, by the principle of mathematical induction, P(n) is true for all natural numbers n.

Example 4: Use mathematical induction to prove that 1 + 5 + 9 + · · · + (4n − 3) =

2n2 – n for every positive integer n [1].

Proof.
Let P (n) be the statement 1 + 5 + 9 + · · · + (4n − 3) = 2n2 − n. First we
will verify our base case, P (1). Observe that (4(1) − 3) = 1 = 2(1) 2 − 1 = 1.
Thus, we know that P (n) holds for n = 1. Next, assume P (k) is true for
some positive integer k; that is,

1 + 5 + 9 + · · · + (4k − 3) = 2k2 − k.
We want to prove that P (k + 1) holds; that is, we want to prove
that 1 + 5 + 9 + · · · + (4(k + 1) − 3) = 2(k + 1)2 − (k + 1).
Observe the following:
[1 + 5 + 9 + · · · + (4k − 3)] + (4(k + 1) − 3) = [2k2 − k] + (4(k + 1) − 3)
[By Inductive Hypothesis]
= 2k2 − k + 4k + 4 – 3

= 2k2 + 4k + 2 + 2 − 3 – k

= 2(k2 + 2k + 1) − k – 1

= 2(k + 1)2 − (k + 1).

Thus P (k + 1) is true. By the principle of mathematical induction, we

have shown that P (n) is true for every positive integer n.

n ( n+1 ) ( n+2 )
Prove that 1 ·2+2 · 3+3 · 4+…+ n ( n+1 )= for every 3positive integer n [1].
3

Proof.
n ( n+1 ) ( n+2 )
Let P (n) be the statement, 1 ·2+2 · 3+3 · 4+…+ n ( n+1 )= First3
3
we will verify our base case, P(1). Observe that
1 ( 1+3 1 )( 1+2 )
1 ( 1+ 1 )=2= =2. Thus, we know that P (n) holds for n = 1.
3
Next, assume P (k) is true for some positive integer k; that is,
k ( k +1 )( k +2 )
1 ·2+2 · 3+3 · 4+…+ k ( k +1 )=
3
We want to prove that P (k + 1) holds; that is, we want to prove that
( k +1 ) ( k +2 ) ( k +3 )
1 ·2+2 · 3+3 · 4+…+ k ( k +1 ) + ( k + 1 )( k +2 )=
3

Observe the following:

{ 1 ·2+ 2· 3+3 · 4+ …+k ( k +1 ) }+ ( k +1 ) ( k +2 )
k ( k +1 ) ( k +2 )
¿ + ( k +1 ) ( k +2 )
3
[By Inductive Hypothesis]

k ( k +1 ) ( k +2 ) 3 ( k +1 )( k +2 ) ( k +1 ) ( k +2 ) ( k +3 )
¿ + =
3 3 3
Thus P (k + 1) is true. Therefore, P (n) is true for all positive integers n
by the principle of mathematical induction.