Greatest Common Factor Calculator
The Euclidean algorithm repeatedly divides until the remainder is zero.
This calculator is free to use. Enable JavaScript to enter your values and see a result instantly.
How it works
The Euclidean algorithm repeatedly divides until the remainder is zero.
Worked example
The greatest common factor of 12 and 18 is 6.
Keep in mind
Results are estimates; check the assumptions for your situation.