Schnirelmann's theorem: every integer greater than 1 is a sum of at most 4401 primes
Provedevery_sum_le_4401_primesEvery integer greater than — even or odd — is a sum of at most primes.
This is Schnirelmann's 1932 theorem in its historical form: there exists a constant such that every integer greater than is a sum of at most 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 from the odd-Goldbach campaign: strictly stronger than the campaign entry odd_sum_le_4401_primes (which is restricted to odd ), because even are covered too — a single plus odd primes for , and explicit padding with s and s 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 `44002$.
import Mathlib
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