GCD and LCM feel like two separate topics from a math textbook, but they're closely related, and both come down to the same underlying idea: looking at how numbers share (or don't share) factors.
What GCD and LCM Actually Mean
The greatest common divisor (GCD) of two numbers is the largest number that divides evenly into both of them, with no remainder. The least common multiple (LCM) is the smallest number that both of them divide evenly into. GCD shrinks toward the numbers' shared factors; LCM grows out to the smallest number that contains both of them. For 12 and 18, the GCD is 6 (the largest number that divides both), and the LCM is 36 (the smallest number both 12 and 18 divide into).
The Euclidean Algorithm
The standard way to compute a GCD isn't to list out every factor of both numbers and compare — that gets slow fast for large numbers. Instead, the Euclidean algorithm, described by Euclid roughly 2,300 years ago, repeatedly replaces the larger number with the remainder of dividing it by the smaller number, and repeats until the remainder hits zero. Whatever number remains at that point is the GCD. This works because any number that divides both of the original numbers also divides their difference (and their remainder), so the GCD never changes at any step — the numbers just keep shrinking until the answer is obvious.
The GCD-LCM Shortcut
Once you have the GCD, there's no need to separately hunt for the LCM: for any two numbers, their GCD times their LCM always equals the product of the two numbers. Rearranged, that means LCM = (a × b) ÷ GCD(a, b). This relationship holds because of how prime factors distribute between GCD (the factors both numbers share) and LCM (all the factors either number needs) — it's a direct mathematical identity, not a coincidence or approximation.
Where This Shows Up in Real Life
GCD and LCM aren't just textbook exercises. Simplifying a fraction to lowest terms is dividing by the GCD of the numerator and denominator. Finding a common denominator to add two fractions is finding the LCM of the two denominators. LCM also shows up whenever you're syncing repeating cycles — like figuring out when two events on different schedules (every 4 days and every 6 days) will next land on the same day, which is the LCM of the two intervals.
Finding It Instantly
Skip the manual division steps and get the GCD and LCM of two or more numbers at once with the free GCD & LCM Calculator.
FAQ
How is the GCD calculated? Using the Euclidean algorithm, a genuinely efficient and exact method that repeatedly replaces the larger number with the remainder of dividing it by the smaller number until the remainder reaches zero.
How is the LCM related to the GCD? The LCM of two numbers equals their product divided by their GCD — a direct mathematical relationship, which is how this tool computes it after finding the GCD first.
Why is the Euclidean algorithm still used when computers can just try every number? Because it's dramatically faster for large numbers. Checking every possible divisor up to the smaller number takes far more steps as numbers grow, while the Euclidean algorithm's remainder-based approach reaches the answer in relatively few steps even for very large inputs, which is why it's still the standard method after roughly 2,300 years.
Can I find the GCD and LCM of more than two numbers? Yes — enter as many numbers as you like, separated by commas, and it computes the GCD and LCM across all of them at once.