Prove Goldbach Conjecture Using Mathematical Induction

Abstract The existing proofs of Goldbach Conjecture are either too complicated or logically imperfect. Here the author
provides an easy-to-understand proof for the Conjecture using mathematical induction.
Key word: prime number, Goldbach Conjecture, proof, mathematical induction.

1. Introduction
Goldbach Conjecture states that every even number greater than 4 is a sum of two primes. The conjecture has been
fascinating mathematicians over centuries since 1742 [1; 2; 3; 4; 5; 6]. The conjecture has been tested valid for all evens up to 6 x
1016 [4] and two proofs have been given for the conjecture recently [5]. The second proof given by Wang [5] applied the concept
of super product of primes to extend its rationality to the infinite. However, the extending was not logically clearly documented.
The current paper tries to present a more concise and more logical proof for the conjecture.
2. Proof of the Conjecture
Given n = k, where k = 4,
According to Wang [7], Xn = X4 = 2 x 3 x 5 = 30. Let’s try to test whether the conjecture holds when n = k.
Since 4 = 2 + 2, 6 = 3 + 3, and 2, 3 are all primes, it is easy to have the conclusion that
The Conjecture holds for all evens up to 6. 1)

30 is the sums of three prime pairs, namely, 7 and 23, 11 and 19, as well as 13 and 17, respectively.
Let’s start with the first prime pair, namely, 7 and 23.

Figure 1. Combination of the differences of 7 and 23 from all primes in [3, 29] generates an array of consecutive evens in [-24, 0].

First, subtract every primes in [3, 29] from 7, and obtain a series of differences of -4, -2, 0, 4, 6, 10, 12, 16, and 22 (Figure
1).
Second, subtract every primes in [3, 29] from 23, and obtain another series of differences of -20, -18, -16, -12, -10, -6, -4, 0,
and 6 (Figure 1).
1
 Third, randomly combine differences in the both series, obtain the following array of sums of even differences between
primes in an ascending order (Figure 1).
-24, -22, -20, -18, -16, -14, -12, -10, -8, -6, -4, -2, 0, 2, 4, 6, 8, 10, 12, 16, 18, 22, 28.
You may perform the same operations to the other two prime pairs (namely, 11 and 19 as well as 13 and 17). The same array
can be obtained, proving the following conclusion
All evens in [-24, 0] are sums of differences between primes. 2)

Figure 2. The lack of a common prime factor shared on both sides of “+” implies potential primality for the sums on the right and
a periodicity of 30 between the primes. There is one exception, 187.

Figure 3. The lack of a common prime factor shared on both sides of “+” implies potential primality for the sums on the right and
a periodicity of 30 between the primes. There is one exception, 161.

2
Figure 4. Combining the right sides in Figure 2, 3, and their unshown counterparts related to primes in [13, 31] results in this
presentation of distribution of primes in [7, 211]. All primes in [7, 31] have their own series that demonstrate clearly a periodicity
of 30, which is the product of 2, 3, and 5, with 12 exceptions. Modified from Wang [7].

Figure 5. All primes in [11, 211] have their own series that demonstrate clearly a periodicity of 210, which is the product of 2, 3,
5, and 7, with 188 exceptions. Modified from Wang [7].
3
 Conclusion 2) implies that, for every even in [6, 30], there are at least one pair of primes that have a sum equal to the
even, if one or both primes in the pairs are substituted by other primes in [3, 29]. Namely,
All evens in [6, 30] are sums of two primes. 3)
Combining conclusions 1) and 3), we have
All evens in [4, 30] are sums of two primes. 4)
Conclusion 4) indicates that Goldbach Conjecture holds when n = k.

Now let’s test whether Goldbach Conjecture holds when n = k + 1.

