GCD Calculator
Compute the greatest common divisor of two integers.
Input Data
A
B
Results
Greatest common divisor.
6
Explanatory note about the result.
gcd(48,18) = 6；lcm = 144。
At a glance:gcd(a,b) is the largest positive integer dividing both; computed by Euclid's algorithm gcd(a,b)=gcd(b, a mod b). Complements lcm and gcd-lcm.
Formula
gcd(a,b) = gcd(b, a mod b).
How to Use
- Enter a and b.
- The tool returns the GCD.
Case Studies
gcd(48,18)
6.
FAQ
gcd of coprime numbers?
It is 1.
Related Tools
References
Content review: Calculatorism Science Team. Results are for reference only; please refer to the relevant authorities for the official figures.