All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsNumber theory

Erdős Problem 313: Primary Pseudoperfect Are Infinite

It is conjectured that the set of primary pseudoperfect numbers is infinite.

Mathematical statement

It is conjectured that the set of primary pseudoperfect numbers is infinite.

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_313.variants.primary_pseudoperfect_are_infinite

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_313.variants.primary_pseudoperfect_are_infinite :    Set.Infinite {n | IsPrimaryPseudoperfect n} := by  sorry
Statement source
Formal Conjectures
Lean version
v4.27.0
Placeholder
Present; no proof artifact
Source evidence
Pinned source index
Fidelity review
Community formulation

References