E.E.A. .com
It doesn't have to be difficult if someone just explains it right.


For the Euclidean Algorithm, Extended Euclidean Algorithm and multiplicative inverse.

Before you use this calculator

If you're used to a different notation, the output of the calculator might confuse you at first.
Even though this is basically the same as the notation you expect. If that happens, don't panic.
Just make sure to have a look the following pages first and then it will all make sense:



Choose which algorithm you would like to use.


Enter the input numbers. Note that you need to enter n before b.
E.g. if you want to know the multiplicative inverse of 26 mod 11, then use n=11 and b=26.



The output will appear here.
Select an algorithm, then enter the desired input numbers and then click on "Calculate! "