Greatest Common Divisor (GCD) - Euclidean Algorithm Calculator

What is the Greatest Common Factor?

The greatest common factor of two or more whole numbers is the largest whole number that divides evenly into each of the numbers. The greatest common factor (GCF) is also referred as the GCD (greatest common denominator) but is most formally referred to as the Greatest Common Divisor (GCD).

If the arguments are both greater than zero then the algorithm can be written in more elementary terms as follows:

Greatest Common Divisor (GCD) - Euclidean Algorithm Calculator

Enter A Value:
Enter B Value:
GCD Value:
LCM Value:
Linear Combination:
Solution: