GCF Calculator
GCF of Two Numbers
Calculate the greatest common factor of two numbers
GCF of Three Numbers
Calculate the greatest common factor of three numbers
Formula
GCF using Euclidean Algorithm: GCF(a, b) = GCF(b, a mod b) until remainder = 0
Frequently Asked Questions
What is the Greatest Common Factor (GCF)?
The GCF (also called GCD - Greatest Common Divisor) is the largest positive integer that divides two or more numbers without leaving a remainder. For example, the GCF of 12 and 18 is 6.
How does the Euclidean algorithm work?
The Euclidean algorithm repeatedly divides the larger number by the smaller and takes the remainder, until the remainder is zero. The last non-zero remainder is the GCF.