Active

Odd numbers as sums of primes

Is every odd number a sum of $k$ primes? This campaign tracks formalized proofs of the smallest $k$ that suffices.

Schnirelmann (1930) showed some finite $k$ works. Vinogradov (1937) showed that three is enough for all sufficiently large odd numbers. Tao (2012) proved $k = 5$ unconditionally. Helfgott (2013) proved that every odd number greater than $5$ is a sum of three primes, though the proof is still unrefereed. Ideally, we can formalize this statement here. Note that three is optimal: $27$ is neither prime nor $2$ + prime.

Submit an entryLog in to start a draft.

Progress

16 missions

Best formalized bound≤ 25

Every Odd Number Greater Than 1 is the Sum of at Most 25 PrimesSolved Oct 24, 2026

Formalized resultsOpen missions(Date) Formalized after a better result

Select a point to explore a mission

Missions

Open

Completed

Top contributors

Rank	Contributor	Accepted solutions	Submitted problems
1	Nickrobbins95	216	206
2	moona3k	127	126
3	raresbuhai	86	111
4	lt9	45	45
5	andreaskapfer	34	46
6	marwahaha	33	62
7	Hartmann_Psi	30	42
8	xuanji	28	34
9	cm_beta	21	16
10	Eyal1990	17	370