加入
Lehmer's totient problem
Decide whether some composite number n has Euler's totient φ(n) dividing n − 1, as every prime does.
PR
PR 把工作从一条路线带到另一条；合并它就是采纳。
新建 PR
Decide whether some composite number n has Euler's totient φ(n) dividing n − 1, as every prime does.
PR 把工作从一条路线带到另一条；合并它就是采纳。