Skip to main content
OlympiadHQ

Browse · MathNet

Print

58th Ukrainian National Mathematical Olympiad

Ukraine number theory

Problem

Determine the greatest positive integer that has pairwise distinct digits and is divisible by each of its digits.
Solution
Clearly, is not one of the digits. In order to be divisible by last digit has to be , but the number will not be divisible by , , and , so it will consist of more digits if is not one of them. But then if all other digits are present, it is not divisible by , and . Therefore, one more digit has to be taken from the number in order for it to be divisible by . If so, the following cases are possible:

Case 1. If either or are taken, then number is divisible by and , but not by , thus digit is not present and the number has digits;

Case 2. If is taken, then it is possible to arrange digits that are left so that each digit divides the number, so the number has digits (all except , and ).

Therefore, the number has digits: , , , , , , . Our goal is to make it the largest possible.

If the number starts with , then digits , , , can make numbers divisible by , those are , , to . But then any of the numbers is not divisible by . If the number starts with , then digits , , form a number that is divisible by . Moreover, is divisible by , therefore, it is the largest number that satisfies given conditions.
Final answer
9867312

Techniques

Divisibility / FactorizationModular Arithmetic