Extended Euclidean Algorithm Calculator

Find integer coefficients x and y that reproduce the GCD of two signed integers, with complete coefficient rows and a modular inverse when it exists.

Result
—
Related result —
Interpretation —
Show calculation details Hide calculation details

Exact calculation and checks

Coefficient rows —
Calculation steps —