Lehmer's totient problem: Is there a composite solution to φ(n) | n-1? | Manifold

Lehmer's totient problem: Is there a composite solution to φ(n) | n-1?

Basic

5

Ṁ86

2031

30%

chance

1D

1W

1M

ALL

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?

This question is managed and resolved by Manifold.

Get

1,000

and

3.00

Related questions

Is Carmichael's totient conjecture true?

Are there infinitely many primes of the form n^2 + 1?

Are there infinitely many composite Fermat numbers?

Related questions

Is Carmichael's totient conjecture true?

Are there infinitely many composite Fermat numbers?

Are there infinitely many primes of the form n^2 + 1?

© Manifold Markets, Inc.•Terms + Mana-only Terms•Privacy•Rules