GCD Calculator
Greatest Common Divisor of any list of integers.
Best for: Use it to simplify fractions, find common measures, or in number theory.
Input
How it's calculated & sources
Free & no sign-up · runs entirely in your browser. Results are estimates for general information, not professional advice — verify important decisions with a qualified expert. Last reviewed June 2026.
How it works
GCD using Euclid's algorithm: gcd(a, b) = gcd(b, a mod b).
Example
gcd(48, 36) = 12
Frequently asked questions
What if I enter zero?+
gcd(a, 0) = a. gcd(0, 0) is conventionally 0.
Continue your journey
Where people usually head next.