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

This page exists due to the efforts of the following people:

Timur

Timur

Created: 2011-08-04 21:14:37, Last updated: 2021-03-20 05:34:54
Creative Commons Attribution/Share-Alike License 3.0 (Unported)

This content is licensed under Creative Commons Attribution/Share-Alike License 3.0 (Unported). That means you may freely redistribute or modify this content under the same license conditions and must attribute the original author by placing a hyperlink from your site to this work https://planetcalc.com/497/. Also, please do not modify any references to the original work (if any) contained in this content.

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 copied to clipboard
PLANETCALC, The greatest common divisor and the least common multiple of two integers

Comments