The greatest common divisor and the least common multiple of two integers

The greatest common divisor (GCD) can be found using 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.

The greatest common divisor and the lowest common multiple of two integers

First integer

Second integer

Calculate

The lowest common multiple

 

The greatest common divisor

 

save Save share Share extension Widget