How it works
When you hand this tool two numbers, it cross-references the complete divisor sets of each and returns only the values where those sets overlap. Picture two circles in a Venn diagram: the left circle holds every number that divides the first input cleanly, the right circle does the same for the second input, and what this calculator reports is the intersection—the numbers sitting in the overlapping middle region.
That overlap matters because shared divisors underpin fraction reduction, ratio simplification, and modular arithmetic. If you need to scale a recipe from 48 servings to 180 servings—or shrink that ratio to its simplest form—you need to know exactly which whole numbers divide both quantities without leaving a remainder.
The tool computes the full factor list for each input independently, then filters for matches. The largest value in that shared set is the greatest common factor (GCF), also called the greatest common divisor. Unlike a single-number factor calculator that simply lists divisors of one value, this two-number comparison focuses your attention on the overlap and ranks it by size.
The formula
CommonFactors(a, b) = { d : d | a AND d | b, d ∈ ℤ⁺ }
Read the vertical bars as "divides." So d divides a and d divides b, where d is a positive integer. The result is a set, and max(CommonFactors(a, b)) gives you the GCF.
Worked example
Finding the GCF of 48 and 180 demonstrates the two-number comparison cleanly. The process walks through each input's divisors, spots the overlap, then picks the largest shared value.
Step 1 — Factor the first number (48).
Check divisors up to √48 ≈ 6.93:
- 1 → 48
- 2 → 24
- 3 → 16
- 4 → 12
- 6 → 8
Sorted: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48
Step 2 — Factor the second number (180).
Check divisors up to √180 ≈ 13.42:
- 1 → 180
- 2 → 90
- 3 → 60
- 4 → 45
- 5 → 36
- 6 → 30
- 9 → 20
- 10 → 18
- 12 → 15
Sorted: 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 30, 36, 45, 60, 90, 180
Step 3 — Identify the overlap.
| First number (48) | Second number (180) | Shared? |
|---|---|---|
| 1 | 1 | ✓ |
| 2 | 2 | ✓ |
| 3 | 3 | ✓ |
| 4 | 4 | ✓ |
| 6 | 6 | ✓ |
| 8 | — | ✗ |
| 12 | 12 | ✓ |
| 16 | — | ✗ |
| 24 | — | ✗ |
| 48 | — | ✗ |
Common factors of 48 and 180: {1, 2, 3, 4, 6, 12}
Step 4 — Select the greatest.
The largest value in the shared set is 12, so GCF(48, 180) = 12.
A quick verification: 48 ÷ 12 = 4 and 180 ÷ 12 = 15. Both results are whole numbers with no remainder, confirming the answer. You can also express this through prime factorization—48 = 2⁴ × 3 and 180 = 2² × 3² × 5—and take the minimum exponent for each shared prime: 2² × 3¹ = 12.
Tips
- Start with the smaller number. Its complete factor list is shorter, so generating that set first and testing each divisor against the larger number is faster than the reverse.
- Use the GCF to simplify fractions immediately. Since GCF(48, 180) = 12, the fraction 48/180 reduces to 4/15 in one step—divide both numerator and denominator by 12.
- Watch for prime inputs. If either number is prime and does not divide the other, the only common factor is 1, and the GCF is 1. Such pairs are called coprime or relatively prime.
- Remember that 1 is always shared. Every pair of positive integers has at least one common factor: 1. So the result set is never empty.
- Negative inputs produce the same positive factors. Convention focuses on positive divisors; the calculator handles the sign for you.
This tool provides a quick arithmetic check, not professional mathematical advice for high-stakes computations.