Romania TST 2016 Day 3 P3
Source: Romania TST 2016 Day 3 P3
November 1, 2017
combinatorics
Problem Statement
Given a positive integer , show that for no set of integers modulo , whose size exceeds , is it possible that the pairwise sums of unordered pairs be all distinct.