Juku writes down all 20-digit numbers in which each of digits , , and appear five times in a row (in some order). Prove that it is possible to choose two of those numbers such that their difference is divisible by .
Solution
As and and are relatively prime, it suffices to find a difference that would be divisible by both and .
All the -digit numbers listed are divisible by because the sum of their digits is . Therefore the difference of any two of them is also divisible by .
It remains to show that the difference of some two of them is divisible by . For this note that there are different orderings of , , and . Therefore there are numbers written in total, but there are different possible remainders. So there must exist some two among those that give the same remainder when divided by . Their difference is divisible by .
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.