Find the Highest Common Factor (HCF) or Greatest Common Divisor (GCD) of numbers.
Result
Save as
GCD(a, b) = GCD(b, a mod b) until remainder is 0
Numbers: 36, 60, 84.
Highest Common Factor (HCF / GCD): 12.
Find the Least Common Multiple (LCM) of two or more numbers with step factorization.
Open calculatorPerform arithmetic operations on proper and improper fractions with step-by-step simplification.
Open calculatorSimplify ratios, solve missing terms in proportions (A:B = C:D), and divide amounts into parts.
Open calculatorCalculate percentage of a value, percentage change, and ratio percentage instantly.
Open calculatorHighest Common Factor (HCF) and Greatest Common Divisor (GCD) are identical terms representing the largest integer that divides all numbers without leaving a remainder.
The Euclidean algorithm is an efficient method for computing the GCD of two integers by repeatedly taking remainders: GCD(a, b) = GCD(b, a % b) until the remainder equals zero.
Determining the highest common factor is crucial for simplifying complex fractions, factoring polynomials, and cryptography algorithms like RSA.