Problem Statement:(adsbygoogle = window.adsbygoogle || []).push({});

Prove that the least upper bound of a set of integers is an integer.

Attempt:

Using well ordered principle this is very trivial. However, is there another way?

ANY comments or ideas relating to the topic would be highly appreciated.

It is assumed that the set mentioned is bounded above.

The mobile version of PF has bugs so the code that was supposed to be pre-generated for this thread did not show up :-(

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Prove that the least upper bound of a set of a set of integers is

**Physics Forums | Science Articles, Homework Help, Discussion**