GCD Calculator
Inputs
GCD Calculator
Greatest common divisor (HCF) of integers.
Primary result
GCD
6
Breakdown
Numbers48, 18
Formula
Euclidean algorithm: gcd(a,b) = gcd(b, a mod b)
Repeated remainder steps find the largest integer that divides every input.
Example
GCD(48,18) = 6
FAQ
Is GCD the same as HCF?
Yes.
Related calculators
LCM Calculator
Least common multiple of two or more integers.
Fraction Calculator
Add, subtract, multiply, divide and simplify fractions.
Ratio Calculator
Simplify a ratio and scale it to a given part.
Average Calculator
Arithmetic mean of a list of numbers.
Prime Number Calculator
Check if a number is prime and list its prime factors.
Random Number Generator
Generate random integers in a range using crypto-quality randomness when available.