Maths Olympiad Prep

Library / /75 of 224

Combinatorics Difficulty 5.7 AIME, harder Prove it Belarus

From the digits 1,2,3,4,5,6,7,81, 2, 3, 4, 5, 6, 7, 8, find the smallest possible value of NN such that, for any two distinct digits from this set, there exists a number among the NN numbers (each number is a four-digit number formed from these digits) which contains both of them.

Solution

Answer: N=6N = 6.

Let some digit, say 11, appear exactly in kk numbers from NN given numbers. Hence, 11 forms at most 33 distinct pairs with the remaining 33 digits of any of these kk numbers. Since the total number of all distinct pairs formed by 11 and the other 77 numbers (2,3,,82,3,\ldots,8) is equal to 77, we see that 3k73k \ge 7. So k3k \ge 3. Therefore, each of the digits 1,2,,81, 2, \ldots, 8 must appear in at least 33 numbers. Thus, the total number of all digits in NN numbers is greater than or equal to 83=248 \cdot 3 = 24. But NN numbers contains exactly 4N4N digits. Therefore, 4N244N \ge 24, so N6N \ge 6.

The following example shows that there are 66 four-digit numbers satisfying the ...

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.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.