CSAT Solved Papers/ 2025/Q35

2025 CSAT — Q35

Quant Number theory 2.5 marks Medium

What is the maximum value of nn such that 7×343×385×1000×2401×777777 \times 343 \times 385 \times 1000 \times 2401 \times 77777 is divisible by 35n35^n?

  1. A 3
  2. B 4 Answer
  3. C 5
  4. D 7

Worked rationale

35=5×735 = 5 \times 7, so 35n35^n needs nn fives and nn sevens. The answer is min(ν5,ν7)\min(\nu_5, \nu_7) over the whole product, where νp\nu_p is the total power of pp.

Factor each term, tracking only 55s and 77s:

termν7\nu_7ν5\nu_5
771100
343=73343 = 7^33300
385=5711385 = 5\cdot7\cdot111111
1000=23531000 = 2^3 5^30033
2401=742401 = 7^44400
77777=71111177777 = 7 \cdot 111111100
total10\mathbf{10}4\mathbf{4}

(Note 77777=7×11111=7×41×27177777 = 7 \times 11111 = 7 \times 41 \times 271 — one factor of 77, no 55.)

ν5=4,ν7=10  n=min(4,10)=4.\nu_5 = 4,\quad \nu_7 = 10 \ \Rightarrow\ n = \min(4, 10) = 4.

The supply of 55s is the bottleneck.

Answer: (b) 4.

Why the other options miss

  • A
    miscounted a repeated factor: counts the 55s only in 10001000 (535^3) and misses the single 55 hidden in 385385, under-counting ν5\nu_5 to 33.
  • C
    an arithmetic slip: mis-adds the 55s (e.g. reads 1000=531000 = 5^3 plus a phantom extra) or averages the two valuations.
  • D
    wrong formula: counts only ν7\nu_7-like quantities, or takes the max instead of the min of the two prime supplies, ignoring that 35n35^n needs both.

Specialist insight

For “highest power of a composite dividing a product,” factor the divisor into primes and take the minimum of the per-prime supplies — never the maximum, never the sum. Here 77 is abundant (ν7=10\nu_7 = 10) but 55 is scarce (ν5=4\nu_5 = 4), so 55 caps nn at 44. The deadliest slip is missing the 55 camouflaged inside 385=5711385 = 5\cdot7\cdot11 (the obvious source is 10001000, but 385385 quietly adds one). The discipline: factor every term fully, sum each prime separately, take the min. Watch for the “ugly” factor (7777777777) designed to look like it might add a 55 — it does not.

The trap, in one line

35n35^n needs nn fives *and* nn sevens, so n=min(ν5,ν7)=min(4,10)=4n = \min(\nu_5,\nu_7) = \min(4,10) = 4 — the 55s (don't miss the one in 385385) are the bottleneck.

← All 2025 CSAT questions