# 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

,

where

[a,b] - LCM,

(a,b) - GCD.

Save the calculation to reuse next time, toextensionembed in your website orshareshare with friends.

## Comments