Lehmer’s totient problem
Is there a composite number n for which Euler’s totient φ(n) divides n − 1?
Summary
D. H. Lehmer asked the question in 1932; for a prime n, φ(n) = n − 1, so the question is whether only primes have this property. Any composite solution must be an odd, square-free Carmichael number with many prime factors, at least 14 by a 1980 result of Cohen and Hagis.
Source
Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 18 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.