Sept 15 - Week 2

In today's lecture we escaped from simple induction proof and instead we will have strong or complete induction. The professor uses two examples to show how complete induction applies.

Instead of simple induction which need one or a few base cases and then all other possible cased can be proved by the base case, the strong induction needs all the n-1 cases to be true in order to prove the "n"th to be true.