The hardest part of Goldbach's conjecture is that there is no good solution for mankind at present. At present, the best conclusion in the world is "1+2", that is to say, any big even number can be divided into the sum of a prime number and an almost prime number, and the so-called almost prime number is the product of two prime numbers. At that time, Chen Jingrun reached this conclusion by means of screening, which also means that the screening method has been "used to the best of its ability" and there can be no breakthrough. If we want to prove "1+1"-Goldbach conjecture, we must find a new method.

In fact, we often say Goldbach conjecture is "two prime conjectures" and "three prime conjectures"-an odd number large enough can be decomposed into the sum of three prime numbers, which has been studied by Russian mathematician имвиноград. If you want to know the difficulty of the triple prime theorem, it is ready-made, just look for a paper to read.

If you want to understand the difficulty of prime number conjecture, you can try to understand the difficulty of screening method first, because the difficulty of conjecture is definitely not less than that of screening method. Next, I'll put a picture of "Fundamentals of Analytic Number Theory" by Pan Chengdong and Pan Chengbiao. This page only introduces the combined filtering tools. I don't think it should be a problem for primary school students to experience terror.

In number theory, this phenomenon often occurs, which can be understood by primary school students, but it is a world-class problem, especially the problem of prime numbers, which is likely to be an unsolved mystery if you ask casually. Euler, the god of mathematics, said that prime numbers may be a secret garden that human mind can never understand. Indeed, there is no formula to quickly verify and predict prime numbers, so you can imagine how difficult it is to do exquisite research. Prime numbers are scattered, so it is impossible to string on an effective theoretical rope, otherwise it would be easy to say, but this abstruse rope line is buried in the deepest part of the mathematical world ...

Many people claim to have proved Goldbach's conjecture, but it is generally possible that Hua once proved that Goldbach's conjecture holds true for almost all even numbers. Doing research often crashes, and we must fully understand the achievements of our predecessors, so that we will not take detours and take the old road.

After reading a lot of questions about invitation, I know why Goldbach conjecture is mentioned. It was proved by high school students. I'm not afraid of jokes. I remember I also proved it in high school. The basic idea of proof is: given n, calculate how many pairs of different combinations of prime numbers exist in n (and their sum does not exceed n), and then compare them with even numbers in n, and record them as r, so as to find the limit. If the ratio is less than 1, it means that there is at least one even number within n, and no prime number pair can be allocated, then Goldbach conjecture is not established. The prime number theorem estimation is used here, and I can't remember the details of the estimation. There is nothing wrong with this idea, um ... it's just practical operation, and there are too many places that need accurate estimation, so we can only compromise constantly.

Is it possible for high school students to prove Goldbach conjecture? If you must ask me, I can only say. ...

I didn't see that high school student's "proof" about guessing brother, and it has been deleted. I am disappointed to see people's comments. I thought it was the sharp operation of a math contest god, and then I tripped over an inconspicuous detail. I didn't expect the comment area to be completely one-sided ...

I am a little worried that my child has been deeply hurt by netizens and can no longer be interested in mathematics. It is really a very sad thing.

I think most people's understanding of mathematicians is a bit wrong, just like one person proves a world conjecture. People's first reaction is that he is a genius, and he is really smart! Insiders often think that he is really brave, he is really hard-working, and of course he is smart (this is the last thing I think). I hope people can hold the latter view.

Mathematics proves to be an invisible skyscraper, and mathematicians need to ensure that every part of it is solid, because once it is built, it can stand the eternal test.

I can't tell you how difficult it is to prove Goldbach's conjecture. If you have to make a metaphor, it is like the proof in the middle school textbook is building blocks, while the proof made by real mathematicians is skyscrapers. Isn't it sad to build a building with building blocks?

I'm paranoid. Yes, I'm crazy, too. However, doesn't the dream of every tall building start from the moment when I was a child?