On Algebraic Methods for the Riemann Hypothesis

Abstract

Properties of the gamma function are examined with implications for the Riemann hypothesis. Some new relations are obtained for the roots of the Zeta function using the properties of the Gamma function, the Bernoulli function, and limitations imposed by the rational relations of the complex roots of the Riemann zeta function, and the rational relations of the complex Gamma functions.

Share and Cite:

Anthony, M. (2025) On Algebraic Methods for the Riemann Hypothesis. Advances in Pure Mathematics, 15, 1-35. doi: 10.4236/apm.2025.151001.

1. Introduction

The Riemann Zeta function, ζ( s ) , is defined by the series:

ζ( s )= 1 1 s + 1 2 s + 1 3 s += n=1 n s ,( s )>1 (1)

The importance of the relation between the Riemann hypothesis and primes is highlighted by a one-on-one correspondence between the non-trivial roots of the function and the primes.

2. Background

The Riemann Hypothesis, proposed by Bernhard Riemann [1] in 1859, conjectures about the distribution of prime numbers and the relation to the Riemann Zeta function, ζ( s ) . It correlates the non-trivial zeros of the ζ-function with the primes if the zeros of the ζ-function have a real part, 1 2 . This hypothesis (RH) is crucial to the understanding of the distribution of primes.

The Robin criterion first specified Guy Robin [2] in 1984 relates the truth of the RH hypothesis to a direct correlation to the statement (Robin’s inequality)

F n = σ( n ) e γ nloglog( n ) <1 (2)

if and only if the set of numbers (I call them the Robin Integers, R n ):

R n [ 3 ,4,5,6,8,9,10,12,16,18,20,24,30,36,48,60, 72,84,120,180,240,360,720,840,2520, 5040 ]

are the only integers that violate the inequality,

F n = σ( n ) e γ nloglog( n ) <1, (3)

This paper also studies these functions and their interrelations and hence provides an objective insight into the beauty of these relations to the Riemann Hypothesis. Further, the importance of functions such as the Γ-functions, the Bernoulli functions, B m , and their relationships to the ζ-function is also explored. The Bernoulli function is intimately related to the ζ-function by the relations:

ζ( 2m )= 2 ( 2m1 ) π ( 2m ) | B 2m | ( 2m )! ,ζ( 12m )= B 2m 2m (4)

It is also very clear that the Γ-function, (Γ(z)), is intimately to Riemann’s ζ-function. The Γ-function was pioneered round about 1729, by the Swiss mathematician Leonhard Eular [3]. Eular’s deep insights into Γ-function led to numerous results in probability theory and in statistics. The particular form of the Γ-function used in this paper was developed by Carl Freidman Gauss [4]. Gauss’s work led to the famous reflection formula of the ζ-function, and numerous new results that will be presented in this paper. Certain invariant relations of the Γ-function are developed in this paper to show the connections of the Γ-function to other functions.

With this in mind, the present paper explores these relationships with some profound results. The distribution of primes and the confluence of the Robin criterion is clearly shown in Figures 1-3, and Figure 4. Results in prime numbers such as the twin prime conjecture are also discussed.

The ζ-function for primes is given by the prime, p, relation:

ζ( s )= p 1 1 p s ( s )>1 (5)

There are key relations for primes that will be highlighted by this article. In general, these relations stem from the Γ-function and in particular, the Gauss’s Γ-function product formula. The intriguing relations of the Sum of Divisors function σ( m ) , with the ζ -function and the Riemann Hypothesis, were developed by several pioneers including Guy Robin [2]. The Sums of Divisors is defined as

σ( m )= d|n d (6)

The uniformity of the function for primes, p, σ( p x )= ( p x+1 1 )/ ( p1 ) , provides a way to link the σ( m ) function to the Robin inequality and hence, the Riemann Hypothesis.

Note: If k=1 K p k a k   is the prime factorization of m, where m, is an integer with K factors, and a k are particular numbers, then,

σ( m )={ k=1 K p k ( a k +1 ) r p k r 1 r>0 k=1 K ( a k +1 ) r=0 (7)

where, γ=0.5772156649 is the Euler-constant.

Several attempts to refine the fundamental relations for F n as a referendum on the Riemann hypothesis have been made with great success. P. Solé and M. Planat [5], showed in 1962 that, if N n is the primordial number of index-n, defined as the product of the first n primes, with N n = k=1 n p k , then,

lim n N n = e γ ζ( 2 ) ~1.08, (8)

J. B. Roser ([6], Theorem 15], proved that there are inequalities between Euler’s totient function φ( n ) , and e γ nloglog( n ) ,

n φ( n ) e γ nloglog( n ),n3 (9)

In 1984 Heath-Brown [7], showed that there are infinitely many positive integers m, for which the divisor function has d( m )=d( m+B ) , where B is an integer. C.G. Pinner [8] also demonstrated that there are repeated values of the divisor function. Y.J. Chloe, N. Lichiardopol, and P. Moree [9] also studied the Robin criteria as did Sayak Chakrabarty [10], and they found possible correlations of the repeated divisor function with Highly composite numbers. Jean-Louis Nicolas [11], proved that there are an infinite number of values of n3 , that satisfy the inequality (5).

In recent times, I focused on iterations of number theoretic functions. In the paper the Towering Zeta Function [12], I show that the Zeta function can be iterated T-times, denoted as ζ T ( z ) which tends to a constant when T approaches infinity:

lim T ζ T ( z )=ζ( lim T slog n ( z ) )=ζ( z w )= z w =0.29590500557213955

I also showed that the Zeta function only converges to the real constant when the complex part of conjugate Zeta function roots, T, are expressed in the exponential form:

e 2iθ = 1 2 +iT 1 2 iT ,whereθ= tan 1 2T,

In 2024, I showed [13] that Perron’s formula given by:

ψ( x )=x ρ x ρ ρ 1 2 ln( 1 x 2 )ln2π (10)

Involves the complex roots ρ , of the Zeta function can be iterated to condense to the k th iterant:

x Ψ k ( x )=k( xΨ( x ) ) (11)

The rational functions of the roots of the Riemann zeta function are also expressed as rational Gamma functions. The behavior of the Gamma function for complex arguments restricts the validity of these rational arguments to arguments  ( s )>0 . As will be shown, this restriction also applies to the roots.

The first method that shows that the roots of the function must lie on the half-line is obtained by means of the Gauss-gamma function. It is shown that the gamma function has properties that impose conditions for the functional relations on the half-line.

The second method also uses the complex form of the Γ-function in [14]. In both these methods, an analysis of the relations that involve the Zeta functions and the gamma functions is used to conditionally show that the half-line plays an important role in many functions. In a first demonstration of the relationship of the Γ-function to the ½-line, invariants of the Γ-function are used to demonstrate how the ½ line features in a lot of results. In a second method, the relationship between ζ-function, the Bernoulli numbers, B n and Γ-function is explored to precipitate unexpected results about the rational relations of complex Γ-function, and its specific influence on Riemann conjecture. The rational functions of the non-trivial roots of the ζ-function happen to be expressible as relations between the Bernoulli numbers, B n and Γ-function and the complex roots. Both these methods produce indisputable verification that the non-trivial roots of the ζ-function lie on the half-line with no assumptions made. The process is a natural consequence of a special property of these functions.

3. The Invariance of the Gamma Function to Substitution σ( m )σ( m+j )

Any function with a relational product { ny } , can be represented by the Sums of Divisor function, σ( m ) . Here is a simple example:

log( ny )=logn+logy, (12)

Then, if ny=m , we can put n=σ( m ) , y= m σ( m ) , and so,

log( m )=logσ( m )+log m σ( m ) (13)

Here is another example:

If ny=m , we can put n=σ( m ) , y= m σ( m ) , and so, applied to the formula:

cos( ny )=cos( y ) k=1 n1 2 ( 1 sin 2 ( y ) sin 2 ( 2k1 )π 2n ),[ niseven ] (14)

By using the sum of divisor function, we find the relation:

cos( m )=cos( m σ( m ) ) k=1 σ( m )1 2 ( 1 sin 2 ( m σ( m ) ) sin 2 ( 2k1 )π 2σ( m ) ),[ σ( m )isodd ] (15)

Interestingly, (14) and (15) differentiate between odd and even values of σ( m ) . Since primes have σ( p )=p+1 , an even number the relation (14) does not apply to primes. Since p+1 is always even except for the prime 2! Since σ( 2 )=3 ,

cos( 2 )=cos( 2 3 ) k=1 1 ( 1 sin 2 ( 2 3 ) sin 2 ( 2k1 )π 6 ),[ σ( 2 )isodd ] (16)

0.4161468365=0.7858872608( 1 0.3823812134 0.2500000000 ) =0.4161468365 (17)

The fact that the sum of divisor function σ( m ) , can be manipulated this way leads to some interesting formulas that can produce significant and unexpected results.

For example, if we put:

n=σ( m ),x= n σ( m ) , (18)

in the following trigonometric relations, we get:

sin( m )=σ( m )sin( m σ( m ) )cos( m σ( m ) ) k=1 σ( m )2 2 ( 1 sin 2 ( m σ( m ) ) sin 2 πk σ( m ) ) cos( m )= k=1 σ( m ) ( 1 sin 2 ( m 2σ( m ) ) sin 2 ( 2k1 )π 2σ( m ) ) }[ σ( m )iseven ] (19)

