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: 978 mod 361 ≡ 256, so you could also use this calculator with n=361 and b=256. 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 978 mod 361 using the Extended Euclidean Algorithm:

n	b	q	r	t1	t2	t3
361	978	0	361	0	1	0
978	361	2	256	1	0	1
361	256	1	105	0	1	-1
256	105	2	46	1	-1	3
105	46	2	13	-1	3	-7
46	13	3	7	3	-7	24
13	7	1	6	-7	24	-31
7	6	1	1	24	-31	55
6	1	6	0	-31	55	-361

Answer

So t = 55. Now we still have to apply mod n to that number:
55 mod 361 ≡ 55
So the multiplicative inverse of 978 modulo 361 is 55.

Verification

Let i be the answer we just found, so i=55. We also have b=978 and n=361.
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) ≡
55 × 978 (mod 361) ≡
53790 (mod 361) ≡
1 (mod 361)

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