Answer: inductive step.
- A inductive step
- B final step
- C guessing step
- D drawing step
Correct answer: A. inductive step
Explanation: Every induction proof needs a base case and an 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.