Goldbach strong conjecture and its proof

By Samuel Bonaya Buya

Teacher, Ngao girls’ secondary school

Email: sbonayab@gmail.com

Abstract: In this research proof of Goldbach strong conjecture is presented, through identifying two
possible inequalities representing the number of possible partitions of a Goldbach number. The result of
the proof of Cramer’s conjecture is used to derive an inequality for possible number of Goldbach
partitions.

Keywords: Goldbach conjecture; Cramer’s conjecture.

1. Introduction
The strong Goldbach conjecture is one of the oldest unsolved problems in number theory and
mathematics.

It states: Every even integer greater than 2 can be expressed as the sum of two primes (Weisstein,
(2002)). The conjecture was formulated in 1742 by Christian Goldbach (Ingham, 2013).

2. Notations
In this paper a Goldbach number will be represented as 2k where k is a Goldbach integer given by k > 1.
The letter p, with or without subscript will be used to denote a prime number. R (2k) represents the
number of ways a Goldbach number can be written as the sum of two primes. The letter g, with or
without subscript will be used to denote gaps between primes of Goldbach partition. The maximum
average gap between the primes of Goldbach partition will be represented as g max .

Definitions
A Goldbach number (Weisstein E. W., 2000)is any even integer greater than 2. A Goldbach integer on
the other is any integer greater than 1.

A Goldbach partition is expressing a Goldbach number as a sum of two prime numbers.

3. Goldbach partition
Let 2k denote a Goldbach number, p1 and p2 the primes of Goldbach partition. The equations (1) and (2)
below generate a Goldbach partition of an even number 2k  2 (SBB1, 2018).
 (1) p2  k  k 2  L

(2) p1  k  k 2  L

The product of the two equations gives the result stated in equation (3) below

(3) L  p1 p2

The sum of the two equations gives the result stated in the equation 4 below.

(4) 2k  p1  p2

The difference of the two equations gives the result stated in equation 5 below.

(5) p2  p1  2 k 2  L

The results (3), (4) and (5)

4. Proof of Goldbach strong conjecture

First proof method
The number of Goldbach partitions, R(k ) of a Goldbach number is given by the equation 6 below.

2k
(6) R(k ) 
d

The divisor d (a, rational number) takes a form like that of equation 4.

(7) d  2 k 2 m

In the equation 7, m is a rational number.

The closed formula for the number of Goldbach partitions of a Goldbach number is given by the
equation 8.

k
(8) R(k ) 
k2  m

The equation 8 is subject to the restraints 9 and 10 below.

(9) k2  m  4

(10) k2

The restraints 9 and 10 imply the following:

m0
(11) k
1  R( k) 
2
The upper limit of m can be determined using the inequality 12 below:

(12) k 2  m  ln k

The inequality is based on the premise that the number of Goldbach partitions of a Goldbach number
cannot exceed the number of primes up to the Goldbach integer (k). For example, consider the
Goldbach integer 5. The number of primes up to 5 is 3 and therefore the number of Goldbach partitions
of the Goldbach number 10 cannot exceed 10.

The inequality 12 implies that:

(13) m  k 2  (ln k )2

By inequalities 12 and 13

(14) 0  m  k 2  (ln k )2

Thus the minimum number of partitions of a Goldbach number is 1. This authenticates Goldbach
conjecture.

Second proof method

Cramer’s conjecture stipulates that the gap between primes is given by:

(15) gn  O((ln p n )2 )

In the paper (Buya S. B., 2019) the equation (15) was reformulated to the equation (16) below:

(16) gn  a((ln pn) 2  b

Through some criteria of selecting maximum prime gaps in the interval 2(n  1)2  (2n) 2 the table 1
below was generated.

Table 1: Comparing ratio of consecutive maximum prime gaps in the intervals 2(n  1)2  (2n) 2

Interval Primes with Maximum gap Ratio of

maximum gap consecutive
in the interval maximum gaps
0- 4 2, 3 1
4 - 16 7, 11 4 4
16 - 36 23, 29 6 3
2
36 - 64 53, 59 6 1
64 - 100 89, 100 8 4
3
100 - 144 113, 127 14 7
4
In the table 1 above the maximum ratio is 4 and is not exceeded in preceding intervals. Therefore the
primes that were selected to determine the constants of equation 1 are 2 and 7. The gaps to be selected
were 1 and 4.

Substituting these values into equation (16) the equations (17) and (18) below:

(17) a(ln 2)2  b  1

(18) a(ln 7)2  b  4

The Solutions of the two simultaneous equations were:

3
(19) a 0.91
(ln 7)  (ln 2)2
2

It was noted that the coefficient, a, is close to the greatest known value of the Cramer-Shanks-Granville
ratio (Placeholder1) of 0.920638.

3(ln 2)2
(20) b  1 0.56  1(1sf )
(ln 7) 2  (ln 2) 2

Therefore the maximum gap between consecutive primes was given by the inequality 6 below:

3 3(ln 2) 2
(21) gn  (ln p ) 2
 1 
(ln 7)2  (ln 2) 2 (ln 7) 2  (ln 2) 2
n

It was noted the (22) inequality is broken at gn  0.91(ln pn )2  1 pn 3 . The remedy was to make b  1
to obtain the inequality 7 below.

(22) gn  0.91(ln pn )2  1

Thus the gap given by (22) above was obtained as applicable to all primes.

The equation (7) by inequality (22) can take the form (23) below:

(23) d  e(0.91(ln 2 k) 2 1)  f

To determine the appropriate values of d to obtain a Goldbach partition inequality the two smallest
Goldbach integers will be used.

For k  2; d4  4 and k  3; d6  6 , the following equations hold:

Note: here d 4 is the divisor of equation 6 when k = 2.

 4  2.75e  f
(24)
6  3.92e  f

From 24:

e  1.71
(25)
f  0.70

Substituting (25) into 23:

(26) d  1.56(ln 2k )2  1.01

Substituting (26) into (6)

2k
(27) R(2k ) 
1.56(ln 2k ) 2  1.01

The inequality (27) can be reduced to inequality (28) below:

2k
(28) R(2k ) 
2(ln 2k )2  1

By inequality (28) the minimum number of Goldbach partitions is 1. Thus the Goldbach conjecture is
verified.

5. Conclusion
It is possible to derive inequalities for determining the number of Goldbach partitions of a Goldbach
number. In this research two inequalities have been derived and they show that the minimum number
of partitions of a Goldbach number is 1.
Bibliography
Buya, S. B. (2018). A Short and Elegant Proof of Goldbach conjecture. African Journal of Mathematics
and Computer Science Research .

Buya, S. B. (2019). Proof of Cramer's conjecture . Academia.edu .

Ingham, A. (2013, June). Popular lectures. 8.

SBB1. (2018). A short and elegant proof of Goldbach conjecture. African Journal of Mathematics and
Computer Science Research .

SBB2. (2019). The Twin prime and Polignac's conjecture and their proof. Academia.edu .

Weisstein, E. W. ((2002)). Goldbach Conjecture.

Weisstein, E. W. (2000). Goldbach number .