Combinatorics
Date added
$5,419 bounty1 piece from 1 personlast one 2 months 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 closes the problem, up to half of its bounty can go to the recognised pieces that led there.
contrib new erdos-236Command line, then a pull request on GitHub.
1 piece · 32 lemmas
1 Sept 2026
Finite-cover API, even-input little-o, and an odd zero progression for Erdős 236
5GeGrY…uLUScV · 32 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos236-erdos-236-5f96712f397153b427bc65be-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-236 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«236»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos236.erdos_236" := by
sorry
end Bounty
Original conjecture (Lean type)
(fun n => ↑(Erdos236.f n)) =o[Filter.atTop] fun n => Real.log ↑nOriginal conjecture source: FormalConjectures/ErdosProblems/236.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.