IMO Shortlist 2001 problem N6


Kvaliteta:
  Avg: 0,0
Težina:
  Avg: 8,0
Dodao/la: arhiva
2. travnja 2012.
2001 shortlist tb
LaTeX PDF
Is it possible to find 100 positive integers not exceeding 25,000, such that all pairwise sums of them are different?
Izvor: Međunarodna matematička olimpijada, shortlist 2001