MATHEMATICAL INDUCTION

The formula for the sum of the first n positive odd integers is

1+3+5+7+ …+( 2n−1)=n2

Let us verify this formula for sum values of n .

n=1: 1=1 ↔1=12

n=2 1+3=4 ↔ 1+3=22
n=3 1+3+5=9 ↔1+3+5=32
n=4 1+3+5+7=16 ↔1+3+ 5+7=4 2
n=5 1+3+5+7+ 9=25 ↔ 1+3+5+7+ 9=52
For these calculations we are convinced that formula holds for values of n and we would observe that
the formula is still true. Of course, such procedure is not a proof of a formula for the sum of odd integer.
However, there is a proof involving a technique called mathematical induction.

Mathematical induction is a principle for proving certain mathematical theorems, propositions, or

formula. It is a technique used to establish a given mathematical statement for all natural numbers. A
form of direct proof, mathematical induction involves two parts.

1. Case basis. This part aims to prove that the given statement holds for n=1.
2. Induction step. This part aims to prove that if the given statement holds for some natural
numbers n , then it implies the statement is also true for the succeeding natural number n+1.

We do not prove the principle of mathematical induction. Its use involves the following reasoning:

From (1) the statement A ( n ) (sometimes represented by P(1)) is true for n=1. Because A ( n ) is true for
n=1 , it follows from (2) that A( n) is true for n=1+1 or 2. Because A(n) is true for n=2 , it is true for
n=2+1 or 3. Because A(n) is true for n=3 , it is true for n=3+1 or 4 . Thus A ( n ) is true for all
positive- integer values of n .

This principle is analogous to the principle of domino effect, that is, dominoes are aligned and erected,
so that when the first one falls, the next domino will follow to fall. Consequently, if the second domino
falls, the third will follow to fall, and so on.

1
Example 1: Prove that the sum of the first n consecutive positive integers is n( n+ 1).
2

Proof

To prove that

1
1+2+3+…+ n= n (n+1). Equation 1
2
 I. Case Basis. We first verify that the formula is true for n=1.
If n=1, the statement becomes
1
1= (1)(1+1)
2
1
1= (1)(2)
2
1=1 which is true.

1
The statement 1+2+3+…+ n= n (n+1) is true for n=1. However, this does not completely prove
2
the statement. It is necessary to show that the statement holds for any value of n , say n=k , then
consequently, it also holds for the next integer which is n=k +1.

II. Induction step. Show that the statement is true for n=k +1.

If n=k , the statement becomes

1
1+2+3+…+ k= k ¿ ) Equation 2
2

1
To complete the proof, show that 1+2+3+…+ k= k ¿ ) (Eq. 2) is true for the next value which is
2
n=k +1.

When n=k+1, we have

1
1+2+3+…+ k +(k +1)= ( k +1)¿)
2

1 1
k ( k +1 ) + ( k +1 )= (k +1)¿)
2 2

1 1
(k + 1)( k +1)= (k +1)¿ ) Factoring by grouping
2 2

1 1
(k + 1) (k + 2)= (k +1)¿ )
2 2

1 1
( k +1)(k +2)= ( k +1) ¿)
2 2

Conclusion: we have proven that the formula is true when n=1 ,n=k and n=k +1. Therefore, by the
principle of mathematical induction, the formula is true when n is any positive integer.

Example 2: Prove that the sum of the first n positive odd integers is n2 .

To prove 1+3+5+ …+ ( 2 n−1 )=n2 :

I. Case Basis
If n=1

2 ( 1 )−1=12

1=1 Since the case basis is true, we can proceed to induction step.

II . Induction Step

Assume that n=k

Then the equation becomes

1+3+5+ …+ ( 2 k−1 )=k 2

Now, prove the formula true for n=k +1

1+3+5+ …+ ( 2 k−1 ) + ( 2 ( k +1 ) −1 )=( k + 1 )2

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

k 2+2 k +1=( k +1 )2

( k +1 )2 =( k +1 )2

Conclusion: We have proven that the formula is true for any n positive integer.

Activity

Use mathematical induction to show that each equation in n is true for all positive integers.

n
1. 1+4 +7+ …+ ( 3 n−2 ) = (3 n−1)
2
2. 5+9+ 13+…+ ( 4 n+1 )=n ( 2 n+3 )
3. 1+5+9+ …+ ( 4 n+3 )=n (2 n−1 )
4. 3+7+ 11+…+ ( 4 n−1 )=n(2n+1)
5. 7+13+19+ …+ ( 6 n+1 ) =n ( 3 n+4 )
n
6. 12 +22+ 32+ … n2= ( n+1 )( 2 n+1 )
6
3 3 3 3 n2 2
7. 1 +2 +3 +…+ n = ( n+1)
4