🔢 🔢 LCM Calculator: How to Find Least Common Multiple

The Least Common Multiple (LCM) is the smallest positive integer that is divisible by all the given numbers without a remainder. It is the foundation for adding and subtracting fractions, finding common denominators, synchronizing repeating events in scheduling, and solving a wide range of number theory problems. Understanding how to calculate LCM — and why it works — makes fractions and periodic problems far easier to handle.

What is LCM?

The LCM of two or more numbers is the smallest number that appears in the multiplication tables of all the given numbers.

• Multiples of 4: 4, 8, 12, 16, 20, 24, ...
• Multiples of 6: 6, 12, 18, 24, ...
• LCM(4, 6) = 12 — the first number appearing in both lists

This listing method works for small numbers, but for larger numbers, prime factorization or the Euclidean algorithm are far more efficient.

Method 1: Prime Factorization

Step 1: Find the prime factorization of each number.
Step 2: Take every prime factor that appears, using the highest power it appears in any one number.
Step 3: Multiply these together.

Example: LCM(12, 18)

• 12 = 2² × 3
• 18 = 2 × 3²
• LCM = 2² × 3² = 4 × 9 = 36

(Take 2² from 12, 3² from 18 — the highest power of each prime across all numbers.)

Example: LCM(8, 12, 20)

• 8 = 2³
• 12 = 2² × 3
• 20 = 2² × 5
• LCM = 2³ × 3 × 5 = 8 × 3 × 5 = 120

Method 2: Using GCD (Euclidean Method)

The relationship between LCM and GCD:

LCM(a, b) = |a × b| ÷ GCD(a, b)

First find GCD using the Euclidean algorithm (divide larger by smaller, replace larger with remainder, repeat until remainder = 0).

Example: LCM(48, 18)

• GCD step: 48 ÷ 18 = 2 remainder 12 → 18 ÷ 12 = 1 remainder 6 → 12 ÷ 6 = 2 remainder 0 → GCD = 6
• LCM = (48 × 18) ÷ 6 = 864 ÷ 6 = 144

This method is especially efficient for large numbers where prime factorization becomes slow.

LCM in Real-World Contexts

Adding Fractions: The Least Common Denominator

The LCM of the denominators gives the Least Common Denominator (LCD), which lets you add fractions with different denominators:

5/12 + 7/18: LCM(12, 18) = 36 → 15/36 + 14/36 = 29/36

The LCD is always the LCM of the denominators — converting to the LCD is the same as finding the LCM.

Scheduling: Finding When Events Coincide

Two buses leave the same stop — Bus A every 8 minutes, Bus B every 12 minutes. When do they next leave together?

LCM(8, 12) = 24 → they depart together every 24 minutes

This is the classic "scheduling synchronization" problem that appears in operations research, manufacturing, and logistics.

Music: Finding Beat Coincidence

If one drum pattern repeats every 3 beats and another every 4 beats, both restart together every LCM(3, 4) = 12 beats — making 12 beats the actual period of the combined pattern.

Key Properties of LCM

• LCM(a, b) × GCD(a, b) = a × b (valid for two numbers only)
• LCM of co-prime numbers (GCD = 1) equals their product: LCM(7, 11) = 77
• LCM is always ≥ the largest of the given numbers
• LCM of a number with itself = the number: LCM(6, 6) = 6
• LCM(a, b, c) is found iteratively: LCM(LCM(a, b), c)

LCM vs HCF: The Key Difference