In the first of three lectures on mathematical induction, try out this powerful tool for proving theorems about the positive integers. See how an inductive proof is like knocking over a row of dominos: Once the base case pushes over a second case, then by induction all cases fall.