Back to Problems

ternaryGoldbach

Specification

Can every odd integer greater than 5 be written as the sum of three primes? (A prime may be used more than once.) NB. While Harald Helfgott's solution is not published in a peer-reviewed journal yet, his results seem generally accepted.

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
theorem ternaryGoldbach (n : ℕ) (hn : 5 < n) (hn_odd : Odd n) :
    ∃ p q r, Nat.Prime p ∧ Nat.Prime q ∧ Nat.Prime r ∧ n = p + q + r
ID: Wikipedia__GoldbachConjecture__ternaryGoldbach
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.