Statements (51)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:theorem
|
| gptkbp:bfsLayer |
4
|
| gptkbp:bfsParent |
gptkb:Carl_Friedrich_Gauss
gptkb:Fermat's_Last_Theorem |
| gptkbp:applies_to |
integers
prime numbers computational number theory |
| gptkbp:can_be_extended_by |
higher powers in modular arithmetic
non-prime moduli |
| gptkbp:discovered_by |
various mathematicians over the years
|
| gptkbp:first_described_by |
1637
|
| gptkbp:first_introduced |
gptkb:Euler's_theorem
|
| gptkbp:historical_significance |
the development of mathematics
|
| https://www.w3.org/2000/01/rdf-schema#label |
Fermat's little theorem
|
| gptkbp:is |
a fundamental theorem in number theory
|
| gptkbp:is_a_basis_for |
many cryptographic algorithms
|
| gptkbp:is_a_framework_for |
Fermat primality test
modern cryptographic systems |
| gptkbp:is_a_solution_for |
gptkb:currency
computational problems in number theory |
| gptkbp:is_a_source_of |
other mathematical results
|
| gptkbp:is_a_tool_for |
primality testing
|
| gptkbp:is_connected_to |
the concept of congruences
|
| gptkbp:is_discussed_in |
mathematical literature
|
| gptkbp:is_fundamental_to |
finite fields
|
| gptkbp:is_involved_in |
Lifting the Exponent Lemma
|
| gptkbp:is_often_associated_with |
Fermat's theorem
|
| gptkbp:is_often_used_in |
gptkb:computer_science
|
| gptkbp:is_part_of |
the study of modular forms
|
| gptkbp:is_referenced_in |
academic papers on number theory
|
| gptkbp:is_related_to |
gptkb:Chinese_Remainder_Theorem
gptkb:musical_group modular arithmetic the RSA algorithm |
| gptkbp:is_used_for |
Wilson's theorem
|
| gptkbp:is_used_in |
gptkb:XMPP_Extension_Protocol
gptkb:building gptkb:currency digital signatures number theory error detection algorithms |
| gptkbp:key |
abstract algebra
|
| gptkbp:named_after |
gptkb:Pierre_de_Fermat
|
| gptkbp:occurs_in |
mathematical textbooks
elementary number theory |
| gptkbp:related_concept |
solving Diophantine equations
examples in modular arithmetic modular arithmetic diagrams |
| gptkbp:result |
the properties of groups
|
| gptkbp:state |
If p is a prime number and a is an integer not divisible by p, then a^(p-1) ≡ 1 (mod p)
|
| gptkbp:training |
undergraduate mathematics courses
|