Least Common Multiple (LCM) Calculator

LCM Calculator

Enter at least two positive integers:

How to Find the Least Common Multiple

The Least Common Multiple (LCM) of two or more positive integers is the smallest positive integer divisible by each of them.

Method 1: GCF Identity (used above)

  1. Find the GCF (Greatest Common Factor) using the Euclidean algorithm.
  2. Apply the identity: LCM = (a × b) / GCF.

Method 2: Prime Factorization

  1. Find the prime factorization of each number.
  2. For each prime that appears in any factorization, take the highest exponent across all inputs.
  3. Multiply these prime powers together.

Example: LCM(12, 18) via prime factorization

  • 12 = 2² × 3¹
  • 18 = 2¹ × 3²
  • Take the highest exponent of each prime: 2² (from 12), 3² (from 18).
  • LCM = 2² × 3² = 4 × 9 = 36

Method 3: Listing Multiples

  1. List the multiples of each number until you find a common one.
  2. That smallest common multiple is the LCM.

This is the slowest method for large inputs; the GCF identity is preferred.

Popular LCM Examples

PairLCMGCF
6 and 8242
9 and 12363
12 and 18366
15 and 25755
18 and 24726
24 and 367212

Frequently Asked Questions

What is the Least Common Multiple (LCM)?

The LCM is the smallest positive integer that is a multiple of two or more given numbers. It is widely used to find common denominators of fractions and to solve scheduling problems.

How are LCM and GCF related?

By the identity LCM(a, b) × GCF(a, b) = a × b. So once you have the GCF (via the Euclidean algorithm), the LCM follows immediately: LCM = (a × b) / GCF.

What is LCM used for?

Two major uses: (1) adding/subtracting fractions with different denominators (find the common denominator); (2) scheduling — when two repeating events occur together (every 12 days and every 18 days → coincide every LCM(12, 18) = 36 days).

LCM Calculator

Least Common Multiple Calculator