sin( m )=σ( m )sin( n σ( m ) ) k=1 σ( m )2 2 ( 1 sin 2 ( m σ( m ) ) sin 2 kπ σ( m ) ) cos( m )=cos( m σ( m ) ) k=1 σ( m )1 2 ( 1 sin 2 ( m σ( m ) ) sin 2 ( 2k1 )π 2σ( m ) ) }[ σ( m )isodd ] (20)

Any factorizable integer function can be done this way. Of course, the construct restricts the functions we use to define the integers, m. Clearly, the relationship of integer functions to the Gauss Γ-function is clear. Again, we can represent the relationship of the Gauss gamma function ([14], p. 896] as:

Γ( yn )= ( 2π ) 1y 2 y ( ny ) 1 2 k=0 y1 Γ( n+ k y ) (21)

Let g( z ) be a function with k-factors, then for any given factor, f j ( m ) , j<k ,

g( z )= f j ( z )( n=1 j1 f n ( z ) n=j+1 k f n ( z ) )

and,

Γ( g( z ) )= ( 2π ) 1 f( z ) f j ( m ) 2 ( f( z ) f j ( m ) ) f( z ) 1 2 k=0 f( z ) f j ( m ) 1 Γ( f( z )+k f( z ) f j ( m ) )foranyj. (22)

The relation (22) is only true if f j ( m )|g( z ) . Observe that while g( z ) , is uniquely defined as a real or complex function, g( z ) f j ( m ) is not uniquely defined as an integer function since many functions f j ( m ) , can satisfy the relation (22) for some g( z ) . However, there may exist multiple functions for which { g( z ) f a ( m ) , g( z ) f b ( m ) , g( z ) f c ( m ) , } . In such a case, g( z ) has multiple integer-factors. It is interesting to note that the product form of two variables of the gamma function is behaving like a non-commutative function (I use that word loosely) since, Γ( ny )Γ( yn ) , when the roles of n, and y, are interchanged. This may provide a means to understand the sum of divisors function σ( v ) . Suppose, we consider values of n= σ( v ) , y= m σ( v ) and, let yn=m , then,

Γ( m )= ( 2π ) 1σ( v ) 2 σ ( v ) m 1 2 k=0 σ( v )1 Γ( m+k σ( v ) ) (23)

The relation (23) is invariant to the substation σ( v )σ( v+μ ) . An Interchange of the variables, gives:

Γ( yn )= ( 2π ) 1y 2 y ( ny ) 1 2 k=0 y1 Γ( n+ k y ) (24)

then,

Γ( m )= ( 2π ) 1 m σ( v ) 2 ( m σ( v ) ) m 1 2 k=0 m σ( v ) 1 Γ( σ( v )+ k m σ( v ) ) (25)

Note that the multiplicated variables yn=m , has not changed m, and, it is the multiplication operation that generates a distinct choice of σ( v )|m . There is a distinct difference between σ( v ) , and σ( v+μ ) , since the expression is not invariant to substitution σ( v )σ( v+μ ) , unless { m σ( v ) , m σ( v+μ ) } for any μ . A function g( z ) , that may have factors that are integers and complex numbers can be represented as a product of its factors such that the following theorem applies.

THEOREM 1: Let f j ( z )>0 , represent an integer factor of g( z ) , then,

Γ( g( z ) )= ( 2π ) 1 f j ( z ) 2 ( f j ( z ) ) g( z ) 1 2 k=0 f j ( z )1 Γ( g( z )+k f j ( z ) ) (26)

is invariant with respect to choices of any of the factors f v ( z ) , of g( z ) .

The significance of the THEOREM 1, is its consequences for prime numbers, and their relations to functions like the ζ-function and the sum of divisors function, σ( m ) and primes.

PROOF:

Let f j ( z ) , be some jth integer factor of k-factors a real or complex function g( z ) . Then,

g( z )= n=1 k f n ( z ) = f j ( z )( n=1 j1 f n ( z ) n=j+1 k f n ( z ) ) (27)

The Gauss gamma product formula is a simple relation given by:

Γ( ny )= ( 2π ) 1n 2 n ( ny ) 1 2 k=0 n1 Γ( y+ k n ) (28)

Then, since f j ( z ) , is an integer-factor of g( z ) , we have, putting n= f j ( z ) ,

Γ( f j ( z )( n=1 j1 f n ( z ) n=j+1 k f n ( z ) ) )= ( 2π ) 1 f j ( z ) 2 ( f j ( z ) ) g( z ) 1 2 k=0 f j ( z )1 Γ( g( z )+k f j ( z ) ) (29)

If there any other integer factor labelled here f v ( z ),Z , then, the substitution f j ( z ) f v ( z ) leaves Γ( g( z ) ) invariant.

Γ( g( z ) )= ( 2π ) 1 f v ( z ) 2 ( f v ( z ) ) g( z ) 1 2 k=0 f v ( z )1 Γ( g( z )+k f v ( z ) ) (30)

THEOREM 2: If ρ is a non-trivial root of the ζ-function, then,

k=2 ( ζ( 1 k ρ ) 2Γ( k ρ )ζ( k ρ )cos( π( k ρ ) 2 ) )=2π (31)

PROOF:

From the reflection formula,

2 1z Γ( z )ζ( z )cos( πz 2 )= π z ζ( 1z ) (32)

Γ( g( z ) )= ( 2π ) g( z ) ζ( 1g( z ) ) 2ζ( g( z ) )cos( πg( z ) 2 ) (33)

DEFINITION 1: Define the transformation

( 2π ) g( z ) = ζ( 1g( z ) ) 2Γ( g( z ) )ζ( g( z ) )cos( π( g( z ) ) 2 ) (34)

as the Pi-transformation.

Then, the left-hand-side is separable into real and complex parts.

If g( z )= k z k , i.e., the sum of k-terms, and functions, then, the Pi-transformation gives:

( 2π ) g( z k ) = ( 2π ) k z k = k ( ζ( 1g( z k ) ) 2Γ( g( z k ) )ζ( g( z k ) )cos( π( g( z k ) ) 2 ) ) (35)

For example, let g( z )=σ+iτ , then, from (35),

( 2π ) ( σ+iτ ) = ζ( 1σiτ ) 2Γ( σ+iτ )ζ( σ+iτ )cos( π( σ+iτ ) 2 ) (36)

And let g( z )=( σ+iτ )y , where y is any function, then, from (33),

( 2π ) ( σ+iτ )y = ζ( 1+( σ+iτ )y ) 2ζ( ( σ+iτ )y )cos( π( σ+iτ )y 2 )Γ( ( σ+iτ )y ) (37)

( 2π ) ( ρ+iτ )+( ρ+iτ )y = ζ( 1σiτ ) 2Γ( σ+iτ )ζ( σ+iτ )cos( π( σ+iτ ) 2 ) ζ( 1+( σ+iτ )y ) 2ζ( ( σ+iτ )y )cos( π( σ+iτ )y 2 )Γ( ( σ+iτ )y ) (38)

As an example, put y=ρiτ

( 2π ) σ 2 + τ 2 σiτ = ζ( σ 2 τ 2 )ζ( 1σiτ )Γ( σ 2 τ 2 )cos( π( σ 2 τ 2 ) 2 ) ζ( 1+ σ 2 + τ 2 )ζ( 1+σ+iτ )Γ( σ+iτ )cos( π( σ+iτ ) 2 ) (39)

The relation (39) is again separable into real and complex parts for products of n-functions since the left-hand side is separable into products, k=1 n F( arg z k ) . It is obvious that the powers of ( 2π ) on the right-hand-side (LHS) determine completely the arguments on the left-hand-side (RHS), and in general, the form ( 2π ) g( z ) determines the RHS as having arguments

k=1 n F( z k )= ( 2π ) n=1 n z k (40)

As another example, taking the product relation for the arguments, g( z )= 1 2 +iT , f( z )= 1 2 iT .

Then,

( 2π ) 1 2 iT =2[ ζ( 1 2 iT ) Γ( 1 2 +iT )ζ( 1 2 +iT )cos( π( 1 2 +iT ) 2 ) ], ( 2π ) 1 2 +iT =2[ ζ( 1 2 +iT ) Γ( 1 2 It )ζ( 1 2 iT )cos( π( 1 2 iT ) 2 ) ] (41)

2π=4[ ζ( 1 2 iT ) Γ( 1 2 +iT )ζ( 1 2 +iT )cos( π( 1 2 +iT ) 2 ) ][ ζ( 1 2 +iT ) Γ( 1 2 It )ζ( 1 2 iT )cos( π( 1 2 iT ) 2 ) ] (42)

