Section 2.5
Section 2.5. Integers and Algorithms. Euclidean algorithm for finding gcd. Where L is a larger number, and S is a smaller number, to find gcd(L,S): divide L by S to obtain: L = S * c + r where c is some constant and r is the remainder next, find gcd(S,r) using the same method
395 views • 23 slides