A Necessary and Sufficient Condition for Proof of the Binary Goldbach Conjecture. Proofs of Binary Goldbach, Andrica and Legendre Conjectures. Notes on the Riemann Hypothesis. (Edition 8D)

1. A Sufficient and Necessary Condition for Proof of Goldbach Conjecture

The square of a natural square number greater than or equal to 2 is equal to the square of a natural square number greater or equal to 0 and a Goldbach partition semiprime.

Let m be a natural number greater or equal to 2. Let n be a natural number greater or equal to zero. Let $s_g$ be a Goldbach partition semiprime. Goldbach partition semiprimes contain prime factors of the same parity. The above condition means that:

$$m^2=n^2+s_g$$

(1)

1.1. Proof

The above mathematical statement implies that for every natural number $m\ge 2$ there exists a Goldbach partition semiprime $s_g\le m^2$ subject to condition (1).

Let p and q be the prime factors of the semiprime $s_g$ such that

$$p\ge q$$

. In which case, by (1),

$$p=m+n$$

and

$$q=m-n$$

. This also implies that

$$m=\frac{p+q}{2}\ge 2$$

and

$$n=\frac{p-q}{2}\ge 0$$

.

Thus the above condition is sufficient for the proof of the Binary Goldbach conjecture.

We can now proceed on to prove the Binary Goldbach conjecture assuming the condition (1) above.

2. Proof of Binary Goldach Conjecture

The above partition (1) also implies that the prime factors of $s_g$ are $m+n$ and $m-n$. By (1):

$$m=\sqrt{(}{n}^2+s_g)$$

(2)

From (1) also

$$s_g=(m+n)(m-n)$$

(3)

Substituting (2) into the first factor of (3) we obtain the formulation given by (4) that generates prime numbers.

$$m+n=n+\sqrt{(}{n}^2+s_g)$$

(4)

Substituting (2) into the second factor of (3) we obtain the formulation given by (5) that generates the first prime factor of $s_g$ .

$$m-n=-n+\sqrt{(}{n}^2+s_g)$$

(5)

Adding together equations (4) and (5) we obtain the Goldbach partition formulation of even numbers greater or equal to 4 given by formulation (6) below.

$$2m=(n+\sqrt{(}{n}^2+s_g))+(-n+\sqrt{(}{n}^2+s_g))$$

(6)

by (1)

$$n=\sqrt{(}{m}^2-s_g)$$

(7)

$$m+n=m+\sqrt{(}{m}^2-s_g)$$

(8)

$$m-n=m-\sqrt{(}{m}^2-s_g)$$

(9)

$$2m=(m+\sqrt{(}{m}^2-s_g))+(m-\sqrt{(}{m}^2-s_g))$$

(10)

Thus all composite even numbers have a Goldbach partition given by any of the formulae (6) and (10) above.

The gap between primes in a Goldbach partition is given by

$$2n=2\sqrt{(}{m}^2-s_g)$$

(11)

Thus given the zeta function (11):

$$2s=1+2it$$

(12)

Then the Equation (12) below is holds true:

$$\sum n^{-2s}=\sum {(m^2-s_g)}^{\frac{-1}{2}-it}$$

(13)

When a sum series is presented in the form (12) above then n would represent half the gap between consecutive primes and $s_g$ would represent product of consecutive primes. The sum series (12) is exactly in accordance to distribution of prime numbers. The above findings are in agreement with the Riemann’s hypothesis.

3. Results

Example 1

work out the Goldbach partition pairs of 100 using equaton (1) and (10)

Solution

$${50}^2=3^2+53\times 47$$

$${50}^2=9^2+59\times 41$$

$${50}^2={21}^2+71\times 29$$

$${50}^2={33}^2+83\times 17$$

$${50}^2={39}^2+89\times 11$$

$${50}^2={47}^2+97\times 3$$

The partition pairs are (3, 97), (11, 89), (17,83), (29, 71), (41, 59) and (47, 53).

