arXiv Analytics

Sign in

arXiv:1311.6180 [math.PR]AbstractReferencesReviewsResources

Moderate and Large Deviations for the Erdős-Kac Theorem

Behzad Mehrdad, Lingjiong Zhu

Published 2013-11-24, updated 2015-11-26Version 3

The Erd\H{o}s-Kac theorem is a celebrated result in number theory which says that the number of distinct prime factors of a uniformly chosen random integer satisfies a central limit theorem. In this paper, we establish the large deviations and moderate deviations for this problem in a very general setting for a wide class of additive functions.

Related articles: Most relevant | Search more
arXiv:1010.5361 [math.PR] (Published 2010-10-26, updated 2011-06-13)
Central limit theorem for multiplicative class functions on the symmetric group
arXiv:1205.0303 [math.PR] (Published 2012-05-02, updated 2014-05-10)
A central limit theorem for the zeroes of the zeta function
arXiv:1212.1379 [math.PR] (Published 2012-12-06, updated 2013-06-09)
Optimal On-Line Selection of an Alternating Subsequence: A Central Limit Theorem