Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

All-odd ternary Goldbach for n≥e3100n \ge e^{3100}n≥e3100

Open
WeakGoldbach.three_odd_primes_ge_exp3100

by jjosh · Sep 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

goldbachnumber-theoryprimes

For every odd natural number n≥e3100n \ge e^{3100}n≥e3100 there exist odd primes p,q,rp, q, rp,q,r with n=p+q+rn = p + q + rn=p+q+r.

This is the Liu–Wang effective-Vinogradov regime, strengthened to odd summands: their estimate shows the weighted representation count is positive (in fact ≫n2\gg n^2≫n2), while representations involving the prime 222 are of the shape {2,2,n−4}\{2,2,n-4\}{2,2,n−4} and contribute only O(log⁡2n)O(\log^2 n)O(log2n), so an all-odd representation must exist.

Preamble
import Mathlib
Formal statement
namespace WeakGoldbach

theorem three_odd_primes_ge_exp3100 (n : ℕ)
    (hn : Real.exp 3100 ≤ (n : ℝ)) (hodd : Odd n) :
    ∃ p q r : ℕ,
      Nat.Prime p ∧ Nat.Prime q ∧ Nat.Prime r ∧
      Odd p ∧ Odd q ∧ Odd r ∧ n = p + q + r := by
  sorry

end WeakGoldbach
Source
M.-C. Liu and T. Wang, On the Vinogradov bound in the three primes Goldbach conjecture, Acta Arith. 105 (2002), strengthened to odd summands by the weighted-count argument

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