LCM Calculator

Find the Least Common Multiple (LCM) of two or more numbers using prime factorization with detailed steps.

Enter Numbers

Result

Least Common Multiple
36

Step-by-Step Solution

LCM(12, 18) = 36

What is the Least Common Multiple (LCM)?

The Least Common Multiple (LCM) of two or more integers is the smallest positive integer that is divisible by each of those numbers. For example, the LCM of 4 and 6 is 12, because 12 is the smallest number that both 4 and 6 divide into evenly.

LCM is a fundamental concept in number theory and is widely used in fraction arithmetic, scheduling problems, and many areas of mathematics and engineering.

Methods to Find LCM

Prime Factorization Method

Factor each number into primes, then take the highest power of each prime factor that appears.

LCM = product of highest prime powers

Listing Multiples Method

List multiples of each number until you find the smallest common one.

List: 4, 8, 12... and 6, 12... => LCM = 12

Using GCD (Euclidean)

Use the relationship between LCM and GCD for an efficient calculation.

LCM(a, b) = |a x b| / GCD(a, b)

Division Method

Divide all numbers by common prime factors simultaneously until all reduce to 1.

LCM = product of all divisors used

How to Calculate LCM Using Prime Factorization

The prime factorization method is one of the most reliable approaches:

  1. Find the prime factorization of each number.
  2. Identify all unique prime factors across all numbers.
  3. For each prime factor, take the highest power that appears in any factorization.
  4. Multiply all the highest prime powers together to get the LCM.

Example: LCM of 12 and 18

12 = 22 x 31

18 = 21 x 32

Highest powers: 22 = 4 and 32 = 9

LCM = 4 x 9 = 36

Applications of LCM

  • Adding and subtracting fractions: LCM of denominators gives the least common denominator.
  • Scheduling problems: Finding when events with different cycles coincide.
  • Gear ratios and engineering: Synchronizing rotational speeds.
  • Music theory: Finding when rhythmic patterns align.
  • Cryptography: Used in RSA and other algorithms.

LCM vs GCD

While LCM finds the smallest common multiple, the Greatest Common Divisor (GCD) finds the largest common factor. They are related by the formula: LCM(a, b) x GCD(a, b) = |a x b|. This relationship provides an efficient way to compute one from the other.