Goldbach’s conjecture is one of the oldest and best-known unsolved problems in number theory. It states: every even integer greater than 2 can be expressed as the sum of two primes  .
In the letter to Euler by Goldbach in 1742, Goldbach put forward the following conjecture: any even number greater than 2 can be written as the sum of two prime numbers. The common conjecture today is the version of Euler. The proposition that any sufficiently large even number can be expressed as a sum of the number of prime factors less than a sum of two numbers that prime factors not exceeding a and b separately. It is denoted as “a + b”. In 1966, Chen Jingrun proved that “1 + 2” was established. But the Goldbach’s conjecture has not yet been fully resolved .
We are going to take the big even number x on the number line, and then going to go back from x, and to look for the even numbers that are not true for the Goldbach’s conjecture, which is the exception even numbers.
The number of exception even numbers before x is written E(x). We hope that no matter how big x is, there’s only one exception even numbers. Before x, which is 2, namely is just 2 that makes the guess wrong. So the Goldbach’s conjecture is equivalent to E(x) = 1 . We will use the method of exception set to solve the Goldbach’s conjecture.
Remarks on Notation
Definition: If A is a set, card (A) is the number of elements of set A. In addition:
• is the set of integers with multiples of prime p. As .
• is the set with multiples of primes 2, 3, ∙∙∙, pm in [1, n], as .
• is the set of integers without multiples of primes 2, 3, ∙∙∙, pm in [1, n], as .
• π(N) is the number of prime numbers in [1, 2n].
• D(N) is the number of prime integer-pairs that sum of two integers is equal to 2n.
• D n is a set with elements are prime integer-pairs.
2.1. Prime and Composite Numbers
In number theory, we know the number of primes can calculate by sieve of Eratosthenes and inclusion exclusion formula   .
It can be received exact value by the calculation of the tolerance formula, but it can only be used in small range of positive integers, because the operation is very complicated. For a larger range of data operations, there is inefficiency.
2.2. The Lower Limit of the Number of Prime Numbers
2.2.1. Function ϕ(n)
Theorem. (Euler function)    If n contains any prime number pi, pj, ∙∙∙, pk factor, let ϕ(n) be the number of positive integers not greater than and prime to n, then
2.2.2. Function ϕ'(n)
Lemma 1.    (Division with remainder) If a and b are two integers, then integers q and r exist as
Theorem 2. If p is any prime number, let be a set of all multiples of prime p in [1, n]
Proof. If n = kp + r, 0 ≤ r < p, then
Theorem 3. Let be a set of integers without multiples of prime p, then
Proof. By Theorem 2, have
This (1 − 1/p) is called the eliminating factor of the composite number. □
Theorem 4. If , is the collection of n continuous natural number that except multiples of primes 2, 3, ∙∙∙, pm, then the function ϕ'(n) is
Proof. Case 1: if n is multiple of primes 2, 3, which as n equals 18,
This is say, the function ϕ(n) is the accurate value calculated when the n is multiple of 2, 3, ∙∙∙, pm.
Case 2: if n may be not multiples of primes 2, 3, ∙∙∙, pm, which as n equals 20,
When n is not multiple of 2, 3, ∙∙∙, pm, by Theorem 2, it can be known that 1/pi is the component density of multiples of the prime pi in [1, n]. Then we take ϕ'(n) from ϕ(n) as below
By Theorem 60 in “An Introduction to the Theory of numbers” , we known ϕ'(n) is multiplicative. According to Theorem 3, it can be known that (1 − 1/p) is the eliminating factor of the composite number. By Theorem 3, the every eliminating factor (1 − 1/p) less than or equal to the actual value, then its means that, ϕ'(n) is lower bound of the number of primes in [1, n]. For examples: if n = 60, , π(60) = 17, ϕ'(60) = 13.71; if n = 68, , π(68) = 19, ϕ'(68) = 15.54. Namely
Theorem 5. If ,
Proof. By Theorem 4, we known, if n is a multiple of primes 2, 3, ∙∙∙, pm,
But when n is not a multiple of primes pi, there maybe has a error r ( ), and
In order to obtain a definite lower limit of the number of primes and simple operation, we find a function that may be associated with the error as an error compensation. That is to subtract 1 is the error compensation for every operation of multiples of pi. (i = 1, 2, …, m) So, we obtain following formula
3. Integer Pairs
2n positive integers be arranged to w rows as Figure 1 follows.
We obtain n pairs of two integers that sum are just equal to 2n, it is called “integer-pair”. It is called “prime integer-pair” if two integers are primes.
Obviously, as long as we can prove that there has one or more than one prime integer-pair, the Goldbach’s conjecture problem can be solved .
Theorem 6. Let Dn be a set of prime integer-pairs in Figure 1. Then
Proof. First, to delete all even integer-pairs in Figure 1, we obtain n/2 (or (n + 1/2)) odd integer-pairs, as Figure 2 (assume n − 1 is odd) noticed that the spacing of each odd prime number is the same as that of the natural number, as shown in Figure 3. So the function formula of ϕ'(n) can also be applied (except without the 2 factor).
Our approach is:
1) First, those integer-pairs on the top row that contain multiple of 2, 3, ∙∙∙, pm are to marked “/”, (suppose n − 3 are composite numbers) (see Figure 4).
Figure 1. n pairs from 2n integers.
Figure 2. Odd integer-pairs.
Figure 3. Odd integers.
Figure 4. Marking of “/”.
The calculation for the number of integer-pairs marked “/” is by ϕ'(n) as below
by Theorem 5.
2) Next, those integer-pairs on the bottom row that contain multiple of 2, 3, ∙∙∙, pm are also to marked “\”, see Figure 5 (suppose n − 3, n + 3, 2n − 5 are composite numbers);
Then, we are deleting all integer-pairs that are marked “/” or “\”. At same times, we are using function d(n) for calculation the number of all deleted integer-pairs as below(by change every numerator 1 to 2 from function ϕ'(n))
In this way, we counted only one time for every integer-pair that containing one multiple of 2, 3, ∙∙∙, pm; but for other integer-pairs that contained two multiples of 2, 3, ∙∙∙, pm (as integer-pairs noted “×” ), we repeat counted it by two times, this is called excessive duplicate sieving . Note: this repetitive deletion will make d(n) − m less than the actual number of the remainder with 1 and prime numbers (see Figure 5). This does not affect the validity of the proof. Instead, the way to do this is to get a more rigorous the lower limit of card (Dn) (i.e. D(N)), which is exactly what we need. So, the(4) is true. □
Theorem 7. Let Dn be a set of prime integer-pairs in Figure 1. If
is true, then card(D n) ≥ 1.
Figure 5. Marking of “\”.
Proof. Because all integer-pairs that containing of the composite numbers have been deleted, the remnants are just 1 and primes. Because the Dn is a set of prime integer-pairs in n integer-pairs, and
In order to get the safe and reliable data, our rule to believe that if d(n) is greater than or equal to 2, the card (Dn) is greater than or equal to 1 (because 1 and three primes can form two integer-pair). So Theorem 7 is true. □
4. Proof of Proposition
4.1. Proofs of Some about Theorems
Theorem 8. When m ≥ 60, Pm/4 ≥ m + 2.
Proof. Because from m to m + 1, . That is to say, the growth rate of Pm greater than that of m.
Use induction on m:
1) When m = 60, P60 = 281, P60/4 = 70.25. 70.25 > 60 + 2 (to win more 8.25).
2) Suppose when m = k, .
Then, when m = k + 1, there have two cases:
a) Most prime numbers are not the twin primes, then
b) When pk+1 and pk are a pair of twin primes,
The prime numbers behind are not the twin prime number. If the distance is greater than or equal to 4, then the loss of 0.5 in the twin prime numbers will be made up in the increment of successive prime numbers. So as 2n goes up, the surplus goes up. This is the argument with the growth rate of Pm is greater than that of m.
This completes the proof of Theorem 8. □
To understand Theorem 8, see the data obtained by computer programming following Figure 6.
Theorem 9. If , then
Figure 6. Data of m and pm.
Proof. In fact, when , the d(n) is
By Theorem 8, when m ≥ 60, Pm/4 ≥ m + 2. So
4.2. Proof of the Proposition
Proposition 4.1. Every even number that not less than 4 is the sum of two prime numbers.
Proof. Let 2n be any even number larger than 4. That 2n integers are arranged form two rows in Figure 7 as below.
Using the method of Section 3, we deleting even integer-pairs and remnants are those odd integer-pairs.
Next to delete those odd integer-pairs of multiple of 2, 3, ∙∙∙, pm by the duplicate sieving, as Figure 8.
And by Theorem 6, we obtain function d(n) as
By Theorem 8 and Theorem 9 we can prove that when ,
By Theorem 7, it is following
Figure 7. n integer-pairs from 2n integers.
Figure 8. Deleting of odd integer-pairs.
Namely there is having one or more one of prime integer-pairs exist in n integer-pairs that sum of two primes equals 2n, witch when , , (by ).
For example, D(78,962) = 542, 78,962 = 43 + 78,919 = 61 + 78,901.
In addition, for 4 ≤ 2n ≤78,960, we can prove by a table (to omit). For example:
D(78,960) = 1630, 78,960 = 31 + 78,929 = 41 + 78,919;
D(78,958) = 572, 78,958 = 29 + 78,929 = 41 + 78,917.
Hence the Proposition 4.1 is true. □
5. Safety Analysis
Some people may ask: is the method of repeated screening reliable? Is it beyond the range of positive integers?
Now let’s do a mathematical analysis of this problem   .
Because the formulas few a factor of (1 − 1/2), so though every numerator is 2, it will not more than the actual value.
In fact, when , by Theorem 8,9. So the limit of is in security range. Obviously, it is not less than 0, and card (Dn)
greater than 1 if pm (namely 2n) is enough big. There is also has a space of prime integer-pairs. In other words, the data is safe and reliable. Such as, the safety feasibility of repeated screening method is proved by the mathematical analysis  . In addition, Here we see that the function d(n) increases as pm increases, and d(n) is a monotonic increasing function.
There is a large surplus for the proof of Goldbach’s conjecture, as shown in:
1) By computer calculation, the actual number of prime pairs is less than d(n) − 1. That is to say, the error compensation is not need to minus m. So, when m ≥ 5, pm ≥ 11, pm ≥ 2.75 > 2, the Proposition 4.1 can be proved.
2) Starting from harsh conditions, the error compensation is required to be 2m. when m ≥ 1098, pm ≥ 8819, (2n ≥ 77774762). For example: D(77774762) = 6808, 77774762 = 77774743 + 19 = 77774731 + 31.
So the goldbach’s conjecture is correct absolutely.
6. Computer Test Data
Through computer programming, we get Table 1 as follows.
1) Table 1 shows that ϕ'(n) is less than π(N).
This shown the ϕ'(n) is the lower limit of the number of prime numbers.
2) Table 1 shows that d(n) is less than D(N)and correct. The general trend of d(n) is upward ; with the increasing of 2n, the number of prime integer-pairs is increasing. In other words, even number N (=2n) goes to infinity, the Goldbach’s conjecture is still correct.
By computer programming, we obtain Figure 9. Those digits represents the number of prime integer-pairs in [150, 300], (the detection interval is 2); 2) the dotted line above represents the function d(n)，and below is d(n) − m. The solid line shows the pm/4.
Table 1. About the numbers of prime and the numbers of prime pairs.
Figure 9. Diagram of the number of prime integer-pairs.
Figure 9 is showing: 1) All digital with the number of prime integer-pairs above the line of d(n) − m, which more and more. 2) This is to explain that the function d(n) is the lower bound of the number of prime integer-pairs, pm/4 and d(n) − m are its the reliable lower limit. That means that, when x ≥ 100, the number of prime integer-pairs must be greater than 1. In other words, no matter how big x is, E(x) is always equal to 1.
Through the above proof, we proved that even x greater than 2 can find prime pairs that sum of two primes equal to even x, which proves that the exception set E(x) is always equal to 1. In this way, we proved the Goldbach’s conjecture by the method of exception set .
In addition, it is worth mentioning that this proving method is equally applicable to solving the same types of problems, such as Angle valley conjecture and a proof of the infinite of twin prime numbers (let every integer-pair be that the difference of two integers is 2). A world mathematical problem unsolved for more than 270 year was finally solved successfully. I have to say that this is a gratifying success case of mathematical theory and computer technology.