EdiShorts

UPSC Prelims 2026 CSAT Q19 · Numeracy

Year2026
PaperCSAT
QuestionQ19
SubjectNumeracy

If 10^m × 1000 × n = 75^25 × 25^32 × 32^75, where n is not divisible by 10, then the value of m is

  1. a101
  2. b111
  3. c121
  4. d131
Show answer & explanationHide answer
Correct answer(b) 111

The right side is 2^375 × 3^25 × 5^114, so it contains exactly 10^114 (limited by the 114 fives); then m + 3 = 114 gives m = 111.

Statement-by-statement analysis

✗ Option (a)
  • If m = 101, the left side has 10^101 × 10^3 = 10^104.
  • Then n = 2^(375 − 104) × 3^25 × 5^(114 − 104) = 2^271 × 3^25 × 5^10.
  • This n contains both 2 and 5, so it is divisible by 10, which the question forbids.
✓ Option (b)
  • Right side = 3^25 × 5^50 × 5^64 × 2^375 = 2^375 × 3^25 × 5^114.
  • The largest power of 10 in it is 10^min(375, 114) = 10^114.
  • m + 3 = 114 gives m = 111, and n = 2^261 × 3^25 has no factor 5, so n is not divisible by 10.
✗ Option (c)
  • If m = 121, the left side needs 10^124, which means 5^124.
  • The right side has only 5^114, and 124 > 114.
  • So n would have to be a fraction, which is impossible.
✗ Option (d)
  • If m = 131, the left side needs 10^134, which means 5^134.
  • Only 5^114 is available, so the equality cannot hold with n a whole number.

Concept to know

  • Break every base into primes: 75 = 3 × 5^2, 25 = 5^2, 32 = 2^5, 1000 = 2^3 × 5^3, and 10^m = 2^m × 5^m.
  • Use power rules: (a^p)^q = a^(pq) and a^p × a^q = a^(p+q). So 75^25 = 3^25 × 5^50 and 32^75 = 2^375.
  • Each factor of 10 needs one 2 and one 5. The power of 10 in a number is therefore min(power of 2, power of 5).
  • The condition 'n is not divisible by 10' means every possible factor of 10 must already sit in 10^m × 1000. So the exponent of 10 on the left must equal min(375, 114).
  • Compare exponents, not the values of the prime powers. Here 114 < 375, so the count of fives is the limit.
  • Finish with the extra constant: m + 3 = 114, so m = 111.

Related facts for revision

  • Trailing zeros of a product or power expression equal min(total 2s, total 5s). This question is that idea in disguise.
  • Trailing zeros of n! = [n/5] + [n/25] + [n/125] + ...; for example, 100! has 20 + 4 = 24 zeros.
  • Variation: 'highest power of 6 (or 12, or 15) dividing an expression'. Factor the divisor into primes and take the limiting prime count.
  • Variation: 'n is not divisible by 2' or 'by 5'. Then match that single prime's full exponent instead of the minimum.
  • Spot the type when large powers are equated to 10^m × something with a non-divisibility condition. Go straight to counting 2s and 5s.
How UPSC tests this

Prime factorisation, laws of exponents and the minimum-of-2s-and-5s rule for powers of 10.

Trap: Some candidates match the power of 2 and get m + 3 = 375, m = 372; others forget to subtract the 3 from 1000 and pick 114. Option (a), 101, comes from miscounting the fives, for example adding only 50 + 64 − 13. Time-saver: count only the fives (25 × 2 + 32 × 2 = 50 + 64 = 114), since 32^75 clearly gives far more twos, then subtract 3.

More Numeracy PYQs

All Numeracy questions →

Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.