Maths Olympiad Prep

Library / /41 of 61

Combinatorics Difficulty 6.2 National Olympiad Prove it Ibero-American Mathematical Olympiad

Problem:
Find a number NN with five digits, all different and none zero, which equals the sum of all distinct three digit numbers whose digits are all different and are all digits of NN.

Solution

Solution:
There are 4×3=124 \times 3 = 12 numbers with a given digit of nn in the units place. Similarly, there are 1212 with it in the tens place and 1212 with it in the hundreds place. So the sum of the 3 digit numbers is 12×111(a+b+c+d+e)12 \times 111(a+b+c+d+e), where n=abcden=abcde. So 8668a=332b+1232c+1322d+1331e8668a=332b+1232c+1322d+1331e. We can easily see that a=1a=1 is too small and a=4a=4 is too big, so a=2a=2 or 33. Obviously ee must be even. 00 is too small, so e=2,4,6e=2,4,6 or 88. Working mod 1111, we see that 0=2b+2d0=2b+2d, so b+d=11b+d=11. Working mod7\bmod 7, we see that 2a=3b+6d+e2a=3b+6d+e. Using the mod11\bmod 11 result, b=2,d=9b=2, d=9 or b=3,d=8b=3, d=8 or b=4,d=7b=4, d=7 or b=5,d=6b=5, d=6 or b=6,d=5b=6, d=5 or b=7,d=4b=7, d=4 or b=8,d=3b=8, d=3 or b=9,d=2b=9, d=2. Putting each of these into the mod7\bmod 7 result gives 2ae=4,1,5,2,6,3,0,42a-e=4,1,5,2,6,3,0,4 mod 77. So putting a=2a=2 and remembering that ee must be 2,4,6,82,4,6,8 and that all digits must be different gives a,b,d,e=2,4,7,6a, b, d, e = 2,4,7,6 or 2,7,4,82,7,4,8 or 2,8,3,42,8,3,4 as the only possibilities. It is then straightforward but tiresome to check that none of these give a solution for cc. Similarly putting a=4a=4, gives a,b,d,e=3,4,7,8a, b, d, e=3,4,7,8 or 3,5,6,43,5,6,4 as the only possibilities. Checking, we find the solution above and no others.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.