$$100=(50+\sqrt{(}{50}^2-53\times 47))+(50-\sqrt{(}{50}^2-53\times 47))=53+47$$

$$100=(50+\sqrt{(}{50}^2-59\times 41))+(50-\sqrt{(}{50}^2-59\times 41))=59+41$$

$$100=(50+\sqrt{(}{50}^2-71\times 29))+(50-\sqrt{(}{50}^2-79\times 29))=71+29$$

$$100=(50+\sqrt{(}{50}^2-83\times 17))+(50-\sqrt{(}{50}^2-83\times 17))=83+17$$

$$100=(50+\sqrt{(}{50}^2-89\times 11))+(50-\sqrt{(}{50}^2-89\times 11))=89+11$$

$$100=(50+\sqrt{(}{50}^2-97\times 3))+(50-\sqrt{(}{50}^2-97\times 3))=97+3$$

Example 2

Use formula (11) to determine the gaps between primes of the Goldbach partition of 40.

Solution

$$g_1=2\sqrt{(}{20}^2-23\times 17)=6$$

$$g_2=2\sqrt{(}{20}^2-29\times 11)=18$$

$$g_3=2\sqrt{(}{20}^2-37\times 3)=34$$

3.1. Conclusion on the Binary Goldbach Conjecture

The binary Goldbach conjecture is true. A neccessary and sufficient condition for it’s for proof exists.

The binary Goldbach conjecture qualifies to be a theorem.

The findings from this proof method furnishes the tools for the proof of Andrica conjecture.

4. Proof of Andrica Conjecture

The conjecture asserts that the inequality

$${\sqrt{p}}_{n+1}-{\sqrt{p}}_n<1$$

holds for all n where $p_n$ is the $n^{th}$ prime.

In this research, consecutive primes share are common Goldbach partition semiprime. Thus if

$$p_{n+1}=m+\sqrt{m^2-s_g}$$

(14)

then

$$p_n=m-\sqrt{m^2-s_g}$$

(15)

If The Andrica conjecture is true then:

$$\sqrt{(}m+\sqrt{m^2-s_g})-\sqrt{(}m-\sqrt{m^2-s_g})<1$$

(16)

In which case:

$$m+\sqrt{(}{m}^2-s_g)<1+2\sqrt{(}m-\sqrt{(}{m}^2-s_g\left)\right)+m-\sqrt{(}{m}^2-s_g)$$

(17)

The above inequality simplifies to

$$2\sqrt{(}{m}^2-s_g)<1+2\sqrt{(}m-\sqrt{(}{m}^2-s_g\left)\right)$$

(18)

If $g_n$ represents the gap between the primes, then also

$$m^2-s_g=\frac{g_n}{2}$$

(19)

In which case

$$2\sqrt{\frac{}{}}{g}_{n}2<1+2\sqrt{(}m-\sqrt{\frac{}{}}{g}_{n}2\left)\right)$$

(20)

We can afford to omit 1 on the left side of the inequality.This also means that

$$\frac{g_n}{2}<m-\sqrt{(}\frac{g_n}{2})$$

(21)

$$\frac{g_n}{2}(1+\sqrt{(}\frac{1}{g_n}))<m$$

(22)

Since the smallest gap is 1 then the above inequality also implies that:

$$m>g_n$$

(23)

m represents the average of the two consecutive primes. The gap beween two consecutive primes is less that average of the two primes. Thus Andrica conjecture is true and qualifies to be a theorem.

The findings from the proof method used in resolving the Andrica conjecture can be used to prove Legendre conjecture.

5. Proof of Legendre Conjecture

The Legendre conjecture proposes that there exists prime numbers in between two consecutive square integers.

5.1. Proof Method

Let r and t be positive integers that fit the conditions of the Equation (24) below.

$$\sqrt{(}{p}_{n+j}+t)-\sqrt{(}{p}_n-r)=1$$

(24)

The Equation (24) can thus be considered to be an Andrica theorem problem.

Thus is we set

$$n=\sqrt{p_n-r_n}$$

(25)

where n is an integer, then by (24)

