#### Answer

(ii) "If P(k) is true, then P(k+1) is true."

#### Work Step by Step

In Step 2 of mathematical induction we prove the second statement:
(ii) "If P(k) is true, then P(k+1) is true."
This statement, along with proving that $P(1)$ is true, allows us to prove that $P(n)$ is true for all $n$.