Maths Olympiad Prep

Library / /16 of 43

Number theory Difficulty 4.7 AIME Find the answer Italy

Problem:

Determine the largest integer nn with this property: there exist nn distinct positive integers a1,,ana_{1}, \ldots, a_{n} such that, however two distinct ones are chosen among them, neither their sum nor their difference is divisible by 100100.

Pick one

Solution

Solution:

The answer is (C). A number is divisible by 100100 if and only if its decimal representation ends with 0000.

Let us divide the integers a1,,ana_{1}, \ldots, a_{n} into groups as follows: in a first group we put those whose decimal representation ends with 0000, in a second group those ending with 0101 (or having a single digit and that digit is 11) or with 9999, in a third those having as last two digits 0202 or 9898 and so on, until we reach the fifty-first group, in which we insert those ending with the digits 5050.

If there are two integers in the same group, then necessarily either their difference or their sum will be divisible by 100100: indeed, if the two integers end with the same group of two digits, then their difference ends with 0000 and is divisible by 100100; if instead they end with different groups of digits, the fact that they are in the same group means that their sum is divisible by 100100. Since we have exactly 5151 groups, nn is at most 5151: indeed, if we had 5252 or more integers, at least two would fall into the same group and, for the reasons stated, either their difference or their sum would be divisible by 100100.

On the other hand, it is easy to convince oneself that 100,101,,150100, 101, \ldots, 150 is precisely a set of 5151 positive integers with the property described in the text, and therefore 5151 is the number required.

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 translated into English from it; metadata (topic, difficulty) added by this project.