Finds the greatest common divisor of two integers with the Euclidean algorithm, and the least common multiple as the product ÷ the GCD.