Greatest Common Factor (GCF, HCF or GCD): Rules, Methods, and Examples
The greatest common factor is the largest positive integer that divides each of two or more given integers without leaving a remainder. In primary and middle school mathematics across the globe, it is widely abbreviated as GCF, highest common factor (HCF), or greatest common divisor (GCD).
What Is Greatest Common Factor (GCF, HCF or GCD)?
The greatest common factor (GCF) of two or more non-zero integers is the maximum integer that divides all of them evenly. Because every whole number has individual factors, comparing the complete factor sets of two numbers reveals their shared common factors. The largest number among those shared values is the greatest common factor.
Different international curricula use different standard terms for this concept:
- GCF (Greatest Common Factor): Standard term used across North America and international international baccalaureate programs.
- HCF (Highest Common Factor): Standard term used in the United Kingdom, India, Australia, and Commonwealth education systems.
- GCD (Greatest Common Divisor): Standard term used in higher algebra, computer science, and number theory.
All three terms describe the exact same mathematical value: .
For example, to find the greatest common factor of and , list all positive factors for each number:
- Factors of :
- Factors of :
The shared factors belonging to both sets are and . The largest shared factor is , so .
When two numbers share no positive common factor other than , their GCF is . Such numbers are called coprime (or relatively prime). For example, and share no common prime factors, so .
When to Use It
Finding the greatest common factor is essential whenever a problem involves partitioning quantities into equal, complete groups without any leftovers.
Common practical situations requiring GCF include:
- Simplifying Fractions: Dividing the numerator and denominator by their GCF reduces any fraction to its lowest terms in a single step. For instance, in , dividing both parts by gives .
- Arranging Objects in Equal Rows or Groups: Packing items of different types (such as apples and oranges) into identical gift boxes with zero remaining items.
- Tiling Rectangular Areas: Determining the largest square tiles that can completely cover a rectangular floor without cutting any tile.
- Factoring Algebraic Expressions: Factoring out the greatest common term from polynomial expressions, such as .
Use GCF when dividing quantities into maximum equal groups with zero leftovers
Do not confuse GCF problems with problems that ask about future event alignment or repeating cycles. Problems involving synchronized events rely on common multiples rather than common factors.
Step-by-Step Method
There are three primary methods to calculate the greatest common factor: factor listing, prime factorization, and the division ladder method.
Method 1: Listing Factors
- List all positive factors for each number in ascending order.
- Identify all shared common factors present in all lists.
- Select the largest factor among the shared set.
Method 2: Prime Factorization
- Write the prime factorization of each number using factor trees or repeated prime division.
- Express each prime factorization in exponent form.
- Identify all prime bases that appear in every factorization.
- For each shared prime base, pick the smallest exponent present across the factorizations.
- Multiply these minimum prime powers together to get the GCF.
Method 3: Division Ladder Method
- Write the given numbers side by side inside an inverted division step.
- Divide all numbers simultaneously by a shared prime factor.
- Write the resulting quotients directly underneath.
- Repeat the process until the quotients share no common factor other than .
- Multiply all the common prime divisors along the left column.
Visual Worked Examples
Example 1: Finding the GCF of two two-digit numbers
Question: Find the greatest common factor of and .
Method:
- Express both numbers as products of prime factors:
- Identify the prime bases shared by both numbers ( and ).
- Select the smallest exponent for each shared prime base:
- Minimum power of :
- Minimum power of :
- Multiply these minimum prime powers together.
Answer: The greatest common factor of and is .
Check: Divide both numbers by : and . The resulting quotients and share no common factor other than , confirming is the greatest common factor.
Example 2: Finding the GCF of three numbers
Question: Calculate .
Method:
- Set up the three numbers in a division ladder.
- Divide all three numbers by shared prime factor :
- , ,
- Divide the new quotients by shared prime factor :
- , ,
- Divide the quotients by shared prime factor :
- , ,
- The remaining quotients are prime to each other (coprime set).
- Multiply all common prime divisors: .
Answer: .
Check: , , . Since , is correct.
Example 3: Word problem with equal distribution
Question: A store clerk has pencils and notebooks. What is the greatest number of identical gift packages the clerk can make so that every package contains the exact same number of pencils and notebooks with no items left over?
Method:
- Identify that the maximum number of identical gift packages is given by .
- Find the prime factorizations:
- Select the shared prime factors with the smallest exponents:
- Power of :
- Power of :
- Multiply the minimum prime powers: .
- Calculate items per package:
- Pencils per package:
- Notebooks per package:
Answer: The clerk can make at most identical gift packages, with each package containing pencils and notebooks.
Check: , and . All items are used with zero remainder.
How to Check the Answer
Verify a calculated GCF using these two reliable mathematical checks:
Check 1: The Coprime Quotients Test
Divide each original number by the candidate GCF:
If , then the quotients share no common factors, proving that the candidate GCF is the greatest possible common factor.
Check 2: The GCF-LCM Product Formula
For any two positive integers and , the product of their GCF and LCM equals the product of the original numbers:
This fundamental identity links GCF and LCM directly. For example, for and , and . Checking: , and .
Common Mistakes
Common Misconception | Mathematical Reality | Correct Strategy |
Confusing GCF with LCM | GCF divides into numbers (). LCM is divisible by numbers (). | Remember: Factors are smaller or equal; Multiples are larger or equal. |
Stopping Too Early in Division | Choosing a common factor that is not the greatest common factor (e.g., stopping at for and ). | Always test whether quotients are coprime (). |
Selecting Highest Exponents in Prime Factorization | Selecting maximum exponents yields the LCM instead of the GCF. | Take the smallest exponent for shared prime factors when computing GCF. |
Stating GCF of Coprime Numbers is 0 | Positive integers always share the common factor . | The GCF of coprime numbers is always , never . |
A learning plan shaped by your child, not the class
State-aligned Math plus our own Logic and English curriculum. An adaptive baseline test finds the gaps and fills them.
Practice questions
Based on the division ladder shown above, what is the greatest common factor of and ?
Which set of numbers consists of coprime integers (numbers whose GCF is )?
and
and
and
and
and
A florist has roses and tulips. She wants to make identical bouquets containing the exact same number of roses and tulips with zero flowers left over. What is the maximum number of identical bouquets she can create?
What is the greatest common factor of , , and ?
If two positive integers and have a and a product , what is their least common multiple?

