Is it? 1+2=3? , or? 1+ 1=2? They are all mathematical axioms, and they will always hold. Are based on piano's axioms, proving that such identities are meaningless. What mathematicians really want to prove is Goldbach conjecture, which has always been an unsolved mystery in the field of mathematics. Hilbert once listed it as one of the 23 major mathematical problems.
Many people may misunderstand Chen Jingrun? 1+2=3? Proof, but in fact he didn't prove it? 1+2=3? . In addition, this formula does not need to be proved, because it is an identity and a mathematical axiom. In fact, mathematician Chen Jingrun proved? 1+2? . So what? 1+2? What does this mean?
As for it? 1+2? We need to talk about a mathematical problem, Goldbach conjecture. /kloc-in the 8th century, the mathematician Goldbach raised a question about integer division. He wrote to Euler for verification.
1+2? China mathematician Chen Jingrun has proved this. How to prove it? 1+ 1? ?
Euler rewrote Goldbach's conjecture into the form we know now.
Any even number greater than 2 can be split into the sum of two prime numbers (there are many ways to split), which is called? 1+ 1? .
For small even numbers, it is easy to list formulas that conform to Goldbach conjecture.
14=3+ 1 1=7+7
100=3+97= 1 1+89= 17+83=29+7 1=4 1+59=47+53
1+2? China mathematician Chen Jingrun has proved this. How to prove it? 1+ 1? ?
The number of ways to split an even number (from 4 million to 1 million) into the sum of two prime numbers.
However, it is difficult to prove that all even numbers conform to this law. Although Euler thinks this conjecture is correct, even a great mathematician like him can't solve the Goldbach conjecture. Today, nearly 300 years after Goldbach's conjecture was put forward, it is still an unsolved mystery.
Because it is impossible to prove Goldbach's conjecture in one step, mathematicians take a roundabout way, hoping to approach Goldbach's conjecture gradually. Before that, mathematicians gradually proved? 9+9? 、? 5+5? 、? 3+3? 、? 1+4? (Proved by China mathematician Wang Yuan) What else? 1+3? . At present, the closest proof to Goldbach's conjecture was completed by China mathematician Chen Jingrun in 1960s.
1+2? China mathematician Chen Jingrun has proved this. How to prove it? 1+ 1? ?
Chen Jingrun draft paper.
Chen Jingrun proved that any large enough even number can be decomposed into the sum of a prime number and a natural number, and this natural number is almost a prime number, which is equal to the product of two prime numbers. The result can be expressed as: big even number = prime number+prime number? Prime number, so-called? 1+2? Also known as Chen Theorem.
So, is it natural to prove Goldbach's conjecture?
Most mathematicians think that Chen Jingrun's screening method has reached its limit, and on this basis, it is proved that Goldbach's conjecture is almost impossible. To prove it? 1+ 1? The existing methods may need to be greatly improved, or a new mathematical method is needed.