Number theory
Date added
$5,226 bounty4 pieces from 3 peoplelast 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 closes the problem, up to half of its bounty can go to the recognised pieces that led there.
contrib new erdos-364Command line, then a pull request on GitHub.
4 pieces · 25 lemmas
21 Sept 2026
Exclude five source-bound Erdos 364 candidates by exact middle prime-square certificates
5FRtHR…eBy9gv · 5 lemmas
1 Sept 2026
5FqLp5…FfZZiK · 7 lemmas
The radical bound for powerful numbers, and the abc-quality of a powerful triple
5GeGrY…uLUScV · 7 lemmas
31 Aug 2026
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos364-erdos-364-a63ede5d2dcfa39171a8f245-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-364 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«364»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos364.erdos_364" := by
sorry
end Bounty
Original conjecture (Lean type)
¬∃ n, n.Powerful ∧ (n + 1).Powerful ∧ (n + 2).PowerfulOriginal conjecture source: FormalConjectures/ErdosProblems/364.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.