The product of the relation (42) is independent of the ζ-function, and relies only on the relation:

4{ Γ( 1 2 +iT )Γ( 1 2 iT ) }( cos( π( 1 2 +iT ) 2 )cos( π( 1 2 iT ) 2 ) )=2π (43)

Now,

( 2π ) g( z ) = k1 ( ζ( 1g( z ) ) 2Γ( g( z ) )ζ( g( z ) )cos( π( g( z ) ) 2 ) ) (44)

Put g( z )=ζ( z ) , then,

( 2π ) 1 k=2 k z = 1 2π k=2 ( ζ( 1 k z ) 2Γ( k z )ζ( k z )cos( π( k z ) 2 ) )= ( 2π ) ζ( z ) (45)

If z=ρ , is a root, then, ζ( ρ )=0 , the non-trivial roots follow:

k=2 ( ζ( 1 k ρ ) 2Γ( k ρ )ζ( k ρ )cos( π( k ρ ) 2 ) )=2π (46)

Note that the conjugate relations on ½ line give,

4[ ζ( 1 2 iT ) Γ( 1 2 +iT )ζ( 1 2 +iT )cos( π( 1 2 +iT ) 2 ) ][ ζ( 1 2 +iT ) Γ( 1 2 It )ζ( 1 2 iT )cos( π( 1 2 iT ) 2 ) ]=2π (47)

Then, using the fact that

( 2π ) g( z ) = ζ( 1g( z ) ) 2ζ( g( z ) )cos( πg( z ) 2 )[ Γ( g( z ) ) ] (48)

Put g( z )=ζ( z ) 1 z1 , and separate the terms for 1 z1 , then,

( 2π ) 1 k=2 k z + 1 z1 = 1 2π [ ζ( 1+ 1 z1 ) 2Γ( 1 z1 )ζ( 1 z1 )cos( π( 1 z1 ) 2 ) ] k=2 ( ζ( 1 k z ) 2Γ( k z )ζ( k z )cos( π( k z ) 2 ) ) = ζ( 1ζ( z )+ 1 z1 ) 2Γ( ζ( z ) 1 z1 )ζ( ζ( z ) 1 z1 )cos( π( ζ( z ) 1 z1 ) 2 ) (49)

Then when z=ρ , a root of the ζ-function,

( 2π ) 1 k=2 k z + 1 z1 = 1 2π [ ζ( ρ ρ1 ) Γ( 1 1ρ )ζ( 1 1ρ )cos( π 22ρ ) ] k=2 ( ζ( 1 k z ) 2Γ( k z )ζ( k z )cos( π( k z ) 2 ) ) = ζ( ρ ρ1 ) Γ( 1 1ρ )ζ( 1 1ρ )cos( π 22ρ ) (50)

k=2 ( ζ( 1 k ρ ) 2Γ( k ρ )ζ( k ρ )cos( π( k ρ ) 2 ) )=2π (51)

Hence the relation is uniquely satisfied by the roots ρ , of the ζ-function when g( ρ )= 1 1ρ .

( 2π )   1 ρ1 = ζ( ρ ρ1 ) 2Γ( 1 ρ1 )ζ( 1 ρ1 )cos( π 2 ( 1 ρ1 ) ) (52)

Also note that lim z g( z )= lim z ( ζ( z ) 1 z1 )=λ0.5772156649 , where λ is the Euler-Mascheroni constant [14]. Let us not separate the terms, then, the Cauchy principal value exists

lim z ( ( 2π ) ζ( z )+ 1 z1 )= ( 2π ) λ (53)

( 2π ) λ = lim z ( ζ( 1ζ( z )+ 1 z1 ) 2Γ( ζ( z ) 1 z1 )ζ( ζ( z ) 1 z1 )cos( π( ζ( z ) 1 z1 ) 2 ) ) (54)

( 2π ) λ = ζ( 1λ ) 2Γ( λ )ζ( λ )cos( π( λ ) 2 ) =0.34616095200041890772= C (55)

It must be noted that to a large number of decimal places, the constant C πeλ+ 1 2 :

Then, we can conclude that for all the Stieltjes numbers λ k , follow:

( 2π ) λ k = ζ( 1 λ k ) 2Γ( λ k )ζ( λ k )cos( π( λ k ) 2 ) (56)

4. The Relation of the Product Gamma Function to Primes

From the Gauss Γ-product formula [14], (21),

Γ( m )= ( 2π ) 1σ( m ) 2 σ ( m ) m 1 2 k=0 σ( m )1 Γ( m+k σ( m ) ) (57)

It is clear that the following relations are equal,

( 2π ) 1m 2 m m 1 2 k=0 m1 Γ( m+k m )= ( 2π ) 1σ( m ) 2 σ ( m ) m 1 2 k=0 σ( m )1 Γ( m+k σ( m ) ) (58)

Then, for all real numbers m,

( 2π ) σ( m )m 2 ( m σ( m ) ) m 1 2 k=0 m1 Γ( m+k m ) k=0 σ( m )1 Γ( m+k σ( m ) ) =1 (59)

Since, for all primes, m=p , σ( p )=p+1 , from (59), we get for all primes, p:

2π p p 1 2 k=0 p1 Γ( p+k p ) σ ( p ) p 1 2 k=0 σ( p )1 Γ( p+k σ( p ) ) =1 (60)

and so, (60) is not invariant to the substitutions, σ( p )σ( p+j ) , unless { p,p+j }Primes .

In 1999, Pierre Dusart [15] showed that every kth prime p k is greater than

p k >k( lnp+lnlnp1 )fork2.

Contributions by G. H. Hardy, Ramanujan [[16], §9, p. 141] also demonstrated bounds for primes. Leonhard Euler [17] presented to the St. Petersburg Academy on April 6, 1752. The paper “Observatio de summis divisorum, Novi Commentarii”. In that work, he presented a relation between the Triangular numbers and the Sums of Divisor function σ( p ) . In this paper, I will show that the triangular numbers are indeed related to periods generated between integers as a result of Robin’s inequality.

THEOREM 3: There are an infinite number twin primes { p,p+2 } that have the restriction,

( σ( p ) σ( p+2 ) ) 2 ( 2π ) p+2 σ( p ) 2 σ( p+2 ) 2 1,{ p,p+2 }twinprimes (61)

PROOF:

From the expression (61), put the prime relation for p,p+2 ,

[ 2π p p 1 2 k=0 p1 Γ( p+k p ) σ ( p ) p 1 2 k=0 σ( p )1 Γ( p+k σ( p ) ) ][ 2π p p+2 1 2 k=0 p+21 Γ( p+2+k p ) σ ( p+2 ) p+2 1 2 k=0 σ( p+2 )1 Γ( p+2+k σ( p+2 ) ) ]=1 (62)

Then,

( σ( p ) σ( p+2 ) ) 2 ( 2π ) p+2 σ( p ) 2 σ( p+2 ) 2 1,{ p,p+2 }twinprimes (63)

It is clear that if p<σ( p ),p+2<σ( p+2 ) , so if p is not a twin prime,

( 2π ) ( p σ( p ) ) p 1 2 ( p+2 σ( p+2 ) ) p+ 3 2 k=0 p1 Γ( p+k p ) k=0 σ( p )1 Γ( p+k σ( p ) ) k=0 p+1 Γ( p+2+k p+2 ) k=0 σ( p+2 )1 Γ( p+2+k σ( p+2 ) ) 1,if{ p,p+2 }twinprimes (64)

Hence for twin primes, p,p+2, σ( p ) σ( p+2 ) = p+1 p+3 <1 . Then, it follows that since (64) 1 , then,

σ( p ) σ( p+2 ) ( 2π ) ( p σ( p ) ) p 1 2 ( p+2 σ( p+2 ) ) p+ 3 2 k=0 p1 Γ( p+k p ) k=0 σ( p )1 Γ( p+k σ( p ) ) k=0 p+1 Γ( p+2+k p+2 ) k=0 σ( p+2 )1 Γ( p+2+k σ( p+2 ) ) 1,{ p,p+2 }twinprimes σ( p ) σ( p+2 ) ( 2π ) ( p σ( p ) ) p 1 2 ( p+2 σ( p+2 ) ) p+ 3 2 k=0 p1 Γ( p+k p ) k=0 σ( p )1 Γ( p+k σ( p ) ) k=0 p+1 Γ( p+2+k p+2 ) k=0 σ( p+2 )1 Γ( p+2+k σ( p+2 ) ) <1,{ p,p+2 }twinprimes (65)

The relation (65) determines if any pair of integers, { p,p+2 }twinprimes exclusively.

Hence,

σ( p ) σ( p+2 ) ( 2π ) ( p σ( p ) ) p 1 2 ( p+2 σ( p+2 ) ) p+ 3 2 k=0 p1 Γ( p+k p ) k=0 σ( p )1 Γ( p+k σ( p ) ) k=0 p+1 Γ( p+2+k p+2 ) k=0 σ( p+2 )1 Γ( p+2+k σ( p+2 ) ) <1 (66)

( σ( p ) σ( p+2 ) ) ( σ( p ) ) p 1 2 k=0 σ( p+2 )1 Γ( p+2+k σ( p+2 ) ) k=0 σ( p )1 Γ( p+k σ( p ) ) ( 2π ) ( p ) p 1 2 k=0 p1 Γ( p+k p ) ( p+2 σ( p+2 ) ) p+ 3 2 k=0 p+1 Γ( p+2+k p+2 ) <1 (67)

( σ( p ) σ( p+2 ) ) { ( σ( p+2 ) ) p+ 3 2 k=0 σ( p+2 )1 Γ( p+2+k σ( p+2 ) ) }{ ( σ( p ) ) p 1 2 k=0 σ( p )1 Γ( p+k σ( p ) ) } ( { ( 2π ) ( p ) p 1 2 k=0 p1 Γ( p+k p ) }{ ( p+2 ) p+ 3 2 k=0 p+1 Γ( p+2+k p+2 ) } ) <1 (68)

( σ( p ) σ( p+2 ) ){ ( 2π ) 1 2 σ( p+2 ) 2 ( σ( p+2 ) ) p+ 3 2 k=0 σ( p+2 )1 Γ( p+2+k σ( p+2 ) ) }{ ( 2π ) 1 2 σ( p ) 2 ( σ( p ) ) p 1 2 k=0 σ( p )1 Γ( p+k σ( p ) ) } ( 2π ) 1( 1 2 p 2 )( 1 2 p+2 2 )+( 1 2 σ( p+2 ) 2 )+( 1 2 σ( p ) 2 ) ( { ( 2π ) 1 2 p 2 p p 1 2 k=0 p1 Γ( p+k p ) }{ ( 2π ) 1 2 p+2 2 ( p+2 ) p+ 3 2 k=0 p+1 Γ( p+2+k p+2 ) } ) <1 (69)

σ( p ) σ( p+2 ) ( 2π ) 1( 1 2 p 2 )( 1 2 p+2 2 )+( 1 2 σ( p+2 ) 2 )+( 1 2 σ( p ) 2 ) { Γ( p+2 ) }{ Γ( p ) } { Γ( p ) }{ Γ( p+2 ) } <1 (70)

All the terms in the curly bracket represent the Γ-function, and they cancel leaving us with the condition for p,p+2 to be twin primes:

p+2 σ( p+2 ) ( 2π ) σ( p+2 ) 2 +( p+2 σ( p ) 2 ) { p,p+2 }twinprimes (71)

Relation (71) is true for every known twin prime set. However, it is also satisfied by many integers p, that are not primes. It is possible that after a given number of integer solutions that involve primes, the remaining infinite number of solutions can be combinations of primes and non-primes.

The strategy is to first take p+2 as a known prime in the expression (71) and then see if p is a prime if we get a sequence of integer-relations relating p,p+2 that only survives when p is also a prime.

STATEMENT 1: Let p+2 be a prime.

I use the strategy of finding the required relations p to be a twin prime when we accept that p+2 , is a prime. We don’t know if p is a prime yet, but we know that p+2 is a prime and so, σ( p+2 )=p+3 .

σ( p ) p+3 ( 2π ) { 3 2 + p 2 }+( p+2 σ( p ) 2 ) =M , where M is a constant.

In terms of the Pi-transformations;

( 2π ) g( z ) = ζ( 1g( z ) ) 2Γ( g( z ) )ζ( g( z ) )cos( π( g( z ) ) 2 ) (72)

{ ζ( 1{ 3 2 + p 2 } ) 2Γ( { 3 2 + p 2 } )ζ( { 3 2 + p 2 } )cos( π 2 ( { 3 2 + p 2 } ) ) } ×[ ζ( 1+( p+2 σ( p ) 2 ) ) 2Γ( σ( p ) 2 p2 )ζ( σ( p ) 2 p2 )cos( σ( p ) 2 p2 ) ] =M

When p+2 is an odd prime, it is clear that p is odd, { 3 2 + p 2 }=k , where k3 is an integer that can be either odd or even, and so,  p=2k3 , p+2=2k1 .

( 2π ) k+ σ( 2k3 ) 2 5 =[ ζ( 1k ) 2Γ( k )ζ( k )cos( π 2 ( k ) ) ] ×[ ζ( σ( 2k3 ) 2 4 ) 2Γ( 5 σ( 2k3 ) 2 )ζ( 5 σ( 2k3 ) 2 )cos( π 2 ( 5 σ( 2k3 ) 2 ) ) ] =1 (73)

Then, if k is an odd number, the expression vanishes, so k must be even and p=4m3 , mZ .

( 2π ) 2m+ σ( 4m3 ) 2 5 =MRe (74)

STATEMENT 2: When 4m3 is a prime, σ( 4m3 )=4m2 , hence,

M= ( 2π ) 6 = 1 64 π 6 (75)

Hence for all twin primes, p=4m3 , p+2=4m1 , M= 1 64 π 6 only when 4m1 is a prime.

Applying Dirichlet’s theorem (20) concludes the proof:

THEOREM 5: For any two positive coprime integers, a , d , there exists infinitely many primes of the form a+nd , where n is also a positive integer.

5. The Relationship of the Divisor Function, the Gamma-Function, the Zeta Function and the Robin Inequality

From (57),

( σ( n ) ) n 1 2 ( 2π ) σ( n ) 2 1 2 Γ( n ) k=0 σ( n )1 Γ( n+k σ( n ) )=1forallnZ. (83)

Expression (83) is invariant to the substitution σ( n )m , n 1 2 ρiτ ,

m ρiτ ( 2π ) m 2 1 2 Γ( 1 2 ρiτ ) k=0 m1 Γ( 1 2 ρiτ+k m )=1forallρ,τR (84)

m ρiτ = ( 2π ) m 2 1 2 Γ( 1 2 ρiτ ) k=0 m1 Γ( 1 2 ρiτ+k m ) forallρ,τR (85)

m=1 m ρiτ = m=1 ( ( 2π ) m 2 1 2 Γ( 1 2 ρiτ ) k=0 m1 Γ( 1 2 ρiτ+k m ) )forallmZ,ρ,τR (86)

ζ( ρ+iτ )= m=1 ( ( 2π ) m 2 1 2 Γ( 1 2 ρiτ ) k=0 m1 Γ( 1 2 ρiτ+k m ) ) (87)

Putting

Γ( 1 2 ρiτ )= ( 2π ) 1 2 m 2 m ρiτ k=0 m1 Γ( 1 2 ρiτ+k m ) (88)

gives,

ζ( ρ+iτ )= m=1 m ρiτ (89)

Now, from elementary number theory, using the Li-function,

Li( n )=γ+lnln( n )+ k=1 ( ln ( n ) k kk! ) (90)

One finds that:

e Li( n )Li( ln( n ) )+ k=1 ( ln ( lnn ) k kk! ) k=1 ( ln ( n ) k kk! ) ln( ln( n ) )+ln( ln( ln( n ) ) ) =1 (91)

In an earlier draft-paper, I showed that the Zeta function vanishes for rational functions of the roots, when the gamma functions result in real arguments for which real part is given by

e iγ( 12ρ )+log( Γ( ρ+1 ) Γ( 2ρ ) )+ k=1 ( 12ρ k +log( ρ+k ( 1ρ+k ) ) ) =1 (92)

Hence, from (57) and (92), for any, n>1 ,

( σ( n ) ) n 1 2 ( 2π ) σ( n ) 2 1 2 Γ( n ) e Li( q )Li( ln( q ) )+ k=1 ( ln ( ln( n ) ) k kk! ) k=1 ( ln ( n ) k kk! )ln( ln( n ) )+ln( ln( ln( n ) ) ) k=0 σ( n )1 Γ( n+k σ( n ) )=1 (93)

and

e Li( ln( n ) )+ k=1 ( ln ( ln( n ) ) k kk! ) = ( σ( n ) ) n 1 2 ( 2π ) σ( n ) 2 1 2 Γ( n ) e Li( n ) k=1 ( ln ( n ) k kk! )ln( ln( n ) )+ln( ln( ln( n ) ) ) k=0 σ( n )1 Γ( n+k σ( n ) ) (94)

Multiplying both sides by σ( n ) n ,

σ( n ) e Li( ln( n ) )+ k=1 ( ln ( ln( n ) ) k kk! ) p = ( σ( n ) ) n+ 1 2 ( 2π ) σ( n ) 2 1 2 Γ( n+1 ) e Li( n ) k=1 ( ln ( n ) k kk! )ln( ln( n ) )+ln( ln( ln( n ) ) ) k=0 σ( n )1 Γ( n+k σ( n ) ) (95)

Again, using the Li-function relation,

Li( n )=γ+lnln( n )+ k=1 ( ln ( n ) k kk! ) (96)

We find that both sides express the form of the Robin relation:

σ( n ) e γ nlnln( n ) = ( σ( n ) ) n+ 1 2 ( 2π ) σ( n ) 2 1 2 Γ( n+1 ) e Li( n ) k=1 ( ln ( n ) k kk! )ln( ln( n ) )+ln( ln( ln( n ) ) ) k=0 σ( n )1 Γ( n+k σ( n ) ) (97)

6. The Relationship of the Robin Inequality to the Riemann Zeta Function

Consider the expression:

σ( n ) e γ nlnln( n ) = ( σ( n ) ) n+ 1 2 k=0 σ( n )1 Γ( n+k σ( n ) ) ( 2π ) σ( n ) 2 1 2 Γ( n+1 ) e Li( n ) k=1 ( ln ( n ) k kk! )ln( ln( n ) )+ln( ln( ln( n ) ) ) (98)

e γ nlnln( n ) = ( σ( n ) ) n 1 2 k=0 σ( n )1 Γ( n+k σ( n ) ) ( 2π ) σ( n ) 2 1 2 Γ( n+1 ) e Li( n ) k=1 ( ln ( n ) k kk! )ln( ln( n ) )+ln( ln( ln( n ) ) ) (99)

This is invariant to the substitutions, σ( n )m , n 1 2 s .

e γ ( 1 2 s )lnln( 1 2 s ) = ( m ) s k=0 m1 Γ( ( 1 2 s )+k m ) ( 2π ) m 2 1 2 Γ( 3 2 s )  e Li( 1 2 s ) k=1 ( ln ( 1 2 s ) k kk! )ln( ln( z ) )+ln( ln( ln( z ) ) ) (100)

m s = e γ ( 2π ) m 2 1 2 Γ( 3 2 s ) e Li( 1 2 s ) k=1 ( ln ( 1 2 s ) k kk! )ln( ln( 1 2 s ) )+ln( ln( ln( 1 2 s ) ) ) ( 1 2 s )lnln( ( 1 2 s ) ) k=0 m1 Γ( ( 1 2 s )+k m ) (101)

Hence,

ζ( s )= m=1 e γ e { Li( 1 2 s ) k=1 ( ln ( 1 2 s ) k kk! )ln( ln( 1 2 s ) ) }+ln( ln( ln( 1 2 s ) ) ) ( 2π ) m 2 1 2 Γ( 1 2 s ) lnln( ( 1 2 s ) ) k=0 m1 Γ( ( 1 2 s )+k m ) (102)

Li( 1 2 s ) k=1 ( ln ( 1 2 s ) k kk! )lnln( 1 2 s )=γ (103)

ζ( s )= m=1 ( 2π ) m 2 1 2 Γ( 1 2 s ) k=0 m1 Γ( 1 2 s+k m ) (104)

and since

Γ( 1 2 s )= ( 2π ) 1 2 m 2 m s k=0 m1 Γ( 1 2 s+k m ) (105)

ζ( s )= m=1 m s (106)

Obviously, the Robin inequality is related to the ζ-function!

Then, due to invariance of (104) to the mf( m ) , were, { f( m ),m }Z ; and when s=ρ+iτ takes on certain values, and so:

Γ( 1 2 s )= ( 2π ) 1 2 f( m ) 2 ( f( m ) ) s k=0 f( m )1 Γ( 1 2 s+k f( m ) ) (107)

Then, (107) can be put as:

ζ( s )= m=1 ( f( m ) ) s = ( 2π ) m 2 f( m ) 2 k=0 f( m )1 Γ( 1 2 s+k f( m ) ) k=0 m1 Γ( 1 2 s+k m ) (108)

Obviously when f( m )=m , we recover the original ζ-function:

ζ( s )= m=1 m s (109)

7. The Relationship of the Gamma-Function, to the Roots of the Zeta Function

Consider the rational forms of the ζ-function (Jensen formula [14], p. 1036),

ζ( s )=( 2 s1 2 s 1 )( s s1 )+ 2 2 s 1 0 ( ( 1 4 + t 2 ) s 2 sin( s tan 1 2t ) e 2πt 1 )dt,{ ( s )1 } (110)

Substituting tanθ=2t , dt= 1 2 ( 1+ tan 2 θ )= 1 2 ( secθ ) 2 , in (109), the tan function is valid for the range { 0... } . The sin function is valid for the range { 0... π 2 } .

ζ( s )=( 2 s1 2 s 1 )( s s1 + 0 π 2 ( sin( sθ )( 1 2 ( secθ ) s ) e πtanθ 1 )dθ ) (111)

This reduces to

ζ( s )=( 2 s1 2 s 1 )( s s1 + 0 π 2 ( sin( sθ )( ( secθ ) 2s ) e πtanθ 1 )dθ ) (112)

Using Chebyshev’s polynomials of the first kind, ([14], p. 993), and putting x=cosθ , in

sin( s cos 1 ( x ) )= 1ChebyshevT ( s, cos 1 ( x ) ) 2 (113)

ChebyshevT( s, cos 1 ( cosθ ) ) =cos( sθ )= 1 2 [ ( cosθ+i 1cos θ 2 ) s + ( cosθi 1cos θ 2 ) s ] (114)

sin( sθ )= 1 ( 1 2 [ ( cosθ+i 1cos θ 2 ) s + ( cosθi 1cos θ 2 ) s ] ) 2 (115)

( secθ ) 2s = ( cosθ ) s2 (116)

ζ( s )=( 2 s1 2 s 1 )( s s1 + 0 π 2 ( ( cosθ ) s2 ( 1 ( 1 2 ( cosθ+isinθ ) s + 1 2 ( cosθisinθ ) s ) 2 ) e πtanθ 1 )dθ ) (117)

ζ( s )=( 2 s1 2 s 1 )( s s1 + 0 π 2 ( ( cosθ ) 2s ( ( cosθ ) 2s ( 1 2 ( 1+itanθ ) s + 1 2 ( 1itanθ ) s ) 2 ) e πtanθ 1 )dθ ) (118)

Which can be reduced again by the substitution, x=tanθ , with dθ= dx 1+ x 2 , in (118),

ζ( s )=( 2 s1 2 s 1 )( s s1 )+ 0 ( ( 1 1+ x 2 ) 2s ( 1 1+ x 2 ) 2s ( 1 2 [ ( 1+ix ) s + ( 1ix ) s ] ) 2 e πx 1 )dx (119)

Simplifying,

ζ( s )=( 2 s1 2 s 1 )( s s1 )+ 0 ( ( 1 1+ x 2 ) s ( 1 2 [ ( 1+ix ) s ( 1+ x 2 ) s + ( 1ix ) s ( 1+ x 2 ) s ] ) 2 e πx 1 )dx (120)

ζ( s )=( 2 s1 2 s 1 )( s s1 )+( 2 s1 2 s 1 )[ 0 ( 2 ( 1+ x 2 ) s ( 1ix ) 2s ( 1+ix ) 2s e πx 1 )dx ] (121)

Finally, one arrives at the Abel Plena form:

ζ( s )=( 2 s1 2 s 1 )[ s s1 +( 2 s1 2 s 1 ) 0 i( ( 1+ix ) s + ( 1+ix ) s e πx 1 )dx ] (122)

The function (121) can now be reduced to a series form, as follows:

( 1+ix ) s = n=0 ( ix ) n Γ( 1s ) Γ( sn+1 )n! , ( 1ix ) s = n=0 ( ix ) n Γ( 1s ) Γ( sn+1 )n! (123)

Note that the odd terms vanish and the sums become real, and one is left with:

ζ( s )=( 2 s1 2 s 1 )[ s s1 + 0 ( 2 n=1 ( x ) 2n1 Γ( 1s ) 2Γ( sn+2 )( 2n1 )! e πx 1 )dx ] (124)

Using the relations,

ζ( 2n )Γ( 2n )[ 1 π 2n ]= 0 x 2n1 e πx 1 dx,Γ( 2n )=( 2n1 )!

We get the relation:

ζ( s )=( 2 s1 2 s 1 )[ s s1 + n=1 2Γ( 1s )ζ( 2n )Γ( 2n ) π 2n Γ( sn+2 )( 2n1 )! dx ] (125)

ζ( s )=( 2 s1 2 s 1 )[ s s1 + n=1 2Γ( 1s )ζ( 2n ) π 2n Γ( sn+2 ) dx ] (126)

Using the relation ζ( 2n )= ( 1 ) n+1 2 2n1 π 2n B 2n ( 2n )! , one arrives at the desired form:

ζ( s )=( 2 s1 2 s 1 )[ s s1 n=1 2 2n B 2n Γ( 1s ) Γ( s2n+2 )( 2n )! ] (127)

Now, a critical observation is that the series in (127) also determines an equal representation of the rational forms of the arguments by the observation that

s s1 = n=0 1 2 n B n Γ( 1s ) Γ( 2ns )n! (128)

The function becomes:

