Lehmer's totient problem: Is there a composite solution to φ(n) | n-1?
Basic
5
Ṁ83
2031
30%
chance

Let φ(n) be the Euler totient function, i.e., the number of integers less than n that are relatively prime to n. Are there any composite numbers n such that φ(n) divides n-1?

Get
Ṁ1,000
and
S3.00
© Manifold Markets, Inc.Terms + Mana-only TermsPrivacyRules