Lehmer's totient problem

Decide whether some composite number n has Euler's totient φ(n) dividing n − 1, as every prime does.