The induction step should have n = k+1
Use mathematical induction to prove that the assertion is true for . is divisible by .
basis then is divisible by .
IH let and assume is divisible by .
Induction Step
Since is divisble by (by the induction hypothesis) then is also divisible by
Is this right?
What is wrong with the latex
If this is a proof by induction you need to go a step at a time, not prove it for all numbers at once.IH let and assume is divisible by .
I'd say this. "Assume . We want to show ."
Not quite, no. You have the formula wrong, and you need to show your work; how do you know 4 divides for certain?Since is divisble by (by the induction hypothesis) then is also divisible by