GCD & LCM Calculator
Find the greatest common divisor and least common multiple of numbers
Find the greatest common divisor and least common multiple of numbers
Enter at least two positive integers to calculate GCD and LCM
Euclidean Algorithm: GCD(a, b) = GCD(b, a mod b) until b = 0
The GCD is the largest positive integer that divides each of the integers. The LCM is the smallest positive integer divisible by each of the integers.