Number theory
Date added
$4,855 bounty1 piece from 1 personlast one 16 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 closes the problem, up to half of its bounty can go to the recognised pieces that led there.
contrib new erdos-933Command line, then a pull request on GitHub.
1 piece · 5 lemmas
8 Oct 2026
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos933-erdos-933-1cf0da79b05a9966527c778d-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-933 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«933»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos933.erdos_933" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ Filter.limsup (fun n => ↑↑(2 ^ Erdos933.k n * 3 ^ Erdos933.l n) / (↑↑n * ↑(Real.log ↑n))) Filter.atTop = ⊤Original conjecture source: FormalConjectures/ErdosProblems/933.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.