EdiShorts

UPSC Prelims 2025 CSAT Q58 · Numeracy

Year2025
PaperCSAT
QuestionQ58
SubjectNumeracy

The 5-digit number PQRST (all distinct digits) is such that T ≠ 0. P is thrice T. S is greater than Q by 4, while Q is greater than R by 3. How many such 5-digit numbers are possible ?

  1. a3
  2. b4
  3. c5
  4. d6
Show answer & explanationHide answer
Correct answer(b) 4

By dividing the conditions into valid digit sets for (R, Q, S) and (T, P), exactly 4 non-overlapping combinations satisfy all distinct-digit constraints.

Statement-by-statement analysis

✗ Option (a)
  • 3 is incorrect because it misses one of the valid distinct-digit combinations.
  • Candidates often overlook the combination of Pair (3, 9) with Triplet (1, 4, 8) which forms the valid number 94183.
  • Systematic evaluation reveals 4 solutions in total rather than 3.
✓ Option (b)
  • Since S = Q + 4 and Q = R + 3, we get S = R + 7, giving three possible triplets (R, Q, S) = (0, 3, 7), (1, 4, 8), and (2, 5, 9).
  • Since T != 0 and P = 3T, single-digit constraints give three possible pairs (T, P) = (1, 3), (2, 6), and (3, 9).
  • Testing all 9 combinations for distinct digits yields exactly 4 valid numbers: 63072, 64182, 94183, and 35291.
✗ Option (c)
  • 5 is incorrect because it includes combinations that violate the distinct digits condition.
  • Out of 9 total cross-combinations, 5 contain repeating digits across the two sets.
  • For instance, combining (0, 3, 7) with (1, 3) repeats the digit 3 for both Q and P.
✗ Option (d)
  • 6 is incorrect as it overcounts the valid solutions.
  • Only 4 combinations ensure that P, Q, R, S, T are all mutually distinct single digits from 0 to 9.

Concept to know

  • Express linked digit variables in terms of a single baseline variable to establish upper and lower bounds.
  • Since S = R + 7 and S must be a single digit 0 to 9, R can only take values 0, 1, or 2.
  • Since P = 3T and T != 0, T can only take values 1, 2, or 3 to keep P as a single non-zero digit.
  • Apply the distinct digits constraint to filter out any Cartesian product pair that shares a digit.
  • Use systematic enumeration rather than random trial-and-error to ensure no valid combination is missed.

Related facts for revision

  • Cryptarithm problems where distinct letters represent unique decimal digits.
  • Position-based digit constraint problems where leading digits cannot be zero.
  • Cartesian product listing under strict non-overlap set constraints.
  • Digit-based puzzle solving techniques for CSAT Numeracy.
How UPSC tests this

Systematic enumeration and constraint satisfaction under distinct-digit conditions.

Trap: Failing to check for overlapping digits between independent variable groups or missing the pair (T=3, P=9) with (R=1, Q=4, S=8).

More Numeracy PYQs

All Numeracy questions →

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