Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
modular arithmetic
|
| gptkbp:category |
Elementary number theory
|
| gptkbp:field |
gptkb:Number_theory
|
| gptkbp:generalizes |
gptkb:Fermat's_Little_Theorem
|
| gptkbp:hasComponent |
gptkb:Euler's_totient_function
|
| gptkbp:hasProofsOf |
gptkb:Group_theory
Induction |
| https://www.w3.org/2000/01/rdf-schema#label |
Euler's Theorem
|
| gptkbp:implies |
a^φ(n) ≡ 1 (mod n) for coprime a, n
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:publishedIn |
1770
|
| gptkbp:relatedTo |
gptkb:Fermat's_Little_Theorem
|
| gptkbp:sentence |
If n and a are coprime positive integers, then a^φ(n) ≡ 1 (mod n), where φ(n) is Euler's totient function.
|
| gptkbp:usedIn |
gptkb:RSA_algorithm
cryptography |
| gptkbp:bfsParent |
gptkb:Number_Theory
|
| gptkbp:bfsLayer |
7
|