Something to do with the pigeons

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

For more problems ,click here.
×

Problem Loading...

Note Loading...

Set Loading...