What is the minimum number of odd integers we must choose in the range of to to ensure that there is at least one pair whose sum is ?
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.
1 + 1 0 0 1 = 1 0 0 2 , but 1 0 0 1 < 1 0 0 0 . So there's no pair for 1 . Also, 5 0 1 + 5 0 1 = 1 0 0 2 , but 5 0 1 can't be paired with itself, so there's no pair for 5 0 1 .
That leaves 249 pairs of odd numbers between 1 and 1 0 0 0 (inclusive) whose pair-wise sum is 1 0 0 2 . If we choose only one element of each of these pairs, we don't have any pairs summing to 1 0 0 2 .
So, 2 unpairable elements, plus one element of each of 249 pairs gives us a total of 251 elements we can choose without having a valid pair. As soon as we choose the 252nd, however, we must have the pair we needed. Thus the answer is 252.