Determine the smallest positive integer for which the following statement holds true: From any consecutive integers one can select a non-empty set of consecutive integers such that their sum is divisible by .
Problem 1642
Official solution
Solution:
Answer. .
The prime factorization of is . Let .
For each integer , color the three numbers , , red, and the six numbers , , , , , blue. Now the integers are colored periodically. In a period of length , there are red integers, then uncolored integers, then blue integers and finally uncolored integers.
The sum of the integers in a red interval is , and the sum of the integers in a blue interval is . So if there is a colored interval (we mean a maximal one throughout) in the given consecutive integers, one can choose it. It is easy to see, that among any consecutive integers, there must be a colored interval. Thus the smallest (that we look for) satisfies .
Now we will show that it is not possible to choose consecutive integers in the desired way from the set ( and thus ). Assume that there exists such that
That means either , or . Since
must divide . Taking into account that
we conclude that must be or . It means either and , or and , or . But , and , a contradiction.