MathDB
O 16

Source:

May 25, 2007
modular arithmetic

Problem Statement

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