Use this GCD and LCM calculator to find the greatest common divisor and least common multiple of 2 or 3 integers. These values are especially useful when simplifying fractions, comparing multiples, solving school math exercises and working with divisibility. The calculator uses the Euclidean algorithm for quick and reliable results.
The GCD is used to simplify fractions, solve Diophantine equations, and in cryptography (RSA). For example, to simplify 48/18: GCD=6, so 48/18 = 8/3.
The LCM is often used to find a common denominator for fractions, coordinate repeating cycles and solve scheduling problems where events repeat at different intervals.
GCD: Euclidean algorithm — gcd(a,b) = gcd(b, a mod b) until b=0 | LCM: lcm(a,b) = |a×b| / gcd(a,b)
Example: GCD(48, 18) = 6 | LCM(48, 18) = 144
Discover similar tools to continue your calculation or compare related results.
