Before you use this calculatorMake sure you read and understand the following pages:
- Euclidean Algorithm
For the basics and the table notation
- Extended Euclidean Algorithm
Unless you only want to use this calculator for the basic Euclidean Algorithm.
- Multiplicative inverse
in case you are interested in calculating the multiplicative inverse of a number modulo n
using the Extended Euclidean Algorithm
CalculatorFor multiplicative inverse calculation, use the modulus n instead of a in the first field.
After clicking on 'Calculate!', the answer will appear below:
So gcd(0, 0) =