Combinatorics
$5,146 bounty1 piece from 1 personlast one 17 days ago
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-949Command line, then a pull request on GitHub.
1 piece · 6 lemmas
23 Sept 2026
General Zorn criterion for 949 + solved cases: #S<c, S bounded above/below, span_Q S ≠ ⊤
5H4Cpb…vjBPNo · 6 lemmas
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«949»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos949.erdos_949" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∀ (S : Set ℝ), (∀ a ∈ S, ∀ b ∈ S, a + b ∉ S) → ∃ A ⊆ Sᶜ, Cardinal.mk ↑A = Cardinal.continuum ∧ A + A ⊆ SᶜOriginal conjecture source: FormalConjectures/ErdosProblems/949.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.