Example of Extended Euclidean Algorithm: computing 28-1 mod 75

75 = 2* 28 + 19 =>

(75 - 2*28) mod 75 = 19

(75* 28 - 2*28) mod 75 = 19

73 * 28 mod 75 = 19

28 = 1* 19 + 9

(28 - 1* 19) mod 75 = 9

(1* 28 - 173 28) mod 75 = 9

(3 * 28) mod 75 = 9

19 = 2* 9 + 1

(19 - 2* 9) mod 75 = 1

(7328 - 2328) mod 75 = 1. 67 28 mod 75 = 1.

Previous slide Next slide Back to first slide View graphic version