Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
gptkb:Modular_arithmetic
|
| gptkbp:field |
gptkb:Number_theory
|
| gptkbp:form |
a^φ(n) ≡ 1 (mod n)
|
| gptkbp:generalizes |
gptkb:Fermat's_little_theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Euler's theorem
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:publicationYear |
1763
|
| gptkbp:publishedIn |
gptkb:Novi_Commentarii_academiae_scientiarum_Petropolitanae
|
| 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:Leonhard_Euler
|
| gptkbp:bfsLayer |
5
|