# Riemann Hypothesis implies Odd Number is Sum of at most 5 Primes

Jump to navigation
Jump to search

## Theorem

Let the truth of the Riemann Hypothesis be assumed.

Let $n$ be an odd integer.

Then $n$ is the sum of at most $5$ primes.

## Proof

This theorem requires a proof.You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{ProofWanted}}` from the code.If you would welcome a second opinion as to whether your work is correct, add a call to `{{Proofread}}` the page. |

## Historical Note

When this result was cited by David Wells in the $1997$ edition of *Curious and Interesting Numbers, 2nd ed.*, this was the limit of knowledge.

However, Terence Tao has since come up with a proof of this result which does not require the Riemann Hypothesis.

## Sources

- 1995: Leszek Kaniecki:
*On Šnirelman's constant under the Riemann hypothesis*(*Acta Arith.***Vol. 72**,*no. 4*: pp. 361 – 374)

- 1997: David Wells:
*Curious and Interesting Numbers*(2nd ed.) ... (previous) ... (next): $5$