Related papers: High and odd moments in the Erd\H{o}s--Kac theorem

Montgomery and Soundararajan showed that the distribution of $\psi(x+H) - \psi(x)$, for $0 \le x \le N$, is approximately normal with mean $ \sim H$ and variance $\sim H \log (N/H)$, when $N^{\delta} \le H \le N^{1-\delta}$. Their work…

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…

By adapting the moment method developed by Granville and Soundararajan [17], Khan, Milinovich and Subedi [24] recently obtained a weighted version of the Erd\H{o}s--Kac theorem for $\omega(n)$ with multiplicative weight $d_k(n)$, where…

We prove an Erd\H{o}s-Kac type of theorem for the set $S(x,y)=\{n\leq x: p|n \Rightarrow p\leq y \}$. If $\omega (n)$ is the number of prime factors of $n$, we prove that the distribution of $\omega(n)$ for $n \in S(x,y)$ is Gaussian for a…

We show that the Erd\H{o}s-Kac theorem is valid in almost all intervals $\left[x,x+h\right]$ as soon as $h$ tends to infinity with $x$. We also show that for all $k$ near $\log\log x$, almost all interval $\left[x,x+\exp\left(\left(\log\log…

We prove near-optimal upper bounds for the odd moments of the distribution of coprime residues in short intervals, confirming a conjecture of Montgomery and Vaughan. As an application we prove near-optimal upper bounds for the average of…

Given $n\in\mathbb{N}$, let $\omega\left(n\right)$ denote the number of distinct prime factors of $n$, let $Z$ denote a standard normal variable, and let $P_{n}$ denote the uniform distribution on $\left\{ 1,\ldots,n\right\} $. The…

The celebrated Erd\H{o}s--Kac theorem says, roughly speaking, that the values of additive functions satisfying certain mild hypotheses are normally distributed. In the intervening years, similar normal distribution laws have been shown to…

We show that for large integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the number of prime factors follows an approximate normal distribution, with mean $C \log_2 n$ and variance $V \log_2 n$,…

Given a natural number $n$, let $\omega\left(n\right)$ denote the number of distinct prime factors of $n$, let $Z$ denote a standard normal variable, and let $P_{n}$ denote the uniform distribution on $\left\{ 1,\ldots,n\right\} $. The…

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.

In this article we show that the Erd\H{o}s-Kac theorem, which informally states that the number of prime divisors of very large integers converges to a normal distribution, has an elegant proof via Algorithmic Information Theory.

Let $x\geqslant 3$, for $1\leqslant n \leqslant x$ an integer, let $\omega(n)$ be its number of distinct prime factors. We show that, among the values $n\leqslant x$ with $\omega(n)=k$ where $1\leqslant k \ll \log_2 x$, $\omega(n-1)$…

For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1…

Lindsay and Basak (2000) posed the question of how far from normality could a distribution be if it matches $k$ normal moments. They provided a bound on the maximal difference in c.d.f.'s, and implied that these bounds were attained. It…

Building on earlier work introducing the notion of "mod-Gaussian" convergence of sequences of random variables, which arises naturally in Random Matrix Theory and number theory, we discuss the analogue notion of "mod-Poisson" convergence.…

Transforming the Erd\H{o}s-Kac theorem provides more flexibility in how the theorem can be utilized as an interval estimate for the prime omega function, which counts the number of distinct prime divisors. Here, we consider a direct…

Let $s(n)=\sum_{d\mid n,~d<n} d$ denote the sum of the proper divisors of $n$. The second-named author proved that $\omega(s(n))$ has normal order $\log\log{n}$, the analogue for $s$-values of a classical result of Hardy and Ramanujan. We…

We prove a bound for the Wasserstein distance between vectors of smooth complex random variables and complex Gaussians in the framework of complex Markov diffusion generators. For the special case of chaotic eigenfunctions, this bound can…

Let $h(d)$ be the class number of indefinite binary quadratic forms of discriminant $d$, and let $\varepsilon_d$ be the corresponding fundamental unit. In this paper, we obtain an asymptotic formula for the $k$-th moment of $h(d)$ over…