Current location - Training Enrollment Network - Mathematics courses - Who is the famous mathematician who solved the mathematical problem Goldbach conjecture?
Who is the famous mathematician who solved the mathematical problem Goldbach conjecture?
Who is the famous mathematician who solved the mathematical problem Goldbach conjecture? Chen Jingrun.

Chen Jingrun is a famous mathematician in China, recognized as a genius, and also a "freak" and an "idiot". He is known as "Goldbach's first conjecture". That year, in a 6-square-meter hut, he used six sacks of draft paper to conquer "1+2" in the world mathematical puzzle "Goldbach conjecture", which shocked the whole world, only one step away from taking off the crown jewel of number theory.

Chen Jingrun has made many great achievements in the research field of analytic number theory, and won the first prize of National Natural Science Award, China Mathematics Award, Heli Fund Award and many other awards. 198/kloc-0 was elected as an academician of China academy of sciences in March, and1996 died in Beijing hospital in the afternoon of March at the age of 63.

Introduction of scientific research achievements in Chen Jingrun;

Chen Jingrun proved in Goldbach's conjecture that every big even number can be expressed as the sum of the products of a prime number and no more than two prime numbers; Let D(N) be the number of tables in which n is the sum of two prime numbers, and prove that there exists d (n) < 7.8342c (n)/(lnn) 2 for a sufficiently large even number n; Chen Jingrun's detailed proof (1+2) published in 1973 is called "Chen's Theorem" by the international mathematics community, and many of his research results on Goldbach's conjecture are the best in the world.

Chen Jingrun proposed and implemented a new weighting algorithm. There is a sum ω in his weighting algorithm, and the usual Bombieri-vinogradov mean value theorem can't give a proper estimate of the remainder in ω. In the estimation of sum ω, Chen Jingrun transformed the problem of estimating the number of elements in one set into the problem of calculating the number of elements in another set. This idea strengthens the power of screening methods and is called the transformation principle by the international mathematics community.