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

Esta página existe graças aos esforços das seguintes pessoas:

Timur

Timur

Criado: 2011-08-04 21:14:37, Ultima atualização: 2021-03-20 05:34:54

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]=\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
 

URL copiado para a área de transferência
PLANETCALC, The greatest common divisor and the least common multiple of two integers

Comentários