$$n+1=\sqrt{(}{p}_{n+j}+t_{n+j})$$

(26)

It should be clarified in the above form n has no bearing with gap between consecutive primes. The Andrica theorem Equation (24) rather implies primes $p_n$, $p_{n+j}$ lie in between consecutive square integers $n^2$ and ${(n+1)}^2$. Thus Andrica theorem implies that Legendre conjecture is true.

5.2. Additional Notes. On the Riemann Zeta Function as Viewed through the Andrica Theorem Equation

For the purpose of analysis of the zeta function in sum series, the $p_n$ of Equation (25) will be taken as the $n^{th}$ prime in which case the maximum integer value of $r_n$ is $+1$.

Thus for $p_1=2$, $r_1=+1$. For $p_2=3$, $r_2=+1$, and so on. If s is a complex number given by Equation (12) we note that:

$$n^{-2s}={(p_n-r_n)}^{\frac{-1}{2}-it}$$

(27)

Thus in Equation (27) n represents the number of primes. Thus

$$\sum n^{-2s}=\sum {(p_n-r_n)}^{\frac{-1}{2}-it}$$

(28)

From Equation (25):

$$p_n=n^2+r_n$$

(29)

This is to say that

$$p_n^{-2s}={(n^2+r_n)}^{-1-2it}$$

(30)

This also means from Euler product that

$$\zeta \left(2s\right)=\sum n^{-2s}=\sum {(p_n-r_n)}^{\frac{-1}{2}-it}=\prod \frac{1}{1-p_n^{-2s}}=\prod \frac{1}{1+p_n^{-s}}\prod \frac{1}{1-p_p^{-s}}$$

(31)

This is to say that

$$\sum {(p_n-r_n)}^{\frac{-1}{2}-it}=\prod \frac{1}{1+p_n^{-\frac{1}{2}-it}}\prod \frac{1}{1-p_n^{-\frac{1}{2}-it}}$$

(32)

When we permit $s=k$ where then k is an integer then:

$$\zeta \left(2k\right)=\sum n^{-2k}=\prod \frac{1}{1-p_n^{-2k}}$$

(33)

$$\zeta \left(1\right)=\sum {(p_n-r_n)}^{-\frac{1}{2}}=\prod \frac{1}{1+p_n^{-\frac{1}{2}}}\prod \frac{1}{1-p_n^{-\frac{1}{2}}}$$

(34)

Again we can also use the formulation below for relating $p_n$ andn:

$$p_n=n^2-{(n-1)}^2+z_n=2n-1+z_n$$

(35)

where $z_n$ is an integer greater or equal to zero. This means that

$$\zeta \left(s\right)=\sum n^s=\sum (\sqrt{(}{n}^2-p_n+z_n){-1)}^s=\sum {\left(\frac{p_n+1-z_n}{2}\right)}^s$$

(36)

Let:

$$w_n=z_n-1$$

(37)

Then:

$$n=p_n-w_n$$

(38)

$$\sum n^s=\sum {(p_n-w_n)}^s=\prod \frac{1}{1-p^{-s}}$$

(39)

Thus the $n^{th}$ integer is connected to the $n^{th}$ prime by the above relationship. Thus

$$g_n=p_{n+1}-p_n=1+w_{n+1}-w_n$$

(40)

and

$$2m=(m+\frac{g_n}{2})+(m-\frac{g_n}{2})=p_{n+1}+p_n$$

(41)

where:

$$2m=2p_n+g_n=2(n+w_n)+1+w_{n+1}-w_n$$

(42)

On the other hand if:

$$n+i=p_{n+i}-w_{n+i}$$

(43)

then:

$$g=p_{n+i}-p_n=i+w_{n+i}-w_n$$

(44)

in which case:

$$2m=(m+\frac{g}{2})+(m-\frac{g}{2})=p_{n+i}+p_n$$

(45)

Let

$$n^a={(p_n-w_n)}^a=p_n^{-2k}$$

(46)

Then

$$alogn=alog(p_n-w_n)=-2klog{p}_n$$

