Problem #PRU-60362

Problems Methods Algebraic methods Partitions into pairs and groups; bijections Pigeonhole principle Pigeonhole principle (other)

Problem

You are given 1002 different integers that are no greater than 2000. Prove that it is always possible to choose three of the given numbers so that the sum of two of them is equal to the third.

Will this still always be possible if we are given 1001 integers rather than 1002?