Integer as Sum of 27 Primes
Jump to navigation
Jump to search
The validity of the material on this page is questionable.
A far cry from the Goldbach Conjecture. Puzzling statement.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by resolving the issues.
Theorem
Every positive integer greater than $1$ can be expressed as the sum of no more than $27$ primes.
Proof
A far cry from the Goldbach Conjecture. Puzzling statement.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by resolving the issues.
To discuss this proof in more detail, feel free to use the talk page.
If you are able to fix this page, then when you have done so you can remove this instance of {{Questionable}} from the code.
If you would welcome a second opinion as to whether your correction is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Sources
- 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $27$
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $27$
