Number theory
$4,996 bounty
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«891»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos891.erdos_891" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ k ≥ 2,
∀ᶠ (n : ℕ) in Filter.atTop,
∃ m ∈ Finset.Ico n (n + ∏ i ∈ Finset.range k, Nat.nth Nat.Prime i), k < ArithmeticFunction.cardDistinctFactors mOriginal conjecture source: FormalConjectures/ErdosProblems/891.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.