The beauty of induction is that it allows a theorem to be proven true where an infinite number of cases exist without exploring each case individually. Induction is analogous to an infinite row of dominoes with each domino standing on its end. If you want to make all the dominoes fall, you can either:

- push on the first one, wait to see what happens, and then check each domino afterwards (which may take a long time if there's an infinite number of dominoes!)
- or you can
*prove*that if any domino falls, then it will cause the domino after it to fall. (i.e. if the first one falls then the second one will fall, and if the second one falls then the third one will fall, etc.)

Induction, essentially, is the methodology outlined in point 2.

## Contents

## Parts of InductionEdit

Induction is composed of three parts:

- The Base Case (in the domino analogy, this shows the first domino will fall)
- The Induction Hypothesis (in the domino analogy, we assume that a particular domino will fall)
- The Inductive Step (in the domino analogy, we prove that the domino we assume will fall will cause the next domino to fall)

## Weak InductionEdit

Weak induction is used to show that a given property holds for all members of a countable inductive set, this usually is used for the set of natural numbers.

Weak induction for proving a statement (that depends on ) relies on two steps:

- is true for a certain base step. Usually the base case is or

- . That is, given that is true, is also true.

If these two properties hold, one may induce that the property holds for all elements in the set in question. Returning to the example, if you are sure that you called your neighbor, and you knew that everyone who was called in turn called his/her neighbor, then you would be guaranteed that everyone on the block had been called (assuming you had a linear block, or that it curved around nicely).

### ExamplesEdit

The first example of a proof by induction is always 'the sum of the first n terms:'

**Theorem 2.4.1.**For any fixed

**Proof:**

- Base step: , therefore the base case holds.

- Inductive step: Assume that . Consider .

So the inductive case holds. Now by induction we see that the theorem is true.

## Reverse InductionEdit

Reverse induction is a method of using an inductive step that uses a negative in the inductive step. It is a minor variant of weak induction. The process still applies only to countable sets, generally the set of whole numbers or integers, and will frequently stop at 1 or 0, rather than working for all positive numbers.

Reverse induction works in the following case.

- The property holds for a given value, say .

- Given that the property holds for a given case, say , Show that the property holds for .

Then the property holds for all values .

I learnt today from http://people.math.carleton.ca/~ckfong/hs14a.pdf (see example there) that reverse indcution is also usable in the general case: "to establish the validity of a sequence of propositions Pn (n ≥ 1), it is enough to establish the following

(a) Pn is valid for inﬁnitely many n.

(b) If Pn+1 is valid, then so is Pn.

It can be the case that we can easily prove P1 and if P for n=m so P for n=2m. In this case we have (a) for the infinitely many n = 2 exp k (for k >= 0).

## Strong InductionEdit

In weak induction, for the inductive step, we only required that for a given , its *immediate predecessor* () satisfies the theorem (i.e., is true). In strong induction, we require that not only the immediate predecessor, but all predecessors of satisfy the theorem. The variation in the inductive step is:

- If is true for all then is true.

The reason this is called strong induction is fairly obvious--the hypothesis in the inductive step is much stronger than the hypothesis is in the case of weak induction. Of course, for finite induction it turns out to be the same hypothesis, but in the case of transfinite sets, weak induction is not even well-defined, since some sets have elements that do not have an immediate predecessor.

## Transfinite InductionEdit

Used in proving theorems involving transfinite cardinals. This technique is used in set theory to prove properties of cardinals, since there is rarely another way to go about it.

## Inductive SetEdit

We first define the notion of a *well-ordered* set. A set is *well-ordered* if there is a total order < on and that whenever is non-empty, there is a *least-element* in . That is, such that .

An *inductive set* is a set such that the following hold:

- (where is the least element of )
- If then such that

Of course, you look at that and say "Wait a minute. That means that !" And, of course you'd be right. That's exactly why induction works. The principle of induction is the theorem that says:

**Theorem 2.4.2.**If is a non-empty well-ordered set and is an inductive subset of then .

The proof of this theorem is left as a very simple exercise. Here we note that the set of natural numbers is clearly well-ordered with the normal order that you are familiar with, so is an inductive set. If you accept the axiom of choice, then it follows that every set can be well-ordered.

## ExercisesEdit

```
1 + 2 + 3 + … + n = n(n + 1)2
```

First, we show that it holds for integers 1, 2 and 3

- 1 = 2×1/2
- 1 + 2 = 3×2/2
- 1 + 2 + 3 = 4×3/2 = 6

Suppose the identiy holds for some number *k*, then

is true.

We aim to show that:

is also true. We proceed

which is what we have set out to show. Since the identity holds for 3, it also holds for 4 and since it holds for 4 it also holds for 5, and 6 and 7 and so on.

^{n}for n ≥ 4.

The claim is true for n = 4. As 4! > 2^{4}, i.e. 24 > 16. Now suppose it's true for n = k, k ≥ 4, i.e.

- k! > 2
^{k}

it follows that

- (k+1)k! > (k+1)2
^{k}> 2^{k+1} - (k+1)! > 2
^{k+1}

We have shown that if for n = k then it's also true for n = k + 1. Since it's true for n = 4, it's true for n = 5, 6, 7, 8 and so on for all n.

` 1`^{3} + 2^{3} + … + n^{3} = (n+1)^{2n²}4

Suppose it's true for n = k, i.e.

it follows that

We have shown that if it's true for n = k then it's also true for n = k + 1. Now it's true for n = 1 (clear). Therefore it's true for all integers.

*n*: 2 + 4 + 6 + … + 2k = k(k + 1)

First, we show that this statement holds for *n*=1.

Assume that the equation holds for *n*=*k*. Then,

We aim to show that .

Adding to both sides,

- ,

which is what we set out to prove. By mathematical induction, the formula holds for all .

*n*: 1 + 4 + 7 + … + (3n - 2) = n(3n - 1)2

First, we show that this statement holds for *n*=1.

Assume that the equation holds for *n*=*k*. Then,

We aim to show that .

Adding to both sides,

- ,

which is what we set out to prove. By mathematical induction, the formula holds for all .

*n*: 2 + 7 + 12 + … + (5n - 3) = n(5n - 1)2

First, we show that this statement holds for *n*=1.

Assume that the equation holds for *n*=*k*. Then,

We aim to show that , same as .

Adding to both sides,

- ,

which is what we set out to prove. By mathematical induction, the formula holds for all .

*n*: 1 + 2⋅2 + 3⋅2

^{2}+ 4⋅2

^{3}+ … + n⋅2

^{n-1}= 1 + (n-1)2

^{n}

;

First, we show that this statement holds for *n*=1.

Assume that the equation holds for *n*=*k*. Then,

We aim to show that , same as .

Adding to both sides,

- ,

which is what we set out to prove. By mathematical induction, the formula holds for all .

*n*: 1

^{2}+ 2

^{2}+ 3

^{2}+ … + n

^{2}= n(n+1)(2n+1)6

First, we show that this statement holds for *n*=1.

Assume that the equation holds for *n*=*k*. Then,

We aim to show that , same as .

Adding to both sides,

- ,

which is what we set out to prove. By mathematical induction, the formula holds for all .

*n*: 11⋅2 + 12⋅3 + 13⋅4+ … + 1n⋅(n+1) = nn+1

First, we show that this statement holds for *n*=1.

Assume that the equation holds for *n*=*k*. Then,

We aim to show that , same as .

Adding to both sides,

- ,

which is what we set out to prove. By mathematical induction, the formula holds for all .

This problem can be solved without mathematical induction. We note that . Then, the question can be paraphrased as , which simplfies to , or . Q.E.D.

*n*: 3 + 3

^{2}+ 3

^{3}+ … + 3

^{n}= 3⋅3

^{n-1}2

First, we show that this statement holds for *n*=1.

Assume that the equation holds for *n*=*k*. Then,

We aim to show that .

Adding to both sides,

- ,

which is what we set out to prove. By mathematical induction, the formula holds for all .

This can also be proven using the sum formula for a geometric series.

*n*:

First, we show that this statement holds for *n*=1.

Assume that the equation holds for *n*=*k*. Then,

We aim to show that .

Adding to both sides,

- ,

which is what we set out to prove. By mathematical induction, the formula holds for all .

*n*:

First, we show that this statement holds for *n*=1.

Assume that the equation holds for *n*=*k*. Then,

We aim to show that .

Adding to both sides,

- ,

which is what we set out to prove. By mathematical induction, the formula holds for all .

This problem can be solved without using mathematical induction.

multiply both sides by

expand,

and simplify.

. Q.E.D.

*n*: if (the so called

*Bernoulli's inequality*)

if

First, we show that this statement holds for *n*=1.

- because

Assume that the equation holds for *n*=*k*. Then,

We aim to show that .

Multyplying by both sides, (desn't alter the sign of the inequality because , and so )

The last step relies on the fact that , since and a square is always greater than or equal to 0.

- ,

which is what we set out to prove. By mathematical induction, the formula holds for all .

*n*:

First, we show that this statement holds for *n* = 1 and *n* = 2.

- because
- because

Assume that the inequality holds for *n*=*k*. Then,

We aim to show that and

We know that (added to both sides of ).

Now we need to show that

The last statement is clearly true (). Therefore, and thus .

Now we show that . We know that (added to both sides of ). Now we need to show that

The last statement is clearly true (). Therefore, and thus .

Multyplying by both sides, (desn't alter the sign of the inequality because , and so ) Combining both inequalities we proved, we get the one we needed for the inductive step.

- and ,

and by mathematical induction, the formula holds for all .

*n*: (Hard)

First, we show that this statement holds for *n* = 1.

- because

Assume that the inequality holds for *n*=*k*. Then,

We aim to show that

We know that (added to both sides of ).

Now we need to show that

The last statement is clearly true. Therefore, and thus , the inductive step, and by mathematical induction, the formula holds for all .

*n*: 3 is a factor of

No Solutions Available

*n*: 9 is a factor of

No Solutions Available

*n*: 4 is a factor of

No Solutions Available

*n*: is a factor of

No Solutions Available

*n*: is divisible by 2304

No Solutions Available

No Solutions Available