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.

Euclidean Algorithm Extended Euclidean Algorithm Modular multiplicative inverse

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=

Calculate!

Output

This is the calculation for finding the multiplicative inverse of 34353 mod 857 using the Extended Euclidean Algorithm:
Answer

So $t = -270$. Now we still have to apply $\pmod{n}$ to that number: $$-270 \pmod{857} ≡ 587$$ So the multiplicative inverse of $34353$ modulo $857$ is $587$.

Verification

Let $t$ be the answer we just found, so $t=587$. We also have $b=34353$ and $n=857$.
If our answer is correct, then $t \times b \pmod{n} \equiv 1 \pmod{n}$.
Let's see if that's indeed the case. \[ \begin{aligned} t \times b \pmod{n} &\equiv \\ 587 \times 34353 \pmod{857} &\equiv \\ 20165211 \pmod{857} &\equiv1 \pmod{857} \\&\equiv 1 \pmod{n}\end{aligned} \]