Euler's theorem (number theory)
GPTKB entity
Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
modular arithmetic
|
| gptkbp:category |
Elementary number theory
|
| gptkbp:field |
number theory
|
| gptkbp:function |
gptkb:Euler's_totient_function
|
| gptkbp:generalizes |
gptkb:Fermat's_little_theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Euler's theorem (number theory)
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:relatedTo |
gptkb:Carmichael_function
gptkb:Chinese_remainder_theorem modular exponentiation |
| gptkbp:sentence |
If n and a are coprime positive integers, then a^φ(n) ≡ 1 (mod n), where φ(n) is Euler's totient function.
|
| gptkbp:statedIn |
gptkb:Leonhard_Euler
1773 |
| gptkbp:usedIn |
gptkb:RSA_algorithm
cryptography |
| gptkbp:bfsParent |
gptkb:Euler
gptkb:Leonard_Euler |
| gptkbp:bfsLayer |
7
|