Problem:
Determine the largest integer with this property: there exist distinct positive integers such that, however two distinct ones are chosen among them, neither their sum nor their difference is divisible by .
Problem:
Determine the largest integer with this property: there exist distinct positive integers such that, however two distinct ones are chosen among them, neither their sum nor their difference is divisible by .
Pick one
Solution:
The answer is (C). A number is divisible by if and only if its decimal representation ends with .
Let us divide the integers into groups as follows: in a first group we put those whose decimal representation ends with , in a second group those ending with (or having a single digit and that digit is ) or with , in a third those having as last two digits or and so on, until we reach the fifty-first group, in which we insert those ending with the digits .
If there are two integers in the same group, then necessarily either their difference or their sum will be divisible by : indeed, if the two integers end with the same group of two digits, then their difference ends with and is divisible by ; 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 . Since we have exactly groups, is at most : indeed, if we had 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 .
On the other hand, it is easy to convince oneself that is precisely a set of positive integers with the property described in the text, and therefore is the number required.