Preprint
Article

This version is not peer-reviewed.

Prime Representing Constant in the Critical Strip

Submitted:

16 October 2025

Posted:

17 October 2025

You are already at the latest version

Abstract
The Prime Representing Constant generates prime numbers infinitely in order. The number 2 is the smallest prime number. The smallest prime number that does not divide succeeding prime numbers is 2.
Keywords: 
;  ;  

1. Introduction

Leonhard Euler first introduced and studied the function over the reals in the first half of the eighteenth century. In 1737, the connection between the zeta function and prime numbers was discovered by Euler, who proved the identity.
n = 1 1 n s = p p r i m e 1 1 p s
This study is about the Prime Representing Constant. It shows that the probability of P k is the smallest prime that does not divide n. Shows the relation of the critical strip and the Prime Representing Constant. Shows the composition of the Prime Representing Constant and how it infinitely generates all prime numbers in order. Demonstrate the relation of Riemann Zeta function and the Prime Representing Constant.

2. Method

The sequence 2, 3, 2, 3, 2, 5, 2,.., is a sequence of smallest primes that do not divide n. The probability of P k is the smallest prime that does not divide n, for some natural number can be written as:
P ( P k does not divide n and P 1 , P 1 , . . . , P k 1 divide n ) = 1 1 P k i = 1 k 1 ( 1 P i )
The average of the sequence is therefore given by
k = 1 P k 1 i = 1 k 1 P i = k = 1 P k 1 1 P k i = 1 k 1 1 P i
which is the definition of Prime Representing Constant [1].
k = 1 P k 1 i = 1 k 1 P i = 2.9200509773161347120925629171120194 . . .
Preprints 181082 i001
f ( n + 1 ) = f n ( f ( n ) f n + 1 )
The floor of f n are all prime numbers

2.1. Riemann Zeta Function

The Euler product formula can be used to calculate the asymptotic probability that s randomly selected integers are set-wise coprime. The asymptotic probability that s numbers are coprime is given by a product over all primes,
p p r i m e 1 1 p s = 1 ζ ( s )
Bernhard Riemann’s 1859 article "On the Number of Primes Less Than a Given Magnitude" [2] extended the Euler definition to a complex variable, proved its meromorphic continuation and functional equation, and established a relation between its zeros and the distribution of prime numbers.
If we substitute s = 1 then,
p p r i m e 1 1 p 1 = 1 ζ ( 1 )
p p r i m e 1 1 p 1 = 1 1 2 1 1 3 1 1 5 1 1 7 . . .

2.2. Euler–Mascheroni Constant

n = 1 1 n = ζ ( 1 )
In mathematics, the harmonic series is the infinite series formed by summing all positive unit fractions:
n = 1 1 n = 1 + 1 2 + 1 3 + 1 4 + 1 5 + 1 6 + 1 7 + . . .
The first n terms of the series sum to approximately ln n + γ where ln is the natural logarithm and γ is the Euler–Mascheroni constant.
γ = lim s 1 + n = 1 1 n s 1 s n
γ = lim s 1 ζ ( 1 + s ) + ζ ( 1 s ) 2
γ = lim s 1 ζ ( s ) 1 ( s 1 )

2.3. Analytical Continuation

The equation relates values of the Riemann zeta function at the points s and 1 s in particular relating even positive integers with odd negative integers, except for a simple pole at s = 1. The continuation to 0 > ( s ) 1 can be obtained from the formula
ζ ( s ) = 1 ( s 1 ) + n = 1 n n + 1 1 n s 1 x s d x
Using algebra, if we substitute n = 1 n n + 1 1 n s 1 x s d x with x then.
ζ ( s ) = 1 ( s 1 ) + x
Substituting s with 1 2 ,
ζ 1 / 2 = 1 ( 1 2 1 ) + x
ζ 1 / 2 = 1 ( 1 2 ) + x
ζ 1 / 2 = 2 + x
all trivial zeros have interval of -2.
ζ 1 / 2 = 2 + x
ζ ( 1 / 2 ) 1.46 . . .
1.46 . . . = 2 + x
1.46 . . . = 2 + 0.539 . . .
The number 2 is the smallest prime number. The smallest prime number that does not divide succeeding prime number is 2. Starting from 3, all prime numbers are odd numbers. The smallest prime that does not divide odd number is 2.
Table 1. Sequence of smallest prime that does not divide n.
Table 1. Sequence of smallest prime that does not divide n.
n 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
Prime 2 3 2 3 2 5 2 3 2 3 2 5 2 3 2 3 2 5 2 3 2 3 2 5 2 3 2 3 2 7
Table 2. In the Total row, 87/30 is equal to 2.9. It is approximately the Prime Representing Constant.
Table 2. In the Total row, 87/30 is equal to 2.9. It is approximately the Prime Representing Constant.
k P k Count Product Count/Product
1 2 15 30 15/30
2 3 10 30 10/30
3 5 4 20 4/30
4 7 1 7 1/30
Total 30 87 30/30
In the 1st row, 15/30 is equal to 1/2 and in the total row 30/30 is equal to 1.
1 1 P k i = 1 k 1 1 P i
if k = 1, then P 1 = 2
1 1 P 1 i = 1 1 1 1 P i
1 1 2 i = 1 0 1 P i
1 1 2
1 2

