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
AlgorithmChoose which algorithm you would like to use.
NumbersEnter the input numbers:
Output
This is the output of the Extended Euclidean Algorithm using the numbers a=667 and b=985:| a | b | q | r | s1 | s2 | s3 | t1 | t2 | t3 |
|---|---|---|---|---|---|---|---|---|---|
| 667 | 985 | 0 | 667 | 1 | 0 | 1 | 0 | 1 | 0 |
| 985 | 667 | 1 | 318 | 0 | 1 | -1 | 1 | 0 | 1 |
| 667 | 318 | 2 | 31 | 1 | -1 | 3 | 0 | 1 | -2 |
| 318 | 31 | 10 | 8 | -1 | 3 | -31 | 1 | -2 | 21 |
| 31 | 8 | 3 | 7 | 3 | -31 | 96 | -2 | 21 | -65 |
| 8 | 7 | 1 | 1 | -31 | 96 | -127 | 21 | -65 | 86 |
| 7 | 1 | 7 | 0 | 96 | -127 | 985 | -65 | 86 | -667 |
So we found that:
- gcd(667, 985) = 1
- s = -127
- t = 86
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| = |-127 × 667 + 86 × 985| = |-84709 + 84710| = |1| = 1 gcd(a, b)= gcd(667, 985) = 1
As you can see, |
s × a + t × b| = gcd(a, b), so our calculation is correct!