Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alternativeTo |
a^p ≡ a (mod p) for any integer a and prime p
|
| gptkbp:appliesTo |
modular arithmetic
prime numbers |
| gptkbp:category |
elementary number theory
|
| gptkbp:field |
number theory
|
| gptkbp:firstStated |
1640
|
| gptkbp:generalizes |
gptkb:Euler's_theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Fermat's little theorem
|
| gptkbp:influenced |
gptkb:RSA_algorithm
Carmichael numbers |
| gptkbp:language |
gptkb:mathematics
|
| gptkbp:namedAfter |
gptkb:Pierre_de_Fermat
|
| gptkbp:provenBy |
gptkb:Leonhard_Euler
|
| gptkbp:publishedIn |
gptkb:Fermat's_correspondence
|
| gptkbp:relatedTo |
gptkb:Wilson's_theorem
gptkb:Euler's_theorem gptkb:Fermat's_Last_Theorem |
| gptkbp:state |
If p is a prime and a is an integer not divisible by p, then a^(p-1) ≡ 1 (mod p)
|
| gptkbp:usedIn |
cryptography
primality testing |
| gptkbp:bfsParent |
gptkb:Euler's_theorem
|
| gptkbp:bfsLayer |
6
|