homechevron_rightStudychevron_rightMathchevron_rightGeometry

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

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
[a,b]=\frac{ab}{(a,b)},
where
[a,b] - LCM,
(a,b) - GCD.

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

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

The lowest common multiple
 
The greatest common divisor
 
Save the calculation to reuse next time, to extension embed in your website or share share with friends.

Comments