Number theory
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
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.