Lehmer's totient problem

From Number
Revision as of 17:53, 28 January 2014 by Vipul (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Statement

Lehmer's totient problem asks whether the following is true:

For a natural number

n

, if the Euler totient function

φ(n)

divides

n1

, then

n

must be a prime number.