JMO 2017 B6
B6. The 9-digit positive integer \(N\) with digit pattern \(ABCABCBBB\) is divisible by every integer from 1 to 17 inclusive.
The digits \(A\), \(B\) and \(C\) are distinct. What are the values of \(A\), \(B\) and \(C\)?
Junior Mathematical Olympiad 2017, Question B6. © UK Mathematics Trust. Original paper on ukmt.org.uk
Answer: \(A = 3\), \(B = 0\) and \(C = 6\)
Since \(N\) is divisible by both 2 and 5, \(N\) is divisible by 10 and hence \(B = 0\). Therefore \(N\) is of the form \(A0CA0C000 = A0C \times 1001 \times 1000\).
Now \(1001 = 7 \times 11 \times 13\) and \(1000 = 2 \times 2 \times 2 \times 5 \times 5 \times 5\). Hence \(A0CA0C000\) is certainly divisible by 1, 2, 4, 5, 7, 8, 11, 13 and 14.
We are told that \(N\) is divisible by every integer from 1 to 17. Hence, in particular, N is divisible by 9. Therefore, since the rule for divisibility by 9 is that the sum of the digits of the number is also divisible by 9, we have \(2A + 2C\) is a multiple of 9 and hence \(A + C\) is a multiple of 9. Also, since \(A\) and \(C\) are distinct, \(A + C = 9\).
Once \(A\) and \(C\) are chosen so that \(N\) is divisible by 9, \(N\) will also be divisible by 3, 6, 12 and 15.
Since \(N = A0C \times 1001 \times 1000\) is divisible by 16, \(A0C\) is divisible by 2 and hence \(C\) is even. Therefore, the only options for \(A\) and \(C\) (in that order) are 1 and 8, 3 and 6, 5 and 4, or 7 and 2.
To ensure \(N\) is divisible by 17, we must now ensure that \(A\) and \(C\) are chosen so that \(A0C\) is divisible by 17. When we look at each case in turn, we find that \(108 = 6 \times 17 + 6\), \(306 = 18 \times 17\), \(504 = 29 \times 17 + 11\) and \(702 = 41 \times 17 + 5\). Therefore \(A = 3\), \(B = 0\) and \(C = 6\).
Solution © UK Mathematics Trust, from the JMO 2017 solutions.