Bootstrap
  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:


Input

Algorithm

Choose which algorithm you would like to use.

Numbers

Enter the input numbers:

a=
b=


Output

This is the output of the Extended Euclidean Algorithm using the numbers a=743 and b=612:
abqr s1s2s3 t1t2t3
743612113110101-1
61213148801-41-15
131881431-45-15-6
884322-45-145-617
4322115-14299-617-363
2120-14299-61217-363743
Answer

So we found that:

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: