Calculate the Greatest Common Divisor (GCD), also known as the Greatest Common Factor (GCF) or Highest Common Factor (HCF), of two integers.
Calculate the Greatest Common Divisor (GCD), also known as the Greatest Common Factor (GCF) or Highest Common Factor (HCF), of two integers.
Enter a positive integer
Enter a positive integer
Computed using the Euclidean algorithm: GCD(a, b) = GCD(b, a mod b) until b = 0.
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
