The greatest common divisor and the least common multiple of two integers
This calculator finds the greatest common divisor (GCD) and the least common multiple (LCM) of two integers
You can find the greatest common divisor (GCD) using the Euclidean algorithm. See description here - The greatest common divisor of two integers.
If you knew GCD, you can find the least common multiple (LCM) easily
,
where
[a,b] - LCM,
(a,b) - GCD.
URL copiado para a área de transferência
Calculadoras similares
PLANETCALC, The greatest common divisor and the least common multiple of two integers
Comentários