All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsNumber theory

Erdős Problem 828: Lehmer Conjecture

When n>1n > 1, Lehmer conjectured that ϕ(n)n1\phi(n) | n - 1 if and only if nn is prime.

Mathematical statement

When n>1n > 1, Lehmer conjectured that ϕ(n)n1\phi(n) | n - 1 if and only if nn is prime.

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_828.variants.lehmer_conjecture

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_828.variants.lehmer_conjecture : answer(sorry)   n > 1, φ n ∣ n - 1  Prime 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