Number of Factors Test
The factor count gives a clean, calculation-proof test for perfect squares. Write the prime factorisation N = p^a · q^b · r^c …; the total number of factors is (a+1)(b+1)(c+1)…. A number is a perfect square exactly when every prime exponent is even — because pairing primes into two equal halves needs even powers. A beautiful consequence: a perfect square is the only kind of number with an ODD number of factors. Every factor d pairs with N/d, and these pairings cover all factors in twos — except when d = N/d = √N, which happens only for a square, leaving one unpaired factor and an odd total. CAT uses this two ways. Forward: "how many of 1–100 have an odd number of factors?" Answer: the perfect squares, 1, 4, …, 100 — that is 10. Backward: to make N a perfect square, multiply by the product of exactly those primes whose exponent is currently odd, lifting each odd power to the next even power.
✅ 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
Identity & gap rules
| Perfect square definition | N = k² for some integer k ≥ 0 |
|---|---|
| Possible unit digits | last digit ∈ {0, 1, 4, 5, 6, 9} only |
| Digital root of a square | digital root ∈ {1, 4, 7, 9} only |
| Non-squares between n² and (n+1)² | (n+1)² − n² − 1 = 2n |
| Sum of first n odd numbers | 1 + 3 + 5 + … + (2n−1) = n² |
Factor-count power-tools
| Number of factors | if N = p^a · q^b · r^c then d(N) = (a+1)(b+1)(c+1) |
|---|---|
| Perfect-square test | N is a square ⇔ every prime exponent a, b, c … is even |
| Odd factor count | d(N) is odd ⇔ N is a perfect square |
| Smallest multiplier to a square | multiply by the product of primes with odd exponent |
| Squares ≤ M | count = ⌊√M⌋ |