2.4. Critical Strip and Prime Representing Constant

k = 1 1 1 P k i = 1 k 1 1 P i = k = 1 i = 1 k 1 P i i = 1 k 1 1 P i
This is a telescoping sum:
= 1 1 P 1 + 1 P 1 1 P 1 P 2 + . . .
= 1 + i = 1 1 P i
i = 1 1 P i , tends to 0
= 1 + 0
= 1
The
k = 1 1 1 P k i = 1 k 1 1 P i
is equal to
k = 1 1 1 P k m u l t i p l i e d b y k = 1 i = 1 k 1 1 P i
k = 1 1 1 P k tends to 0(product over primes converges to zero)
k = 1 i = 1 k 1 1 P i which tends very quickly to zero.
So
k = 1 1 1 P k i = 1 k 1 1 P i ,
the whole product tends to 0
The
k = 1 1 1 P k = p p r i m e 1 1 p s = 1 ζ ( 1 )
k = 1 1 1 P k = 1 ζ ( 1 ) = 0
ζ ( 1 ) = 1 k = 1 1 1 P k
ζ ( 1 ) = n = 1 1 n =
Riemann Zeta function has the Prime Representing Constant in the critical line.
0.4999161085496864640353762556517134 . . . 0.5
The ζ ( 0.4999161085496864640353762556517134 . . . ) is - 1.4600254886580673560462814585560097340...The result divided by ζ ( 0 ) is equal to the Prime Representing Constant.
Figure 1. Nontrivial zeros are aligning in the critical line.
Figure 1. Nontrivial zeros are aligning in the critical line.
Preprints 181082 g001
k = 1 P k 1 i = 1 k 1 P i = 1.460025488658067356046281458556009734 . . . 1 / 2
k = 1 P k 1 i = 1 k 1 P i = 1.460025488658067356046281458556009734 . . . 1 / 2
k = 1 P k 1 i = 1 k 1 P i = ( 2 ) ( 1.460025488658067356046281458556009734 . . . )
k = 1 P k 1 i = 1 k 1 P i = 2.920050977316134712092562917112019468 . . .

3. Result

ζ ( 0 ) = 1 / 2
multiply by Prime Representing Constant is equal to
1 / 2 k = 1 P k 1 i = 1 k 1 P i = 1.460025488658067356046281458556009734 . . .
1 / 2 k = 1 P k 1 i = 1 k 1 P i = ζ ( 0.4999 . . . )
ζ ( 0 ) k = 1 P k 1 i = 1 k 1 P i = ζ ( 0.4999 . . . )

4. Discussion

The probability of P k is the smallest prime that does not divide n, for some natural number can be written as:
P ( P k does not divide n and P 1 , P 1 , . . . , P k 1 divide n ) = 1 1 P k i = 1 k 1 ( 1 P i )
The average of the sequence is therefore given by
k = 1 P k 1 i = 1 k 1 P i = k = 1 P k 1 1 P k i = 1 k 1 1 P i
Prime Representing Constant, the prime generator/operator, infinitely generates prime numbers in order.
k = 1 1 1 P k i = 1 k 1 1 P i = k = 1 i = 1 k 1 P i i = 1 k 1 1 P i
This is a telescoping sum equal to 1.
The product of
k = 1 1 1 P k i = 1 k 1 1 P i ,
tends to 0
The average of 0 and 1 is 1/2. The number 2 is the smallest prime number. This study shows that the smallest prime that does not divide P 2 up to P is 2. The probability of 2 is the smallest prime that does not divide n to be 1/2.
ζ ( 0 ) k = 1 P k 1 i = 1 k 1 P i = ζ ( 0.4999 . . . )
0.4999 0.5
1 / 2 k = 1 P k 1 i = 1 k 1 P i = 1.460025488658067356046281458556009734 . . .
1 / 2 = 1.460025488658067356046281458556009734 . . . k = 1 P k 1 i = 1 k 1 P i
1 / 2 = 1.460025488658067356046281458556009734 . . . k = 1 P k 1 i = 1 k 1 P i
These show the relation of prime numbers in the critical line 1/2 of the Riemann Zeta function.

Acknowledgments

The author is grateful to Angeles Bulanhagui, Lance Rougil Bulanhagui and Heart Bulanhagui.

References

  1. Dylan Fridman, Juli Garbulsky, Bruno Glecer, James Grime, and Massi Tron Florentin. A prime-representing constant. The American Mathematical Monthly, 126(1):70–73, 2019. [CrossRef]
  2. Riemann, Bernhard, Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse, 1859.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated