_{1}

The article presents the proof of the validity of the generalized Riemann hypothesis on the basis of adjustment and correction of the proof of the Riemanns hypothesis in the work [1] , obtained by a finite exponential functional series and finite exponential functional progression.

In this paper we give the proof of the generalized Riemann’s hypothesison the basis of adjustments and corrections to the proof of the Riemann’s hypothesis of the zeta function, which was undertaken in [

The formulation of the problem (Generalized Riemann’s hypothesis). All non-trivial zeros of Dirichle’s function L ( s , χ ) have a real part that is equal to σ = 1 2 .

1). For this we first will provethe Riemann's hypothesis for the zeta function ς ( n ) .

1.1). The solution. For the confirmation of the Riemann’s hypothesis we will give the definitions and prove the following theorem.

Definition 1. The expression

∑ k = 1 [ n ] u 1 k ( x ) = u ( x ) + u 1 2 ( x ) + u 1 3 ( x ) + ⋯ + u 1 [ n ] ( x ) (1)

is called finite exponential functional series with respect to the variable exponent 1 k , where k = { 1 , 2 , 3 , ⋯ , [ n ] } .

Definition 2. The progression of the type

a ( x ) , a ( x ) ⋅ q ( x ) , a ( x ) ⋅ q 2 ( x ) , ⋯ , a ( x ) ⋅ q x ( x ) (2)

is called finite exponential functional progression, if their first member a ( n ) is a function of x or is equal to 1 and the denominat or q ( n ) is a function of the variable x 1 x .

Theorem 1. If the set of natural numbers N n + = { 1 , 2 , ⋯ , k , ⋯ , n } is the union of subsets M 1 , M 2 , M 3 , M 4 , M 5 , M 6 and these subsets are disjoint and have appropriately for m , r , s , t , v , u the elements, the number of elements of the set N n + = M 1 ∪ M 2 ∪ M 3 ∪ M 4 ∪ M 5 ∪ M equal to

n = m + r + s + t + v + u .

