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

Simple item page
dc.creatorGranville, Andrew
dc.creatorSoundararajan, K.
dc.date2006-06-01
dc.date.accessioned2026-07-07T07:14:44Z
dc.date.available2026-07-07T07:14:44Z
dc.descriptionWe 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.
dc.description12 pages; expository article, to appear in the Montreal NATO school on equidistribution
dc.identifierhttps://arxiv.org/abs/math/0606039
dc.identifierhttp://arxiv.org/abs/math/0606039
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113002
dc.subjectNumber Theory
dc.subjectProbability
dc.titleSieving and the Erd{\H o}s-Kac theorem
dc.typetext

Files

Collections

arXiv