Related papers: A Generalization of the Erd\H{o}s-Kac Theorem

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 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 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$,…

The classical Erd\H{o}s-Kac theorem states that for $n$ chosen uniformly at random from $1, \dots, N$, the random variable $(\omega(n) - \log\log N)/\sqrt{\log\log N}$ converges in distribution to the standard Gaussian as $N$ tends to…

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…

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…

In this paper, we study the linear independence between the distribution of the number of prime factors of integers and that of the largest prime factors of integers. Respectively, under a restriction on the largest prime factors of…

Let $\omega(n)$ denote the number of distinct prime factors of a natural number $n$. In 1940, Erd\H{o}s and Kac established that $\omega(n)$ obeys the Gaussian distribution over natural numbers, and in 2004, the third author generalized…

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)$…

Let $\omega(n)$ denote the number of distinct prime factors of a natural number $n$. In 1940, Erd\H{o}s and Kac established that $\omega(n)$ obeys the Gaussian distribution over natural numbers. In 2004, the third author generalized their…

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.

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…

The Erdos-Kac theorem, a foundational result in probabilistic number theory, states that the number of prime factors of an integer follows a Gaussian distribution. In this paper we develop and analyze probabilistic models for "random…

Random integers, sampled uniformly from $[1,x]$, share similarities with random permutations, sampled uniformly from $S_n$. These similarities include the Erd\H{o}s--Kac theorem on the distribution of the number of prime factors of a random…

In 1917, Hardy and Ramanujan showed that if $\omega(n)$ is the number of distinct prime factors of a randomly chosen positive integer $n,$ then the normal order of $\omega(n)$ is $\log \log \, n.$ This led Erd\H{o}s and Kac to prove their…

We present a new perspective of assessing the rates of convergence to the Gaussian and Poisson distributions in the Erd\"os-Kac theorem for additive arithmetic functions $\psi$ of a random integer $J_n$ uniformly distributed over…

Fix a number field $K$. For each nonzero $\alpha \in \mathbb{Z}_K$, let $\nu(\alpha)$ denote the number of distinct, nonassociate irreducible divisors of $\alpha$. We show that $\nu(\alpha)$ is normally distributed with mean proportional to…

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 $\omega(n-1)$ satisfies an Erd\H{o}s-Kac type theorem whenever $\omega(n)=k$ where $1\leqslant k\ll\log\log…

Given a variety over $\mathbb{Q}$, we study the distribution of the number of primes dividing the coordinates as we vary an integral point. Under suitable assumptions, we show that this has a multivariate normal distribution. We generalise…

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…