You're reading: Posts Tagged: Terence Tao

Every odd integer larger than 1 is the sum of at most five primes

Terence Tao has uploaded to the arXiv a paper “Every odd number greater than 1 is the sum of at most five primes“, submitted to Mathematics of Computation. He says this result 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.

Google+