GCF Calculator (Greatest Common Factor)

Math

Find the Greatest Common Factor (GCF) of two numbers using the Euclidean algorithm.

Formula

GCF via Euclidean algorithm; LCM = |a×b| / GCF
  • Euclidean algorithm: GCF(a,b) = GCF(b, a mod b)

GCF(48, 36)

Inputs
  • Number A: 48
  • Number B: 36

GCF = 12; LCM = 144

Frequently asked questions

What is GCF?
The Greatest Common Factor is the largest integer that divides both numbers evenly.