20221016, 13:35  #1 
Oct 2022
13 Posts 
6line proof of the binary Goldbach conjecture for even integers congruent to 2 mod 4.
There is a somehow forgotten but elegant identify of Buchstab on the number of Goldbach partitions. By exploiting that identity, we demonstrate within 6 lines that every even integer congruent to 2 mod 4 can be expressed as a sum of two odd primes.
This proves the binary Goldbach conjecture for the specified integers. Kindly see: https://figshare.com/articles/prepri...cture/21342042 Presumably, the reason why the identity has been forgotten, is that it's quite difficult to treat analytically, hence numbee theorists shifted focus to other approaches, most notably the circle method. Your constructive comments are most welcome. Regards, Tatenda. Last fiddled with by masser on 20221016 at 14:32 Reason: Moved Post to Math forum, where it seems more appropriate. 
20221016, 15:03  #2 
"Robert Gerbicz"
Oct 2005
Hungary
1611_{10} Posts 
Have you lost your arxiv account ? And I would strongly suggest to return to the Millenium prize problems (https://en.wikipedia.org/wiki/Millennium_Prize_Problems), and leave the easy problems for us.

20221016, 21:12  #3 
Oct 2022
13 Posts 
I will indeed post on arXiv. Only that Figshare is much quicker.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Idiotic Proof of the Twin primes Conjecture and Goldbach's conjecture  Hugo1177  Miscellaneous Math  1  20210113 22:15 
"PROOF" OF GOLDBACH'S CONJECTURE  Awojobi  Miscellaneous Math  221  20191002 08:33 
I Think I Have A Proof of the strong Goldbach conjecture  MathDoggy  Miscellaneous Math  9  20190413 16:13 
Proof of Goldbach Conjecture  vector  Miscellaneous Math  5  20071201 14:43 