Calculate the Greatest Common Divisor (GCD), also known as the Greatest Common Factor (GCF) or Highest Common Factor (HCF), of two integers.
Enter your values below
How this calculator works
Computed using the Euclidean algorithm: GCD(a, b) = GCD(b, a mod b) until b = 0.
Common questions about this calculator
