Find the greatest common divisor and least common multiple of two numbers.
GCD found via the Euclidean algorithm. LCM = (a × b) / GCD(a,b).