Sieving and the Erd{\H o}s-Kac theorem
Andrew Granville, K. Soundararajan

TL;DR
This paper presents an accessible proof of the Erdős-Kac theorem using moment calculations, extending it within sieve theory and connecting to related results in number theory.
Contribution
It introduces a simplified proof method for the Erdős-Kac theorem and demonstrates its extension in sieve theory, linking to existing literature.
Findings
Proof of Erdős-Kac theorem via moments
Extension of proof within sieve theory
Connections to related number theory results
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Algebraic Geometry and Number Theory
