Proving a theory can be a daunting process. No matter how many times you try something with the same result, how can you be *certain* that it will *always* have the same result, no matter what?

For example, if you were to see someone fill a water balloon with ice water and hold it out the window, you would probably either cringe in anticipation of the shouting below, or eagerly watch, depending on the situation. In either case, your response would be based on the fact that you would be *certain* that a water balloon would pop on someone's head if dropped out the window onto them. Your certainty would be based on your past experience with water balloons and sidewalks, and you'd very likely be correct, but until the balloon actually hits the target, there isn't any way to be absolutely certain it will break.

In math, situations like this occur a lot. Based on repeated experience, you may develop a rule or shortcut to save time or effort when calculating. However, you may be rightly concerned about using such shortcuts on an important exam. After all, how can you be *certain* that the shortcut works in every situation?

### Proofs by Induction

In this lesson you will learn about **mathematical induction**, a method of proof that will allow you to prove that a particular statement is true for all positive integers.

First let's make a guess at a formula that will give us the sum of all the positive integers from 1 to *n* for any integer *n*. If we look closely at Gauss’s Formula we used in the last lesson, where the young boy was able to quickly add up all of the numbers between 1 and 100, we can see a general form: there were 100 numbers, hence 50 pairs. So if there were *n* numbers, there would be (*n*/2) pairs. The first and last numbers were 1 and 100. They added together to give us 101. This number was the sum of each pair in the overall sum. So in general, we could add together 1 and *n* to get the sum of each pair. Therefore we might hypothesize that the sum of the first *n* positive integers is *n*((*1 +* n)/2). However, we have not proven that this formula works for all positive integers *n*. Mathematical induction will allow us to do this.

**The overall idea of induction is this:** Assume that a statement is true for some arbitrary value of *n*, and show that if the statement is true for *n* = *k*, it must also be true for *n* = *k+1*. This process is used because we can’t actually show it is true for every value. For example, you might show that the above equation is true for *n* = 100, and then *n* = 101, and then *n* = 102, but then what about 103? 104? 500? A million?

Mathematical induction allows us prove that a statement is true in three steps:

Step 1) The **base case***:* prove that the statement is true for the first value of *n*. In some cases, this might be *n* = 0. In the case of the integer sum formula above, we would start with *n* = 1. Often with induction you may want to expand the first step by showing that the statement is true for several values of *n*.

Step 2) The **inductive hypothesis***:* assume that the statement is true for the *k*^{th} value of *n*. In the case of the integer sum formula, we would state the following: the sum of the first *k* positive integers is *k*((1 + *k*)/2).

Step 3) The **inductive step***:* use the inductive hypothesis to show that the statement is true for the *k* + 1^{th} step. In the case of the integer sum formula, we would prove the following: assuming that the sum of the first *k* positive integers is *k*((1 + *k*)/2) , the sum of the first *k* +1 positive integers is ((*k* + 1) (1 + (*k* + 1)/2) .

Carrying out this kind of proof requires that you perform each of these steps., For the third step in particular you must rely on your algebra skills.

### Examples

#### Example 1

Earlier, you were asked how you could be certain that a theory always results in the correct answer.

Situations like this are custom-made for inductive proofs. If you come up with a shortcut on your math, and want to be absolutely certain it works in every situation, run it through the proof explained in this lesson. If it passes all of the tests, you can be sure it will work with any number you throw at it.

#### Example 2

Prove: The sum of the first *n* positive integers is .

Use the three steps of mathematical induction:

Step 1) The base case:

If *n* = 1, the entire sequence is just 1 and therefore the sum is 1. Also, .

This establishes the base case.

Step 2) Assume that the sum of the first positive integers is .

In other words, assume that .

Step 3) We must show that the sum of the first positive integers is .

In other words, we must show that .

There are two key ideas to keep in mind as you are carrying out this step: (1) remember to use the assumption and (2) remember how sums work.

How does the sum of the first *k* + 1 integers relate to the sum of the first *k* integers? To get the sum of the first *k* + 1 integers we must add up all the integers from 1 to *k* and then add on *k* + 1, since the sum of the first *k* + 1 integers is .

Now we must use our assumption. Remember that we are *assuming* that .

Substitute in for in our expression above for the sum of the first *k* + 1 integers.

Now we have the sum of the first *k* + 1 integers is .

Remember that we are trying to show that the sum of the first *k* + 1 integers is . With some algebraic manipulation, we can show that .

See below:

The common denominator is 2 Add the fractions | |

Simplify the numerator | |

Factor the numerator | |

The term is the same as | |

We have shown that our formula for the sum of the first *n* integers is true for *n* = 1. We have also shown that whenever it is true for *n* = *k* it is also true for *n* = *k+1*. Since we know it is true for *n* = 1, it must therefore be true for *n* = 2. Similarly, since it is true for *n* = 2, it must therefore be true for *n* = 3, and it must therefore be true for *n* = 4,... You should see that we have proven that the sum of the first *n* positive integers is for *all* integer values of *n*. We can similarly prove a formula for the sum of the first *n* terms in an arithmetic series.

#### Example 3

Prove that the sum of the first *n* terms of an arithmetic series is where *a*_{1} is the first term in the series and *a** _{n}* is the last term.

Recall that in an arithmetic sequence or series, there is a common difference, *d*, between each term, and that the n^{th} term is We need to keep these ideas in mind in order to complete the proof.

Step 1) Base case: if then

Using the hypothesized formula, we have

Step 2) Assume that

Step 3) Prove that if our formula for is true then .

We can think of the sum of the first *k* + 1 terms as the sum of the first *k* terms, plus the *k* + 1 term. So we have:

Add the term | |
---|---|

Use the formula for from step 2 | |

The common denominator is 2 | |

Add the fractions | |

Use substitution: remember that for any positive integer . So and | |

Distribute and combine like terms | |

Factor by grouping | |

Again, | |

#### Example 4

Use induction to prove that .

Step 1) Base case:

Step 2) Inductive hypothesis:

Step 3) Inductive step: show that

First, note that .

Now we have:

#### Example 5

Use induction to prove that .

Step 1) Base case:

Step 2) Inductive hypothesis: assume that

Step 3) Show that

We have:

#### Example 6

Use induction to prove that .

Step 1) Base case:

Step 2) Assume that

Step 3) Show that

First, note that

Now we have:

### Review

Use induction to prove the following:

### Review (Answers)

To see the Review answers, open this PDF file and look for section 7.6.