How gcd calculator works
Euclid’s remainder algorithm finds the greatest common divisor.
Try an example
48, 18 → 6.
Good to know
Safe integers only. GCD(0,0) is returned as 0 by convention.
Your privacy
Processing happens on this device. We do not upload your input, put it in share links or save it to your favourites. Closing this tab discards the working input; downloaded results remain wherever you save them.