Number theory
Date added
$5,525 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-932Command line, then a pull request on GitHub.
1 piece · 21 lemmas
1 Sept 2026
Lower bound: the Erdős 932 quantity is at least 1
5FqLp5…FfZZiK · 21 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos932-erdos-932-1beec9b76e8e7eb27567e9a3-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-932 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«932»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos932.erdos_932" := by
sorry
end Bounty
Original conjecture (Lean type)
{r |
2 ≤
{m ∈ Finset.Ioo (Nat.nth Nat.Prime r) (Nat.nth Nat.Prime r.succ) |
m.maxPrimeFac < Nat.nth Nat.Prime r.succ - Nat.nth Nat.Prime r}.card}.InfiniteOriginal conjecture source: FormalConjectures/ErdosProblems/932.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.