Number theory
Date added
$5,268 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-313-variants-primary-pseudoperfect-are-infiniteCommand line, then a pull request on GitHub.
1 piece · 18 lemmas
3 Sept 2026
Canonical-witness equivalence and prime-successor closure for Erdős 313
5FqLp5…FfZZiK · 18 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-variants-primary-pseudoperfect-are-infinite-07e86b1edbea800a4798ebed-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-313-variants-primary-pseudoperfect-are-infinite →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«313»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos313.erdos_313.variants.primary_pseudoperfect_are_infinite" := by
sorry
end Bounty
Original conjecture (Lean type)
{n | Erdos313.IsPrimaryPseudoperfect n}.InfiniteOriginal conjecture source: FormalConjectures/ErdosProblems/313.lean
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.