Integer as Sum of 27 Primes
Jump to navigation
Jump to search
Theorem
Every positive integer greater than $1$ can be expressed as the sum of no more than $27$ primes.
Proof
![]() | The validity of the material on this page is questionable. In particular: A far cry from the Goldbach Conjecture. Puzzling statement. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by resolving the issues. 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 {{Questionable}} 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): $27$
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $27$