Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
gptkb:Euler's_totient_function
|
| gptkbp:field |
number theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Lehmer's totient problem
|
| gptkbp:implies |
If such a composite n exists, it must be odd, square-free, and have at least 7 distinct prime factors
|
| gptkbp:namedAfter |
gptkb:Derrick_Henry_Lehmer
|
| gptkbp:noKnownSolution |
true
|
| gptkbp:proposedBy |
1932
|
| gptkbp:relatedTo |
gptkb:Euler's_totient_function
prime numbers Carmichael numbers |
| gptkbp:status |
unsolved
|
| gptkbp:type |
Are there composite numbers n such that φ(n) divides n-1?
|
| gptkbp:bfsParent |
gptkb:D._H._Lehmer
gptkb:Derrick_Henry_Lehmer gptkb:Lehmer's_number |
| gptkbp:bfsLayer |
7
|