Common Factors Calculator — Find Shared Divisors & GCF
Find the common factors and greatest common factor (GCF) of two numbers with step-by-step explanation. Learn how to identify shared divisors using prime factorization and the Euclidean algorithm. For related number theory tools, see our GCD calculator.
Table of Contents
- 1What Are Common Factors?
- 2Greatest Common Factor (GCF)
- 3How to Find Common Factors
- 4Step-by-Step Examples
- 5More Common Factor Examples
- 6The Prime Factorization Method
- 7The Euclidean Algorithm
- 8Common Factors of Three or More Numbers
- 9Common Mistakes to Avoid
- 10Real-World Applications
- 11Practice Problems with Solutions
- 12Tips for Finding Common Factors
- 13Final Thoughts
- 14FAQ: Common Questions
Find Common Factors
Enter two numbers to find all their common factors and the greatest common factor (GCF). Click Calculate for step-by-step working.
Common Factors – Complete Explanation
A common factor (or common divisor) is a number that divides evenly into two or more numbers. Finding common factors is essential for simplifying fractions, factoring algebraic expressions, and solving problems involving equal grouping. The greatest common factor (GCF) is the largest of these shared factors.
Common Factor Definition
A number d is a common factor of a and b if: a ÷ d has no remainder AND b ÷ d has no remainder. The GCF is the largest such number.
Every pair of positive integers has at least one common factor: 1.
1. What Are Common Factors?
When two numbers share a factor, that factor divides both numbers exactly. For example, 6 is a common factor of 24 and 36 because:
- 24 ÷ 6 = 4 (exact division, no remainder)
- 36 ÷ 6 = 6 (exact division, no remainder)
Key terminology:
- Common Factor: Any number that divides both given numbers evenly.
- Greatest Common Factor (GCF): The largest common factor. Also called GCD or HCF.
- Coprime: Two numbers whose only common factor is 1 (e.g., 8 and 15).
2. Greatest Common Factor (GCF)
The GCF is the most important common factor because it's used to:
- Simplify fractions: Divide numerator and denominator by their GCF to get simplest form.
- Factor polynomials: The GCF of coefficients is factored out of algebraic expressions.
- Solve problems: Finding the largest equal grouping possible.
Example: GCF of 24 and 36 = 12
• 24 ÷ 12 = 2, 36 ÷ 12 = 3
• Fraction 24/36 simplifies to 2/3 by dividing by GCF 12
• Common factors: 1, 2, 3, 4, 6, 12 → GCF is 12
3. How to Find Common Factors
There are three main methods:
Method 1 — List All Factors:
1. List all factors of each number.
2. Identify the factors that appear in both lists.
3. The largest is the GCF.
• Best for: Small numbers.
Method 2 — Prime Factorization:
1. Find the prime factorization of each number.
2. Identify common prime factors.
3. Multiply them, using the minimum exponent for each common prime.
• Best for: Medium to large numbers.
Method 3 — Euclidean Algorithm:
1. Divide the larger by the smaller, take the remainder.
2. Replace the larger with the smaller, and the smaller with the remainder.
3. Repeat until remainder = 0. The last non-zero remainder is the GCF.
• Best for: Very large numbers or computer implementation.
4. Step-by-Step Examples
Example 1: Common Factors of 24 and 36 (List Method)
Find all common factors and the GCF of 24 and 36.
Step 1: List all factors of 24: 1, 2, 3, 4, 6, 8, 12, 24
Step 2: List all factors of 36: 1, 2, 3, 4, 6, 9, 12, 18, 36
Step 3: Common factors: 1, 2, 3, 4, 6, 12
Step 4: GCF = 12 (the largest common factor)
Result: Common factors = {1, 2, 3, 4, 6, 12}, GCF = 12
Example 2: GCF of 48 and 60 (Prime Factorization Method)
Find the GCF of 48 and 60 using prime factorization.
Step 1: Prime factorize:
48 = 2⁴ × 3
60 = 2² × 3 × 5
Step 2: Common primes with minimum exponents:
2² (minimum of 2⁴ and 2²)
3¹ (minimum of 3¹ and 3¹)
Step 3: GCF = 2² × 3 = 4 × 3 = 12
Result: GCF(48, 60) = 12
5. More Common Factor Examples
GCF of 18 and 27: 18=2×3², 27=3³ → GCF = 3² = 9
GCF of 14 and 21: 14=2×7, 21=3×7 → GCF = 7
GCF of 16 and 25: 16=2⁴, 25=5² → GCF = 1 (coprime)
GCF of 12, 18, and 24: Common primes: 2×3 = 6
6. The Prime Factorization Method
This method is systematic and works for any size numbers:
- Prime factorize each number completely.
- List all primes that appear in all factorizations.
- For each common prime, take the smallest exponent that appears.
- Multiply these primes raised to their minimum exponents — the result is the GCF.
Example: GCF of 72 and 90
72 = 2³ × 3²
90 = 2 × 3² × 5
Common primes: 2 (min exponent 1), 3 (min exponent 2)
GCF = 2¹ × 3² = 2 × 9 = 18
7. The Euclidean Algorithm
The Euclidean algorithm is an efficient method for finding the GCF without needing to factor either number.
Find GCF of 48 and 18:
48 ÷ 18 = 2 remainder 12
18 ÷ 12 = 1 remainder 6
12 ÷ 6 = 2 remainder 0
Last non-zero remainder: GCF = 6
8. Common Factors of Three or More Numbers
To find common factors of three or more numbers, find the GCF of the first two, then find the GCF of that result with the third number:
Find GCF of 24, 36, and 60:
Step 1: GCF(24, 36) = 12
Step 2: GCF(12, 60) = 12
Result: GCF(24, 36, 60) = 12
9. Common Mistakes to Avoid
- Confusing GCF with LCM: GCF is the largest common factor; LCM is the smallest common multiple.
- Stopping too early: Finding 4 as a common factor of 24 and 36 is correct, but 12 is the greatest.
- Forgetting 1: 1 is always a common factor. Include it in your list.
- Multiplying instead of taking the minimum exponent: Use the smallest exponent for common primes.
- Assuming large numbers always have large GCFs: 1000 and 1001 are coprime — their GCF is 1.
10. Real-World Applications
- Simplifying Fractions: Divide numerator and denominator by their GCF to reduce to simplest form.
- Equal Grouping: 24 apples and 36 oranges → GCF 12 tells the largest equal groups.
- Factoring Polynomials: 12x² + 18x = 6x(2x + 3).
- Recipe Scaling: Finding the GCF for the largest common batch size.
- Construction: Determining the largest tile size fitting evenly into wall dimensions.
- Cryptography: The Euclidean algorithm for GCF is used in RSA encryption.
11. Practice Problems with Solutions
Problem 1: Find all common factors of 18 and 30.
Solution: Common: 1, 2, 3, 6
Problem 2: Find the GCF of 56 and 98.
Solution: GCF = 2×7 = 14
Problem 3: Simplify 45/75 using the GCF.
Solution: GCF(45,75)=15 → 3/5
Problem 4: Are 21 and 55 coprime?
Solution: GCF=1 → Yes, coprime
12. Tips for Finding Common Factors
- Start with small prime factors (2, 3, 5) — they're easiest to spot.
- Use the Euclidean algorithm for large numbers.
- The GCF of any number and 0 is the number itself: GCF(a, 0) = a.
- If one number divides the other evenly, the smaller is the GCF.
- Consecutive integers are always coprime: GCF(n, n+1) = 1.
- For fraction simplification, always divide by the GCF.
13. Final Thoughts
Common factors and the greatest common factor are fundamental concepts that connect arithmetic to algebra. From simplifying fractions to factoring polynomials, the GCF is a tool you'll use throughout your mathematical journey. Understanding how to find it efficiently gives you flexibility and confidence in working with numbers.
Master the GCF alongside its partner the LCM, and you'll have complete command of the relationship between factors and multiples. Use this calculator to verify your manual work, but practice until finding common factors becomes systematic and reliable.
14. Frequently Asked Questions
The GCF (greatest common factor) is the largest number that divides evenly into two or more numbers. The LCM (least common multiple) is the smallest number that is a multiple of all given numbers. For 4 and 6: GCF = 2, LCM = 12. The GCF simplifies fractions; the LCM finds common denominators.
Two numbers are coprime (or relatively prime) when their only common factor is 1. For example, 8 and 15 are coprime because the factors of 8 are 1, 2, 4, 8 and the factors of 15 are 1, 3, 5, 15 — they share only 1. Consecutive integers are always coprime.
Use the list method for small numbers (≤ 50), prime factorization for medium numbers (≤ 1000), and the Euclidean algorithm for large numbers or when implementing in code. All three methods give the same result.
Divide both numerator and denominator by their GCF. For example, to simplify 24/36: GCF(24, 36) = 12, so 24 ÷ 12 = 2 and 36 ÷ 12 = 3. The simplified fraction is 2/3. Using the GCF ensures you simplify in one step.
Find the GCF of the first two numbers, then find the GCF of that result with the third number. For example, GCF(24, 36, 60): GCF(24, 36) = 12, then GCF(12, 60) = 12. The result is 12. This works for any number of inputs.
The Euclidean algorithm finds the GCF by repeated division. It doesn't require factorization, making it very efficient for large numbers. It works by replacing the larger number with the remainder when divided by the smaller, repeating until the remainder is 0. The last non-zero remainder is the GCF.
The GCF is found by multiplying the common prime factors, each raised to the minimum exponent that appears in both factorizations. For example, 72 = 2³ × 3² and 90 = 2 × 3² × 5. Common primes: 2¹ and 3² → GCF = 2 × 9 = 18.
Explore Math Topics
Continue your learning journey with our other math guides
Related Calculators
Explore these other math tools that complement common factors:
- 🔹 GCD Calculator — Find the greatest common divisor of any numbers.
- 🔹 Factors of a Number Calculator — Find all factors and factor pairs.
- 🔹 LCM Calculator — Find the least common multiple of numbers.
- 🔹 Prime Factorization Calculator — Break down numbers into prime factors.
- 🔹 Common Multiples Calculator — Find shared multiples of numbers.
- 🔹 Divisibility Checker — Test if a number divides evenly into another.
Conclusion
Common factors and the greatest common factor are fundamental concepts that connect arithmetic to algebra. Use this calculator to verify your manual work, but practice until finding common factors becomes systematic and reliable.
Readers who wish to continue practicing and reinforce what they've learned can explore the companion learning resource for guided exercises.