Euler's theorem in number theory
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
modular arithmetic
|
| gptkbp:field |
number theory
|
| gptkbp:generalizes |
gptkb:Fermat's_little_theorem
|
| gptkbp:involves |
gptkb:Euler's_totient_function
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:publishedIn |
18th century
|
| gptkbp:statedIn |
If n and a are coprime, then a^φ(n) ≡ 1 mod n
|
| gptkbp:usedIn |
gptkb:RSA_algorithm
cryptography |
| gptkbp:bfsParent |
gptkb:Euler,_Leonhard
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Euler's theorem in number theory
|