Are there any proofs that cannot be done using mathematical induction, but can be done using strong induction?
Is the proof of every integer≥2 is divisible by a prime?
Appreciate the help!
Asked
Active
Viewed 148 times
1 Answers
1
One can prove strong induction using ordinary induction; so any proof that uses strong induction could be rewritten, if desired, to use only ordinary induction.
Greg Martin
- 78,820
-
But it can still be proven using MI, right? I'm trying to find proofs that cannot be solved using MI, and only able to be solved using Strong Induction. – spuddy Mar 24 '20 at 07:39
-
And @Greg Martin has explained to you why that is impossible. – ancient mathematician Mar 24 '20 at 08:35