The parity problem obstruction for the binary Goldbach problem with bounded error

What's new

Two of the most famous open problems in additive prime number theory are the twin prime conjecture and the binary Goldbach conjecture. They have quite similar forms:

  • Twin prime conjecture The equation $latex {p_1 – p_2 = 2}&fg=000000$ has infinitely many solutions with $latex {p_1,p_2}&fg=000000$ prime.
  • Binary Goldbach conjecture The equation $latex {p_1 + p_2 = N}&fg=000000$ has at least one solution with $latex {p_1,p_2}&fg=000000$ prime for any given even $latex {N geq 4}&fg=000000$.

In view of this similarity, it is not surprising that the partial progress on these two conjectures have tracked each other fairly closely; the twin prime conjecture is generally considered slightly easier than the binary Goldbach conjecture, but broadly speaking any progress made on one of the conjectures has also led to a comparable amount of progress on the other. (For instance, Chen’s theorem has a version for the twin prime conjecture, and a version…

View original post 1,123 more words

Advertisements

传说中的心灵鸡汤

控制脾气是种本领

 

鸡汤:控制脾气是一种本领。

反驳:食人蚁生活在南非的热带雨林,而骆驼根本不属于热带雨林,而是生活在热带沙漠。

读书多了内心才不会决堤

 

鸡汤:读书多了,内心才不会决堤。

反驳:你堤坝都装反了,读再多的书也会决堤。

Warning :Picture Scanned for Features Las Vegas

 

竹子的故事:

large_Ur0K_2de900006f991260

当禅师遇到理科生:

70185be4jw1eiqa61rbusj20c872fnem