Answer: 1.
- A 1
- B 0
- C 2
- D 10
Correct answer: A. 1
Explanation: The base case is checked at the smallest value in the range, here n = 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.