Timeline for Proof of the weak Goldbach Conjecture
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 24, 2013 at 10:22 | comment | added | H A Helfgott | I would say Terry Tao's post is a good explanation of why proofs based on the circle method (such as mine) will not, in and of themselves, work out for the binary Goldbach problem. My comments give some idea of my strategy for the ternary problem (as of May 2012), but I think I've explained things better elsewhere. | |
| Jun 26, 2013 at 15:36 | comment | added | Turbo | Does this also show every odd number $n > 5$ is of form $n=2p+q$ where $p$ and $q$ are some primes? | |
| May 15, 2013 at 15:45 | comment | added | Timothy Chow | Note that the blog post was written a year ago. It is still relevant, though (particularly the comments by Helfgott). | |
| May 14, 2013 at 16:46 | vote | accept | Rodrigo A. Pérez | ||
| May 14, 2013 at 11:26 | history | answered | Ben Green | CC BY-SA 3.0 |