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 rs1s2s3t1t2t3

So we found the following:
  • gcd(0, 0) = 0
  • s =
  • t=
s × a + t × b = × 0 + × 0 = 0
This is equal to the gcd we calculated.