EdiShorts

UPSC Prelims 2022 CSAT Q55 · Numeracy

Year2022
PaperCSAT
QuestionQ55
SubjectNumeracy

There is a numeric lock which has a 3-digit PIN. The PIN contains digits 1 to 7. There is no repetition of digits. The digits in the PIN from left to right are in decreasing order. Any two digits in the PIN differ by at least 2. How many maximum attempts does one need to find out the PIN with certainty?

  1. a6
  2. b8
  3. c10
  4. d12
Show answer & explanationHide answer
Correct answer(c) 10

Systematic case enumeration or the combinatorial gap method yields exactly 10 valid PIN combinations satisfying all conditions.

Statement-by-statement analysis

✗ Option (a)
  • Incorrect because 6 only accounts for PINs ending in the digit 1.
  • It ignores valid PINs ending in digits 2 and 3, leading to an undercount.
✗ Option (b)
  • Incorrect because 8 misses two valid combinations.
  • It fails to systematically count all valid decreasing sequences meeting the gap constraint.
✓ Option (c)
  • Correct because listing all valid 3-digit PINs gives exactly 10 combinations.
  • PINs ending in 1 are 531, 631, 731, 641, 741, 751 (6 combinations).
  • PINs ending in 2 are 642, 742, 752 (3 combinations) and PIN ending in 3 is 753 (1 combination), totaling 6 + 3 + 1 = 10 attempts.
✗ Option (d)
  • Incorrect because 12 overcounts the possible combinations.
  • It includes invalid pairs that do not maintain a minimum difference of 2 between adjacent digits.

Concept to know

  • Maximum attempts with certainty refers to the worst-case scenario, which equals the total number of valid PIN combinations.
  • Let the 3-digit PIN from left to right be d1, d2, d3 with constraints d1 > d2 > d3, d1 - d2 >= 2, and d2 - d3 >= 2.
  • Method 1: Systematic listing by fixing the rightmost digit d3 from minimum value 1 to maximum possible value 3.
  • Method 2: Combinatorial Gap Formula. Choosing k numbers from n numbers with a minimum gap of g corresponds to selecting k numbers from n - (k - 1)(g - 1) numbers without restriction.
  • Applying the formula with n = 7, k = 3, and g = 2 gives 7 - (3 - 1)(2 - 1) = 5 available choices, resulting in 5C3 = 10 combinations.

Related facts for revision

  • Worst-case guarantee problems where maximum trials equal total valid state counts.
  • Selection of non-consecutive items or items with specific difference constraints.
  • Permutations and combinations under inequality constraints such as strictly increasing or decreasing sequences.
How UPSC tests this

Ability to count valid combinations systematically under multiple inequality and gap constraints.

Trap: Stopping early after finding 6 combinations for units digit 1, or forgetting that the formula 5C3 directly avoids manual counting errors.

More Numeracy PYQs

All Numeracy questions →

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