Given 2 numbers a and b, this calculates the following

1) The Greatest Common Divisor (GCD) using Euclids Algorithm

2) x and y in Bézouts Identity ax + by = d using Euclids Extended Algorithm Extended Euclidean Algorithm

This calculator has 2 inputs.

1) The Greatest Common Divisor (GCD) using Euclids Algorithm

2) x and y in Bézouts Identity ax + by = d using Euclids Extended Algorithm Extended Euclidean Algorithm

This calculator has 2 inputs.

- algorithm
- A process to solve a problem in a set amount of time
- equation
- a statement declaring two mathematical expressions are equal
- euclids algorithm
- method for computing the greatest common divisor (GCD) of two numbers
- euclids extended algorithm
- division algorithm for integers
- greatest common factor
- largest positive integer dividing a set of integers
- identity
- an equality that holds true regardless of the values chosen for its variables
- quotient
- The result of dividing two expressions.
- remainder
- The portion of a division operation leftover after dividing two integers