# 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 content is licensed under Creative Commons Attribution/Share-Alike License 3.0 (Unported). That means you may freely redistribute or modify this content under the same license conditions and must attribute the original author by placing a hyperlink from your site to this work https://planetcalc.com/3299/. Also, please do not modify any references to the original work (if any) contained in this content.

### Articles that describe this calculator

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
- Modular inverse of a matrix
- Modular math
- Modular Multiplicative Inverse
- 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