With Euclid's algorithm, we can find the greatest common divisor (GCD) of two integers a and b. It can be proven that the GCD is the smallest positive integer l...