Calculator
Before you use this calculator
Make sure you read and understand the following pages:- 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. - Multiplicative inverse
in case you are interested in calculating the multiplicative inverse of a number modulo n
using the Extended Euclidean Algorithm
Calculator
For multiplicative inverse calculation, use the modulus n instead of a in the first field.After clicking on 'Calculate!', the answer will appear below:
| a | b | q | r | s1 | s2 | s3 | t1 | t2 | t3 |
|---|
So we found the following:
- gcd(0, 0) = 0
- s =
- t=
s × a + t × b = × 0 + × 0 = 0
This is equal to the gcd we calculated.