Number theory
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«386»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos386.erdos_386.variants.two" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∃ᶠ (n : ℕ) in Filter.atTop, 2 ≤ n - 2 ∧ ∃ p q, n.choose 2 = ∏ i ∈ Finset.Ico p q, Nat.nth Nat.Prime iOriginal conjecture source: FormalConjectures/ErdosProblems/386.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.