HOW IT IS CALCULATED
Find the greatest common divisor
Find the largest integer that divides both input values without a remainder.
Instant resultClear formulaRuns locally
01Values
02GCD(a,b)
03Result
GCD(48,18) = 6
GCD is useful for simplifying ratios and fractions
Dividing numerator and denominator by their GCD reduces a fraction to lowest terms.
02
In short
What logic does the calculator use?
GCD(a,b)
Example?
GCD(48,18) = 6