answersLogoWhite

0

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.

User Avatar

Wiki User

14y ago

Still curious? Ask our experts.

Chat with our AI personalities

ProfessorProfessor
I will give you the most educated answer.
Chat with Professor
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi
FranFran
I've made my fair share of mistakes, and if I can help you avoid a few, I'd sure like to try.
Chat with Fran

Add your answer:

Earn +20 pts
Q: Show that the natural set of numbers is an unbounded set?
Write your answer...
Submit
Still have questions?
magnify glass
imp