ζ( s )=( 2 s1 2 s 1 )[ s s1 ( n=0 2 n B n Γ( 1s ) Γ( sn+2 )n! n=0 1 2 n B n Γ( 1s ) Γ( 2ns )n! ) ] (129)

ζ( s )=( 2 s1 2 s 1 )[ s s1 ( n=0 2 n B n Γ( 1s ) Γ( sn+2 )n! + s s1 ) ] (130)

Finally,

ζ( s )=( 2 s1 2 s 1 )( n=0 2 n B n Γ( 1s ) Γ( 2ns )n! ) (131)

8. The Non-Trivial Roots of the Zeta Function

It is clear from (130) that when s=ρ is a root of the ζ-function,

ρ ρ1 = n=1 2 2n B 2n Γ( 1ρ ) Γ( ρ2n+2 )( 2n )! = n=0 1 ( 2 n ) B n Γ( 1ρ ) Γ( 2nρ )n! , (132)

and,

n=0 2 n B n Γ( 1ρ ) Γ( ρn+2 )n! =0 (133)

This is where the role of the Bernoulli numbers, B n and the Gamma function come into play with the roots of the Riemann zeta function. Note that the expression (129) is the rational form of the Γ-function. Consider the Γ-function ([13], p. 894):

Γ( z )= e γz z k=1 ( e z k 1+ z k ),( z )>0 (134)

here γ is Euler’s constant [14]. The relation (134) is only valid for ( z )>0 , i.e., ( z )=( ρ2n+1 )>0 . The Bernoulli numbers and the Γ-function (134) interact only for values of n{ 0,1 } . These are precisely the values that truncate the relation:

ρ ρ1 = n=1 2 2n B 2n Γ( 1ρ ) Γ( s2n+2 )( 2n )! n=0 1 2 n B n Γ( 1ρ ) Γ( 2ns )n! (135)

Put z=1ρ , and also, z=22nρ in (135), and since it is only valid for n=0,1 , it can be seen that (135) produces the correct result:

1 ρ1 1+ n=1 2 2n B 2n Γ( 1ρ ) Γ( ρ2n+2 )( 2n )! =0 (136)

Which provides again for the relation,

ρ ρ1 = n=1 2 2n B 2n Γ( 1ρ ) Γ( ρ2n+2 )( 2n )! (137)

It follows that unless s is a root, the result (136) is not true. Let us expand Γ( 1s ) using the functional relation (134), and using (137)

ρ ρ1 = 1 ρ1 ( e γ( 1ρ ) k=1 ( e 1ρ k 1+ 1ρ k ) n=1 2 2n B 2n Γ( ρ2n+2 )( 2n )! ) (138)

It can be seen that from the numerator, a root s, can be expressed as

ρ= e γ( 1ρ ) k=1 ( e 1ρ k 1+ 1ρ k )[ n=1 2 2n B 2n Γ( ρ2n+2 )( 2n )! ] (139)

This relation must be satisfied by the substitution, ρ1ρ in (138); hence,

1ρ= e γρ k=1 ( e ρ k 1+ ρ k )[ n=1 2 2n B 2n Γ( ρ2n+1 )( 2n )! ] (140)

Additionally, an equivalent representation of the rational form is obtained:

ρ ρ1 = e γ( 1ρ ) k=1 ( e 1ρ k 1+ 1ρ k )[ n=1 2 2n B 2n Γ( ρ2n+2 )( 2n )! ] e γρ k=1 ( e ρ k 1+ ρ k )[ n=1 2 2n B 2n Γ( ρ2n+1 )( 2n )! ] (141)

It is possible to simplify (141) as follows:

ρ ρ1 = e γ( 12ρ ) Γ( ρ ) Γ( 1ρ ) k=1 ( e 12ρ k ( k+ρ ) k+1ρ )[ ρ ρ1 1ρ ρ ] (142)

ρ ρ1 = e γ( 12ρ ) Γ( ρ ) Γ( 1ρ ) k=1 ( e 12ρ k ( k+ρ ) k+1ρ ) [ ρ ρ1 ] 2 (143)

Then,

ρ1 ρ = e γ( 12ρ ) Γ( ρ ) Γ( 1ρ ) k=1 ( e 12ρ k ( k+ρ ) k+1ρ ) (144)

ρ1 ρ = e γ( 12ρ ) Γ( ρ ) Γ( 1ρ ) k=1 ( e 12ρ k k+ρ+( 12ρ ) k+ρ ) (145)

and finally,

ρ1 ρ = e γ( 12ρ ) [ Γ( ρ ) Γ( 1ρ ) ] k=1 ( e 12ρ k 1+ 12ρ k+ρ ) (146)

Now from (146), put ρ=σ+iτ

σ+iτ1 σ+iτ = e γ( 1( 2σ+2iτ ) ) [ Γ( σ+iτ ) Γ( 1σiτ ) ] k=1 ( e 1( 2σ+2iτ ) k k+σ+iτ 1σ+kiτ ) (147)

In this case, one uses the complex representation of the Γ-function ([14]. p. 895):

Γ( σ+iτ )=Γ( σ )[ σ e iτγ σ+iτ ] k=1 ( e iτ k 1+ iτ σ+k ),σ>0, (148)

σ+iτ= Γ( σ )σ e iτγ Γ( σ+iτ ) k=1 ( e iτ k σ+k σ+k+iτ ) (149)

then, similarly,

1σiτ= Γ( 1σ ) e iτγ Γ( 1σiτ ) k=1 ( e iτ k 1σ+k 1σiτ+k ) (150)

One can now express the rational form of the roots as follows:

1σiτ σ+iτ = Γ( 1σ ) e iτγ Γ( 1σiτ ) k=1 ( e iτ k 1σ+k 1σiτ+k ) Γ( σ ) e iτγ Γ( σ+iτ ) k=1 ( e iτ k σ+k σ+iτ+k ) (151)

1σiτ σ+iτ = Γ( 1σ )Γ( σ+iτ ) e iτγ Γ( σ )Γ( 1σiτ ) e iτγ k=1 ( e 2iτ k ( 1σ+k )( ρ+k+iτ ) ( 1σiτ+k )( σ+k ) ) (152)

And so,

σ+iτ 1σiτ = Γ( σ ) Γ( 1σ ) Γ( 1σiτ ) Γ( σ+iτ ) e 2iτγ k=1 ( e 2iτ k ( σ+k 1σ+k )( 1σiτ+k σ+k+iτ ) ) (153)

From (146), we also have,

σ+iτ1 σ+iτ = e γ( 1( 2σ+2iτ ) ) [ Γ( σ+iτ ) Γ( 1σiτ ) ] k=1 ( e 1( 2σ+2iτ ) k k+σ+iτ 1σ+kiτ ) (154)

Multiplying (153) by (154), it is possible to reach:

Γ( σ ) Γ( 1σ ) e iγ( 12σ ) k=1 ( e 12σ k σ+k 1σ+k )=1 (155)

e iγ( 12σ )+log( Γ( σ ) Γ( 1σ ) k=1 ( e 12σ k ρ+k 1ρ+k ) ) =1 (156)

e iγ( 12σ )+log( Γ( σ ) Γ( 1σ ) )+ k=1 ( 12σ k +log( σ+k 1σ+k ) ) =1 (157)

Now, the right-hand side of (157) is unity. However, the left-hand side of (157) can grow due to the fact that the sum

k=1 ( 1 k )=ζ( 1 )=

Except when σ= 1 2 , and one finds that all the terms in (157) reduce to unity:

e iγ( 0 )+log( 1 )+ k=1 ( log( 1 ) ) =1 (158)

No assumptions have been made about σ .

9. A Sequence That Gives the Integers Obeying the Robin Inequality

THEOREM 2: Let p be an integer, such that

g( p )= Li( e e σ( p ) p λ ) k=1 ( e σ( p ) p λ kk! ) e Li( ln( p ) ) k=1 ( ln ( lnp ) k kk! ) (159)

Then, for all p>5040 , the integer-function

x=3 p ( 1 2 + ( ln( ln( g( x ) ) )ln( ln( 1 g( x ) ) ) )i 2π ) ×( 1 2 + ( ln( ln( g( p ) ) )ln( ln( 1 g( p ) ) ) )i 2π )={ n p pg( p )<1 0 pg( p )>1 (160)

maps p into the infinite sequence of integers, n p , only if p satisfies the Robin inequality.

PROOF:

Using the Li-function, it is easy to show that:

g( p )= λ+ln( ln( e e σ( p ) p λ ) ) e λ+ln( ln( ln( p ) ) ) (161)

Note that from ([14], p. 46):

k=1 ( sin( kx ) k )= πx 2 (162)

Putting x=ln( ln( g( x ) ) )ln( ln( 1 g( x ) ) )i ,

1 π k=1 ( sin( k[ ln( ln( g( x ) ) )ln( ln( 1 g( x ) ) )i ] ) k ) = 1 2 + ( ln( ln( 1 g( x ) ) )ln( ln( g( x ) ) ) )i 2π (163)

Then,

1 π x=3 p ( 1 2 + ( ln( ln( g( x ) ) )ln( ln( 1 g( x ) ) ) )i 2π ) ×( 1 2 + ( ln( ln( g( p ) ) )ln( ln( 1 g( p ) ) ) )i 2π )={ n p pg( p )<1 0 pg( p )>1 (164)

x=3 p ( 1 π k=1 ( sin( k[ ln( ln( g( x ) ) )ln( ln( 1 g( x ) ) )i ] ) k ) ) ×( 1 π k=1 ( sin( k[ ln( ln( g( p ) ) )ln( ln( 1 g( p ) ) )i ] ) k ) ) ={ n p pg( p )<1 0 pg( p )>1 (165)

Note that

ln( ln( 1 g( x ) ) )ln( ln( g( x ) ) )=iπforg( x )>1 ln( ln( 1 g( x ) ) )ln( ln( g( x ) ) )=iπforg( x )<1 (166)

Then, if there exists a finite number n p of integers p j for which g( p j )<1 , that survive, and p n p integers p m , for which g( p m )>1 , that do not survive then, for the range, 3...p . The relation (158) is a continuous mapping of p to the sequence of the integers n={ 1,2,3,4,, } , with gaps, G( n,n+1 ) between integers n,n+1 , that satisfy the Robin inequality criterion. Then, if for p>5040 , the gap G( n ) between the sequence of integers, n must be zero.

The sequence of gaps that belong to G( n,n+1 ){ 6,3,1,0( are these triangular numbers? ) } . Note that these gaps are also related to the Leonhard Euler’s σ-function. The question mark indicates that we do not know if for every p>5040 , G( p>5040 )=0 .

Note that the sequence of gaps are triangular numbers belonging to the set:

{ 0,1,3,6,10,15,21,28,36,45,55,66,78,91,105, 120,136,153,171,190,210,, k( k+1 ) 2 } (167)

Now using the Li-function [14], we reconstruct the Robin inequality as follows:

σ( m ) m e γ Li( m )+γ+ k=1 ( lnm ) k kk! <1,m R m (168)

R m [ 3 ,4,5,6,8,9,10,12,16,18,20,24,30,36,48,60, 72,84,120,180,240,360,720,840,2520, 5040 ] (169)

It is clear that the general sum k=1 ( lnm ) k kk! , holds for all m in (168).

The understanding of the Robin Inequality has been stalled by the discovery of a function that can simulate its property and remain valid for all integers with the criteria that if, m>5040 R m . To do this,

1) I create a new function, F( m ) that will be valid within the range of m<5041 , that generates all the Robin inequality conditions for all m5041 , and is increasing for all higher m>5041 values.

2) If the function is valid for the inequality for any m<5041 , and for a single value of m>5040 , it will be valid for all m>5040 .

To generate such a function, we consider the sum in the function F( m ) below. There exists a value n for which the function:

F( m )= σ( m ) m e γ Li( m )+γ+ k=1 n ( lnm ) k kk! { >1, m R m <1, m R m (170)

holds for all m R m . A progressive determination of n, shows that the function, F( m ) , (170) holds for n=22 , for m R m , and therefore should hold for all m, if for m>5040 , it holds. This is so since if any integer greater than 5040 produces a positive value of F( m ) and does not follow Robin’s inequality, and if m=5041 also produces a negative result for F( m ) that obeys the Robin inequality, then it cannot produce a positive result for m>5040 since the sum is increasing thereafter, and the maximum value of this increase is the infinite sum. Table 1 shows the values of the two sums in the range 5035…5045.

Table 1. Difference between the infinite sum and the finite sum.

m

k=1 ( lnm ) k kk!

k=1 22 ( lnm ) k kk!

Difference in sums Δ m

σ( m ) m e γ ( Li( m )γ k=1 22 ( lnm ) k kk! =ln( ln( m ) ) )

5035

685.66195184509884607000

685.66837027517579615000

0.00641843007695008000

−1.42673061028986065000,

5036

685.77923715916120116000

685.78565910254497690000

0.00642194338377574000

−1.16601623748948898860,

5037

685.89651974455881535000

685.90294520239490977000

0.00642545783609442000

−1.35751570774075386840,

5038

686.01379960195919260000

686.02022857539320316000

0.00642897343401056000

−1.22664046738100985820,

5039

686.13107673202953835000

686.13750922220716680000

0.00643249017762845000

−1.58786025843012142350,

5040

686.24835113543675930000

686.25478714350381195000

0.00643600806705265000

0.00547701121975959660,

5041

686.36562281284746401000

686.37206233994985156000

0.00643952710238755000

−1.58000600706458847760,

5042

686.48289176492796320000

686.48933481221170046000

0.00644304728373726000

−1.30698824063832039330,

5043

686.60015799234426936000

686.60660456095547561000

0.00644656861120625000

−1.38222149027422428420,

5044

686.71742149576209747000

686.72387158684699621000

0.00645009108489874000

−1.08052130523482364040,

5045

686.83468227584686490000

686.84113589055178396000

0.00645361470491906000

−1.47517274812773264550

It is clear that the infinite sum is slightly larger than the finite sum.

a) The maximum difference after 5050 for the sums is ∆5040 ≈ 0.00643600806705265... corresponding to a positive value.

b)

σ( 5040 ) 5040 e γ ( Li( 5040 )γ k=1 ( ln5040 ) k kk! =ln( ln( 5040 ) ) ) =0.00547701121975959660

Therefore, there is no integer m >5040 that generates a sum for which

  σ( m ) m e γ ( Li( m )γ k=1 ( lnm ) k kk! =ln( ln( m ) ) )>1

Then, the relation

