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

#### Output

This is the output of the**Extended Euclidean Algorithm**using the numbers a=

**831**and b=

**322**:

a | b | q | r | s1 | s2 | s3 | t1 | t2 | t3 |
---|---|---|---|---|---|---|---|---|---|

831 | 322 | 2 | 187 | 1 | 0 | 1 | 0 | 1 | -2 |

322 | 187 | 1 | 135 | 0 | 1 | -1 | 1 | -2 | 3 |

187 | 135 | 1 | 52 | 1 | -1 | 2 | -2 | 3 | -5 |

135 | 52 | 2 | 31 | -1 | 2 | -5 | 3 | -5 | 13 |

52 | 31 | 1 | 21 | 2 | -5 | 7 | -5 | 13 | -18 |

31 | 21 | 1 | 10 | -5 | 7 | -12 | 13 | -18 | 31 |

21 | 10 | 2 | 1 | 7 | -12 | 31 | -18 | 31 | -80 |

10 | 1 | 10 | 0 | -12 | 31 | -322 | 31 | -80 | 831 |

**Answer**

So we found that:

- gcd(831, 322) = 1
- s = 31
- t = -80

**Verification**

If our answer is correct, then the absolute value of

`s × a + t × b`

is equal to the `gcd`

of `a`

and `b`

. We have:
- |
`s × a + t × b`

| = |31 × 831 + -80 × 322| = |25761 + -25760| = |1| = 1 `gcd(a, b)`

= gcd(831, 322) = 1

`s × a + t × b`

| = `gcd(a, b)`

, so our calculation is correct!