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. 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.

n=
b=


Output

This is the calculation for finding the multiplicative inverse of 563 mod 971 using the Extended Euclidean Algorithm:
nbqr t1t2t3
971563140801-1
56340811551-12
408155298-12-5
155981572-57
9857141-57-12
57411167-1219
411629-1219-50
1691719-5069
9712-5069-119
723169-119426
2120-119426-971
Answer

So t = 426. Now we still have to apply mod n to that number:
426 mod 971 ≡ 426
So the multiplicative inverse of 563 modulo 971 is 426.

Verification

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