Search arXivSearch

arXiv · 2112.11841

Along the lines of nonadditive entropies: $q$-prime numbers and $q$-zeta functions

Abstract

The rich history of prime numbers includes great names such as Euclid, who first analytically studied the prime numbers and proved that there is an infinite number of them, Euler, who introduced the function $ζ(s)\equiv\sum_{n=1}^\infty n^{-s}=\prod_{p\,prime} \frac{1}{1- p^{-s}}$, Gauss, who estimated the rate at which prime numbers increase, and Riemann, who extended $ζ(s)$ to the complex plane $z$ and conjectured that all nontrivial zeros are in the $\mathbb{R}(z)=1/2$ axis. The nonadditive entropy $S_q=k\sum_ip_i\ln_q(1/p_i)\;(q\in\mathbb{R})$ involves the function $\ln_q z\equiv\frac{z^{1-q}-1}{1-q}\;(\ln_1 z=\ln z)$ that is interconnected to a $q$-generalized algebra, using $q$-numbers defined as $\langle x\rangle_q\equiv e^{\ln_q x}$ ($\langle x\rangle_1\equiv x$). The $q$-prime numbers are then defined as the $q$-natural numbers $\langle n\rangle_q\equiv e^{\ln_q n}\;(n=1,2,3,\dots)$, where $n$ is a prime number $p=2,3,5,7,\dots$ We show that, for any value of $q$, infinitely many $q$-prime numbers exist; for $q\le1$ they diverge for increasing prime number, whereas they converge for $q>1$; the standard prime numbers are recovered for $q=1$. For $q\le 1$, we generalize the $ζ(s)$ function as follows: $ζ_q(s)\equiv\langleζ(s)\rangle_q$ ($s\in\mathbb{R}$). We show that this function appears to diverge at $s=1+0$, $\forall q$. Also, we alternatively define, for $q\le 1$, $ζ_q^Σ(s)\equiv\sum_{n=1}^\infty\frac{1}{\langle n\rangle_q^s}=1+\frac{1}{\langle 2\rangle_q^s}+\dots $ and $ζ_q^Π(s)\equiv\prod_{p\,prime}\frac{1}{1-\langle p\rangle_q^{-s}}=\frac{1}{1-\langle 2\rangle_q^{-s}}\frac{1}{1-\langle 3\rangle_q^{-s}}\frac{1}{1-\langle 5\rangle_q^{-s}}\cdots$, which, for $q<1$, generically satisfy $ζ_q^Σ(s)<ζ_q^Π(s)$, in variance with the $q=1$ case, where of course $ζ_1^Σ(s)=ζ_1^Π(s)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ernesto P. Borges, Takeshi Kodama, Constantino Tsallis. 2021-12-22. Along the lines of nonadditive entropies: $q$-prime numbers and $q$-zeta functions. https://doi.org/10.3390/e24010060

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