GCD Calculator

Find the greatest common divisor (also called greatest common factor) of two whole numbers.

Calculate

Enter your values below.

Result

GCD
0

Formula used

Calculated using the Euclidean algorithm: repeatedly replace the larger number with the remainder of dividing it by the smaller number, until the remainder is zero.

Example: GCD(48, 18) = 6.

How to use this calculator

  1. Enter First integer, Second integer.
  2. Press Calculate to see your result instantly.

FAQ

Frequently asked questions

What is the greatest common divisor?

The largest positive integer that divides both numbers exactly, with no remainder.

What algorithm is used?

The Euclidean algorithm, a fast and standard method for finding GCD.

What if one number is 0?

The GCD of any number and 0 is the other number itself.

How is GCD related to LCM?

For two numbers, GCD × LCM equals the product of the two numbers.