Since k = 4, then n = k + 1 = 5, Xn = X5 = 2 x 3 x 5 x 7, according to the definition given by Wang [7].
As shown in Figure 4, all primes on the same radiating line have a difference of 30 or multiples of 30 in between, and
the difference between two primes on the same cycle can be translated to their counterparts on another cycle. It is
noteworthy that such differences can be increased by 30 if the minuend moves onto the outer cyclewhile the subtrahend
remains static in Figure 4. For example, difference of 32 can be obtained between 43 and 11, by moving 13 to the position
of 43 (on the next outer cycle) while 11 remains unchanged.
Through similar operations (moving minuend onto the outer cycle), all differences in [0, 24] between primes in [3, 29]
can be translated to [30k, 24 + 30k], where k ϵ [1, 5].
The bothering gap (namely, lack) of 26 and 28 in the differences and its derivatives (namely, 26 + 30k, 28 + 30k) can
easily filled. For example, since 11 - 13 = -2, 28 = 30 - 2 = 30 + (11 – 13) = 41 -13, the difference 28 can be obtained by
moving the minuend (11) onto the position of 41 (its counterpart on the next outer cycle) while the subtrahend (13) remains
static. All derivatives of 28 (28 + 30k) may be obtained in a similar way. The gap of difference 26 can be filled in a similar
way. So we can obtain all differences between primes in [0, 180], implying that all evens in [30, 210] are sums of 2 primes.
Namely,
Goldbach Conjecture holds in [30, 210]. 5)
The negative influence of exceptions in Figure 4 are ignorable, since the gap of differences due to a exception can be
easily filled by shifting both minuend and subtrahend onto outer or inner cycle at the same time as exceptions are of
minority in the derivatives. For example, the difference of 2 = 133 -131 is influenced by the occurrence of exception 133,
but it does not eliminate 2 from the array of differences, as 2 = 103 - 101 = 73 - 71 = 43 - 41. Such redundancy of
differences between primes make the exceptions ignorable.
Combing conclusion 4) and 5), we have that all evens in [4, 210] are sums of two primes. Namely,
Goldbach Conjecture holds in [4, 210]. 6)
This proves that Goldbach Conjecture holds when n = k + 1.
This completes the proof of the Goldbach Conjecture.

Comparing Figure 4 and 5 and referring to Wang [7], it is easy to see that almost all primes and their derivatives in a
stage are the “seeds” (numbers on the innermost cycle) for the proliferation of primes in the next stage. Considering the
periodicity of primes presented in Wang [7], the differences among primes on the innermost cycle in each stage [7] can be
readily translated to those on the outer cycles by adding the super product of primes in each stage. Such proliferation of
primes in cascades continues up to the infinite, as seen in Figure 6. This validates the above mathematical induction.

4
Figure 6. All primes on an axis may be divided (red triangle) into two segments, as shown in Figure 6a, 6b and 6c. Note that all
numbers smaller than the divide (red triangle) generate a super product of primes, while those greater than the divide (and their
products) can be added to the super product to give rise to more primes, as shown in Figure 4 and 5, which are full presentations
of the initial presenations shown in Figure 6a and 6b, respectively. Since there are infinite number of primes, there obviously are
infinite number of divides (broken triangles) and depictions similar to Figure 4 and 5, which, although nor shown, bring the
reasoning presented here into infinite.

3. Conflicts of Interests
The author declares no conflicts of interests regarding the publication of this paper.

5. References
[1] Chen, J.-R. (1966) On the representation of a larger even integer as the sum of a prime and the product of at most two primes.
Kexue Tongbao 17, 385-386.
[2] Chen, J.-R. (1973) On the representation of a larger even integer as the sum of a prime and the product of at most two primes.
Scientia Sinica 16 157-176.
[3] Hua, L.-G. (1979) Introduction to number theory. Science Press, Beijing.
[4] Guy, R.K. (2007) Unsolved problems in number theory. Science Press, Beijing.
[5] Wang, X. (2021) Two ways to prove Goldbach conjecture. London Journal of Research in Science: Natural and Formal 21, 1-
9.
[6] Brun, V. (1920) Le crible d'Eratosthène et le théorème de Goldbach. Skrifter Videnskapsselskapet i Kristiania, 1. Mat.-Naturv.
Klasse 3.
[7] Wang, X. (2021) The genesis of prime numbers ---- Revealing the underlying periodicity of prime numbers. Advances in Pure
Mathematics 11, 12-18.