CSAT Solved Papers/ 2023/Q25

2023 CSAT — Q25

Quant Number theory 2.5 marks Medium

Let xx be a positive integer such that 7x+967x + 96 is divisible by xx. How many values of xx are possible?

  1. A 10
  2. B 11
  3. C 12 Answer
  4. D Infinitely many

Worked rationale

If x∣7x+96x \mid 7x + 96, then since x∣7xx \mid 7x, we must have x∣96x \mid 96. Conversely every divisor of 9696 works. So the number of valid xx equals the number of positive divisors of 9696.

Factorise: 96=25×396 = 2^5 \times 3. The divisor count is

(5+1)(1+1)=6×2=12.(5 + 1)(1 + 1) = 6 \times 2 = 12.

Answer: (c) 12.

Why the other options miss

  • A
    mishandled a repeated factor: mis-factors 9696 (e.g. 24⋅3⋅?2^4 \cdot 3 \cdot ?) or applies the exponent+1+1 rule to a wrong exponent, undercounting divisors.
  • B
    off by one: computes 1212 then drops x=1x = 1 or x=96x = 96 as “trivial,” or forgets to add 11 to one exponent.
  • D
    solved the wrong question: reasons ”7x7x is always divisible by xx, so any xx works,” forgetting the +96+96 term that pins x∣96x \mid 96.

Specialist insight

The whole problem is the one-line reduction x∣7x+96  ⟺  x∣96x \mid 7x + 96 \iff x \mid 96 (subtract the obvious multiple 7x7x). Then it is a pure divisor-count: 96=25⋅3⇒(5+1)(1+1)=1296 = 2^5\cdot 3 \Rightarrow (5+1)(1+1) = 12. The seductive wrong answer is (d) “infinitely many,” which catches anyone who sees only the 7x7x and misses that the constant 9696 bounds the divisors. CSAT routinely hides a divisor-count behind a divisibility phrasing.

The trap, in one line

x∣7x+96  ⟺  x∣96x\mid 7x+96 \iff x\mid 96; 96=25⋅396 = 2^5\cdot 3 has (5+1)(1+1)=12(5+1)(1+1)=12 divisors ⇒\Rightarrow (c).

← All 2023 CSAT questions