Finding GCD and LCM

The greatest common divisor (GCD) is the largest number that divides both numbers evenly, found here using the Euclidean algorithm. The least common multiple (LCM) is the smallest number that both values divide into evenly, calculated by multiplying the two numbers together and dividing by the GCD.

Where This Is Used

GCD and LCM show up when simplifying fractions, finding common denominators, and scheduling repeating events.