Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2001 IMO Shortlist Problems/N6

Revision as of 19: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

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2001_IMO_Shortlist_Problems/N6&oldid=27523"