Euclid's Algorithm Calculator
Enter two whole numbers to find the greatest common factor (GCF). See the work and learn how to find the GCF using the Euclidean Algorithm.
How to Find the GCF Using Euclid's Algorithm
- Given two whole numbers where a is greater than b, do the division a ÷ b = c with remainder R.
- Replace a with b, replace b with R and repeat the division.
- Repeat step 2 until R=0.
- When R=0, the divisor, b, in the last equation is the greatest common factor, GCF.
Since greatest common factor (GCF) and greatest common divisor (GCD) are synonymous, the Euclidean Algorithm process also works to find the GCD.
To find the GCF of more than two values see our Greatest Common Factor Calculator.
For more information and examples using the Euclidean Algorithm see our GCF Calculator and the section on Euclid's Algorithm.
The Math Forum: LCD, LCM.
Rutgers University Department of Mathematics: The Euclidean Algorithm.
Cite this content, page or calculator as: