Find the smallest positive integer N such that any subset of size N taken from the set of the first 2017 positive integers will always include at least two integers that differ by exactly 13.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
There's an easy argument that your set is maximal. Consider all the numbers are that are congruent to 1 modulo 13: 1 , 1 4 , 2 7 , 4 0 , 5 3 , … , 2 0 1 6 . There are 156 elements in this list. You cannot take any two elements that are consecutive in this list, so you can have at most 1 5 6 / 2 = 7 8 elements from this list. The other residues work similarly.
Log in to reply
My set indeed excludes all even-numbered entries in the sequence ( n , 1 3 + n , 2 6 + n , … ) for n = 1 … 1 3 .
With this argument, we end up excluding 2 × 7 8 + 1 1 × 7 7 = 1 0 0 3 numbers from the list of 2017, leaving 1 0 1 4 as the maximum size.
Thanks!
Problem Loading...
Note Loading...
Set Loading...
Let n be included precisely if ⌊ 1 3 n − 1 ⌋ is even.
It is then easy to check that if n is included in the set, then n ± 1 3 are not included.
This set contains 78 blocks of 13 integers, or 1014 integers: { 1 , 2 , 3 , … , 1 3 ; 2 7 , 2 8 , 2 9 , … , 3 9 ; 5 3 , 5 4 , 5 5 , … , 6 5 ; … ; 2 0 0 3 , 2 0 0 4 , 2 0 0 5 , … , 2 0 1 5 }
This is a maximal set; adding any more numbers in the given range will cause two to have a difference of 13. Therefore the answer is 1 0 1 4 + 1 = 1 0 1 5 .
Note : I have not given a proof that no better set could be found. Any takers?
Note : Another intuitive approach is to include precisely all odd numbers. However, in that case, any 1010th number added will be even and at distance 13 from one of an odd number.