Browse · MathNet
PrintJapan Mathematical Olympiad
Japan number theory
Problem
Let be a positive integer which is a multiple of but not of . When we add to the product of all the digits of , then we obtain a number which is a multiple of . Find the smallest possible value for such a number .
Solution
is a multiple of , but not of , and since is a multiple of , the number satisfies the conditions of the problem. We will show in the sequel that if , then does not satisfy the conditions of the problem.
Now, if a number satisfies the conditions of the problem, then it is easy to see that the product of all the digits of must be a multiple of but not a multiple of . Hence must satisfy the following condition, which we call the condition X:
One and only one of the digits of must be either or and none of the digits of can equal or .
If has only one digit, then neither nor satisfies the conditions of the problem, so must have at least two digits. Now write with a positive integer and an integer such that . From the condition that , we see that . Now consider the following cases:
(1) When or : Since must be a multiple of in this case, must also be a multiple of . If or or , then violates the condition X, so we must have . But then since is a multiple of , cannot be . On the other hand, since is not a multiple of , cannot be either. So, the case under consideration cannot occur.
(2) When is neither nor : By the condition X, we see that one and only one of the digits of must be either or . If or , then must be a multiple of , but any choice of violates the condition X. Finally, if , only number less than and is a multiple of and not of is , but since is not a multiple of , the case under consideration cannot occur either.
Thus we conclude that is the smallest possible positive integer satisfying the conditions of the problem.
Final answer
138
Techniques
Divisibility / FactorizationModular ArithmeticIntegers