相关论文: An information-theoretic proof of the Erd\H{o}s-Ka…

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…

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…

In 2022, Bergelson and Richter established a new dynamical generalization of the prime number theorem. Later, Loyd showed a disjoint form with the Erd\H{o}s-Kac theorem. Recently, the author and his coauthors proved some ergodic theorems…

This paper proves several assertions on sufficient conditions for the convergence of additive arithmetic functions to the normal distribution. A generalization of the Erdos-Kac theorem was proved and determines the rate of convergence of…

In the present work we use maximum entropy methods to derive several theorems in probabilistic number theory, including a version of the Hardy-Ramanujan Theorem. We also provide a theoretical argument explaining the experimental…

Granville and Soundararajan showed that the $k$th moment in the Erd\H{o}s--Kac theorem is equal to the $k$th moment of the standard Gaussian distribution in the range $k=o((\log \log x)^{1/3})$, up to a negligible error term. We show that…

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…

A short, information-theoretic proof of the Kac--Bernstein theorem, which is stated as follows, is presented: For any independent random variables $X$ and $Y$, if $X+Y$ and $X-Y$ are independent, then $X$ and $Y$ are normally distributed.

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

Let \(d_k(p)\) denote the natural density of positive integers whose \(k\)-th smallest prime divisor is \(p\). Erd\H{o}s asked whether, for each fixed \(k\), the sequence \(p\mapsto d_k(p)\) is unimodal as \(p\) ranges over the primes.…

In this paper, we develop Furstenberg's proof of infinity of primes, and prove several results about prime divisors of sequences of integers, including the celebrated Schur's theorem. In particular, we give a simple proof of a classical…

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…

A set of integers greater than 1 is primitive if no member in the set divides another. Erd\H{o}s proved in 1935 that the series $f(A) = \sum_{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets $A$. In 1986 he asked…

Let $(G_n)_{n\geqslant 0}$ be a linear recurrence sequence defining a numeration system and satisfying mild structural hypotheses. For real-valued G-additive functions (additive in the greedy G-digits), we establish an…

The law of large numbers for the empirical density for the pairs of uniformly distributed integers with a given greatest common divisor is a classic result in number theory. In this paper, we study the large deviations of the empirical…

Following work of Mehrdad and Zhu and of Liu, we prove a large deviation principle for a broad class of integer-valued additive functions defined over abelian monoids. As a corollary, we obtain a large deviation principle for a generalized…

We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…

This paper is intended as a sequel to a paper arXiv:0803.2636 written by four of the coauthors here. In the paper, they proved a stronger form of the Erd\H{o}s-Mirksy conjecture which states that there are infinitely many positive integers…

In 2022, Bergelson and Richter gave a new dynamical generalization of the prime number theorem by establishing an ergodic theorem along the number of prime factors of integers. They also showed that this generalization holds as well if the…

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…