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:

Output

This is the output of the Extended Euclidean Algorithm using the numbers a=759 and b=11741:

a	b	q	r	s1	s2	s3	t1	t2	t3
759	11741	0	759	1	0	1	0	1	0
11741	759	15	356	0	1	-15	1	0	1
759	356	2	47	1	-15	31	0	1	-2
356	47	7	27	-15	31	-232	1	-2	15
47	27	1	20	31	-232	263	-2	15	-17
27	20	1	7	-232	263	-495	15	-17	32
20	7	2	6	263	-495	1253	-17	32	-81
7	6	1	1	-495	1253	-1748	32	-81	113
6	1	6	0	1253	-1748	11741	-81	113	-759

Answer

So we found that:

$gcd(759, 11741) = 1$
$s = -1748$
$t = 113$

Verification
If our answer is correct, then the absolute value of $s × a + t × b$ is equal to the $gcd$ of $a$ and $b$. We have:

$|s × a + t × b| = |-1748 × 759 + 113 × 11741| = |-1326732 + 1326733| = |1| = $ $1$
$gcd(a, b) = gcd(759, 11741) = $ $1$

As you can see, $| s × a + t × b| = gcd(a, b)$, so our calculation is correct!