vix.ing · top · new · best · stats · spec

Sieving and the Erd\H os-Kac theorem

2006/06/01 by Andrew Granville, K. Soundararajan, Granville, Andrew +1 · 1 citation
Mathematics · #Algebraic Geometry and Number Theory #Analytic Number Theory Research #FOS: Mathematics #Limits and Structures in Graph Theory #Number Theory (math.NT) #Probability (math.PR) #math.NT #math.PR

paper · pdf · doi:10.48550/arxiv.math/0606039

12 pages; expository article, to appear in the Montreal NATO school on equidistribution

arxiv created 2006/06/01 · openalex publication_date 2006/06/01 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

Related