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

**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**11 mod 1189**using the Extended Euclidean Algorithm:

n | b | q | r | t1 | t2 | t3 |
---|---|---|---|---|---|---|

1189 | 11 | 108 | 1 | 0 | 1 | -108 |

11 | 1 | 11 | 0 | 1 | -108 | 1189 |

**Answer**

So t = -108. Now we still have to apply mod n to that number:

-108 mod 1189 ≡ 1081

So the multiplicative inverse of 11 modulo 1189 is 1081.

**Verification**

Let **i** be the answer we just found, so i=1081. We also have b=11 and n=1189.

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) ≡

1081 × 11 (mod 1189) ≡

11891 (mod 1189) ≡

1 (mod 1189)

`i × b (mod n) ≡ 1 (mod n)`

, so our calculation is correct!