A way to prove numbers are unbounded is through proof by contradiction. Let’s assume that an upper bound to numbers exists and that upper bound is B. We can then add 1 to B, so that upper bound is now B+1. We can then wash, rinse, repeat. So, numbers are unbounded.
Latest Answers