Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Every Odd Number Greater Than 1 is the Sum of at Most 97041 Primes

Proved
odd_sum_le_97041_primes

by xuanji · Oct 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

goldbachnumber-theoryschnirelmann-densitysieve-theory

Every odd natural number greater than 111 is a sum of at most 97 04197\,04197041 primes, with repetition allowed.

Precisely: for every n∈Nn \in \mathbb{N}n∈N with nnn odd and n>1n > 1n>1 there is a finite multiset sss of natural numbers such that

∣s∣≤97 041,every p∈s is prime,∑p∈sp=n.|s| \le 97\,041, \qquad \text{every } p \in s \text{ is prime}, \qquad \sum_{p \in s} p = n.∣s∣≤97041,every p∈s is prime,p∈s∑​p=n.

Here ∣s∣|s|∣s∣ 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 97 04197\,04197041.

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
  • Endorsed by Shuze Chen · Oct 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by xuanji · Oct 3, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me