CSAT Solved Papers/ 2022/Q55
2022 CSAT — Q55
There is a numeric lock which has a -digit PIN. The PIN contains digits to . 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 . How many maximum attempts does one need to find out the PIN with certainty?
Worked rationale
The number of attempts to be certain equals the number of valid PINs. A PIN is a strictly decreasing triple from with adjacent differences : and (these force every pair to differ by ).
Collapse the gaps by a shift: let . Then and , so , with and .
Thus the valid PINs correspond bijectively to strictly increasing triples in :
Answer: (c) 10.
Why the other options miss
- A only the tightest triples: counts just the triples with both gaps exactly (e.g. ), missing the ones with wider gaps.
- B wrong reduced range: uses on a mis-sized shifted set (range instead of ).
- D order counted or gap relaxed: counts ordered triples, or loosens the gap to ” somewhere,” over-counting.
Specialist insight
The clean tool is the gap-removing bijection: subtracting from the three positions turns the “differ by ” constraint into a plain strictly-increasing choice, so the count is just . Decreasing-order plus a minimum gap is exactly a pattern; here gives .
Min-gap- decreasing triples from – map to plain triples (c).