GCD Calculator
Greatest common divisor of two or more integers, Euclidean algorithm.
Rated 4.7 out of 5 based on 340 reviews
How to use GCD Calculator
- Enter integers. Leave a field blank only when the page says the value is missing, not by typing 0 unless 0 is a real value.
- Read the result rows under the form. Errors appear in the status line. Nothing is uploaded.
- Rounding follows IEEE floating point in this browser unless the page says it uses integers or BigInt.
GCD Calculator
Euclidean GCD
| Computes | Greatest common divisor of two or more integers, Euclidean algorithm. |
|---|---|
| Includes | Euclidean GCD |
| Includes | Two or more integers |
| Engine | percentage |
| Upload | None |
| Advice | Arithmetic only |
What GCD Calculator is
GCD(48, 18) = 6. GCD of a list folds pairwise. GCD(n, 0) = |n|. GCD(0, 0) is 0 on this page.
The formula runs in this tab. CZNull does not receive the numbers.
How this page computes
LCM(a, b) = |ab| / GCD(a, b) on the LCM page. Fractions reduce with the same GCD.
Entities and related jobs
Greatest common divisor of two or more integers, Euclidean algorithm. Named features: Euclidean GCD, Two or more integers.
See also LCM Calculator, Fraction Calculator, Prime Factorization, Percentage Calculator, Scientific Calculator, Average Calculator.
Use cases
Simplifying fractions and scheduling repeating cycles that must line up.
Limits
Invalid input appears in the status line. IEEE floating point applies unless a row says otherwise. CZNull does not receive the numbers.