Carmichael's totient function conjecture
GPTKB entity
Statements (11)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:category |
unsolved problem in mathematics
|
| gptkbp:field |
number theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Carmichael's totient function conjecture
|
| gptkbp:namedAfter |
gptkb:Robert_Carmichael
|
| gptkbp:proposedBy |
1907
|
| gptkbp:relatedTo |
gptkb:Euler's_totient_function
|
| gptkbp:sentence |
For every integer n > 1, there is at least one other integer m ≠ n such that φ(m) = φ(n), where φ is Euler's totient function.
|
| gptkbp:status |
open problem
|
| gptkbp:bfsParent |
gptkb:Robert_Carmichael
|
| gptkbp:bfsLayer |
8
|