Looking to find a set of integers such that the sum of any subset of the set is unique. For instance - 1,3,5 works. 1+3, 1+5, 3+5, do not equal each other or any individual number in the set. But 2,3,5 doesnt. 2+3=5. Anyone have any ideas on how to go about generating such a set? 2^n works, but I would like to find a set with at least 8 numbers on the same order of magnitude.