Extended Euclidean Algorithm

To find Bezout coefficients and the greatest common divisor, you can use an iterative Extended Euclidean Algorithm computation that solves the linear combination ax + by = gcd(a, b) for any two integers. The skill visualizes each division step automatically.

The Extended Euclidean Algorithm works by iteratively applying integer division to compute the greatest common divisor while simultaneously tracking Bezout coefficients in a visual table. You can watch each division step update the coefficients in real time.

Yes, you can compute the modular inverse or GCD for negative integers. The computation includes automatic sign adjustment for negative inputs and mathematically verifies the resulting linear combination to ensure correctness.

The Extended Euclidean Algorithm visualization requires client-side JavaScript execution to render the division table and handle the interactive, user-driven computation flow. No additional dependencies or external libraries are needed.

To verify the identity ax + by = gcd(a, b) after computing Bezout coefficients, the skill automatically performs mathematical verification of the resulting linear combination. This interactive verification confirms the computed GCD and coefficients match.