In mathematical induction, if the initial step case holds for n = 1, what should we prove next?

Question

In mathematical induction, if the initial step case holds for  n  = 1, what should we prove next?

Answer

Prove the inductive hypothesis for  n  =  k.

Answer

Prove the inductive hypothesis for  n  =  k  + 1.

Answer

Prove the inductive step for  n  =  k  + 1.

Answer

Prove the statement is false for  n  = 2 .

Crowdly