Browse · MathNet
Print66th Czech and Slovak Mathematical Olympiad
Czech Republic number theory
Problem
Find the smallest positive integer that can be inserted between numbers and so that the resulting number is a multiple of . (Radek Horenský)
Solution
Number is a multiple of , therefore the digit sum of the resulting number has to be divisible by . This happens if and only if we insert a number with digit sum divisible by , that is a number which is a multiple of . Trying out the smallest such numbers, we find out that inserting , , and doesn't work (instead of checking divisibility by we can check that numbers , , and are not divisible by , looking at their final four digits). On the other hand, is a multiple of . The answer is .
Final answer
36
Techniques
Divisibility / FactorizationModular Arithmetic