Find the greatest common divisor (GCD) and lowest common multiple (LCM) of any two numbers. This project uses the Euclidean algorithm.
