Number theory
Date added
$5,226 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-376Command line, then a pull request on GitHub.
1 piece · 11 lemmas
1 Sept 2026
Carry and digit reductions for central binomial coefficients coprime to 105
5EyGbW…7GEFVR · 11 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos376-erdos-376-09ec115f8b8322ba543b8903-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-376 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«376»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos376.erdos_376" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ {n | n.centralBinom.Coprime 105}.InfiniteOriginal conjecture source: FormalConjectures/ErdosProblems/376.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.