# 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

**Note:**948 mod 383 ≡ 182, so you could also use this calculator with n=383 and b=182. In that case the table will have less rows, even though it has the same multiplicative inverse.

**948 mod 383**using the Extended Euclidean Algorithm:

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

383 | 948 | 0 | 383 | 0 | 1 | 0 |

948 | 383 | 2 | 182 | 1 | 0 | 1 |

383 | 182 | 2 | 19 | 0 | 1 | -2 |

182 | 19 | 9 | 11 | 1 | -2 | 19 |

19 | 11 | 1 | 8 | -2 | 19 | -21 |

11 | 8 | 1 | 3 | 19 | -21 | 40 |

8 | 3 | 2 | 2 | -21 | 40 | -101 |

3 | 2 | 1 | 1 | 40 | -101 | 141 |

2 | 1 | 2 | 0 | -101 | 141 | -383 |

**Answer**

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

141 mod 383 ≡ 141

So the multiplicative inverse of 948 modulo 383 is 141.

**Verification**

Let **i** be the answer we just found, so i=141. We also have b=948 and n=383.

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

141 × 948 (mod 383) ≡

133668 (mod 383) ≡

1 (mod 383)

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

, so our calculation is correct!