Sieving and the Erd{\H o}s-Kac theorem
Number Theory
2007-05-23 v1 Probability
Abstract
We give a relatively easy proof of the Erd\H os-Kac theorem via computing moments. We show how this proof extends naturally in a sieve theory context, and how it leads to several related results in the literature.
Cite
@article{arxiv.math/0606039,
title = {Sieving and the Erd{\H o}s-Kac theorem},
author = {Andrew Granville and K. Soundararajan},
journal= {arXiv preprint arXiv:math/0606039},
year = {2007}
}
Comments
12 pages; expository article, to appear in the Montreal NATO school on equidistribution