Sieving and the Erd{H o}s-Kac theorem
classification
🧮 math.NT
math.PR
keywords
prooftheoremcomputingcontexteasyextendsgiveleads
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.