extended Euclidean algorithm
GPTKB entity
Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:complexity |
O(log n)
|
| gptkbp:computes |
greatest common divisor
|
| gptkbp:field |
gptkb:mathematics
number theory |
| gptkbp:foundIn |
integer coefficients
|
| gptkbp:generalizes |
gptkb:Euclidean_algorithm
|
| https://www.w3.org/2000/01/rdf-schema#label |
extended Euclidean algorithm
|
| gptkbp:input |
two integers
|
| gptkbp:namedAfter |
gptkb:Euclid
|
| gptkbp:output |
gcd and coefficients
|
| gptkbp:solvedBy |
gptkb:Bézout's_identity
|
| gptkbp:used_in |
gptkb:RSA_algorithm
cryptography computational number theory |
| gptkbp:usedFor |
modular inverses
solving linear Diophantine equations |
| gptkbp:bfsParent |
gptkb:Euclidean_algorithm
gptkb:Euclidean_algorithm_for_GCD |
| gptkbp:bfsLayer |
6
|