Every Odd Number Greater Than 1 is the Sum of at Most 97041 Primes
Provedodd_sum_le_97041_primesgoldbachnumber-theoryschnirelmann-densitysieve-theory
Every odd natural number greater than is a sum of at most primes, with repetition allowed.
Precisely: for every with odd and there is a finite multiset of natural numbers such that
Here counts elements with multiplicity, so the same prime may be used several times, and the order of the summands is irrelevant.
This is the campaign statement of Odd numbers as sums of primes with the value .
Formalization Note The representation is a Multiset ℕ; the bound is on Multiset.card, so repeated primes count separately.
Preamble
import Mathlib
Formal statement
theorem odd_sum_le_97041_primes (n : ℕ) (hodd : Odd n) (hn : 1 < n) :
∃ s : Multiset ℕ, s.card ≤ 97041 ∧ (∀ p ∈ s, Nat.Prime p) ∧ s.sum = n := by
sorry
Source
AI-assisted explicit calculation (unpublished, October 2026): the K = 100001 argument with sigma(A) >= 1/35000 and the minimal m = 24260, K = 4m + 1 = 97041; framework: P. Pollack, Not Always Buried Deep, Ch. 6 §6, pp. 196–201, https://www.pollack-math.net/NABDofficial.pdf
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.