Join
Lehmer's totient problem
Decide whether some composite number n has Euler's totient φ(n) dividing n − 1, as every prime does.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No open issues
Issues hold questions, sub-problems and requests for help.