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.
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
This is the calculation for finding the multiplicative inverse of 823 mod 830 using the Extended Euclidean Algorithm:| n | b | q | r | t1 | t2 | t3 |
|---|---|---|---|---|---|---|
| 830 | 823 | 1 | 7 | 0 | 1 | -1 |
| 823 | 7 | 117 | 4 | 1 | -1 | 118 |
| 7 | 4 | 1 | 3 | -1 | 118 | -119 |
| 4 | 3 | 1 | 1 | 118 | -119 | 237 |
| 3 | 1 | 3 | 0 | -119 | 237 | -830 |
So t = 237. Now we still have to apply mod n to that number:
237 mod 830 ≡ 237
So the multiplicative inverse of 823 modulo 830 is 237.
Let i be the answer we just found, so i=237. We also have b=823 and n=830.
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) ≡
237 × 823 (mod 830) ≡
195051 (mod 830) ≡
1 (mod 830)
i × b (mod n) ≡ 1 (mod n), so our calculation is correct!