Proof. The theorem is proved similarly to the theorem 7.11 ( [

Theorem 2. M ( n ) = ∑ k = 1 ∞ μ ( k ) of a series 1 ς ( s ) = ∑ n = 1 ∞ μ ( n ) n s equals.

| M ( n ) | < 1.5 n

Proof. Let the number N = N ( n ) be the quantity of elements of the set of natural numbers N n + = { 1 , 2 , 3 , ⋯ , n } . The positive integers N n + consist: of 1; primes, the quantity of which is denoted by П = П ( n ) ; of natural numbers, which are divided on p m with quotient from 1 with m ≥ 2 , the number of which is denoted by К к = К к ( n ) ; the number of positive integers, which are decomposed into a product of a pair number of primes, we denote by T n = T n ( n ) , and the amount of numbers, which can be converted into product of unpaired number of primes, will be denoted by T н = T н ( n ) . Then the amount of natural numbers N , of the set of natural numbers N n + , according to the theorem 1, equals

N n + = 1 + П + Т n + Т н + K к + К (3)

The number of the natural series N n + approximately can be expressed as a finite exponential function series

f 1 ( n ) = ∑ k = 2 [ n ] n 1 k = n + n 3 + n 4 + ⋯ + n [ n ] (4)

We will write the number of natural numbers K ( n ) , approximately as finite exponential function series consisting of the first ( n − 1 ) members of the series (4), and we denote it as f 2 ( n ) , then

f 2 ( n ) = ∑ k = 2 [ n ] n 1 k = n + n 3 + n 4 + ⋯ + n [ n ] . (5)

In the sum of the series (4) each term of the series is taken, as the amount of natural numbers. For example, n k = [ n k ] ; [ 100 ] = { 1 ; 2 ; 3 ; 4 ; 5 ; 6 ; 7 ; 8 ; 9 ; 10 } ; [ 100 3 ] = { 1 ; 2 ; 3 ; 4 } and so on.

A series ( n + n 3 + n 4 + ⋯ + n [ n ] ) is greater than the series of the natural number of positive integers f 1 ( n ) > N n + .

Definition 3. The natural numbers that overlap, are called the finite exponential function series of (5), in which they occurmore than once. Let that N = n and

1 n = 1 [ n ] . The function f 2 ( n ) > K ( n ) , because in the function except the numbers K ( n ) are included and the numbers which overlap.

Definition 4. Two infinitely great f ( n ) and φ ( n ) , which are not equal to each ether f ( n ) ≠ φ ( n ) are called equivalent if lim n → ∞ f ( n ) φ ( n ) = 1 when φ ( n ) ≠ 0 .

We assume that the set of natural numbers M 1 = ( 1 , 2 , 3 , ⋯ , n − 1 , n ) with algebra A 1 = 〈 N , + , ⋅ , − , 0 , 1 〉 is vector space P 1 . In this space we set the standard

| | x | | n = max n | n | = n , and the set of numbers M 2 = ( n [ n ] , n ( n − 1 ) , ⋯ , n ) with algebra A 2 = 〈 n [ n ] , + , ⋅ , − , 0 , 1 〉 will be assumed as vector space P 2 with standard

| | x | | n = max n | n | = n .

Then, the denominator of an exponential function of finite progression, which

operates in the space P 1 will take as q = n 1 n , and the denominator of an exponential function of finite progression, which operates in the space P 2 , as q = n 1 n .

The finite exponential functional series (4) is approximable by the sum of the finite exponential functional progression

φ 1 ( n 1 n ) = 1 + n 1 n + n 2 n + n 3 n + ⋯ + n 1 2 (6)

Proposition 1. The finite exponential functional series (4) and the sum of the finite exponential functional progression (6) are equivalent.

Proof. To prove the equivalence of the finite exponential functional series f 1 ( n ) with the finite functional progression φ 1 ( n 1 n ) the sum of the functional series is written in the form of

f 1 ( n ) = ( n + n 3 + ⋯ + n n ) < ( n 1 n ( n − n + 1 ) + ( n + n 3 + ⋯ + n n ) ) ,

Then let us write that

lim n → ∞ f 1 ( n ) φ 1 ( n 1 n ) = lim n → ∞ ( n + n 3 + ... + n n ) ( 1 + n 1 n + n 2 n + n 3 n + ⋯ + n 1 2 ) = lim n → ∞ n ⋅ ( 1 + n 1 3 − 1 2 + n 1 4 − 1 2 + ⋯ + n 1 n − 1 2 ) n ⋅ ( n − 1 2 + n 1 n − 1 2 + ⋯ + 1 ) = 1

Therefore, in accordance with the definition 4, the functional series and functional progression will be equivalent.

Proposition 1 is proved.

Proposition 2. The finite exponential functional series (4) and the sum of the finite exponential functional progression (6) 2 ⋅ S 1 ( N ) are equivalent.

Proof. The sum of the finite exponential functional progression φ 1 ( n 1 n ) can be calculated by the formula

2 ⋅ S 1 ( N ) = 2 ⋅ n − 1 n 1 n − 1 > 2 ⋅ n − 1 2 n = ( n − n ) (7)

and then the limit lim n → ∞ f 1 ( n ) φ 1 ( n 1 n ) will be equal to:

lim n → ∞ f 1 ( n ) φ 1 ( n 1 n ) = lim n → ∞ n 1 n ( n − n + 1 ) + ( n + n 3 + ⋯ + n n ) n − n = lim n → ∞ ( n 1 n n − n 1 n n + n 1 n 1 ) + ( n + n 3 + ⋯ + n n ) n − n = lim n → ∞ n + n 3 + n 4 + ⋯ + n n + 1 n − n = 1 ,

where lim n → ∞ n n = 1 and 0 < n n − 1 < 2 n ( [

Therefore, in accordance with the definition 4, the functional series (4) and the finite sum 2 ⋅ S 1 of the functional progression (6) at ( n n − 1 ) ≈ 2 n , when n → ∞ ,will be equivalent.

Proposition 2 is proved.

From the expression (4) and (7) one can see that φ 1 ( n 1 n ) is within limit of function

f 1 ( n ) ≈ φ 1 ( n 1 n ) ≥ 2 ⋅ S 1 ( n ) > n − n .

The sum of the finite exponential functional progression (6) with q = n 1 n equals 2 ⋅ S 1 ( N ) ≈ ( n − n ) . When ( n → ∞ ) , S 1 ( N ) → ∞ . We will compare the function 2 ⋅ S 1 ( n ) with the function f ( n ) = N n + . We find

k 1 = lim n → ∞ f ( n ) S 1 ( n ) = lim n → ∞ N 2 ⋅ n − 1 n n − 1 < lim n → ∞ N 2 ⋅ n − 1 2 n = lim n → ∞ N n − n = 1 .

Therefore, k 1 < 1 .

Lemma 1. The number of natural numbers that overlap is less than 1 , 5 n .

Proof. To prove this proposition let us denotethrough K n is the numbers that occur more than once in the finite exponential functional series (4) when n → ∞ , and use the exponential functional series f 2 ( n ) .

The series (5) is taken is this form to be because it includes all numbers that overlap. This follows from the expression 2 n > N , n ⋅ ln 2 > ln N . Two is taken because it is thes mallest prime number that can not be decomposed into prime factors.

The finite exponential functional series (5) will be replace by the sum of finite exponential functional progression

φ 2 ( n 1 n ) = ( 1 + ∑ k = 1 n 2 n k n ) . (8)

Proposition 3. The finite exponential functional series (5) and the finite exponential functional progression (8) are equivalent.

Proof. The functional series (4) can be written as

f 1 ( n ) = ∑ k = n n n 1 k + ( n 1 2 + n 1 3 + ⋯ + n 1 n ) ,

and the functional progression (6) is as

φ 1 ( n 1 n ) = ( 1 + n 1 n + n 2 n + ⋯ + n n − 2 n 2 n ) + ( 1 + ∑ k = 1 n 2 n k n ) .

Discard the first members of the series and progression, we find that

f 2 ( n ) = n 1 2 + n 1 3 + ⋯ + n 1 n or φ 2 ( n 1 n ) = ( 1 + ∑ k = 1 n 2 n k n ) .

We show that

f 3 ( n ) = ∑ k = n n n 1 k and φ 3 ( n 1 n ) = ( 1 + n 1 n + n 2 n + n 3 n + ⋯ + n n − 2 n 2 n )

are equivalent:

k 2 = lim n → ∞ f 3 ( n ) φ 3 ( n 1 n ) = lim n → ∞ ∑ k = n n n 1 k ( 1 + n 1 n + n 2 n + ⋯ + n n − 2 n 2 n ) = lim n → ∞ n 1 n ( n − n + 1 ) 2 ( n − n 2 ) = 1 .

It follows that the finite exponential functional series f 2 ( n ) and the finite exponential functional progression φ 2 ( n 1 n ) are equivalent.

Proposition 3 is proved.

To prove the theorem, we introduce the functions series

f 4 ( n 1 k 1 ) = ∑ k = 2 k 1 [ n ] n 1 k = n 1 4 + n 1 6 + ⋯ + n 1 n , (9)

where k 1 = { 2 , 3 , ⋯ , [ n ] / 2 } . And functional progression

φ 4 ( n 2 n ) = ( 1 + n 2 n + n 4 n + ⋯ + n n − 8 4 n + n 1 4 ) . (10)

If we express the series (5), as a series [ n ] + [ n 3 ] + [ n 4 ] + ⋯ + [ n n ] , than the series (8) is taken [ n ] + [ n 4 ] + [ n 6 ] + ⋯ + [ n 2 k ] is such form so that each element of the series (8) overlaps the each element of the series (5) with unpaired exponents of the root. And then we can write that

[ n ] + [ n 4 ] + [ n 6 ] ⋯ + [ n k ] > [ n 3 ] + [ n 5 ] + ⋯ + [ n 2 k + 1 ] . (11)

Hence the amount of numbers that cover more numbers that overlap.

Proposition 4. The finite exponential functional series (9) and the finite exponential progression (10) are equivalent.

Proof. To prove the equivalence of the finite exponential functional series with the finite exponential functional progression in the form of the relation

k 3 = lim n → ∞ f 4 ( n ) φ 4 ( n ) = lim n → ∞ n 1 4 + n 1 6 + ⋯ + n 1 n ( 1 + n 2 n + n 4 n + ⋯ + n n − 8 4 n + n 1 4 ) = lim n → ∞ n 1 4 ( 1 + n 1 6 − 1 4 + ⋯ + n 1 n − 1 4 ) n 1 4 ⋅ ( n − 1 4 + n 2 n − 1 4 + ⋯ + 1 ) = 1

Therefore, in accordance with the definition 4, the functional series (9) and a functional progression (10) are equivalent.

Proposition 4 is proved.

Proposition 5. The finite exponential functional series (9) and the finite sum 4 ⋅ S 4 ( n ) of the exponential function progression (10) are equivalent when n n − 1 ≈ 2 n ( [

Proof. The sum of functional series f 4 ( n ) is more than ( n 2 − 1 ) , and the sum of functional progression φ 4 ( n 2 n ) is considered, as the sum of the functional progression with q = n 2 n . Then we find that 4 ⋅ S 4 ( n ) = 4 ⋅ n 4 − 1 n 2 n − 1 . In order to calculate the functional ( n 2 n − 1 ) , let us set t 2 = n or t = n , and then we obtain

( n 2 n − 1 ) = ( t 4 t − 1 ) = ( t 2 t − 1 ) ⋅ ( t 2 t + 1 ) = ( t 1 t − 1 ) ⋅ ( t 1 t + 1 ) ⋅ ( t 2 t + 1 ) .

Since lim t → ∞ t t = 1 then ( n 2 n − 1 ) < 8 n 4 . And then we will have

4 ⋅ S 4 ( n ) ≈ 4 n 4 − 1 8 n 4 = n − n 4 2 , (12)

Using the definition 4 we will have

k 3 = lim n → ∞ f 4 ( n ) φ 4 ( n 2 n ) = lim n → ∞ n 2 − 1 n − n 4 2 = 1 .

Therefore, a function of series (9) and the sum 4 ⋅ S 4 ( n ) of functional progression (10) are equivalent.

Proposition 5 is proved.

From the expressions (10) and (12) it is clear that φ 4 ( n ) is within

f 4 ( n 2 n ) ≈ φ 4 ( n ) ≥ 4 ⋅ S 4 ( n ) > n − n 4 2 .

Then we compare function n with the function f 4 ( n ) when n → ∞ and we obtain

k 4 = lim n → ∞ n 4 ⋅ n 4 − 1 n n 2 − 1 < lim n → ∞ n 4 ⋅ n 4 − 1 8 n 4 = lim n → ∞ 8 ⋅ n 4 ⋅ ( n − n 4 ) = 2 .

Hence, we have that k 4 < 2 , or n − 2 ⋅ f 4 ( n 2 n ) < 0 .

Therefore, n 2 < f 4 ( n ) . Let us take into account the value of the finite exponential functional series f 4 ( n ) , and write that

n 2 < K n ( n ) < n + n 2 = 3 2 n .

Lemma 1 is proved. Then we can write that

N ( n ) − c ⋅ f 1 ( n ) < 0 , (13)

Using the inequality f 1 ( n ) > 2 ⋅ K ( n ) we will write that

f 1 ( n ) ≈ K ( n ) + ( n − n + 1 ) + K n ( n ) (14)

If we substitute value of the function f 2 ( n ) (14) into (13), we obtain

N ( n ) − c ⋅ ( K ( n ) + ( n − n + 1 ) + K n ( n ) ) < 0 .

Using Lemma 1, we obtain

N ( n ) − c ⋅ ( K ( n ) + ( n − n + 1 ) + 3 2 n ) < 0 .

Hence; we find that

N ( n ) − c ⋅ ( K ( n ) + ( n − n + 1 ) ) < c ⋅ 3 2 n .

The value N from (3) is substituted instead N , we obtain

1 + П + Т н + Т n + К к + K ( n ) < c ⋅ ( 1.5 n + K ( n ) + ( n − n + 1 ) ) ,

or

1 + П + Т н + Т n + К к < c ⋅ ( 1.5 n + ( 1 + П + Т н + Т n + К к − n + 1 ) ) . (15)

Then we can write that appropriately of the properties of the function of Mobius- μ ( n ) = 1 ,when n = 1 ; μ ( n ) = ( − 1 ) k , where k is the amount of prime factors of the numbers n = p 1 ⋅ p 2 ⋅ ⋯ ⋅ p k and μ ( n ) = 0 when n is multiple p m for m ≥ 2 ,

1 + T n − ( П + Т н ) < c ⋅ ( ( 1 + Т n ) − ( П + Т н ) − n + 1 + 1.5 n ) . (16)

We write that

M ( n ) = 1 + T n − ( П + Т н ) .

Then the expression (16) takes the form

M ( n ) < c ⋅ ( ( M ( n ) − n + 1 ) + 1.5 n ) .

Therefore

| M ( n ) | < c c − 1 ⋅ ( 0.5 n + 1 ) . (17)

The theorem is proved.

For the Mertens function we can find a more precise estimate.

Lemma 2. The accurate assessment. M ( n ) = ∑ k = 1 ∞ μ ( k ) in a series 1 ς ( s ) = ∑ n = 1 ∞ μ ( n ) n s will be equal

M ( n ) < c c − 1 ( 1.25 ⋅ n + n 3 − 1.25 ⋅ n 4 − n + 1 ) .

Proof. In order to finda more accurate estimate than M ( n ) < c c − 1 ( 0.5 n + 1 ) , let us find the sum of the finite exponential functional series (5) f 2 ( n ) = ∑ k = 2 [ n ] n 1 k = ( n + n 3 + n 4 + ⋯ + n [ n ] ) . For that we use the functional progression (6) φ 2 ( n 1 n ) = ( 1 + ∑ k = 1 n 2 n k n ) , then we obtain that

f 2 ( n ) = n + n 3 + n 4 + ⋯ + n n = 2.5 n + 2 n 3 − 2.5 ⋅ n 4 .

We find from the expression (10) that the quantity of numbers that overlap is less than f 2 ( n ) 2 because f 2 ( n ) 2 > [ n 3 ] + [ n 5 ] + ⋯ + [ n 2 k + 1 ] . Using this method, we define what M ( n ) < c c − 1 ( 0.5 ⋅ n + 1 ) and the expression f 2 ( n ) 2 > [ n 3 ] + [ n 5 ] + ⋯ + [ n 2 k + 1 ] we obtain that

M ( n ) < c c − 1 ( 1.25 ⋅ n + n 3 − 1.25 ⋅ n 4 − n + 1 ) .

Hence, we find that the upper limit of the value functions lim n → ∞ M ( n ) n will be the value

lim n → ∞ sup M ( n ) n < c c − 1 ⋅ 0.25 ,

and the lower limit is

lim n → ∞ inf M ( n ) n > − c c − 1 0.25 .

Therefore, the evaluation M ( n ) < c c − 1 ( 0.25 n + n 3 − 1.25 n 4 + 1 ) is a more accurate estimate than M ( n ) < c c − 1 ( 0.5 ⋅ n + 1 ) when n → ∞ .

Lemma 2 is proved.

The theorem 2 proves that the upper limit value of the function lim n → ∞ M ( n ) n equals

lim n → ∞ sup M ( n ) n < 0.5 ⋅ c c − 1 ,

and the lower limit is

lim n → ∞ inf M ( n ) n > − 0.5 ⋅ c c − 1 ,

Proposition 6. c c − 1 ⋅ ( 0.5 n + 1 ) ≪ n 1 2 + ε when n → ∞ .

Proof. According to the theorem 54 ( [

Proposition 6 is proved.

1.2). A determination the values of coefficient c .

1.2.1). Then we can write that according to the properties of Mobius function- μ ( n ) = 1 , then n = 1 ; μ ( n ) = ( − 1 ) k , where k the number of prime factors of the number n = p 1 ⋅ p 2 ⋅ ⋯ p k and μ ( n ) = 0 , when n is the multiple of p m for m ≥ 2 that

( ( 1 + T n ) − ( П + Т н ) ) − с ⋅ ( 1 + Т п − ( П + Т н ) ) < ( 0.5 ⋅ n + 1 ) ,

Then

M ( n ) < c 1 − c ⋅ ( 0.5 ⋅ n + 1 ) ; | M ( n ) | < c c − 1 ⋅ ( 0.5 ⋅ n + 1 ) .

From the expression К ( n ) + ( n − n + 1 ) + 3 2 ⋅ n > 0 , using the properties of Möbius function, it can be written that

M ( n ) < 1.5 ⋅ n − 1 .

And from the expression N − n > 0 we find that

M ( n ) > n .

This coincides with the results [

n < c c − 1 ⋅ ( 0.5 ⋅ n + 1 ) < 1.5 ⋅ n , we find that 2 < c c − 1 < 3 . And here we find that 1.5 < c < 2 .

1.2.2). Using a more precise value М ( n ) , we find that

n < c c − 1 ( 0.25 n + n 3 − 1.25 n 4 + 1 ) < 1.25 ⋅ n .

And here we find that 4 < c c − 1 < 5 and from the double inequality we find that the coefficient с will be in the range 1.25 < c < 1.33.

1.3). Theorem 3. The series 1 ς ( s ) = ∑ n = 1 ∞ μ ( n ) n s converges if σ = 1 2 + ε > 1 2 and | M ( n ) | < c c − 1 ( 0.5 n + 1 ) where ε is a random small number.

Corollary of Theorem 3 (the Riemann’s hypothesis). All non-trivial zeros of the zeta-function have a real partequal to σ = 1 2 .

Proof. A necessary and sufficient condition for the validity of the Riemann’s hypothesis is the convergence of the series 1 ς ( s ) = ∑ n = 1 ∞ μ ( n ) n s when σ > 1 2 ( [

M ( n ) = O ( c c − 1 ( 0.5 n + 1 ) ) and σ = 1 2 .

1 ξ ( 1 2 ) = ∑ n = 1 ∞ M ( n ) n 1 2 = ∑ n = 1 ∞ M ( n ) − M ( n − 1 ) n 1 2 = ∑ n = 1 ∞ M ( n ) ⋅ ( 1 n 1 2 − 1 ( n + 1 ) 1 2 ) = ∑ n = 1 ∞ M ( n ) ( ( n + 1 ) 1 2 − n 1 2 n 1 2 ⋅ ( n + 1 ) 1 2 ) ≤ ∑ n = 1 ∞ M ( n ) 2 n n = ∑ n = 1 ∞ M ( n ) 2 n n = ∑ n = 1 ∞ c c − 1 ( 0 , 5 n + 1 ) 2 n n = 0 , 5 c c − 1 2 ∑ n = 1 ∞ 1 n → ∞

the series diverges.

And when σ = 1 2 + ε > 1 2 we have

1 ς ( 1 2 + ε ) = ∑ n = 1 ∞ M ( n ) n 1 2 + ε ≤ 0.5 ⋅ c c − 1 2 ∑ n = 1 ∞ 1 n 1 + ε ≤ 0.5 ⋅ c c − 1 2 ∫ 1 ∞ 1 n 1 + ε d n = 0.5 ⋅ c c − 1 2 ε = 0.25 ⋅ c ε ⋅ ( c − 1 )

the series converges, where ε is an arbitrary small number.

Therefore, the series 1 ς ( s ) = ∑ n = 1 ∞ μ ( n ) n s converges uniformly for σ = 1 2 + ε > 1 2 , and since it is a function 1 ς ( s ) if σ > 1 , for the theorem of analytic continuation, it is also at its 1 2 < σ ≤ 1 . Therefore, the Riemann’s hypothesis is true.

The theorem is proved.

Proof. Let’s consider the Dirichle’s series

L ( s , χ ) = ∑ n = 1 ∞ χ ( n ) n s , s = σ + i t , (18)

where χ is the character of modulus m .

There is φ ( m ) of such series where φ is the Euler’s function. Since | χ ( n ) | ≤ 1 , the series (18) converges when σ > 1 , as can be seen from a

comparison of this series with the series ∑ 1 n s . We denote it by the sum

through series L ( 1 , χ ) . For various characters χ , we obtain different functions L ( s , χ ) .They are called L is the Dirichle’s functions. In studying the properties of these functions it is convenient to distinguish the cases where χ is the main character χ 1 and when χ ≠ χ 1 .

2.1) If χ ≠ χ 1 than the series (18) converges in the half-plane σ > 0 . Let us

show from the beginning, that the partial sums ∑ n < x χ ( n ) are limited. We divide

the integer number from 1 to [ x ] into classes of deductions by mod m and write [ x ] = m ⋅ q + r , 0 ≤ r ≤ m − 1 . Then

∑ n < x χ ( n ) = ∑ n = 1 [ x ] χ ( n ) = ( ∑ 1 m + ∑ m + 1 2 m + ... + ∑ m ( n − 1 ) + 1 m q ) ⋅ χ ( n ) + ∑ m q + 1 m q + r χ ( n ) .

Because of the orthogonality relations

∑ n ( mod m ) χ ( n ) = { φ ( m ) , than χ = χ 1 0 , than χ ≠ χ 1

we have

∑ n < x χ ( n ) = ∑ m q + 1 m q + r χ ( n ) ,

hence

| ∑ n < x χ ( n ) | ≤ ∑ m q + 1 m q + r | χ ( n ) | ≤ r < m .

Since n − σ at σ > 0 decreases monotonically and tends to zero when n → ∞ , then the series ∑ χ ( n ) / n s converges for real s = σ > 0 , and, consequently, for all s in the half-plane σ > 0 when χ ≠ χ . If, however, σ < 0 , then this the series obviously diverge. It’s abscissa converges σ 0 = 0 and the abscissa of absolute convergence σ ¯ = 1 . By the theorem 4, The Dirichle’s

series ∑ n = 1 ∞ a n ⋅ n − s in the half-plane of the convergence is a regular analytic

function from s , the successive derivatives of which are obtained by the term differentiation of this the series ( [

2.2) If χ = χ 1 we use

L ( s , χ ) = ∑ n = 1 ∞ μ ( n ) ⋅ χ ( n ) n s , Re s ≥ 1 2 . (19)

From the theorem 3 it follows that L ( s , χ ) ≠ 0 when σ ≥ 1 2 . If χ 1 is the main character by mod m , then

χ 1 ( a ) = { 1 , then ( a , m ) = 1 0 , then ( a , m ) > 1 .

Using the condition | χ ( n ) ⋅ n − s | ≤ n − s the function (19) can be written as L ( s , χ ) = ∑ n = 1 ∞ μ ( n ) χ ( n ) n s = ∑ n = 1 ∞ μ ( n ) n s , when χ ( n ) = 1 and σ ≥ 1 2 .

Using the results of the theorem 3, it can be argued that the generalized Riemann’s hypothesis is true, and accordingly to it: “All non-trivial zeros of the Dirichle’s functions have a real part equal to σ = 1 2 ”.

The theorem 4 is proved.

The refutation of the Mertens hypothesis can be found on the basis of the proof of the Riemann hypothesis given in this paper. Take the series

f 1 = ( n + n 3 + ⋯ + n n ) < ( n 1 n ⋅ ( n − n + 1 ) + ( n + n 3 + ⋯ + n n ) )

and it can be written in the form

( n 1 n ⋅ ( n − n + 1 ) + ( n + n 3 + ⋯ + n n ) ) < n + 2.5 ⋅ n 2 + 2 ⋅ n 3 − 2.5 ⋅ n 4 − n + 1 = n + 1.5 ⋅ n + 2 ⋅ n 3 − 2.5 ⋅ n 4 + 1 ,

where

f 2 ( n ) = n + n 3 + ⋯ + n n < 2.5 n + 2 ⋅ n 3 − 2.5 ⋅ n 4 .

Then we can write

N + 2.5 ⋅ n + 2 ⋅ n 3 − 2.5 ⋅ n 4 − n + 1 > 0

or

N > − 1.5 ⋅ n − 2 ⋅ n 3 + 2.5 ⋅ n 4 − 1 (20)

The value N from the expression 3 is substituted instead of N , we obtain

N = 1 + П + Т п + Т н + К к + К (п)

From the expression (20) we obtain

1 + П + Т п + Т н + К к + К ( п ) > − 1.5 ⋅ n − 2 ⋅ n 3 + 2.5 ⋅ n 4 − 1 . (21)

The properties of Mobius function ( [

M ( n ) > − 1.5 ⋅ n − 2 ⋅ n 3 + 2.5 ⋅ n 4 − 1

or

M ( n ) < 1.5 ⋅ n + 2 ⋅ n 3 − 2.5 ⋅ n 4 + 1 .

It will be the smallest value of the function of Mertens M ( n ) and the biggest value for the function of Mertens M ( n ) . From the expression 6

ϕ 1 ( n 1 n ) = 1 + n 1 n + ⋯ + n 1 2

we find that

N − n > 0 , (22)

When ( n n − 1 ) ≈ 2 n and n → ∞ ( [

We write the expression 22 in the form

1 + П + Т п + Т н + К к + К ( п ) > n . (23)

Let us apply the properties of Mobius function to the expression (23) and we obtain

M ( n ) > n .

Then we can state that the function of Mertens M ( n ) is within

n < M ( n ) < 1.5 ⋅ n + 2 ⋅ n 3 − 2.5 ⋅ n 4 + 1

And it rejects the hypothesis of Mertens.

In the article, based on the finite exponential functional series and the finite exponential functional progressions, we prove the generalized Riemann’s hypothesis, as well as the Riemann hypothesis. It is shown that in the Riemann’s

hypothesis σ = 1 2 . In the annex to the article, the Mertens hypothesis is refuted.

In the refuted Mertens hypothesis it is shown that the Mertens function is within n < M ( n ) < 1.5 ⋅ n + 2 ⋅ n 3 − 2.5 ⋅ n 4 + 1 .

Matnyak, S.V. (2018) The Proof of the Generalized Piemann’s Hypothesis. Advances in Pure Mathematics, 8, 672-686. https://doi.org/10.4236/apm.2018.87040