🧱 GCD / GCF Calculator
Uses Euclid's algorithm and shows the steps for the first pair.
Loading calculator…
How it's calculated
gcd(a, b) = gcd(b, a mod b) until the remainder is 0.
Results are estimates for information only. Calculations run privately in your browser.