2001 IMO Shortlist Problems/N6
Problem
Is it possible to find 100 positive integers not exceeding 25,000, such that all pairwise sums of them are different?
Solution
The biggest pairwise sum is 
, and there are 
sums. Thus by the Pigeonhole Principle, there must be at least two sums which are equal.
