Difference between revisions of "2001 IMO Shortlist Problems/N6"
(New page: == Problem == Is it possible to find 100 positive integers not exceeding 25,000, such that all pairwise sums of them are different? == Solution == {{solution}} == Resources == * [[2001 ...) |
(No difference)
|
Revision as of 19:01, 20 August 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.
