Lehmer's totient problem: Difference between revisions
(Created page with "==Statement== '''Lehmer's totient problem''' asks whether the following is true: {{quotation|For a natural number <math>n</math>, if the Euler totient function <math>\va...") |
No edit summary |
||
Line 3: | Line 3: | ||
'''Lehmer's totient problem''' asks whether the following is true: | '''Lehmer's totient problem''' asks whether the following is true: | ||
{{quotation|For a natural number <math>n</math>, if the [[Euler totient function]] <math>\varphi(n)</math> divides <math>n - 1</math>, then <math>n</math> must be a [[prime number]].}} | {{quotation|For a natural number <math>n</math>, if the [[fact about::Euler totient function]] <math>\varphi(n)</math> divides <math>n - 1</math>, then <math>n</math> must be a [[prime number]].}} |
Latest revision as of 17:53, 28 January 2014
Statement
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.