GCF and LCM Calculator

GCF and LCM Calculator – Greatest Common Factor & Least Common Multiple | CalcVelo
🔢 Math Tool · GCF + LCM Together

GCF and LCM Calculator

Find the Greatest Common Factor (GCF) and Least Common Multiple (LCM) of 2 or 3 numbers instantly — with step-by-step prime factorization and Euclidean algorithm breakdown.

Enter Your Numbers
Whole positive numbers only (1 or greater)
Examples:

How to Find GCF and LCM

This free GCF and LCM Calculator finds both the Greatest Common Factor and Least Common Multiple simultaneously — saving you time when you need both values (which is most of the time in school math).

GCF Formula (Prime Factorization)

GCF = Product of COMMON prime factors with LOWEST exponents
Example: GCF(12,18) → 12=2²×3, 18=2×3² → GCF=2¹×3¹=6

LCM Formula (Prime Factorization)

LCM = Product of ALL prime factors with HIGHEST exponents
Example: LCM(12,18) → 12=2²×3, 18=2×3² → LCM=2²×3²=36

GCF × LCM Relationship

GCF(A,B) × LCM(A,B) = A × B
Example: GCF(12,18)=6 and LCM(12,18)=36 → 6×36=216=12×18 ✓

When to Use GCF vs LCM

  • GCF — use for: Simplifying fractions (divide numerator and denominator by GCF), splitting things into equal groups, finding common units
  • LCM — use for: Adding and subtracting fractions (find common denominator), scheduling repeating events, finding when two cycles sync

Real-World Examples

  • Simplify 12/18: GCF(12,18)=6 → divide both by 6 → 2/3 ✓
  • Add 1/4 + 1/6: LCM(4,6)=12 → 3/12 + 2/12 = 5/12 ✓
  • Event scheduling: Bus A every 12 min, Bus B every 18 min → LCM=36 min until both arrive together
  • Tile cutting: Tiles of 12cm and 18cm → GCF=6cm is the largest equal piece

GCF Also Known As

GCF (Greatest Common Factor) = GCD (Greatest Common Divisor) = HCF (Highest Common Factor). All three names refer to the same concept — the largest number that divides evenly into all given numbers.

LCM Also Known As

LCM (Least Common Multiple) = LCD (Least Common Denominator) = LCM (Lowest Common Multiple). All refer to the same concept — the smallest number that all given numbers divide into evenly.

Euclidean Algorithm for GCF

The Euclidean algorithm is a fast method for finding GCF. Divide the larger number by the smaller, take the remainder, then repeat until the remainder is 0. The last non-zero remainder is the GCF.

GCF(48, 18): 48 ÷ 18 = 2 remainder 12
18 ÷ 12 = 1 remainder 6
12 ÷ 6 = 2 remainder 0 → GCF = 6 ✓

How to Find LCM Using GCF

LCM(A, B) = (A × B) ÷ GCF(A, B)
Example: LCM(12, 18) = (12 × 18) ÷ 6 = 216 ÷ 6 = 36 ✓

GCF and LCM of 3 Numbers

For three numbers A, B, C: find GCF(A,B) first, then find GCF of that result with C. Same approach for LCM. This calculator handles 3-number GCF and LCM automatically.

Related Calculators

Also check our Ratio Calculator, Fraction Calculator, Proportion Calculator, and all Math Calculators on CalcVelo.

Frequently Asked Questions

Scroll to Top