This is what I read somewhere
"well-ordering principle for natural numbers is equivalent to the principle of mathematical induction"
Now using well-ordering principle (that every non empty subset of natural numbers has a minimum) I could prove mathematical induction (if P(1) is true and P(n) => P(n+1) then P(i) is true for all i in N)
This is rather trivial.
But using mathematical induction I could not derive well-ordering principle. So is 'well-ordering principle' more powerful assertion than induction? Or, there is a nice way to prove it.
Any help plz?