2022 CSAT — Q5
An Identity Card has the number , not necessarily in that order, where each letter represents a distinct digit (only ). The number is divisible by . After deleting the first digit from the right, the resulting number is divisible by . After deleting two digits from the right, the resulting number is divisible by . After deleting three digits from the right, the resulting number is divisible by . After deleting four digits from the right, the resulting number is divisible by . After deleting five digits from the right, the resulting number is divisible by . Which of the following is a possible value for the sum of the middle three digits of the number?
Worked rationale
All seven distinct digits come from — so all seven are used and their sum is , already divisible by . So ” divisible by ” is automatic.
Now decode each deletion (deleting from the right keeps the leading prefix):
- divisible by (no in the set), so .
- divisible by even.
- divisible by last two digits divisible by even.
- divisible by even (and the prefix digit-sum divisible by ).
- divisible by .
The even digits available are — exactly three of them, and must all be even, so . That leaves the odd digits for .
divisible by : more directly, since the full sum is , , which is iff . Among only works, so , leaving .
divisible by with even and : test — ✓ () and ✓ (). Both need , so .
divisible by : , need (gives ), so .
Two valid cards: () and (). The middle three digits are (positions 3–4–5):
- ;
- .
is not offered; is a possible value.
Answer: (a) 8.
Why the other options miss
- B invented an assignment that doesn’t survive the checks: never actually holds against all six divisibility filters simultaneously.
- C an arithmetic slip: mis-pins or sums the wrong three positions (e.g. ).
- D solved the wrong question: reads “middle three” as or chases the always-divisible total () instead of the positional digits.
Specialist insight
The lever is forced positions before search: divisibility by pins , the three even slots exhaust , and the divisible-by- chain forces . Only then is the search over trivially small. Note the question asks for a possible value, not the value — the configuration is not unique ( or ), and the examiner deliberately offers only one of the two reachable sums.
, evens , forced; valid cards give middle-sum or , and only is offered (a).