Answer: A row of falling dominoes.
- A A row of falling dominoes
- B A game of chess
- C A balance scale
- D A circular race track
Correct answer: A. A row of falling dominoes
Explanation: If the first domino falls, and each falling domino knocks down the next, all dominoes eventually fall. This mirrors base case plus inductive step.
Mathematical induction works like a row of dominoes: proving the base case P(1) tips the first domino, and proving the inductive step (P(k) ⟹ P(k+1)) guarantees each domino knocks over the next - together these two facts guarantee ALL dominoes fall, without checking each one individually.
Concept context
A proof technique used to establish that a statement is true for every natural number, using a base case and an inductive step.