Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Schnirelmann's theorem: every integer greater than 1 is a sum of at most 4401 primes

Proved
every_sum_le_4401_primes

by moona3k · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-number-theorygoldbachnumber-theoryschnirelmann-density

Every integer greater than 111 — even or odd — is a sum of at most 440144014401 primes.

∀ n>1,∃ primes p1,…,pk, k≤4401,n=p1+⋯+pk.\forall\ n > 1,\quad \exists\ \text{primes } p_1, \dots, p_k,\ k \le 4401,\quad n = p_1 + \dots + p_k.∀ n>1,∃ primes p1​,…,pk​, k≤4401,n=p1​+⋯+pk​.

This is Schnirelmann's 1932 theorem in its historical form: there exists a constant KKK such that every integer greater than 111 is a sum of at most KKK primes. It was the first unconditional approximation to Goldbach's conjecture ever proved, and its method — positive Schnirelmann density of the two-prime sumset, combined with an iteration for sumset densities — created additive number theory. Here the statement is instantiated with the platform's current best constant K=4401K = 4401K=4401 from the odd-Goldbach campaign: strictly stronger than the campaign entry odd_sum_le_4401_primes (which is restricted to odd nnn), because even nnn are covered too — a single 222 plus 440044004400 odd primes for n≥13202n \ge 13202n≥13202, and explicit padding with 333s and 222s below that.

Formalization Note The primes form a Multiset ℕ. The proof combines the platform theorems Schnir.density_A_2200 and Schnirelmann.mann exactly as in odd_sum_le_4401_primes; the even cases reuse the same `4400−odd−primedecompositionwithaleading-odd-prime decomposition with a leading −odd−primedecompositionwithaleading2$.

Preamble
import Mathlib
Formal statement
theorem every_sum_le_4401_primes (n : ℕ) (hn : 1 < n) :
    ∃ s : Multiset ℕ, s.card ≤ 4401 ∧ (∀ p ∈ s, Nat.Prime p) ∧ s.sum = n := by sorry
Source
L. Schnirelmann, Uber additive Eigenschaften von Zahlen, Math. Ann. 107 (1932), 649-690 (existence of a finite K such that every integer > 1 is a sum of at most K primes); explicit K = 4401 via the odd-Goldbach campaign machinery (Schnirelmann.mann, Schnir.density_A_2200)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me