UPSC Prelims 2022 CSAT Q10 · Numeracy
The digits 1 to 9 are arranged in three rows in such a way that each row contains three digits, and the number formed in the second row is twice the number formed in the first row; and the number formed in the third row is thrice the number formed in the first row. Repetition of digits is not allowed. If only three of the four digits 2, 3, 7 and 9 are allowed to use in the first row, how many such combinations are possible to be arranged in the three rows?
- a4
- b3
- c2
- d1
Show answer & explanationHide answer
Only 2 valid 3-digit numbers (273 and 327) formed from the given digits yield N, 2N, and 3N that together use all digits from 1 to 9 exactly once without repetition.
Statement-by-statement analysis
- Four combinations is incorrect.
- Only two numbers satisfy the maximum upper limit and the non-repetition condition across all three rows.
- This option occurs if a candidate includes numbers where 3N becomes a 4-digit number.
- Three combinations is incorrect.
- Testing all valid permutations below 330 shows that candidates like 239 or 329 result in repeated digits in 2N or 3N.
- Only two permutations satisfy all criteria simultaneously.
- Two combinations is correct.
- First valid arrangement is N = 273, giving rows 273, 546, and 819, using digits 1 through 9 once.
- Second valid arrangement is N = 327, giving rows 327, 654, and 981, using digits 1 through 9 once.
- One combination is incorrect because it misses the second valid number.
- Candidates selecting this often stop after finding N = 273 without testing N = 327.
Concept to know
- Constraint Bounding: Since 3N must be a 3-digit number, 3N <= 987, which restricts the first row number to N <= 329.
- Digit Selection: Given the set of allowed digits {2, 3, 7, 9}, the hundreds digit of N can only be 2 or 3.
- Permutation Testing: Generate candidate 3-digit numbers from {2, 3, 7, 9} that are <= 329 (237, 273, 239, 293, 279, 297, 327, 329).
- Uniqueness Check: Multiply each candidate N by 2 and 3, then verify that all 9 digits (1 to 9) appear exactly once across N, 2N, and 3N.
Related facts for revision
- Pandigital number problems where digits 1 to 9 are arranged to satisfy mathematical equations.
- Cryptarithms and alphametic puzzles requiring digit assignments without replacement.
- Properties of divisibility by 3 and 9 based on the sum of digits.
- Elimination of test cases using unit digit arithmetic in multiplication.
Systematic candidate filtering using numerical upper bounds followed by digit uniqueness verification across multiple generated terms.
Trap: Forgetting the upper limit N <= 329 or failing to check whether digits repeat within 2N or 3N (e.g. testing 329 where 3 x 329 = 987 repeats digits 8 and 9).
More Numeracy PYQs
Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.