Embedded Files
Well-Ordering Principle
Well-Ordering Principle
Every non-empty set S of non-negative integers contains a least element. That is, there is some integer a in S such that a<=b for all b in S.
Google Sites
Report abuse
Every non-empty set S of non-negative integers contains a least element. That is, there is some integer a in S such that a<=b for all b in S.