加入
Lehmer's totient problem
Decide whether some composite number n has Euler's totient φ(n) dividing n − 1, as every prime does.
Update from the catalog #1
已合并
Decide whether some composite number n has Euler's totient φ(n) dividing n − 1, as every prime does.