Posted by **Mathslover** on Tuesday, May 14, 2013 at 5:24am.

For a set of numbers T, we say that T has distinct subset sums if all distinct subsets of T have distinct sums. How many subsets of {1,2,3,4,5,6,7,8} have distinct subset sums?

Details and assumptions

The empty set (the set of no elements) has sum 0 by convention

## Answer This Question

## Related Questions

- MATHS - For a set of numbers T, we say that T has distinct subset sums if all ...
- Maths - For a set of numbers T, we say that T has distinct subset sums if all ...
- MATHS!!!Please HELP..:'( - For a set of numbers T, we say that T has distinct ...
- math - Consider the set {1,2,3,4,5,6,7,8,9,10}. For each subset, calculate the ...
- MATH Help please..... - Let S={1,2,3,…11} and T1,T2…,TN be distinct subsets of S...
- MATH hard problem...HELLPPPPPP - Let S={1,2,3,…11} and T1,T2…,TN be distinct ...
- Language - In which sentence does the word distinct make sense? The assembly ...
- Math - I was to answer this question: How are the idea of subsets and proper ...
- heeeeeeeeelp math - A subset S of {1,2,…,n} is said to be packed if whenever i,j...
- heeeeeelp math - A subset S of {1,2,…,n} is said to be packed if whenever i,j&#...

More Related Questions