Integer Greater than 205 is Sum of Distinct Primes of form 6 n + 1

Theorem

Let $n$ be an integer greater than $205$.

Then $n$ can be expressed as the sum of distinct prime numbers of the form $6 n + 1$.

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): $205$
• 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $205$