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)Σn=1∞ n-s=Πp\,prime 11- 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 R(z)=1/2 axis. The nonadditive entropy Sq=kΣipiq(1/pi)\;(q∈R) involves the function q zz1-q-11-q\;(1 z= z) that is interconnected to a q-generalized algebra, using q-numbers defined as xq eq x ( x1 x). The q-prime numbers are then defined as the q-natural numbers nq eq n\;(n=1,2,3,…), where n is a prime number p=2,3,5,7,… We show that, for any value of q, infinitely many q-prime numbers exist; for q1 they diverge for increasing prime number, whereas they converge for q>1; the standard prime numbers are recovered for q=1. For q 1, we generalize the ζ(s) function as follows: ζq(s)ζ(s)q (s∈R). We show that this function appears to diverge at s=1+0, ∀ q. Also, we alternatively define, for q 1, ζq(s)Σn=1∞1 nqs=1+1 2qs+… and ζq(s)Πp\,prime11- pq-s=11- 2q-s11- 3q-s11- 5q-s·s, which, for q<1, generically satisfy ζq(s)<ζq(s), in variance with the q=1 case, where of course ζ1(s)=ζ1(s).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.