Pre Calculus Mathematical Induction

There are two aspects to mathematics – discovery and proof – and both are of
equal importance. We must discover something before we can attempt to prove
it, and we can only be certain of its truth once is has been proved. In this section
we will examine the relationship between these two key components of
mathematics more closely.

Example:
(a) Find the sum of the first
(1) 1 odd number.

1=1

(2) 2 odd numbers.

1+3=4

(3) 3 odd numbers.

1+3+5=9

(4) 4 odd numbers.

1 + 3 + 5 + 7 = 16

(5) 5 odd numbers.

1 + 3 + 5 + 7 + 9 = 25

What conjecture can we make about the first n odd numbers?

The sum of the numbers is equal to a perfect square.

Can we write a mathematical statement representing out conjecture?

∑( ) ( )

Recall that the odd numbers were represented by: 2n – 1 and the even numbers
were represented by 2n.

(1) Stewart, James, et al. “Mathematical Induction.” Pre Calculus Mathematics for over
Calculus. USA: Thomson Higher Education, 2006.
Pre Calculus (Sec 9.4a) Mathematical Induction

Mathematical Induction
We are now going to take the statement and prove by mathematical induction that
it is true for all odd numbers.

The Principle of Mathematical Induction

For each natural number n, let P  n  be a statement depending on n.
Suppose that the following two conditions are satisfied.
(1) P 1 is true.
(2) For every natural number k, if P  k  is true, then P  k  1 is true.
Then P  n  is true for all natural numbers n.

NOT IN NOTE PACKET!!

1. Given: ( )

If n was my last number in my sequence, the next # in this sequence

would be n + 1 so therefore we would put that on the left side of the equation.
Since we added a number to the left side, then the right side also has to change to
wherever there was an “n”, we will now have a “n + 1”:

( ) ( )

Where you had an “n”, you now will add the next term of “n + 1”

2. Find the

( )( )
Wherever you had a “k”, you will now have a “k + 1” and simplify

(( ) )(( ) ) ( )( )

3. Find the
( )

( ( ) ) ( ) ( )

Pg 2 over
Pre Calculus (Sec 9.4a) Mathematical Induction

Proof by Mathematical Induction

Step 1: Prove that the statement is true for P 1 .
Step 2: Show that, for any positive integer k, k  n , if P  k  is true (called the
Induction Hypothesis), then P  k  1 is also true.

Examples:
(a) Using mathematical induction, prove that for all natural numbers n,
1  3  5     2n  1  n2

∑ ( )

( )

( )

Now substitute k for n

( )

Now prove:

( ) ( ( ) ) ( )

( )

So since the first part of the left side is this, we can substitute in:

( ) ( )

Now we also know that so substituting that in we get:

( ) ( )

( ) ( )

Once you have both sides the same, then you HAVE TO WRITE:

Therefore we can conclude by mathematical induction that this formula

is valid for every (where n is an integer).

Pg 3 over
Pre Calculus (Sec 9.4a) Mathematical Induction

(b) Using mathematical induction, prove that for all natural numbers n,
n  n  1
1  2  3    n 
2

( )

Therefore we have proven P (1) is true.

( )

( )(( ) )
( )

(I showed where each “k” became “k + 1”)

( )( )
( )

( ) ( )( )
( )

Since 2 of the three terms are being divided by 2, I will now put the other term over 2 but
also I have to multiply it by 2 so that I am really only multiplying it by 1

( ) ( ) ( )( )

( ) ( ) ( )( )

Now looking at the two terms on the left side of the equation, what terms are in both
fractions? (k + 1) so we will pull them to the front and what is left over?

( )[ ] ( )( )

Therefore we can conclude by mathematical induction that this formula is valid for
every

Pg 4 over
Pre Calculus (Sec 9.4a) Mathematical Induction

Using mathematical induction, prove that for all natural numbers n,

n  n  1 2n  1
12  22  32    n2 
6

( )( ( ) )

( )

Therefore P(1) is valid

( )( )

( )(( ) )( ( ) )
( )

( )( )( )
( )

( )( ) ( )( )( )
( )

( )( ) ( ) ( )( )( )

( )[ ( ) ( )] ( )( )( )

( )( ) ( )( )( )

( )( ) ( )( )( )

( )( )( ) ( )( )( )

Therefore we can conclude by mathematical induction that this formula is valid for
every

Pg 5 over
Pre Calculus (Sec 9.4a) Mathematical Induction

(c) Using mathematical induction, prove that for all natural numbers n,
n2  n  1
2

1  2  3    n 
3 3 3 3

( )

2
( )

Therefore P(1) is valid

( )

( ) (( ) )
( )

( ) ( )
( )

( ) ( ) ( )
( )

( ) ( ) ( ) ( )

( ) [ ( )] ( ) ( )

( ) ( ) ( ) ( )

( ) (( )( )) ( ) ( )

( ) ( ) ( ) ( )

Therefore we can conclude by mathematical induction that this formula is valid for
every

Pg 6 over
Pre Calculus (Sec 9.4a) Mathematical Induction

(d) Using mathematical induction, prove that for all natural numbers n,
1  21  22    2n1  2n 1

Recall:

Now:

( )

( )

( )

Therefore we can conclude by mathematical induction that this formula is valid for
every

(e) Prove that n  2n for all positive integers n.

( )

( )

So since ( )

( )

( )
Since n = 1 worked and now any integer greater than one works, therefore we can
conclude by mathematical induction that: for any integer

Pg 7