GCF / GCD Calculator
Find the greatest common factor (GCF) — also called GCD — of two or more integers. Uses the Euclidean algorithm and shows step-by-step working. Useful for simplifying fractions.
GCF
6
How to use the gcf / gcd calculator
Enter two or more integers separated by commas, spaces, or new lines.
Formula & explanation
GCF (greatest common factor) is computed using Euclid's algorithm: gcd(a, b) = gcd(b, a mod b), repeated pairwise across the list.
Examples
GCF(12, 18) = 6. GCF(12, 18, 24) = 6. GCF(7, 11) = 1 (coprime).
Frequently asked questions
- Same as GCD?
- Yes — 'greatest common factor' and 'greatest common divisor' are the same thing.
Related math tools
- Scientific CalculatorFull scientific calculator with trigonometric functions (sin, cos, tan), logarithms, exponents, factorials, and constants. Supports degree and radian mode.
- Average CalculatorCalculate mean, median, mode, range, sum, min, and max for any list of numbers. Paste in grades, scores, or measurements — results update instantly.
- Ratio CalculatorSimplify ratios to lowest terms, convert a ratio to a decimal, scale to any value, and compare two ratios. For recipes, map scales, and aspect ratios.
- Root CalculatorCalculate square roots, cube roots, and any nth root with high precision. Handles perfect squares and irrational results — shows the decimal approximation and the radical form.
- LCM CalculatorFind the least common multiple of any set of integers. Shows prime factorization and step-by-step working — useful for adding fractions, scheduling problems, and number theory.
- Permutation & Combination CalculatorCalculate nPr (permutations) and nCr (combinations) with a step-by-step formula breakdown. Enter n and r to see the count, formula expansion, and intermediate values.