As is generally known, the principal of mathematical induction is used in the following form: We are supposed to prove a proposition for natural numbers. We check whether it is true for the natural number 1, and then assume it to be true for another natural number m. Then, we got to show that the proposition also holds for the natural number .

**Here is a variation of the principle of mathematical induction: **

Assume the proposition to be true for a *first natural number k* (you have to find the particular value of k under the conditions of the given problem). Then, assume it to be true for the natural number m. Finally, we gotta show that the proposition is true for the natural number .

**Example. Show that if n is large enough.**

**Solution. How large is large? We have to find that “first” value for which the above proposition is true. We actually need to check whether the inequality holds for . **

So, if we tabulate the values of LHS and RHS, we find that the first natural number for which this holds is ..

Hence, the proposition is true for n=7.

Assume the proposition to be true for some natural number m where .

That is, holds true. Multiplying both sides by , we get

that is,

, but . Hence, we get

which equals .

Hence, obviously, that is,

. That is, the proposition holds for all natural numbers. Thus, the proof.

More later,

Nalin Pithwa