Counting Factors
Never list divisors on the GRE — count them from the prime factorization. If n = p^a · q^b · r^c, then the number of positive factors is (a + 1)(b + 1)(c + 1). The logic: each factor chooses each prime's exponent independently from 0 up to its max, giving (a+1) choices for p, and so on. For 72 = 2³·3², the count is (3+1)(2+1) = 12 factors. A beautiful corollary the GRE tests directly: a number has an odd number of factors if and only if it is a perfect square, because only then does every (exponent + 1) term multiply out to an odd total. This single formula turns "how many divisors?" — a question that looks like tedious listing — into one multiplication you can do in your head.
✅ Solved examples
✏️ Practice — try these, take hints as needed
📝 Topic test — 8 questions
Auto-graded with full solutions; saved to your dashboard. Use the calculator and formula sheet (top-right) any time.
Formula Reference Sheet
Primes & factorization
| Prime | exactly two factors: 1 and itself |
|---|---|
| Smallest / only even prime | 2 |
| Fundamental Theorem | unique prime factorization for n > 1 |
| Primality check up to | √n (test primes ≤ √n) |
Counting from exponents
| n = p^a · q^b · r^c | number of factors = (a+1)(b+1)(c+1) |
|---|---|
| Perfect square | every prime exponent is even |
| Perfect cube | every prime exponent is a multiple of 3 |
| Odd number of factors ⇔ | n is a perfect square |