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

n	b	q	r	t1	t2	t3
767	902	0	767	0	1	0
902	767	1	135	1	0	1
767	135	5	92	0	1	-5
135	92	1	43	1	-5	6
92	43	2	6	-5	6	-17
43	6	7	1	6	-17	125
6	1	6	0	-17	125	-767

Answer

So t = 125. Now we still have to apply mod n to that number:
125 mod 767 ≡ 125
So the multiplicative inverse of 902 modulo 767 is 125.

Verification

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

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