Number theory
$4,983 bounty1 piece from 1 personlast one last month
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
A lemma, a definition, a special case. There is no race: when someone finishes the problem, the pool splits between everyone whose work led there.
contrib new erdos-885Command line, then a pull request on GitHub.
1 piece · 9 lemmas
1 Sept 2026
Checked cases k = 2, 3, 4 of Erdős 885
5FqLp5…FfZZiK · 9 lemmas
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«885»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos885.erdos_885" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∀ k ≥ 1, ∃ Ns, (∀ n ∈ Ns, 1 ≤ n) ∧ Ns.card = k ∧ (⋂ n ∈ Ns, Erdos885.factorDifferenceSet n).ncard ≥ kOriginal conjecture source: FormalConjectures/ErdosProblems/885.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.