Find the mistakes in the proof fragments,ExerciseTheorem: For any integer n ≥ 1,“Proof (by...

Find the mistakes in the proof fragments,

Exercise

Theorem: For any integer n ≥ 1,

“Proof (by mathematical induction): Certainly the theorem is true for n = 1 because 12 = 1 and  So the basis step is true.

For the inductive step, suppose that for some integer k ≥1,

 We must show that