i need ten numbers, where no matter how you combine them, no two combinations....

i need ten numbers, where no matter how you combine them, no two combinations will produce the same result. for instance,

a

b

c

d

e

f

g

h

i

j

a+b = x =/= a+c, a+d, a+c+d, etc.

Re: i need ten numbers, where no matter how you combine them, no two combinations....

Try:

1, 2, 4, 8, 16, 32, 64, 128, 256, 512

Re: i need ten numbers, where no matter how you combine them, no two combinations....

Thank you. now i have to find all possible combinations of that set. lol fml

Re: i need ten numbers, where no matter how you combine them, no two combinations....

Quote:

Originally Posted by

**tyler91392** Thank you. now i have to find all possible combinations of that set. lol fml

Every combination is unique because each combination corresponds to a binary number, which can be converted to base 10. It turns out that any integer from 1 to 1023 inclusive can be made by summing some subset of {1,2,4,...,512}.