Category Archives: proof techniques

Strong Induction Wasn’t Needed After All

Lately when I’ve taught the second principle of mathematical induction – also called “strong induction” – I’ve used the following example to illustrate why we need it. Prove that you can make any amount of postage of 12 cents or … Continue reading

Posted in number theory, proof techniques | Leave a comment

The Validity of Mathematical Induction

Suppose you have some statement .  Mathematical induction says that the following is sufficient to prove that is true for all natural numbers k. is true. For any natural number k, if is true, then is true. The idea is that the first … Continue reading

Posted in number theory, proof techniques | Leave a comment