In order to prove Goldbach's conjecture, Chen Jingrun studied mathematics day and night and found this world-famous pearl of mathematics. Chen Jingrun trudged in the field of mathematics with amazing perseverance. Hard sweat has brought fruitful results. 1973, Chen Jingrun finally found a simple method to prove Goldbach's conjecture. After his achievement was published, it immediately caused a sensation in the world. Among them, "1+2" was named "Chen Theorem", also known as the "glorious vertex" of the screening method. Hua and other mathematicians of the older generation spoke highly of Chen Jingrun's paper. Mathematicians from all over the world have also published articles praising Chen Jingrun's research achievement as "the best achievement in studying Goldbach's conjecture in the world at present".
Goldbach's Conjecture
When Chen Jingrun was studying in Huaying Middle School in Fuzhou, she was lucky enough to listen to the math teacher Shen Yuan transferred from Tsinghua University. He told his classmates a world math problem: "About 200 years ago, a German mathematician named Goldbach proposed that' any even number greater than 2 can represent the sum of two prime numbers', abbreviated as (1+ 1). He never proved it in his life, so he wrote to Euler, a mathematician in St. Petersburg, Russia, and asked him to help prove the problem. After receiving the letter, Euler began to calculate. He tried to prove it to the death. Later, Goldbach passed away with a lifetime of regret, but left this mathematical problem behind. For more than 200 years, Goldbach's conjecture has attracted many mathematicians, making it a big unsolved mystery in mathematics. " The teacher also made an interesting metaphor here. Mathematics is the queen of natural science, and Goldbach conjecture is the jewel in the queen's crown! This fascinating story left a deep impression on Chen Jingrun, and Goldbach's conjecture attracted Chen Jingrun like a magnet. From then on, Chen Jingrun began the arduous course of winning the crown jewel of mathematics ... Goldbach conjecture Goldbach conjecture.
From 1729 to 1764, Goldbach kept correspondence with Euler for 35 years.
In the letter 1742 to Euler on June 7th, Goldbach put forward a proposition. He wrote:
"My question is this:
Take any odd number, such as 77, which can be written as the sum of three prime numbers:
77=53+ 17+7;
Take an odd number, such as 46 1,
46 1=449+7+5,
It is also the sum of these three prime numbers. 46 1 can also be written as 257+ 199+5, which is still the sum of three prime numbers. In this way, I found that any odd number greater than 7 is the sum of three prime numbers.
But how can this be proved? Although the above results are obtained in every experiment, it is impossible to test all odd numbers. What is needed is a general proof, not another test. "
Euler wrote back: "This proposition seems correct, but he can't give a strict proof. At the same time, Euler put forward another proposition: any even number greater than 2 is the sum of two prime numbers, but he failed to prove this proposition. "
It is not difficult to see that Goldbach's proposition is the inference of Euler's proposition. In fact, any odd number greater than 5 can be written in the following form:
2N+ 1=3+2(N- 1), where 2(N- 1)≥4.
If Euler's proposition holds, even number 2(N- 1) can be written as the sum of two prime numbers, and odd number 2N+ 1 can be written as the sum of three prime numbers, so Goldbach conjecture holds for odd numbers greater than 5.
But the establishment of Goldbach proposition does not guarantee the establishment of Euler proposition. So Euler's proposition is higher than Goldbach's proposition.
Now these two propositions are generally called Goldbach conjecture, which means that Chen Jingrun proved Goldbach conjecture.