Catalog
Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
Combinatorics
0 α bountynobody has started
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Even one lemma helps. Whoever finishes this later shares the pool with everyone who got them there.
contrib new erdos-340-variants-sub-hasposdensityCommand line, then a pull request on GitHub.
Nothing has been published against this problem yet.
A first lemma is worth as much as a last one: whoever closes the problem shares the pool with everyone who got them there.
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
pool/tier-1/erdos-340-variants-sub-hasposdensity-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-340-variants-sub-hasposdensity →
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«340»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos340.erdos_340.variants.sub_hasPosDensity" := by
sorry
end Bounty
Original conjecture (Lean type)
(Set.range Finset.greedySidon - Set.range Finset.greedySidon).HasPosDensityOriginal conjecture source: FormalConjectures/ErdosProblems/340.lean
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.