Number theory
$5,124 bountynobody has started
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Even one lemma helps. Whoever finishes this later shares the pool with everyone who got them there.
contrib new wikipedia-goldbachconjecture-goldbachCommand line, then a pull request on GitHub.
Nothing has been published against this problem yet.
A first lemma is worth as much as a last one: whoever closes the problem shares the pool with everyone who got them there.
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
pool/tier-1/wikipedia-goldbachconjecture-goldbach-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/wikipedia-goldbachconjecture-goldbach →
Formal statement
Proof target
import FormalConjectures.Wikipedia.GoldbachConjecture
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "GoldbachConjecture.goldbach" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∀ (n : ℕ), 2 < n → Even n → ∃ p q, Prime p ∧ Prime q ∧ n = p + qOriginal conjecture source: FormalConjectures/Wikipedia/GoldbachConjecture.lean
Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.