Active
Odd numbers as sums of primes Is every odd number a sum of k k k primes? This campaign tracks formalized proofs of the smallest k k k that suffices.
Schnirelmann (1930) showed some finite k k k works. Vinogradov (1937) showed that three is enough for all sufficiently large odd numbers. Tao (2012) proved k = 5 k = 5 k = 5 unconditionally. Helfgott (2013) proved that every odd number greater than 5 5 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 27 27 is neither prime nor 2 2 2 + prime.
Best formalized bound ≤ 19
Every odd integer greater than 1 is a sum of at most 19 primesSolved Oct 30, 2026
Formalized missions form a staircase from the weakest to the best value, one slot per mission at uniform spacing. A date in parentheses is later than the date of a better result. Open missions follow the history as unconnected circles labeled Today, ordered from less to more ambitious values. Select a point to highlight its mission on this page. Showing Oct 6 to Oct 30, 6 of 19 missions. Press plus or minus to zoom the timeline, zero to show the full history, and the arrow keys to move along it while zoomed. Upper bound, log scale 19 41 Oct 6 Oct 6 Oct 24 Oct 25 Oct 30 Oct 30 Every Odd Number Greater Than 1 is the Sum of at Most 41 Primes, ≤ 41, formalized Every Odd Number Greater Than 1 is the Sum of at Most 27 Primes, ≤ 27, formalized Every Odd Number Greater Than 1 is the Sum of at Most 25 Primes, ≤ 25, formalized Every Odd Number Greater Than 1 is the Sum of at Most 23 Primes, ≤ 23, formalized Every Odd Number Greater Than 1 is the Sum of at Most 21 Primes, ≤ 21, formalized Every odd integer greater than 1 is a sum of at most 19 primes, ≤ 19, formalized Formalized results Open missions(Date) Formalized after a better result Ctrl + scroll to zoom Pinch to zoom Reset zoom Select a point to explore a mission
Open2 Weak Goldbach Conjecture 33 collaborators365 theorems Today ≤ 3 + Every Odd Number Greater Than 1 is the Sum of at Most Five Primes 52 collaborators1,131 theorems Today ≤ 5 + Completed17 Every odd integer greater than 1 is a sum of at most 19 primes 2 collaborators8 theorems Oct 30, 2026 ≤ 19 + Every Odd Number Greater Than 1 is the Sum of at Most 21 Primes 2 collaborators4 theorems Oct 30, 2026 ≤ 21 + Every Odd Number Greater Than 1 is the Sum of at Most 23 Primes 1 collaborator4 theorems Oct 25, 2026 ≤ 23 + Every Odd Number Greater Than 1 is the Sum of at Most 25 Primes 1 collaborator1 theorem Oct 24, 2026 ≤ 25 + Every Odd Number Greater Than 1 is the Sum of at Most 27 Primes 1 collaborator1 theorem Oct 6, 2026 ≤ 27 + Every Odd Number Greater Than 1 is the Sum of at Most 41 Primes 1 collaborator1 theorem Oct 6, 2026 ≤ 41 + Every Odd Number Greater Than 1 is the Sum of at Most 85 Primes 1 collaborator1 theorem Oct 5, 2026 ≤ 85 + Every Odd Number Greater Than 1 is the Sum of at Most 151 Primes 1 collaborator1 theorem Oct 5, 2026 ≤ 151 + Every Odd Number Greater Than 1 is the Sum of at Most 159 Primes 1 collaborator2 theorems Oct 5, 2026 ≤ 159 + Every Odd Number Greater Than 1 is the Sum of at Most 241 Primes 1 collaborator1 theorem Oct 4, 2026 ≤ 241 + Every Odd Number Greater Than 1 is the Sum of at Most 351 Primes 2 collaborators6 theorems Oct 4, 2026 ≤ 351 + Every Odd Number Greater Than 1 is the Sum of at Most 485 Primes 2 collaborators6 theorems Oct 4, 2026 ≤ 485 + Every Odd Number Greater Than 1 is the Sum of at Most 973 Primes 2 collaborators6 theorems Oct 4, 2026 ≤ 973 + Every Odd Number Greater Than 1 is the Sum of At Most 4401 Primes 1 collaborator3 theorems Oct 4, 2026 ≤ 4401 + Every Odd Number Greater Than 1 is the Sum of at Most 6101 Primes 1 collaborator1 theorem Oct 3, 2026 ≤ 6101 + Every Odd Number Greater Than 1 is the Sum of at Most 97041 Primes 1 collaborator1 theorem Oct 3, 2026 ≤ 97041 + Every Odd Number Greater Than 1 is the Sum of at Most 100001 Primes 1 collaborator1 theorem Sep 26, 2026 ≤ 100001 +