# Calculator

**Before you use this calculator**

Make sure you read and understand the following pages:
- Euclidean Algorithm

For the basics and the table notation - Extended Euclidean Algorithm
- Multiplicative inverse

in case you are interested in calculating the multiplicative inverse of a number modulo n

using the Extended Euclidean Algorithm

#### Calculator

For multiplicative inverse calculation, use the modulus n instead of a in the first field.After clicking on 'Calculate!', the answer will appear below:

a | b | q | r |
---|

So gcd(0, 0) =