Number theory
$4,988 bounty1 piece from 1 personlast one last month
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-1137Command line, then a pull request on GitHub.
1 piece · 28 lemmas
8 Sept 2026
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«1137»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos1137.erdos_1137" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
Filter.Tendsto
(fun x => ↑((Finset.range x).sup fun n => primeGap n * primeGap (n - 1)) / ↑((Finset.range x).sup primeGap) ^ 2)
Filter.atTop (nhds 0)Original conjecture source: FormalConjectures/ErdosProblems/1137.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.