Key idea: induction needs both a true base case and the step S(K)⇒S(K+1). Check each separately.
- Base case: S(1) says 1=3+1=4, which is false. So (A) is false, and induction cannot prove the formula, so (B) is false.
- Inductive step: assume 1+3+⋯+(2K−1)=3+K2. Adding 2K+1 gives 3+K2+2K+1=3+(K+1)2, which is exactly S(K+1).
- So S(K)⇒S(K+1) holds, even though the formula is false. (The true sum is K2.)
Answer: (D) S(K)⇒S(K+1)