Chapter 242: Application for Goldbach Conjecture Project_3

And so on.

In the past, all progress on Goldbach's Conjecture was basically made through discussions around falling methods, such as Chen Jingrun's proof of '1+2'.

That's as far as it goes.

Just as Zhao Yi doesn't recommend Terence Tao to continue reducing the number 246, he believes that it is more difficult to do so than to prove the twin prime conjecture.

Goldbach's Conjecture is the same.

Reducing 1+2 to 1+1 is more difficult than proving the conjecture, otherwise, there would have been no progress in forty years.

So, to prove Goldbach's Conjecture, one must find a shortcut.

Zhao Yi considered two methods: one is the semi-computer-aided method, which involves thinking about prime number verification problems—why can even numbers that are directly excluded from prime number verification be decomposed into the sum of two prime numbers?

What mysterious relationship does the number two have with Goldbach's Conjecture?