Vinogradov's Theorem/Corollary 2
Jump to navigation
Jump to search
Corollary to Vinogradov's Theorem
Every sufficiently large odd integer is the sum of three 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. |
Sources
- 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $3$
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $3$
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): Goldbach's conjecture
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): Goldbach's conjecture