2001 IMO Shortlist Problems/N6

Revision as of 18:01, 20 August 2008 by Minsoens (talk | contribs) (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 ...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.

Resources