Euclid's Algorithm Calculator
Enter 2 whole numbers to find the greatest common factor (GCF) and see how the result is found using the Euclidean Algorithm.
How to find the GCF using Euclid's Algorithm
"If the numbers are large, so that factoring them is hard, the best way to find the GCD is using Euclid's Algorithm. From the larger one, subtract the biggest multiple of the smaller one you can without getting a negative answer. Replace the larger number with the answer you got. Repeat this until the last number computed is zero, and the GCD is the next-to-last number computed."1
 The Math Forum: LCD, LCM.
Cite this content, page or calculator as: