Skip to main content

GCF Calculator

Calculate the Greatest Common Factor (GCF/GCD) of two or three numbers with step-by-step calculation.

Advertisement

First number.

Second number.

Optional third number. Leave 0 to skip.

AI Math Assistant

Beta

Ask questions about your calculation results

I can help you understand your results and explore your options. Try asking:

3 free questions per session

AI provides general assistance. Always verify important calculations.

About This Calculator

The greatest common factor is the largest number that divides evenly into two or more integers, and it is the key to simplifying fractions to lowest terms. This calculator finds the GCF using the efficient Euclidean algorithm and also displays all common factors of the given numbers. Beyond fraction reduction, GCF appears in problems involving equal distribution, tiling patterns, and reducing ratios to simplest form.

Quick Tips

  • 1 The Euclidean algorithm finds GCF fastest — divide and use remainders.
  • 2 GCF of any number and zero is the number itself.
  • 3 Finding the GCF first makes simplifying fractions a single step.

Example Calculation

Scenario

36 roses and 48 tulips to make identical bouquets with nothing left over.

Result

GCF(36, 48) = 12 bouquets | Each: 3 roses + 4 tulips

What Is the Greatest Common Factor?

The GCF (also called GCD — Greatest Common Divisor) is the largest number that divides evenly into two or more numbers. For example, GCF(24, 36) = 12, because 12 is the largest number that divides both 24 and 36 without a remainder.

Methods to Find the GCF

Method 1: List all factors of each number and find the largest common one. Method 2: Use prime factorization — take the lowest power of each shared prime factor. Method 3: Use the Euclidean algorithm — repeatedly divide and take remainders until the remainder is 0.

The Euclidean Algorithm

The Euclidean algorithm is the most efficient method: GCF(a,b) = GCF(b, a mod b). Repeat until the remainder is 0. Example: GCF(24,36) → GCF(36,24) → GCF(24,12) → GCF(12,0) → 12. This method has been used for over 2,300 years.

Applications of GCF

GCF is used to simplify fractions (divide numerator and denominator by their GCF), reduce ratios, distribute items equally, tile rectangular areas, and solve divisibility problems. If GCF(a,b) = 1, the numbers are coprime (no common factors).

Frequently Asked Questions