Difference between revisions of "2001 IMO Shortlist Problems/N6"
(This should have been combinatorics, and how did it get to the shortlist anyways???) |
|||
| Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
| − | + | {{solution}} | |
== Resources == | == Resources == | ||
Revision as of 08:31, 6 October 2008
Problem
Is it possible to find 100 positive integers not exceeding 25,000, such that all pairwise sums of them are different?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
