Euclidean Algorithm
Please enter two distinct natural numbers to find the greatest common divisor (gcd) and the least common multiple (lcm).
A description of the euclidean algorithm can be found on Wikipedia.
Please enter two distinct natural numbers to find the greatest common divisor (gcd) and the least common multiple (lcm).
A description of the euclidean algorithm can be found on Wikipedia.