Something to do with the pigeons

What is the minimum number of odd integers we must choose in the range of 1 1 to 1000 1000 to ensure that there is at least one pair whose sum is 1002 1002 ?

For more problems ,click here .
251 501 252 502

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 solution

Brent DeJong
Apr 19, 2015

1 + 1001 = 1002 1 + 1001=1002 , but 1001 1000 1001\not<1000 . So there's no pair for 1 1 . Also, 501 + 501 = 1002 501+501=1002 , but 501 501 can't be paired with itself, so there's no pair for 501 501 .

That leaves 249 pairs of odd numbers between 1 1 and 1000 1000 (inclusive) whose pair-wise sum is 1002 1002 . If we choose only one element of each of these pairs, we don't have any pairs summing to 1002 1002 .

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.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...