Statements (26)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:application |
cryptography
modular arithmetic simplifying fractions |
| gptkbp:category |
gptkb:algorithm
number-theoretic algorithm |
| gptkbp:complexity |
O(log n)
|
| gptkbp:field |
gptkb:mathematics
number theory |
| gptkbp:firstDescribed |
circa 300 BCE
|
| gptkbp:generalizes |
gptkb:extended_Euclidean_algorithm
|
| https://www.w3.org/2000/01/rdf-schema#label |
Euclidean algorithm
|
| gptkbp:introduced |
gptkb:Euclid
|
| gptkbp:introducedIn |
gptkb:Elements
|
| gptkbp:namedAfter |
gptkb:Euclid
|
| gptkbp:purpose |
compute greatest common divisor
|
| gptkbp:relatedTo |
gptkb:Bézout's_identity
gptkb:Diophantine_equations greatest common divisor modular inverse |
| gptkbp:uses |
gptkb:division
remainder |
| gptkbp:bfsParent |
gptkb:Euclid
gptkb:Number_theory gptkb:Arithmetic |
| gptkbp:bfsLayer |
5
|