Induction

Falling dominoes

An interactive lesson with 6 steps, about 5 minutes: you predict, drag and solve, with instant feedback on every answer. It runs in your browser and needs JavaScript.

What you’ll learn

• Induction: prove a base case and an inductive step (k ⇒ k + 1).
• Every step must work, including the very first one (remember the horses).
• Induction proves infinitely many statements in finitely many lines.

Steps

1. Dominoes
2. Proof by induction
3. Odd numbers make squares
4. Spot the flaw
5. Sum to twenty
6. Use the pattern