Answer: falling dominoes.
- A falling dominoes
- B loose stones
- C stacked bricks
- D flipped coins
Correct answer: A. falling dominoes
Explanation: Each domino knocking over the next mirrors P(k) implying P(k + 1).
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.