Jaka chooses a three-digit number , composed of three different non-zero digits. He then takes a piece of paper and writes down all other three-digit numbers he can form from those three digits. The sum of the numbers on the paper is . Find all possible .
, 2008
Solution
Denote the digits of by , and , so that . Three-digit numbers we can form from , and are , , , , , and their sum is . Hence, the sum of the numbers written on the paper is
Consider this equation modulo . When is divided by the remainder is and the remainder of is the same as that of . We conclude that should be congruent to . But , so can only be or .
If , we have , and this is not possible. So, and . The only possible solution is .
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.