Answer: All natural numbers.
- A All real numbers
- B All natural numbers
- C All irrational numbers
- D All negative integers
Correct answer: B. All natural numbers
Explanation: Mathematical induction proves a statement P(n) holds for every natural number n, starting from a base case.
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.