All open problems
Source labels openChecked July 26, 2026

WikipediaNumber theory

Selfridge's conjectures

PSW conjecture* (Selfridge's test) Let pp be an odd number, with p±2(mod5)p \equiv \pm 2 \pmod{5}, 2p11(modp)2^{p-1} \equiv 1 \pmod{p} and Fp+10(modp)F_{p+1} \equiv 0 \pmod{p}, then pp is a prime number.

Mathematical statement

PSW conjecture* (Selfridge's test) Let pp be an odd number, with p±2(mod5)p \equiv \pm 2 \pmod{5}, 2p11(modp)2^{p-1} \equiv 1 \pmod{p} and Fp+10(modp)F_{p+1} \equiv 0 \pmod{p}, then pp is a prime number.

Statement source: Wikipedia statement material

Statement terms: CC-BY-SA-4.0

Attributed source material. Reuse must follow the linked attribution and share-alike terms.

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

selfridge_conjecture

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem selfridge_conjecture (p : ) (hp : IsSelfridge p) : p.Prime := 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