Search arXivSearch

arXiv · 2005.02027

Distance between natural numbers based on their prime signature

Abstract

We define a new metric between natural numbers induced by the $\ell_\infty$ norm of their unique prime signatures. In this space, we look at the natural analog of the number line and study the arithmetic function $L_\infty(N)$, which tabulates the cumulative sum of distances between consecutive natural numbers up to $N$ in this new metric. Our main result is to identify the positive and finite limit of the sequence $L_\infty(N)/N$ as the expectation of a certain random variable. The main technical contribution is to show with elementary probability that for $K=1,2$ or $3$ and $ω_0,\ldots,ω_K\geq 2$ the following asymptotic density holds $$ \lim_{n\to\infty}\frac{\big|\big\{M\leq n:\; \|M-j\|_\infty <ω_j \text{ for } j=0,\ldots,K \big\}\big|}{n} = \prod_{p:\, \mathrm{prime}}\! \bigg( 1- \sum_{j=0}^K\frac{1}{p^{ω_j}} \bigg)~. $$ This is a generalization of the formula for $k$-free numbers, i.e. when $ω_0=\ldots=ω_K=k$. The random variable is derived from the joint distribution when $K=1$. As an application, we obtain a modified version of the prime number theorem. Our computations up to $N=10^{12}$ have also revealed that prime gaps show a considerably richer structure than on the traditional number line. Moreover, we raise additional open problems, which could be of independent interest.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

István B. Kolossváry, István T. Kolossváry. 2021-10-31. Distance between natural numbers based on their prime signature. https://doi.org/10.1016/j.jnt.2021.09.010

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