Hardy–Ramanujan theorem

From HandWiki

In mathematics, the Hardy–Ramanujan theorem, proved by Ramanujan and checked by Hardy[1] states that the normal order of the number ω(n) of distinct prime factors of a number n is log(log(n)). Roughly speaking, this means that most numbers have about this number of distinct prime factors.

Precise statement

A more precise version states that for every real-valued function ψ(n) that tends to infinity as n tends to infinity

[math]\displaystyle{ |\omega(n)-\log\log n|\lt \psi(n)\sqrt{\log\log n} }[/math]

or more traditionally

[math]\displaystyle{ |\omega(n)-\log\log n|\lt {(\log\log n)}^{\frac12 +\varepsilon} }[/math]

for almost all (all but an infinitesimal proportion of) integers. That is, let g(x) be the number of positive integers n less than x for which the above inequality fails: then g(x)/x converges to zero as x goes to infinity.

History

A simple proof to the result (Turán 1934) was given by Pál Turán, who used the Turán sieve to prove that

[math]\displaystyle{ \sum_{n \le x} | \omega(n) - \log\log x|^2 \ll x \log\log x \ . }[/math]

Generalizations

The same results are true of Ω(n), the number of prime factors of n counted with multiplicity. This theorem is generalized by the Erdős–Kac theorem, which shows that ω(n) is essentially normally distributed.

References

  1. G. H. Hardy and Srinivasa Ramanujan (1917)