This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Erdős–Kac theorem | |
|---|---|
| Name | Erdős–Kac theorem |
| Field | Number theory |
| Introduced by | Paul Erdős, Mark Kac |
| Year | 1939 |
Erdős–Kac theorem. The Erdős–Kac theorem is a probabilistic result in Number theory describing the normal distribution of the number of prime factors of large integers. Formulated by Paul Erdős and Mark Kac, it connects ideas from Probability theory, Analytic number theory, and the work of predecessors such as G. H. Hardy, John Littlewood, and Srinivasa Ramanujan. The theorem inaugurated a fruitful interaction between random models inspired by Benoit Mandelbrot-style heuristics and rigorous results linked to the names Atle Selberg, Pál Turán, and Alfréd Rényi.
Let ω(n) denote the number of distinct prime factors of the integer n and let Ω(n) denote the number of prime factors counted with multiplicity. The Erdős–Kac theorem asserts that as x → ∞ the distribution of ω(n) for n ≤ x, suitably normalized, approaches the standard normal distribution. More precisely, for real a < b, for the proportion of integers n ≤ x with (ω(n) − log log x)/sqrt(log log x) ∈ [a,b] tends to Φ(b) − Φ(a), where Φ is the cumulative distribution function associated to the Normal distribution studied by Carl Friedrich Gauss and popularized by Abraham de Moivre and Pierre-Simon Laplace. Variants replace ω(n) by Ω(n) and adjust constants; related limit laws echo work by Andrey Kolmogorov, Paul Lévy, and William Feller in limit theorems.
The theorem emerged from probabilistic perspectives in Analytic number theory developed in the early 20th century. G. H. Hardy and Srinivasa Ramanujan proved earlier normal order results for ω(n), and G. H. Hardy with J. E. Littlewood introduced distributional considerations around primes. Paul Erdős and Mark Kac combined methods reminiscent of Probability theory and the Central limit theorem to propose and prove the result, influenced by combinatorial techniques from Paul Turán and sieve ideas traceable to V. A. Brun and Atle Selberg. Subsequent refinements were achieved by Pál Erdős collaborators and later investigators including Bob Vaughan, Henryk Iwaniec, Enrico Bombieri, and A. A. Karatsuba who linked the theorem to deeper Prime number theorem-style estimates and zero-density results associated with Bernhard Riemann's work and the Riemann zeta function.
The proof blends combinatorial number theory, probabilistic approximation, and analytic estimates. One models ω(n) as a sum of indicator random variables for divisibility by each prime p and applies a version of the Central limit theorem after verifying approximate independence via multiplicative number-theoretic inputs from Mertens, Atle Selberg, and the sieving methods of Brun. Key steps use moment calculations analogous to those in work by Paul Erdős and Paul Turán and control of error terms using estimates related to the Prime number theorem and mean-value theorems for multiplicative functions due to G. H. Hardy and John Littlewood. Modern proofs streamline the argument through techniques of Hugh Montgomery and Robert Vaughan with explicit use of characteristic functions and truncations reflecting methods from Andrey Kolmogorov and William Feller.
The original theorem has numerous extensions: replacing ω(n) with Ω(n) yields analogous Gaussian limits; restricting to arithmetic progressions invokes generalizations tied to Dirichlet L-series and results by Johann Peter Gustav Lejeune Dirichlet; multiplicative functions beyond indicator functions were treated by P. D. T. A. Elliott and K. Soundararajan; function-field analogues were developed in the context of André Weil-inspired frameworks and work by Rudnick and Yitang Zhang-adjacent researchers. Further extensions include local limit theorems, large deviations studied by Kurt Gödel-adjacent probabilists, and adaptations using Erdős–Rényi model-style heuristics in probabilistic combinatorics associated to Paul Erdős and Alfréd Rényi.
The theorem informs heuristics in prime factorization problems, cryptographic assessments tied to integer factorization relevant to institutions like RSA and complexity analyses influenced by Alan Turing-era algorithmic ideas. It provides a benchmark for statistical behavior in multiplicative number theory influencing work on smooth numbers studied by Carl Pomerance and distributions in random permutations related to Andrey Kolmogorov-style limit laws. Connections to the Riemann zeta function and zero-distribution heuristics guide conjectures by Hugh Montgomery and results by Enrico Bombieri and Brian Conrey on correlations of arithmetic functions.
Related limit theorems include the classical normal order of ω(n) by G. H. Hardy and Srinivasa Ramanujan, the Turán–Kubilius inequality associated with Paul Turán and Juozas Kubilius, and probabilistic models in additive and multiplicative number theory developed by Pál Turán and P. D. T. A. Elliott. Comparisons are drawn to function-field analogues studied in the settings introduced by André Weil and to distributional results for divisor functions linked to Dirichlet and Bernhard Riemann-inspired analytic methods. The ensemble of these results frames the Erdős–Kac theorem as central to modern interactions between Probability theory and Analytic number theory.
Category:Theorems in number theory