Extended Euclidean algorithm
This calculator implements Extended Euclidean algorithm, which computes, besides the greatest common divisor of integers a and b, the coefficients of Bézout's identity
This page exists due to the efforts of the following people:
 | Timur
|
Created: , Last updated:
Articles that describe this calculator
Extended Euclidean algorithm
Greatest Common Divisor
Coefficient for bigger integer
Coefficient for smaller integer
Calculators that use this calculator
- Bézout coefficients
- Egyptian fraction expansion
- Egyptian numbers
- Hill cipher
- Inverse Modulo Calculator
- Linear congruence solver
- Linear Diophantine equations
- Modular inverse of a matrix
- Rhind papyrus and fraction expansion algorithms
URL copied to clipboard
Similar calculators
Bézout's identity euclidean algorithm Extended Euclidean algorithm GCD greatest common divisor Math
PLANETCALC, Extended Euclidean algorithm
Comments