(47)

$$a=\frac{logn}{-2klog{p}_n}$$

(48)

$$n^{\frac{-2klog{p}_n}{logn}}=p_n^{-2k}$$

(49)

$$\sum n^{\frac{-2klog{p}_n}{logn}}=\sum p_n^{2k}$$

(50)

Now know from complex analysis that $-1=e^{i\pi }$ and $i=e^{\frac{i\pi }{2}}$ The following complex numbers fit with the s of the Riemann zeta function.

$$s_1=\frac{log(-\sqrt{k})}{logk}=\frac{i\pi +log\left(\sqrt{k}\right)}{logk}=\frac{1}{2}+\frac{i\pi }{logk}$$

(51)

also

$$s_2=\frac{log(-\sqrt{(}ik))}{logk}=\frac{i\pi +log\left(\sqrt{k}\right)+log\left(\sqrt{i}\right)}{logk}=\frac{1}{2}+\frac{5i\pi }{4logk}$$

(52)

$$s_3=\frac{log\sqrt{(}ik)}{logk}=\frac{log\sqrt{i}+log\sqrt{k}}{logk}=\frac{1}{2}+\frac{i\pi }{4logk}$$

(53)

Where k is a positive real number, rational or irrational, not equal to 1. There are other formulations of s given by the formulations:

$$s_4=\frac{log(-\sqrt[N]{k})}{logk}=\frac{i\pi +log\sqrt[N]{k}}{logk}=\frac{1}{N}+\frac{i\pi }{logk}$$

(54)

Here N is permitted to take fractional values. The above values of s form the source of non trivial zeroes outside the critical strip.

$$s_5=\frac{log(-\sqrt[N]{l}og(-k)}{logk}=\frac{1}{N}+\frac{i\pi }{logk}+\frac{i\pi }{Nlogk}=\frac{1}{N}+\frac{i\pi }{logk}(1+\frac{1}{N})$$

(55)

$$s_6=\frac{log\left(i\sqrt[N]{k}\right)}{logk}=\frac{1}{N}+\frac{i\pi }{2logk}$$

(56)

$$s_7=\frac{log(-i\sqrt[N]{k})}{logk}=\frac{1}{N}-\frac{i\pi }{2logk}$$

(57)

$$s_8=\frac{-log(-i\sqrt[N]{k}))}{logk}=-\frac{1}{N}+\frac{i\pi }{2logk}$$

(58)

5.3. The Riemann Zeta Function

The Riemman zeta function is a function of the complex variable s. Where $\Re \left(s\right)>1$ the function it is defined in the half absolutely by the convergent series

$$\zeta \left(s\right)=\sum _{n=1}^{n=\infty }\frac{1}{n^s}$$

(59)

In the whole complex plane it is defined by analytical continuation through the functional equation

$${\pi }^{\frac{s}{2}}\Gamma \left(\frac{s}{2}\right)\zeta \left(s\right)={\pi }^{-\frac{(1-s)}{2}}\Gamma \left(\frac{1-s}{2}\right)\zeta (1-s)$$

(60)

It should be noted that Riemann does not speak of analytical continuation of the function $\sum n^{-s}$ beyond the half plane $\Re \left(s\right)>1$ but speaks rather of finding a formula for it which “remains valid for all s”$\left[3\right]$. The view of analytic continuation in terms of chains of disks and power series convergent in each disk descends from Weierstrass and is quite antithetical to Riemann’s basic philosophy that analytic functions should be dealt with globally, not locally in terms of power series$\left[3\right]$. Riemann introduced a function of a complex variable t defined by

$$\xi \left(t\right)=\frac{1}{2}s(s-1){\pi }^{\frac{s}{2}}\Gamma \left(\frac{s}{2}\right)\zeta \left(s\right)$$

(61)

with $s=\frac{1}{2}+it$. He then shows that is an entire even function of t whose zero have imaginary parts between $-\frac{i}{2}$ and $\frac{i}{2}$.

