2 is the first prime number and the only even prime number. We use screening method to remove all even numbers, and use series to represent the remaining numbers, that is, the remaining series that may be prime numbers, as follows:
2n+ 1 (n = 1, 2,3 ...) (gap) (all prime numbers can be expressed in this way).
2n (n = 2, 3 ...) (sieve) (all non-prime numbers screened from prime numbers can be represented by this)
I call this a gap, and the first gap after 2 must be a prime number, so the next prime number 3 can take the minimum value of n as 1. ☆ The following are the basic steps to understand. We subtract the next prime sequence sieve 3N from the sequence 2N+ 1. (In order to save space, the value range of n is not marked. )
☆ I will first express the gap 2N+ 1 as 2n× 3+(1+2× (3-1)) = 6n+5.
2N×3+( 1+2×(3-2))= 6N+3 = 3×(2N+ 1)
2n×3+( 1+2×(3-3))= 6N+ 1
Screen 3N is expressed as 3×(2N+ 1) and 3×2N, where 3×2N Di belongs to screen 2N, so a new gap expression after removing screen 3N is obtained:
6n+5,6n+1(all prime numbers can be represented by one of them).
On this basis, we calculate the formula that the next prime number is 5 (n = 0), where 1 is a special number and always appears later. Ok, I will subtract sieve 5(N=0) and get the following gap: (step omitted)
30N+29, 30N+23, 30N+ 17, 30n+1,30N+5 (Di belongs to paternal gene 5).
30N+25, 30N+ 19, 30N+ 13, 30N+7, 30N+ 1 (Di belongs to the paternal gene 1).
The same processing method removes 30N+25 and 30N+5 to obtain the following gaps:
☆ 30N+29,30N+23,30N+ 17,30N+ 16,30N+ 19,30N+ 13,30N+7,30N+ 1
☆ Breakthrough: Pay attention to the laws of all prime numbers appearing below. I call the following table the equivalent prime table of Di Gen7:
Repeat the above steps again to get the gap: (let P = 2 10N)
Line width gene 29, gene 23, gene kloc-0/9, gene kloc-0/7, gene kloc-0/3, gene kloc-0/gene 7, gene kloc-0/.
30 P+209 P+203 P+ 199 P+ 197 P+ 193 P+ 19 1p+ 187 P+ 18 1
P+ 179 P+ 173 P+ 169 P+ 167 P+ 163 P+ 16 1p+ 157 P+ 15 1
P+ 149 P+ 143 P+ 139 P+ 137 P+ 133 P+ 13 1p+ 127 P+ 12 1
P+ 1 19 P+ 1 13 P+ 109 P+ 107 P+ 103 P+ 10 1 P+97 P+9 1
P+89p+83p+79p+77p+73p+7 1p+67p+6 1
P+59p+53p+49p+47p+43p+4 1p+37p+3 1
P+29p+23p+ 19p+ 17p+ 13p+ 1 1p+7p+ 1
Column width 2 6 4 2 4 2 4 6 2
Remove the 7N sieve (the bold part in the table just removes one gene, accounting for 1/7) and the product of n prime numbers greater than 7 (not greater than 2 10) (I call it a vacancy), and the rest are prime numbers. (n = 0) (need to know)
Finally, it is time to prove 1+ 1! ! !
Now, let's study the regularity of this prime number table. Take an even number at will, such as 198, and then arbitrarily remove the two numbers in the table. Now I take 107 and 103,107+103 = 210,265438. Now move 107 and 103 three places to the right to get 107+9 1 =198, but readers will think that 91is not a prime number, yes, we will now1. If 9 1 moves down one place, it is equal to 6 1, 137+6 1 or 198, and they are all prime numbers, because the line widths are the same. You can also move 107 down two places and 103 up two places to get 47+151=198, which is also a prime number. Furthermore, shift 47 to the right by two places and 15 1 to the left by one place to get another 41+157 =198. The factors 6, 4 and 2 can constitute any even number from 2 to 30. Some people may ask that 6, 4 and 2 make up 28. I don't know how much to move. The table won't hold. Actually, it's +30 and then MINUS 2. If an even number is too big, put it in the next prime number table.
Now let's look at the prime numbers in the bottom line, that is, gene parts 29, 23, 19, 17, 13,1,7, 5, 3, 2 (where 5, 3, 2 are extension tails. 22, 24, 26, 28, 30, 32, 34, 36, they are continuous, and the line width is 30, that is to say, you can add 30×N to this series at will, that is to say, this table can represent all prime numbers in the range of (8 ~ 36)+30× n, and n can be at least 7 (in fact, it is much larger. That is to say, this number table can represent any prime number of 8 ~ (36+30× 7), that is, 8 ~ 246 >: 2 10. As for the exposed parts of 5, 3 and 2, another number can be used to move to the left until it is increased by 30 (the problem of 1+ 1 in the super critical understanding part has been solved at present).
Ok, let's continue to prove that we take all the prime numbers in this prime number table as paternal genes (excluding the next prime number sieve 1 1N and the prime numbers obtained by removing the product of n prime numbers greater than 1 1), and get the Di genus.
Now let's analyze the properties of the equivalent prime table of 1 1:
Line width: 2 10
Column width:
Gene1991971931918179173167 65433.
Column width 2 2 4 2 10 2 6 6 4
Gene15715149139137127/kloc-0.
Column width 6 6 2 10 2 6 4 14 4
The column widths of other genes are not listed. We can know that the column widths are 14, 10, 6, 4, 2, which are enough to form any even number of 2 ~ 2 10. 6, 4, 2 are the column widths inherited from the previous prime table, and will always appear in the future, 65438.
☆ Now it's time to understand!
Because the gene part of this table (the bottom row) is all the prime numbers of the previous table, that is to say, the bottom column can represent 8 ~ 246, and the row width is 2 10. Similarly, this prime number table can represent (8 ~ 246)+2 10× n (n can be at least 1 1. 23 10。 The gene part of the next table is generated from this table, and the row width of the next table is 23 10, which can be deduced indefinitely.
As for the product number of n prime numbers greater than 1 1, 23 100.5 = 48, 1 1 >: 89, it is far more than half, so it does not affect the conclusion. The original text has proved that if you want to list more prime numbers, the speed of vacancy generation can't keep up with the expansion of prime numbers, then the proportion of vacancies in prime numbers is extremely low! In addition, the screened 169 non-prime number will produce 169+2 10 = 379 as prime number in the next table, but it has no influence on the derivation! I will discuss it in detail in the full text.
Conclusion: It can be inferred from the above that any even number greater than 6 can be expressed as the sum of two prime numbers.