CALTRX

Least Common Multiple Calculator

Find the least common multiple of two or more numbers. Get instant results with step-by-step explanations.

Enter your values above to see the results.

Tips & Notes

  • ✓Fastest method: LCM = (a×b)/GCD. Compute GCD with Euclidean algorithm first.
  • ✓LCM(a,b) ≥ max(a,b) always. LCM(a,a)=a. LCM(a,1)=a.
  • ✓For adding fractions: LCD = LCM of denominators. 1/4+1/6 → LCD=12 → 3/12+2/12=5/12.
  • ✓Three numbers: LCM(LCM(a,b),c). Apply pairwise and build up.
  • ✓If one number divides the other, LCM = larger: LCM(6,18)=18 since 6|18.

Common Mistakes

  • ✗Confusing LCM with GCD. LCM is always ≥ the largest number. GCD is always ≤ the smallest.
  • ✗LCM of prime numbers p and q is always p×q since they share no factors.
  • ✗For fractions: LCD is LCM of denominators, not numerators.
  • ✗Multiplying all numbers together: LCM(4,6,10) ≠ 240. Must account for shared factors.
  • ✗LCM formula: (a×b)/GCD. Order in numerator does not matter — a×b = b×a.

Least Common Multiple Calculator Overview

The Least Common Multiple of two or more integers is the smallest positive integer that every given number divides into evenly. It is the essential tool for adding and subtracting fractions with different denominators, for synchronizing repeating cycles in scheduling problems, and for any calculation requiring a common reference point between periodic quantities.

The fastest method for two numbers leverages their GCF:

LCM(a, b) = (a × b) / GCF(a, b)
EX: LCM(12, 18) → GCF(12, 18) = 6 → LCM = (12 × 18) / 6 = 36
The prime factorization method takes the maximum exponent of every prime appearing in any of the numbers:
EX: LCM(12, 18) → 12 = 2²×3, 18 = 2×3² → take maximums: 2² and 3² → LCM = 4×9 = 36
For three or more numbers, apply LCM pairwise and build up incrementally:
EX: LCM(4, 6, 10) → LCM(4, 6) = 12 → LCM(12, 10) = 60
The relationship connecting LCM and GCF holds exactly for any two positive integers and allows you to find one from the other instantly:
LCM(a, b) × GCF(a, b) = a × b
The applications of LCM span everyday arithmetic through industrial engineering — here are the most common contexts where you will encounter it: - Fraction addition and subtraction: the Least Common Denominator for 1/4 + 1/6 is LCM(4, 6) = 12. Convert: 3/12 + 2/12 = 5/12. The LCD is always the LCM of the denominators. - Repeating event synchronization: two events recurring every 4 days and every 6 days next coincide after LCM(4, 6) = 12 days. Traffic signal timing: two intersections cycling every 45 seconds and 60 seconds align every LCM(45, 60) = 180 seconds — 3 minutes.

Frequently Asked Questions

LCM is the smallest positive integer divisible by all given numbers. Method 1 — prime factorization: factor each number, take the maximum exponent of each prime that appears. LCM(12, 18): 12 = 2²×3, 18 = 2×3². Take max exponents: 2² × 3² = 4 × 9 = 36. Method 2 — use GCF: LCM(a,b) = a×b / GCF(a,b). LCM(12,18) = 12×18/6 = 216/6 = 36. Method 2 is faster for two numbers; method 1 extends naturally to three or more numbers.

Adding or subtracting fractions requires a common denominator — the LCM of all denominators is the least common denominator (LCD), keeping numbers smallest. 1/12 + 1/18: LCD = LCM(12,18) = 36. Convert: 3/36 + 2/36 = 5/36. Using any other common multiple (like 216) works but creates larger, harder-to-reduce fractions. The LCD minimizes arithmetic complexity. Always simplify the final answer by checking GCF of numerator and denominator.

LCM solves scheduling and synchronization problems. Event A repeats every 4 days, Event B every 6 days. When do they coincide again? LCM(4,6) = 12 — both events occur on day 12. Traffic lights synchronized to cycles of 30, 45, and 60 seconds: LCM(30,45,60) = 180 seconds = 3 minutes until all three are green simultaneously. Gear teeth: gears with 12 and 18 teeth align after LCM(12,18)/12 = 3 rotations of the first gear and LCM(12,18)/18 = 2 rotations of the second.

For three or more numbers, use prime factorization and take the maximum exponent of each prime across all numbers. LCM(8, 12, 15): 8 = 2³, 12 = 2²×3, 15 = 3×5. Maximum exponents: 2³ × 3¹ × 5¹ = 8×3×5 = 120. Verify: 120/8=15 ✓, 120/12=10 ✓, 120/15=8 ✓. Alternatively, compute iteratively: LCM(8,12) = 24, then LCM(24,15) = 120. Both methods give the same result — choose whichever is easier for the specific numbers.

LCM and GCF are related by: LCM(a,b) × GCF(a,b) = a × b. This means LCM(a,b) = a×b / GCF(a,b). Example: LCM(15,20) — GCF(15,20) = 5 → LCM = 15×20/5 = 300/5 = 60. Verify: 60/15=4 ✓, 60/20=3 ✓. This relationship only holds exactly for two numbers — for three or more, you must compute GCF and LCM iteratively. The formula is especially useful when GCF is easy to find and saves the factorization step.

If LCM(a,b) = a×b, then GCF(a,b) = 1 — the numbers are coprime (share no common factors). LCM(8,15) = 120 = 8×15, confirming GCF(8,15)=1. Conversely, if GCF(a,b) = a, then a divides b and LCM(a,b) = b. Example: GCF(6,18) = 6 → LCM(6,18) = 18. In modular arithmetic, LCM determines the period of combined cyclic patterns — the Chinese Remainder Theorem uses LCM to find when multiple congruences are simultaneously satisfied.