Youtor
Euclidean Algorithm and Multiplicative Inverse Ex 1
>> YOUR LINK HERE: ___ http://youtube.com/watch?v=K5nbGbN5Trs
This video gives an example of how to use the Euclidean algorithm for finding a multiplicative inverse like this: x^-1 mod n = ?. • For a second example: • Euclidean Algorithm and Multiplicativ... • For using the algorithm to find gcd instead: • Euclidean Algorithm and GCDs (Ex. 1)
#############################
