Use the extended Euclidean algorithm to find the inverse of... (1 Viewer)

[Utility]

5 mod 317.

317 = 5 * 63 + 2
5 = 2 * 2 + 1
2 = 1 * 2 + 0

GCD(317, 5) = 1.

1 = 5 - 2 * 2.

How would you finish this via substitution? For example, 2 = 317 - 5 * 63.

Correction:

1 = 5 - 2 * 2
1 = 5 * 1 + 2 * - 2
1 = 5 * 1 + (317 - 5 * 63) * - 2
1 = 5 (1 + 126) + 317 (-2)

127 = inverse.