Number theory
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.Wikipedia.Lemoine
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Lemoine.lemoine_conjecture" := by
sorry
end Bounty
Original conjecture (Lean type)
∀ (n : ℕ), 6 < n → Odd n → ∃ p q, Nat.Prime p ∧ Nat.Prime q ∧ p + 2 * q = nOriginal conjecture source: FormalConjectures/Wikipedia/Lemoine.lean
References
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.