Find the least common multiple (LCM) of two or more integers.
📖 LCM via GCD Relation (LCM = |a×b| / GCD)Fill in the fields on the left with your information, then press Calculate to see your result instantly. No sign-up required, and no data is sent anywhere — everything is calculated right in your browser.
The least common multiple (LCM) calculator finds the smallest positive integer that is evenly divisible by all the entered numbers. The calculator relies on a direct mathematical relationship linking LCM and GCD for two numbers: the product of the two numbers always equals the product of their GCD and LCM, so LCM(a,b) = |a×b| / GCD(a,b). This method is much faster than manually searching for common multiples by listing each number's multiples until finding the first shared one. When more than two numbers are entered, the calculator computes the LCM of the first two numbers, then the LCM of that result with the third number, and so on. LCM is widely used in adding and subtracting fractions with different denominators (to find a common denominator), and in scheduling recurring events. Because GCD and LCM are linked by this single equation, computing one efficiently — using the fast Euclidean algorithm for GCD — automatically makes computing the other fast as well, with no separate search required.
The least common multiple and the greatest common divisor look like they measure opposite things — the smallest shared multiple versus the largest shared factor — but they are connected by a single, clean equation that makes calculating either one considerably easier once the other is known.
For any two positive integers a and b, the product of their GCD and their LCM always exactly equals the product of a and b themselves. Rearranging this relationship gives a direct formula for the LCM: multiply the two original numbers together, then divide by their GCD. Since GCD can be found quickly using the efficient Euclidean algorithm, this relationship turns what would otherwise be a potentially slow search for the least common multiple into a fast, direct calculation.
The alternative, more intuitive method — listing out the multiples of each number until the first shared value appears — works fine for small, simple numbers but becomes impractical quickly. Finding the LCM of 84 and 126 by listing multiples one at a time would require checking dozens of values before finding the shared one (252); using the GCD-based formula instead requires just one division after finding the GCD (42) through a handful of quick Euclidean algorithm steps.
LCM's most familiar classroom application is finding a common denominator when adding or subtracting fractions with different denominators — using the least common multiple of the two denominators, rather than simply multiplying them together, keeps the resulting numbers as small and manageable as possible throughout the calculation, avoiding unnecessarily large intermediate values that would later need to be simplified back down.
Outside pure arithmetic, LCM answers a surprisingly practical category of scheduling questions: if one event repeats every 4 days and another repeats every 6 days, the LCM of 4 and 6 (which is 12) tells you exactly how many days until both events occur on the same day again. This same logic applies to synchronizing traffic lights on different cycle times, aligning maintenance schedules for machines serviced at different intervals, and any situation involving multiple independently repeating cycles that need to be understood together.
LCM stands for Least Common Multiple — the smallest positive number that all the given numbers can divide into evenly.
For any two numbers, multiplying their GCD by their LCM always equals the product of the two numbers, which is exactly the relationship this calculator uses.
It's most commonly used to find a common denominator when adding or subtracting fractions with different denominators.