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
[a,b] - LCM,
(a,b) - GCD.
URL copiado para a área de transferência
PLANETCALC, The greatest common divisor and the least common multiple of two integers