He further states, sketching a proof of the number of zeroes in range between 0 and T. Riemann then continues: “Man findet nun in der That etwa so viel reelle Wurzeln innerhalb dieser Grenzen, und es ist sehr wahrscheinlich, dass alle Wurzeln reell sind.”, which can be translated as “Indeed, one finds between those limits about that many real zeros, and it is very likely that all zeros are real.” The statement that all zeros of the function $\xi \left(t\right)$ are real is the Riemann hypothesis [2].

When the complex numbers (54) to (58) are used in the $\xi \left(t\right)$ even function (61) non trivial zeros are generated outside the critical line on which $\Re \left(s\right)=\frac{1}{2}$. The zeroes of the $\xi \left(t\right)$ function will then have imaginary parts between between $-\frac{i}{N}$ and $\frac{i}{N}$.

Indeed the critical strip when N is permitted to be fractional. The Riemann hypothesis does not permit non trivial zeroes to be generated outside the critical line.

6. Solution of the Riemann Zeta Equation

When the Riemann zeta function is equated to zero it becomes an equation with infinite number of solutions or zeroes. The complex number proposed in Riemann hypothesis can be generalized to

$$s=\frac{1}{N}+\frac{i\pi }{logk}$$

(62)

where $logk$ is the unknown. Now the general Riemann zeta equation is given by

$$\sum n^{-\frac{logk+iN\pi }{Nlogk}}=\prod \frac{1}{1-p_n^{-\frac{logk+iN\pi }{Nlogk}}}$$

(63)

The solution of the above equation is finding the infinite $logk$ values for a given N and use the same values of $logk$ to determine the complex number s given by (62) above. These solutions can be computer generated.

Infinite number of solitions have been found for the case $N=2$.

The Riemman hypothesis proposes that the above Riemann equation has infinite number of solutions only for the case N = 2.This is false.

A preliminary test using $N\le \frac{1}{100}$, that is, the real part of $s\ge 100$ and $k=2$ shows that infinite number of zeroes are generated. These results falsify the Riemann hypothesis.

6.0.0.5. Example Result That Contradicts the Riemann Hypothesis

$$\zeta (-1000-i\frac{1000\pi }{log2})=0$$

(64)

This non-trivial zero is outside the critical strip and critical line $\Re \left(s\right)=\frac{1}{2}$. This result alone disproves the Riemann hypothesis.

7. A Further Examination of Gaps between Two Consecutive Primes

In Equation (7) n represents half the gap between primes of Goldbach partition. For the purpose of our present analysis, as applied to consecutive primes we will rewrite it to the form (65) below.

$$n^2=m^2-s_g=p_n-\alpha$$

(65)

where $p_n$ is the $n^{th}$ prime number, $m=\frac{p_{n+1}+p_n}{2}$, $s_g=p_{n+1}{p}_n$, $\alpha$ is a positive integer. This means that

$$\alpha =p_n+s_g-m^2=p_n(1+p_{n+1})-{\left(\frac{p_n+p_{n+1}}{2}\right)}^2$$

(66)

(65) means that the gap between consecutive primes is given by:

$$g_n=2n=2\sqrt{(}{p}_n-\alpha )$$

(67)

(66) means that

$$p_n+s_g>m^2$$

(68)

This also means that:

$$p_n+p_n{p}_{n+1}>{\left(\frac{p_n+p_{n+1}}{2}\right)}^2$$

(69)

This also means that

$$4p_n>{(p_{n+1}-p_n)}^2=g_n^2$$

(70)

$$g_n<2{\sqrt{p}}_n$$

(71)

In determining gaps between primes using (67) rather than (71) it should be noted that $1.75\le \alpha \le p_n-1$. Formula (67) suggests that the gap between the primes $p_n$ and $p_{n+1}$ ranges from 2 to $2floor{\sqrt{p}}_n$.

7.1. Arithmetic Mean and Geometric Mean Perspectives in Prime Gaps

The proof of the necessary and sufficient condition for proof of the Binary Goldbach conjecture establishes that all integers m greater than 1 are an arithmetic mean of two primes. That is to say:

