ZovaTool

GCF Calculator

Result

GCF
12
LCM
1680
Coprime?
No

Euclidean algorithm (first two)

Step 1
48 = 0 × 60 + 48
Step 2
60 = 1 × 48 + 12
Step 3
48 = 4 × 12 + 0
Step 4
GCD(48, 60) = 12

How to use the GCF Calculator

  1. Enter two or more numbers separated by commas or spaces.
  2. GCF (also called GCD or HCF) is the largest number dividing every input.
  3. Euclidean algorithm steps are shown for the first pair.
Advertisement

Greatest common factor

GCF is the workhorse of fraction simplification: divide numerator and denominator by their GCF to get the reduced form.

The Euclidean algorithm computes it in O(log n) steps by repeatedly replacing the larger number with the remainder of dividing it by the smaller one.