CSAT Solved Papers/ 2022/Q5

2022 CSAT — Q5

Quant Number theory 2.5 marks Hard

An Identity Card has the number ABCDEFGABCDEFG, not necessarily in that order, where each letter represents a distinct digit (only 1,2,4,5,7,8,91, 2, 4, 5, 7, 8, 9). The number is divisible by 99. After deleting the first digit from the right, the resulting number is divisible by 66. After deleting two digits from the right, the resulting number is divisible by 55. After deleting three digits from the right, the resulting number is divisible by 44. After deleting four digits from the right, the resulting number is divisible by 33. After deleting five digits from the right, the resulting number is divisible by 22. Which of the following is a possible value for the sum of the middle three digits of the number?

  1. A 8 Answer
  2. B 9
  3. C 11
  4. D 12

Worked rationale

All seven distinct digits come from {1,2,4,5,7,8,9}\{1,2,4,5,7,8,9\} — so all seven are used and their sum is 1+2+4+5+7+8+9=361+2+4+5+7+8+9 = 36, already divisible by 99. So ”ABCDEFGABCDEFG divisible by 99” is automatic.

Now decode each deletion (deleting from the right keeps the leading prefix):

  • ABCDEABCDE divisible by 55 E{5}\Rightarrow E \in \{5\} (no 00 in the set), so E=5\boxed{E = 5}.
  • ABAB divisible by 22 B\Rightarrow B even.
  • ABCDABCD divisible by 44 \Rightarrow last two digits CDCD divisible by 44 D\Rightarrow D even.
  • ABCDEFABCDEF divisible by 66 F\Rightarrow F even (and the prefix digit-sum divisible by 33).
  • ABCABC divisible by 33 A+B+C0(mod3)\Rightarrow A+B+C \equiv 0 \pmod 3.

The even digits available are {2,4,8}\{2,4,8\} — exactly three of them, and B,D,FB, D, F must all be even, so {B,D,F}={2,4,8}\{B,D,F\} = \{2,4,8\}. That leaves the odd digits {1,7,9}\{1,7,9\} for A,C,GA, C, G.

ABCDEFABCDEF divisible by 33: A+B+C+D+E+F=36C-odd partnersA+B+C+D+E+F = 36 - C\text{-odd partners} \dots more directly, since the full sum is 3636, A+B+C+D+E+F=36GA+B+C+D+E+F = 36 - G, which is 0(mod3)\equiv 0 \pmod 3 iff G0(mod3)G \equiv 0 \pmod 3. Among {1,7,9}\{1,7,9\} only G=9G = 9 works, so G=9\boxed{G = 9}, leaving {A,C}={1,7}\{A,C\} = \{1,7\}.

CDCD divisible by 44 with DD even and C{1,7}C \in \{1,7\}: test D{2,4,8}D \in \{2,4,8\}72/4=1872/4 = 18 ✓ (C=7,D=2C=7, D=2) and 12/4=312/4 = 3 ✓ (C=1,D=2C=1, D=2). Both need D=2D = 2, so {B,F}={4,8}\{B,F\} = \{4,8\}.

ABCABC divisible by 33: A+B+C=(1+7)+B=8+BA + B + C = (1+7) + B = 8 + B, need 0(mod3)B=4\equiv 0 \pmod 3 \Rightarrow B = 4 (gives 1212), so F=8F = 8.

Two valid cards: 74125897412589 (A=7,C=1A{=}7,C{=}1) and 14725891472589 (A=1,C=7A{=}1,C{=}7). The middle three digits are C,D,EC, D, E (positions 3–4–5):

  • 7412589C+D+E=1+2+5=87412589 \Rightarrow C{+}D{+}E = 1 + 2 + 5 = 8;
  • 14725897+2+5=141472589 \Rightarrow 7 + 2 + 5 = 14.

1414 is not offered; 88 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 EE or sums the wrong three positions (e.g. D+E+FD+E+F).
  • D
    solved the wrong question: reads “middle three” as B,C,DB,C,D or chases the always-divisible total (3636) instead of the positional digits.

Specialist insight

The lever is forced positions before search: divisibility by 55 pins E=5E=5, the three even slots B,D,FB,D,F exhaust {2,4,8}\{2,4,8\}, and the divisible-by-33 chain forces G=9G=9. Only then is the search over {A,C}\{A,C\} trivially small. Note the question asks for a possible value, not the value — the configuration is not unique (88 or 1414), and the examiner deliberately offers only one of the two reachable sums.

The trap, in one line

E=5E=5, evens {B,D,F}={2,4,8}\{B,D,F\}=\{2,4,8\}, G=9G=9 forced; valid cards give middle-sum 88 or 1414, and only 88 is offered \Rightarrow (a).

← All 2022 CSAT questions