arXiv:1311.6180 [math.PR]AbstractReferencesReviewsResources
Moderate and Large Deviations for the Erdős-Kac Theorem
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.
Comments: 13 pages
Related articles: Most relevant | Search more
Central limit theorem for multiplicative class functions on the symmetric group
A central limit theorem for the zeroes of the zeta function
Optimal On-Line Selection of an Alternating Subsequence: A Central Limit Theorem