The Frivolous Theorem states that almost all positive integers are very, very large.[1]
Informally, for all positive integers \(n\), if we "randomly" select a positive integer \(x\), the probability that \(x > n\) is 1. This informal interpretation includes a theoretic problem, because it is provable that there exists no probability measure on \(\mathbb{N}\) such that it is random in the sense that every automorphism of \(\mathbb{N}\) preserves the measure.
Sources[]
- ↑ Frivolous Theorem of Arithmetic. Wolfram MathWorld. Retrieved 2013-04-27.