Ramaré's Theorem
Jump to navigation
Jump to search
Theorem
Every positive integer can be expressed as the sum of no more than $6$ prime numbers.
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. |
Source of Name
This entry was named for Olivier Ramaré.
Historical Note
Ramaré's Theorem was proved by Olivier Ramaré in $1995$.
As such it makes inroads into the resolution of the Goldbach Conjecture.
In $2014$ the result was strengthened by Terence Tao, who reduced the number of primes to $5$.
The term Ramaré's Theorem was invented in $\text {2024}$ by $\mathsf{Pr} \infty \mathsf{fWiki}$ in order to refer to the result compactly.
As such, it is not generally expected to be seen in this context outside $\mathsf{Pr} \infty \mathsf{fWiki}$.
Sources
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): Goldbach's conjecture