AoPSWiki

Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.

Personal tools

Search

Toolbox

2001 IMO Shortlist Problems/N6

From AoPSWiki

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 "http://www.artofproblemsolving.com/Wiki/index.php/2001_IMO_Shortlist_Problems/N6"

Categories: Problems with no solution | Olympiad Number Theory Problems

Want to learn how to tackle those tough AMC/AIME/Olympiad algebra problems? Check out Art of Problem Solving's Intermediate Algebra by Richard Rusczyk and Mathew Crawford. Over 1600 problems!

© Copyright 2008 AoPS Incorporated. All Rights Reserved. • Foundation • Privacy • Contact Us