GCF Calculator

Greatest common factor (HCF/GCD) of two integers via the Euclidean algorithm.

Enter your details and press Calculate to see results.

Formula

GCD(a, b) = GCD(b, a mod b), repeating until b = 0

Example

GCD(48, 36): 48 mod 36 = 12 → GCD(36, 12): 36 mod 12 = 0 → GCF = 12.

Where GCF is used

Simplifying fractions, reducing ratios, tiling problems (largest square tile that fits evenly) and scheduling events that share cycles all rely on the GCF.

Frequently asked questions

Is GCF the same as HCF?

Yes — greatest common factor and highest common factor are different names for the same concept (also called GCD).

What if one number divides the other?

The larger number's divisor relationship wins: GCF(12, 36) = 12.