GCD Calculator
Enter two positive whole numbers to find their greatest common divisor.
How It Works
Uses the Euclidean algorithm: repeatedly replace the larger number with the remainder of dividing it by the smaller, until the remainder is zero.
Example
The GCD of 48 and 18 is 6.
Frequently Asked Questions
- What is GCD used for?
- It's commonly used to simplify fractions to their lowest terms.
Related Calculators
- LCM CalculatorCalculate the least common multiple (LCM) of two numbers.
- Cube Root CalculatorCalculate the cube root of any number, including negative numbers.
- Exponent CalculatorCalculate a base number raised to any exponent.
- Factorial CalculatorCalculate the factorial of a non-negative whole number.
- Log CalculatorCalculate the logarithm of a number for any base.
- Modulo CalculatorCalculate the remainder when dividing one number by another.