What is the first step in , a mathematical induction proof? A A Prove that the statement is true for n=0 B Prove that the statement is true for n=1 C Assume that the statement is true for n=k

The correct answer is **B. Prove that the statement is true for n=1**.While some inductive proofs might start at n=0 (or even another integer), the most common and fundamental starting point for mathematical induction is to show the base case holds true for n=1. This establishes the foundation upon which the inductive step builds. Only after proving the base case can you proceed to assume the statement is true for n=k (step C) and then prove it's true for n=k+1.