Combinatorics
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-141-variants-elevenCommand line, then a pull request on GitHub.
1 piece · 199 lemmas
1 Sept 2026
CPAP-10 formalized: k consecutive primes in AP for every k = 3..10, with full Lucas certificates
5FqLp5…FfZZiK · 199 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-variants-eleven-4b2e2c9101acdeeabb03f21e-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-141-variants-eleven →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«141»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos141.erdos_141.variants.eleven" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∃ s, Erdos141.Set.IsAPAndPrimeProgressionOfLength s 11Original conjecture source: FormalConjectures/ErdosProblems/141.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.