What is GCD (Greatest Common Divisor)?

GCD is the largest nummer that divides both input nummers without leaving a remainder. For example, GCD(12, 18) = 6, because 6 divides both 12 and 18.

What is LCM (Least Common Multiple)?

LCM is the smallest nummer that is a multiple of both input nummers. For example, LCM(12, 18) = 36, because 36 is the smallest nummer divisible by both 12 and 18.

What is the Euclidean algorithm?

The Euclidean algorithm is an efficient method to compute GCD by repeatedly dividing and taking remainders: GCD(a, b) = GCD(b, a mod b) until b = 0. It is much faster than prime factorization for large nummers.

How are GCD and LCM related?

They are related by the formula: GCD(a, b) × LCM(a, b) = a × b. This identity is useful for computing LCM once GCD is known.

What is GCD of two coprime nummers?

Coprime nummers (also called relatively prime) have a GCD of 1, meaning they share no common factors other than 1. For example, GCD(7, 11) = 1.

GCD and LCM Calculator

Gratis GCD and LCM calculator using the Euclidean algorithm. Find both the greatest common divisor and least common multiple with step-by-step breakdown.

Bereken the greatest common divisor and least common multiple of two nummers.

GCD (a, b) = Euclidean algorithm; LCM (a, b) = \frac{a \times b}{GCD ( a , b )}

Gerelateerde calculators

Priemgetal Factorization Calculator

Decompose any nummer into its prime factors and view the exponent notation.

Faculteit Calculator — n! for Any Integer

Compute the factorial of any integer from 0 to 170, including large nummers using arbitrary precision.

Combinaties & Permutaties Calculator

Bereken nCr (combinations) and nPr (permutations) for any n and r direct.

Percentage Calculator

Bereken percentages direct: X% of Y, X is what % of Y, or percentage change.