Search arXivSearch

arXiv · 2412.17583

Asymptotic independence of $Ω(n)$ and $Ω(n+1)$ along logarithmic averages

Abstract

Let $Ω(n)$ denote the number of prime factors of a positive integer $n$ counted with multiplicities. We show that for any bounded functions $a,b\colon\mathbb{N}\to\mathbb{C}$, $$\frac{1}{\log{N}}\sum_{n=1}^N \frac{a(Ω(n))b(Ω(n+1))}{n} = \Bigg(\frac{1}{N}\sum_{n=1}^N a(Ω(n))\Bigg)\Bigg(\frac{1}{N}\sum_{n=1}^N b(Ω(n))\Bigg) + \mathrm{o}_{N\to\infty}(1).$$ This generalizes a theorem of Tao on the logarithmically averaged two-point correlation Chowla conjecture. Our result is quantitative and the explicit error term that we obtain establishes double-logarithmic savings. As an application, we obtain new results about the distribution of $Ω(p+1)$ as $p$ ranges over $\ell$-almost primes for a "typical" value of $\ell$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dimitrios Charamaras, Florian K. Richter. 2026-08-17. Asymptotic independence of $Ω(n)$ and $Ω(n+1)$ along logarithmic averages. https://arxiv.org/abs/2412.17583

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT