Sieving and the Erd{\H o}s-Kac theorem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
12 pages; expository article, to appear in the Montreal NATO school on equidistribution

Keywords

Number Theory, Probability

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/113002

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0606039
 http://arxiv.org/abs/math/0606039

Collections

arXiv