σ( m ) m e γ Li( m )+γ+ k=1 ( lnm ) k kk! { >1, m R m <1, m R m (171)

holds for all known numbers tested with the Robin inequality.

Figure 1 shows the function (170) for the integer range m={ 3..6000 } .

Figure 1. Shows the function F(m) over the range m={ 3..6000 } with the integer set that does not follow Robin’s criteria projecting above the horizontal axes.

It is visually clear from Figure 1, that the function (170) progressively becomes negative as m increases beyond 5040.

The value of the function (170) for m=5040 is 0.005477031… The function (170) goes negative for all m>5040 , k>22 .

Now

k=1 ( ln5040 ) k kk! =686.2547871> k=1 22 ( ln5040 ) k kk! =686.252636 k=23 ( ln5040 ) k kk! =0.0064367327070 (172)

And,

k=1 ( ln5040 ) k kk! k=1 22 ( ln5040 ) k kk! =686.2547871686.252636 =0.0021511< k=23 ( ln5040 ) k kk! (173)

The function π( m ) repeats itself over a large range of integers, and it is an increasing function. After π( 49036 )=5040 , there always exists an integer for which π( 49036+k )=5040+j . Hence using the prime counting function, π( m ) , we can determine if any value of m>49036 , will generate a number belonging to the set

σ( π( m ) ) π( m ) e γ Li( π( m ) )+γ+ k=1 ( lnπ( m ) ) k kk! >1,pi( m ) R m+k (174)

Hence once the function (170) crosses 5040, it cannot become positive again!

k=1 22 ( lnm ) k kk! k=23 ( lnm ) k kk! >0 (175)

The minimum values of the function (170) are at the prime numbers since σ( p )=p+1 , is the lowest bound of the function (170) for any given p.

As shown in Figure 2, the prime function F(p) shows the fall of the function below the recovery range and the function remains in the negative region.

As shown in Figure 3 the magnified graph shows the ascension to the last positive values of the function (170).

Figure 4 shows the perfect match of the infinite sum and the truncated sum in (170).

Figure 2. Shows the super-position graph of the prime counting function F( π( p ) ) , and the integer function for the range m=3..48086 . The values π( p )=720 and π( 49036 )=5040 do not follow the Robin inequality and are shown to project above the horizontal axis. Asso visible is the fall of the range of pi(p) after 48086. The primes pi(prime) are shown with the green line.

Figure 3. Shows the lower bounds of the function (170) as it progresses to higher values of the primes. Greater than 5040 will always give negative values, hence the Riemann Hypothesis is true.

Figure 4. Shows the perfect match of the range of the function (171) when restricted to the maximum sum of 22, versus the infinite sum.

Figure 5. Shows the SHARP fall of the function (170)’s bound (primes are blue, and non-primes are red) after 5040 and the decline progresses ad infinitum.

It is clear that forth finite range 3…5040, the function is decreasing with higher primes. And if (170) is negative for any integer, one can see that the bounds of the function (170), are decreasing with larger primes and therefore should remain negative for higher sum terms. One sees the clear relationship between the prime counting function F( pi( R m ) ) and F( R m ) . Finally, Figure 5 shows the sharp decline of the function (170) after 5040, and progressive lowering of the bounds and infinitum. The lowering of the integer relation for (170) is below the zero line, and the values are all negative after 5040.

Obviously, the flow of values of F( m ) and for the primes, F( p m ) falls continuously as m . The difference between F( m )=[ σ( m ) m e γ +γ+ k=1 n ( lnm ) k kk! ]Li( m ) , remains negative beyond 5040 and does not recover again to a positive value. This is evidenced by the prime-function, (shown in blue) F( p m ) (Figure 6).

Figure 6. Shows that the range of the function F( p m ) has at least the Upper and the Lower bounds F( p m )+ 1 2 <F( m )<F( p m )+2 .

F( p m )+ 1 2 <F( m )<F( p m )+2 (176)

Clearly, these bounds hold for all integer values m>5040 .

10. Conclusions

On the Algebra of the Riemann Zeta function:

The reduced algebra (158) is in the real domain, and does not violate any path integrals and also does not violate any domain restrictions since all these requirements cancel out to give a definite real result.

As I showed earlier, the ½-line is a natural result of the gamma function’s behavior. For example,

( 2π ) 1m 2 m m 1 2 k=0 m1 Γ( m+k m )= ( 2π ) 1σ( m ) 2 σ ( m ) m 1 2 k=0 σ( m )1 Γ( m+k σ( m ) ) (177)

For all integers m,

( 2π ) σ( m )m 2 ( m σ( m ) ) m 1 2 k=0 m1 Γ( m+k m ) k=0 σ( m )1 Γ( m+k σ( m ) ) =1 (178)

For primes, p, σ( p )=p+1 ,

( 2π ) 1 2 p p 1 2 k=0 p1 Γ( p+k p ) σ ( p ) p 1 2 k=0 σ( p )1 Γ( p+k σ( p ) ) =1 (179)

σ( n ) e γ nlnln( n ) = ( σ( n ) ) n+ 1 2 k=0 σ( n )1 Γ( n+k σ( n ) ) ( 2π ) σ( n ) 2 1 2     Γ( n+1 ) e Li( n ) k=1 ( ln ( n ) k kk! )ln( ln( n ) )+ln( ln( ln( n ) ) ) (180)

( 2π ) 1 2 m 2 = Γ( g( z ) ) ( m ) g( z ) 1 2 k=0 m1 Γ( g( z )+k m ) (181)

On the Robin Inequality:

The bounds of the Robin inequality have been elusive since we have always had no way to remove the lnln( m ) part as a changing parameter while still getting a function that provides the same conditions as the inequality. However, by simply changing the range of the sum up to the bound n=1,2,3,,22 , one finds that for the integers in the range m R m , are the only integers that do not obey the inequality. By studying the bounds

F( p m )+ 1 2 <F( m )<F( p m )+2

for the integer function

σ( m ) m e γ Li( m )+γ+ k=1 ( lnm ) k kk!

and by using the Li-function, we find that the continuity of the function for primes, and the integers > 5040 are bounded as stated. This satisfies the Robin hypothesis, and hence the Riemann Hypothesis is true.

On the algebra of prime numbers and twin primes:

The powers of 2π seem to play a very important role in many mathematic relations, ranging from the prime numbers to the Robin numbers. In deed the reflection formula provides a means of relating any powers of 2π to zeta and gamma function. The analysis of the Robin inequality suggests that the LambertW function plays an important role in separating the numbers that violate the Robin inequality from those that do not. Indeed, it is known that the LambertW function has branch points for which the transformations g ( z )=z play a role for the branch points k = 1, and k = 2. However, this cannot be discovered without using the Li function to re-express the relation as exponential functions.

The twin prime conjecture seems to demand that for p to be a twin, the following integer relation must hold for all primes, p, and since an infinite number of primes, exists. Every one of them will obey the relation:

When 4m3 is a prime, σ( 4m3 )=4m2 ,

( 2π ) 2m+ σ( 4m3 ) 2 5 = 1 64 π 6 (173)

Hence for all twin primes, p=4m3 , p+2=4m1 , M= 1 64 π 6 only when 4m1 is a prime.

11. Discussion

Why is the Riemann Hypothesis so difficult to solve? One of the reasons was highlighted by the advice of my Editor. I generated the series for which the function vanishes:

s s1 = n=1 2 2n B 2n Γ( 1s ) Γ( s2n+2 )( 2n )! = n=0 1 2 n B n Γ( 1s ) Γ( 2ns )n! ,

in which the roots of the Zeta function are expressed involving the products of Bernoulli functions and Gamma products. In the initial review, it was pointed out that the, “I more importantly disregarded that the zeros of the ζ-function, which are not values of the series”. It is important to note that the roots themselves are not what is computed by my work. The only object that was computed in this paper is the real part of the root of the Zeta function according to the reduction (157) which becomes real and valid only on the ½ line. Since the Zeta function vanishes to generate the relations (138) to (159), the condition forces the roots to generate (157). It is clear that the restrictions for the validity of the Gamma function for complex variables lead to the consequences that restrict the real part of rational functions of the roots to the ½-line. The expression

e iγ( 12ρ )+log( Γ( ρ+1 ) Γ( 2ρ ) )+ k=1 ( 12ρ k +log( ρ+k 1ρ+k ) ) =1 (183)

Is clearly derived without any assumptions but algebra using the axioms of multiplication, division and addition. It is surprising that the requirement that five expressions were reduced to the required result:

e iγ( 12ρ ) e iγ( 12ρ ) e log( Γ( ρ+1 ) Γ( 2ρ ) ) e k=1 ( 12ρ k ) e k=1 ( log( ρ+k 1ρ+k ) ) =1 (184)

It is important to note that Li function does the same:

e Li( n )Li( ln( n ) )+ k=1 ( ln ( lnn ) k kk! ) k=1 ( ln ( n ) k kk! ) ln( ln( n ) )+ln( ln( ln( n ) ) ) =1 (185)

Acknowledgements

I would like to pay respects to all the great mathematicians on whose shoulder I stand especially, Gauss, Euler, Ramanujan, G. Robin, J.L. Nicolas, J.H. Conway, Marc Prevost. I would like to thank the countless great mathematicians for the insights they have provided for this work over the years. My thanks also go to the Editors of this journal, in particular, Cindy Zhang.

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1] Riemann, B. (1859) Über die Anzahl der Primzahlen unter einer gegebenen Grösse. [Monatsberichte der Berliner Akademie, November 1859]. 136-144.
[2] Robin. G. (1984) Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann. Journal de Mathématiques Pures et Appliquées, 63, 187-217.
[3] Euler, L. (1755) Institutiones calculi differentialis cum eius usu in analysi finitorum ac doctrina serierum, Vol. 1.
[4] Gauss, C.F. (1863) Theoria residuorum biquadraticorum, Commentatio secunda. Königlichen Gesellschaft der Wis-senschaften zu Göttingen, 95-148.
[5] Solé, P. and Planat, M. (2012) The Robin Inequality for 7-Free Integers. Integers, 12, 301-308.
https://doi.org/10.1515/integ.2011.103
[6] Rosser, J.B. and Schoenfeld, L. (1962) Approximate Formulas for Some Functions of Prime Numbers. Illinois Journal of Mathematics, 6, 64-94.
https://doi.org/10.1215/ijm/1255631807
[7] Heath-Brown, D.R. (1984) The Divisor Function at Consecutive Integers. Mathematika, 31, 141-149.
https://doi.org/10.1112/s0025579300010743
[8] Pinner, C.G. (1997) Repeated Values of the Divisor Function. The Quarterly Journal of Mathematics, 48, 499-502.
https://doi.org/10.1093/qmath/48.4.499
[9] Choie, Y.J., Lichiardopol, N., Moree, P. and Sol, P. (2007) On Robin’s Criterion for the Riemann Hypothesis. Tome, 19, 357-372.
[10] Chakrabarty, S. (2019) The Repeated Divisor Function and Possible Correlation with Highly Composite Numbers. arXiv: 1704.00007.
[11] Nicolas, J.L. (1983) Petites valeurs de la fonction d’Euler et hypothèse de Riemann, Séminaire de Théorie des nombres. Progress in Mathematics, 38, 207-218.
[12] Anthony, M.M. (2016) The Towering Zeta Function. Advances in Pure Mathematics, 6, 351-392.
https://doi.org/10.4236/apm.2016.65026
[13] Anthony, M.M. (2024) On Perron’s Formula and the Prime Numbers. Advances in Pure Mathematics, 14, 487-494.
https://doi.org/10.4236/apm.2024.146027
[14] Gradshteyn, I.S. and Ryzhik, I.M. (2007) Table of Integrals, Series, and Products. 7th Edition, Academic Press.
[15] Dusart, P. (1999) The kth Prime Is Greater than . Mathematics of Computation, 68, 411-415.
https://doi.org/10.1090/s0025-5718-99-01037-6
[16] Hardy, G.H. (1999) Ramanujan: Twelve Lectures on Subjects Suggested by His Life and Work. AMS Chelsea Publishing.
[17] Euler, L. (1760) Observation de summis divisorum, Novi Commentarii. Academiae scientiarum Imperialis Petropoli tanae, 5, 59-74.

Copyright © 2025 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.