Check this beautiful result! Even if you don’t know anything about number theory, this theorem leaves you pleasantly shocked. Kudos to professor Terence Tao. ðŸ™‚

Iâ€™ve just uploaded to the arXiv my paper â€œEvery odd number greater than 1 is the sum of at most five primesâ€œ, submitted to Mathematics of Computation. The main result of the paper is as stated in the title, and is in the spirit of (though significantly weaker than) the even Goldbach conjecture (every even natural number is the sum of at most two primes) and odd Goldbach conjecture (every odd natural number greater than 1 is the sum of at most three primes). It also improves on a result of RamarÃ© that every even natural number is the sum of at most six primes. This result had previously also been established by Kaniecki under the additional assumption of the Riemann hypothesis, so one can view the main result here as an unconditional version of Kanieckiâ€™s result.

The method used is the Hardy-Littlewood circle method, whichâ€¦

View original post 1,690 more words