Problem 1
Let be distinct elements of such that whenever (with ), the sum is also one of the . Prove .
Step 1 of 3: Sort the elements
In plain words
Sort the elements
Detailed analysis
Relabel the set so that . We prove the key inequality for .
Sort the elements
Relabel the set so that . We prove the key inequality for .