UPSC Prelims 2025 CSAT Q29 · Numeracy
Year2025
PaperCSAT
QuestionQ29
SubjectNumeracy
Let PQR be a 3-digit number, PPT be a 3-digit number and PS be a 2-digit number, where P, Q, R, S, T are distinct non-zero digits. Further, PQR - PS = PPT . If Q = 3 and T < 6, then what is the number of possible values of (R, S) ?
- a2
- b3
- c4
- dMore than 4
Show answer & explanationHide answer
Correct answer(b) 3
There are exactly 3 valid pairs of (R, S), which are (2, 8) for T = 4, and (4, 9) and (2, 7) for T = 5.
Statement-by-statement analysis
✗ Option (a)
- This option undercounts the solutions by missing the valid pair (2, 8) obtained when T = 4.
- It incorrectly assumes only T = 5 yields valid digit pairs.
✓ Option (b)
- Expanding the equation gives 100P + 30 + R - (10P + S) = 110P + T, which simplifies to 30 + R - S = 20P + T.
- Since R - S ranges from -8 to 8, P must equal 1, simplifying the relation to S - R = 10 - T.
- Since P = 1, Q = 3, and T < 6 is a non-zero digit distinct from P and Q, T can be 2, 4, or 5.
- For T = 4, S - R = 6 gives valid pair (R, S) = (2, 8).
- For T = 5, S - R = 5 gives valid pairs (R, S) = (4, 9) and (2, 7).
- Total valid pairs equal 3.
✗ Option (c)
- This option overcounts by including pairs that violate the condition that digits must be distinct.
- For example, taking R = 3 or R = 1 duplicates the values of Q = 3 or P = 1, which is not allowed.
✗ Option (d)
- The total number of valid solutions is strictly 3.
- No other values of T or (R, S) satisfy all distinctness and non-zero constraints simultaneously.
Concept to know
- Place Value Expansion: Multi-digit numbers can be written in expanded form as PQR = 100P + 10Q + R, PPT = 110P + T, and PS = 10P + S.
- Algebraic Simplification: Substitute Q = 3 into PQR - PS = PPT to get 90P + 30 + R - S = 110P + T, which simplifies to 30 + R - S = 20P + T.
- Variable Bounding: The difference R - S of any two single digits lies between -8 and 8, forcing 22 <= 20P + T <= 38, which proves P = 1.
- Digit Constraint Filtering: Digits P, Q, R, S, T must be non-zero (1 to 9) and mutually distinct.
- Systematic Case Breakdown: Evaluate T from allowed set {2, 4, 5} using S - R = 10 - T and eliminate any pairs containing duplicate digits.
Related facts for revision
- Cryptarithms: Mathematical puzzles where digits are replaced by letters requiring place-value expansion.
- Bounding Technique in Number Theory: Finding limits on unknown variables by taking extreme values of single-digit variables.
- Distinct Digit Constraints: Combinatorial logic problems excluding repeated digits and zero.
- Unit Digit Arithmetic: Using last-digit subtraction rules to quickly eliminate invalid combinations.
How UPSC tests this
Testing place-value expansion, variable bounding, and systematic case analysis under strict logical constraints.
Trap: Candidates often forget that digits must be distinct and accidentally count pairs where R equals P=1 or Q=3, or fail to test all allowed values of T.
← Previous · Q28There are n sets of numbers each having only three positive integers with LCM…Next · Q30 →Consider the sequence AB_CC_A_BCCC_BBC_C that follows a certain pattern. Which…
More Numeracy PYQs
How many words can one form by shuffling the letters of the word QUEUE, if Q is always followed by U? The words thus formed need not necessarily have any meaning.
See the answer & explanation →
X, Y and Z jump forward 4', 6' and 5', respectively. At 8 AM, they all land on mark 199'. How many times will they all land on the same mark (need not be at the same moment) between mark 195' and 1000', if all of them cross mark…
See the answer & explanation →
A toy T jumps forward or backward. In each forward jump, it moves 5' forward whereas in each backward jump, it moves 2' backward. If in 31 jumps, T moves exactly 15' forward, then what is the difference of the number of forward…
See the answer & explanation →
If 10^m × 1000 × n = 75^25 × 25^32 × 32^75, where n is not divisible by 10, then the value of m is
See the answer & explanation →Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.