Proof by Strong Induction

Proof by Strong Induction consists of:

• Base Case: Show that solution holds for $n=1$.
• Inductive Case:
  1. Assume it holds for all $m\le k$.
  2. Substitute to confirm it also holds for $n=k+1$.