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)
Jump to: navigation, search


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

For a natural number , if the Euler totient function divides , then must be a prime number.