Appearance
Modular Inverse by Extended Euclidean Algorithm Calculator
a⋅s + b⋅t = gcd(a, b) = 1
| a: | ||
| Modulus: | a and modulus are coprime |
a-1 = 19
a = 11, b = 26, s = -7, t = 3
(11 ⋅ -7) + (26 ⋅ 3) = -77 + 78 = gcd(11, 26) = 1
| a | b | q | r | s1 | s2 | s3 | t1 | t2 | t3 |
| 11 | 26 | 0 | 11 | 1 | 0 | 1 | 0 | 1 | 0 |
| 26 | 11 | 2 | 4 | 0 | 1 | -2 | 1 | 0 | 1 |
| 11 | 4 | 2 | 3 | 1 | -2 | 5 | 0 | 1 | -2 |
| 4 | 3 | 1 | 1 | -2 | 5 | -7 | 1 | -2 | 3 |
| 3 | 1 | 3 | 0 | 5 | -7 | 26 | -2 | 3 | -11 |
Elapsed: 0.1 (ms), Coprime: true