# Greatest Common Divisor and Least Common Multiple Calculator

Calculate 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

Created: 2011-08-04 21:14:37, Last updated: 2023-05-27 13:04:23

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.

### Using the calculator

To find the GCD and LCM of two integers, enter the values in the "First integer" and "Second integer" fields. Once you've entered the integers, click the "Calculate" button. The calculator will determine the GCD and LCM and display the results.

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

The lowest common multiple

The greatest common divisor

### Calculation of GCD and LCM

The GCD can be found using the Euclidean algorithm, which involves finding the remainder of division until the remainder becomes zero. The GCD is the value obtained at that point. (For a more detailed explanation of the Euclidean algorithm and further information on GCD, refer to the link The greatest common divisor of two integers.)

Once you know the GCD, you can easily calculate the LCM using the formula:
LCM = (a * b) / GCD

URL copied to clipboard
PLANETCALC, Greatest Common Divisor and Least Common Multiple Calculator