MathDB
IMO ShortList 2001, number theory problem 6

Source: IMO ShortList 2001, number theory problem 6

September 30, 2004
modular arithmeticnumber theoryAdditive Number TheorysumsIMO Shortlist

Problem Statement

Is it possible to find 100100 positive integers not exceeding 25,00025,000, such that all pairwise sums of them are different?
Back to ProblemsView on AoPS