This site is supported by donations to The OEIS Foundation.

# Frivolous theorem of arithmetic

The frivolous theorem of arithmetic reminds us that there are infinitely many integers. Economists and astronomers deal with numbers that seem large to the lay person, but some number theorists and combinatorics experts deal with far larger numbers.

Theorem. (Steinbach)

Almost all [nonnegative] integers are very, very, very large.[1]

Proof. This is really more of a thought experiment than a rigorous, formal proof, but it has been independently thought of by a few different people and presented as a proof. For the purpose of this thought experiment we'll only consider nonnegative integers. Let's say, arbitrarily, that the smallest "large number" ${\displaystyle \scriptstyle m\,}$ is ${\displaystyle \scriptstyle 2^{32}\,}$. This number is in fact quite large for most practical purposes, and for most computers these days ${\displaystyle \scriptstyle m-1\,}$ is the largest unsigned integer they can handle without the need for any clever programming. All numbers from 0 to ${\displaystyle \scriptstyle m-1\,}$ are considered "small" and all numbers upwards from ${\displaystyle \scriptstyle m\,}$ are considered "large." Let us say, again also arbitrarily, that ${\displaystyle \scriptstyle m^{2}\,}$ is "infinite" (i.e. ${\displaystyle \scriptstyle m^{2}\,:=\,\infty \,}$ is thus not considered a number and the "large numbers" are ${\displaystyle \scriptstyle m\,}$ to ${\displaystyle \scriptstyle m^{2}-1\,}$). The percentage of "small numbers" is then about 0.000000023283%, while the percentage of "large numbers" is about 99.9999999767%.

As it is an understatement that infinity is much larger than our arbitrary setting, the actual percentage of "large numbers" is much greater than given here and the percentage of "small numbers" much smaller. As we let ${\displaystyle \scriptstyle m^{2}\,}$ go towards infinity, the percentage of "small numbers" (i.e. 0 to ${\displaystyle \scriptstyle m-1\,}$) among "all numbers" (i.e. 0 to ${\displaystyle \scriptstyle m^{2}-1\,}$) goes down to 0%, i.e.

${\displaystyle \lim _{m^{2}\to \infty }{\frac {m}{m^{2}}}={\frac {1}{m}}=0,\,}$

while the percentage of "large numbers" goes up to 100%, i.e.

${\displaystyle \lim _{m^{2}\to \infty }{\frac {m^{2}-m}{m^{2}}}=1-{\frac {1}{m}}=1.\,}$

Since between each pair of consecutive integers there is the same uncountably infinite (the cardinality of the continuum ${\displaystyle \scriptstyle c\,=\,2^{\aleph _{0}}\,}$, i.e. the cardinality of the power set of the integers) number of real numbers, this theorem could just as well be extended to all real numbers, while the proof could remain concerned only with integers.

While frivolous, this theorem is not useless. It can be used to show, among other things, that there is no "lossless data compression method that compresses all inputs to smaller bit strings,"[2] or that it is entirely unrealistic to expect to find counterexamples to certain conjectures by testing each progressively larger number until finding the one that disproves the conjecture.