Here is a correct proof by contradiction.
Assume that the natural numbers are bounded, then there exists a least upper bound in the real numbers, call it x, such that n ≤ x for all n.
Consider x - 1. Since x is the least upper bound, then x - 1 is not an upper bound; i.e. there exists a specific n such that x - 1 < n.
But then, x - 1 < n implies x < n + 1, hence x is not an upper bound.
QED
This concludes the proof; i.e. there exists no upper bound in the real numbers for the set of natural numbers.
P.S. There exists sets in which the set of natural numbers are bounded, but these are not in the real number system.
Chat with our AI personalities
N-P = 0. Note here that N is the set of Natural numbers, P is the set of positive integers, and - is the set operation that in the above statement implies N and P are the same, with the exception that 0 is an element of N but not of P.
That's an infinite set that starts with 8, 16, 24, 32, 40 and goes on forever.
Please tell us your set of numbers.
a set of numbers
The LCM for any pair of natural numbers can be as big as their product.