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-1209-parts-iii-dCommand line, then a pull request on GitHub.
1 piece · 2 lemmas
1 Sept 2026
Erdos 1209 parts i and ii are false: diagonalization via Dirichlet primes
5FqLp5…FfZZiK · 2 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-iii-d-3211682e73ffe5c508406f5f-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-1209-parts-iii-d →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«1209»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos1209.erdos_1209.parts.iii.d" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∃ n, {k | Squarefree (n + 2 ^ 2 ^ k)}.InfiniteOriginal conjecture source: FormalConjectures/ErdosProblems/1209.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.