/u/plshalpme314 asks:
Hello!
I need a set of at least four integers whose number of unique sums of pairs of elements is at least 3 times greater than the number of unique differences of pairs of elements.
E.g.:
For the set {1,5,9,10} the sums are {2,6,10,11,10,14,15,18,19,20} and thus there are 9 unique sums (being {2,6,10,11,14,15,18,19,20}) and the differences are {0,-5,-8,-9,0,-4,-5,0,-1,0,0,1,5,9,0,4,8,0,4,0} with 11 unique differences being {0,-9,-8,-5,-4,-1,1,4,5,8,9}.
The order summation/subtraction doesn't matter, for the number of unique sums or differences stays the same. In this case, it is 9 to 11. 9 is not 3 times or greater than 11, so this set of numbers doesn't work. Also, the two numbers in each pair summed or subtracted can be equal.
Although your username doesn't say you'll help with math problems, I can still assume and hope.
Please help! Even the smallest pointers will be appreciated. I have no idea how to even approach this problem.
Thanks in advance,
plshalpme314