®

Online Calculator Resource

Euclid's Algorithm Calculator

Euclid's GCF Algorithm


Answer:

GCF = 4
for the values 816 and 2260

Solution
2260 - (816 x 2) = 628
816 - (628 x 1) = 188
628 - (188 x 3) = 64
188 - (64 x 2) = 60
64 - (60 x 1) = 4
60 - (4 x 15) = 0

GCF = 4

Share this Calculator & Page

Calculator Use

Enter 2 whole numbers to find the greatest common factor (GCF) and see how the result is found using the Euclidean Algorithm.

For more information on Euclid's Algorithm or to find the GCF of more than 2 values see our Greatest Common Factor Calculator for 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

References

[1] The Math Forum: LCD, LCM.



 

Cite this content, page or calculator as:

Furey, Edward "Euclid's Algorithm Calculator"; from http://www.calculatorsoup.com - Online Calculator Resource.

Follow CalculatorSoup: