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

Calculator

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:

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.
Modular multiplicative inverse
in case you are interested in calculating the modular multiplicative inverse of a number modulo n
using the Extended Euclidean Algorithm

Input

Algorithm

Choose which algorithm you would like to use.

Numbers

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.

Output

Note: 91396 mod 765 ≡ 361, so you could also use this calculator with n=765 and b=361. In that case the table will have less rows, even though it has the same multiplicative inverse.

This is the calculation for finding the multiplicative inverse of 91396 mod 765 using the Extended Euclidean Algorithm:

n	b	q	r	t1	t2	t3
765	91396	0	765	0	1	0
91396	765	119	361	1	0	1
765	361	2	43	0	1	-2
361	43	8	17	1	-2	17
43	17	2	9	-2	17	-36
17	9	1	8	17	-36	53
9	8	1	1	-36	53	-89
8	1	8	0	53	-89	765

Answer

So t = -89. Now we still have to apply mod n to that number:
-89 mod 765 ≡ 676
So the multiplicative inverse of 91396 modulo 765 is 676.

Verification

Let i be the answer we just found, so i=676. We also have b=91396 and n=765.
If our answer is correct, then i × b (mod n) ≡ 1 (mod n).
Let's see if that's indeed the case.
i × b (mod n) ≡
676 × 91396 (mod 765) ≡
61783696 (mod 765) ≡
1 (mod 765)

As you can see, i × b (mod n) ≡ 1 (mod n), so our calculation is correct!