CAT Quant · Study & Practice

Perfect Squares

AreaNumber System DifficultyModerate CAT weightage1–2 questions (directly + inside factor-counting, remainders and base-system sets)

A perfect square is any integer you get by multiplying a whole number by itself: 0, 1, 4, 9, 16, 25 and so on. CAT rarely asks you to recognise a square in isolation; instead it buries the idea inside number-system questions — counting factors, finding the smallest multiplier that makes a number a perfect square, testing whether an expression can ever be a square, or working out how many squares lie in a range. The students who clear the QA cut-off treat perfect squares as a quick filter. They know a square can only end in 0, 1, 4, 5, 6 or 9, so a number ending in 2, 3, 7 or 8 is instantly rejected without any calculation. They know a perfect square is the only kind of number with an odd count of factors, because its square-root factor pairs with itself. And they know the gap between consecutive squares grows linearly, so between n² and (n+1)² there sit exactly 2n non-squares. This chapter builds those reflexes through two focused topics — the digit and digital-root properties that let you reject impostors on sight, and the factor-count test that turns "is it a perfect square?" into a one-glance check on the prime factorisation.

Topics

1 Square Properties 4 worked · 5 practice · 8-Q test Start → 2 Number of Factors Test 4 worked · 5 practice · 8-Q test Start →

⚡ CAT shortcuts & speed methods

The fastest ways to crack this chapter under time pressure — the techniques that separate a 95+ percentiler from the rest.

  • Reject on sight: any number ending in 2, 3, 7 or 8 is never a perfect square.
  • Digital-root filter: a square’s digital root is only 1, 4, 7 or 9 — roots of 2, 3, 5, 6, 8 are impossible.
  • Odd factor count ⇔ perfect square. So "odd number of divisors" always means "the squares".
  • Perfect-square test = every prime exponent in the factorisation is even.
  • Smallest multiplier to a square = product of the primes carrying an odd exponent.
  • Count of perfect squares up to M is just ⌊√M⌋; between n² and (n+1)² sit exactly 2n non-squares.

⚠️ Common mistakes & traps

CAT is designed so that careless errors here cost you marks. Internalise each trap before the exam.

  • Thinking the unit-digit or digital-root test PROVES a square — it can only reject; passing is necessary, not sufficient.
  • Counting 2n+1 instead of 2n for the non-squares strictly between n² and (n+1)².
  • Forgetting 0 and 1 are perfect squares when listing or counting them.
  • Multiplying by the full number instead of only the odd-exponent primes to reach the nearest square.
  • Assuming an odd factor count is "rare" — it is exactly the perfect squares, nothing else.

📈 CAT exam insight & PYQ analysis

In CAT and XAT, perfect squares almost never appear as a bare "is this a square?" question. They surface as the engine inside other number-system asks: counting integers in a range with an odd number of factors, finding the least multiplier or divisor that produces a square, or testing whether an algebraic expression (like n²+n+1) can ever be a perfect square. SNAP and the SSC-style sets are more direct, often asking for the smallest multiplier or the count of squares in a band. Difficulty is Moderate, but it spikes when fused with factor-counting or remainder logic. Prioritise the unit-digit reject, the digital-root filter, and the odd-factor-count equivalence — those three settle most questions in seconds.

🎴 Flashcards — instant recall

Tap a card to reveal the answer. Drill these until they are automatic.

Possible unit digits of a perfect square?Tap to reveal
0, 1, 4, 5, 6, 9
Unit digits that are NEVER a square?Tap to reveal
2, 3, 7, 8
Possible digital roots of a perfect square?Tap to reveal
1, 4, 7, 9
How many factors does a perfect square have?Tap to reveal
An odd number
Why is the factor count odd for a square?Tap to reveal
√N pairs with itself, leaving one unpaired factor
Non-square integers strictly between n² and (n+1)²?Tap to reveal
2n
Perfect-square test on prime factorisation?Tap to reveal
Every prime exponent is even
Smallest multiplier to make N a square?Tap to reveal
Product of primes with an odd exponent
Sum of the first n odd numbers?Tap to reveal
n²
How many perfect squares from 1 to 100?Tap to reveal
10 (1² to 10²)
Count of perfect squares ≤ M?Tap to reveal
⌊√M⌋
Make 1176 = 2³·3·7² a square — multiply by?Tap to reveal
6 (= 2 × 3)

📌 Quick revision

A perfect square is k². It can only end in 0, 1, 4, 5, 6 or 9, and its digital root is only 1, 4, 7 or 9 — these tests reject impostors but never prove a square. The defining structural fact: a perfect square is the unique kind of number with an ODD number of factors, because √N pairs with itself. From the prime factorisation, N is a square exactly when every exponent is even; to reach the nearest square, multiply by the primes with odd exponents. Between n² and (n+1)² lie exactly 2n non-squares, and there are ⌊√M⌋ squares up to M.

Chapter test

📝 Perfect Squares — Chapter Test
25 fresh questions · timed · full solutions
Start chapter test →
📊 My CAT analytics
Track scores, accuracy by topic and progress over time.
View analytics →

🏆 Vidaara CAT success checklist

You have truly mastered Perfect Squares when you can tick every box below.

  • Recall every formula in this chapter without looking them up
  • Solve each topic’s practice set with at least 80% accuracy
  • Use the chapter shortcuts to cut your solving time in half
  • Spot and avoid every common trap listed above
  • Score 80%+ on the timed chapter test

📋 Chapter mastery scorecard

Track where you stand. Aim for the target before moving to the next chapter.

Skill checkpointTarget
Concept theory & formulas understood100%
Topic practice sets attempted (2 topics)2/2
Best topic-test score— → 80%+
Chapter test score— → 80%+
Flashcards drilled to instant recall12 cards