AbraCalc

GCD Calculator

Find the Greatest Common Divisor (GCD) of two integers instantly.

Embed this tool on your site

How to use this tool

  1. Enter first number and second number in the fields above.
  2. Results update instantly as you type — or click Calculate.
  3. Read your gcd and the full breakdown beneath it.

Enter two integers to find their Greatest Common Divisor (GCD) using the Euclidean algorithm.

Frequently asked questions

What is GCD?
The Greatest Common Divisor (GCD) of two integers is the largest positive integer that divides both numbers without a remainder.

References & sources