Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:application |
gptkb:RSA_algorithm
primitive roots |
| gptkbp:defines |
the smallest positive integer m such that a^m ≡ 1 mod n for all integers a coprime to n
|
| gptkbp:field |
number theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Carmichael function
|
| gptkbp:namedAfter |
gptkb:Robert_Carmichael
|
| gptkbp:property |
λ(2^k) = 2^{k-2} for k > 2
λ(mn) = lcm(λ(m), λ(n)) for coprime m, n λ(n) divides φ(n) λ(p^k) = φ(p^k) for odd primes p or k ≤ 2 |
| gptkbp:relatedTo |
gptkb:Euler's_totient_function
|
| gptkbp:symbol |
λ(n)
|
| gptkbp:usedIn |
cryptography
|
| gptkbp:bfsParent |
gptkb:Euler's_totient_function
gptkb:Euler's_totient_function_φ(n) gptkb:Robert_Daniel_Carmichael gptkb:(Z/nZ)^× |
| gptkbp:bfsLayer |
6
|