Euclid's GCD Algorithm & Mo dular Arithmetic 1

Euclid's GCD Algorithm & Mo dular Arithmetic 1 Euclid's GCD Algorithm: De nition: The greatest common divisor of a and b is the largest d suc h that j (where d j a denotes that divides). Example: T o compute the gcd of 360 and 84, w e could just factor th

www.cs.berkeley.edu