Before you use this calculator

Make sure you read and understand the following pages:


For multiplicative inverse calculation, use the modulus n instead of a in the first field.

a (or the modulus n) b:
Euclidean Algorithm
   (The greatest common divisor (GCD))
Extended Euclidean Algorithm
   (GCD and Bézout coefficients)
Multiplicative inverse modulo n
   (using the extended euclidean algorithm)
After clicking on 'Calculate!', the answer will appear below:

a b q r

So gcd(0, 0) =