$$m=\frac{p+q}{2}$$

(72)

The geometric mean is equal to the squareroot of the Goldbach partition semiprime. The inequality relationship between the arithmetic and geometric means is given by:

$$\frac{p+q}{2}\ge \sqrt{(}pq)={\sqrt{s}}_g$$

(73)

The inequality relationship (73) above follows from the identity relations (74) and (75) below.

$$pq+{\left(\frac{p-q}{2}\right)}^2={\left(\frac{p+q}{2}\right)}^2$$

(74)

This means that

$$pq=\sqrt{(}{\left(\frac{p+q}{2}\right)}^2-{\left(\frac{p-q}{2}\right)}^2)$$

(75)

if g represents gap between primes then (75) also means

$$s_g=m^2-{\left(\frac{g}{2}\right)}^2$$

(76)

Equation (76) also means that the gap between primes is equal to twice the squareroot of the difference between the squares of arithmetic and geometric means.

Every arithmetic mean, m, constituted from two primes has at least one corresponding geometric mean constituted from the same primes. The number of geometric means certain arithmetic mean can have is equal to the number of ways in which it is computed. Geometric means constituted from two identical primes are prime numbers otherwise they are surds of order 2.

Thus m (an integer greater than 1) of Equation (1) is an arithmetic mean of two primes while $s_g$ is the square of their geometric mean.

8. On Goldbach Partition Using by Integration

All Goldbach partition semiprimes for the Goldbach partition of composite even number 2m can be generated using the the sum series:

$$s_g=\sum _{r=1}^m(2r-1)-\sum _{s=1}^n(2s-1)=m^2-n^2$$

(77)

where $2n$ is the gap between the primes of the semiprime $s_g$ and r, s are an integers. Thus Goldbach partition semiprimes with a gap of 2 between prime factors can be generated with the sum series

$$s_g=3+5+...+2(m-1)-1$$

Goldbach partition semiprimes with a gap of 4 between prime factors can be generated with the sum series

$$s_g=5+7+...+2(m-2)-1$$

and so forth. It should be noted that $2m$ represents the Goldbach number. Thus for semiprimes with a gap of 2 between prime products:

$$3+5+7=4^2-1^2=15=3\times 5$$

$$3+5+..+11=6^2-1^2=35=5\times 7$$

$$3+5+..+23={12}^2-1^2=143=11\times 13$$

and so forth. These results imply that that the Goldbach partition semiprime, $s_g$, for the partition of a composite even number $2m$ can be obtained by integrating to some specific limits. That is to say:

$$s_g=2{\int }_0^{m}xdx-2{\int }_0^{n_g}xdx=2{\int }_{n_g}^{m}xdx$$

(78)

Here $n_g$ is an $s_g$ generator for a specified m determinate from the integration process given in (78). Equation (78) is an extension of the condition (1) through integration. The Equation (78) can further be factored as given in (79) below.

$$s_g=\left(\sqrt{(}2{\int }_0^{m}xdx\right)+\sqrt{(}2{\int }_0^{n_g}xdx\left)\right)\left(\sqrt{(}2{\int }_0^{m}xdx\right)-\sqrt{(}2{\int }_0^{n_g}xdx\left)\right)$$

(79)

Thus Goldbach partition of the composite natural number $2m$ is given by:

$$2m=\left(\sqrt{(}2{\int }_0^{m}xdx\right)+\sqrt{(}2{\int }_0^{n_g}xdx\left)\right)+\left(\sqrt{(}2{\int }_0^{m}xdx\right)-\sqrt{(}2{\int }_0^{n_g}xdx\left)\right)$$

(80)

9. Conclusion

The binary Goldbach conjecture is true and qualifies to be a theorem. Each composite even number has at least one Goldbach partition semiprime for its Goldbach partition.

Andrica conjecture is true. Andrica conjecture qualifies to be a theorem.

Andrica theorem implies that Goldbach conjecture is true.

The Riemman hypothesis is not true. non trivial zeroes can be generated outside the critical strip.