Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Nonempty subset proof

  1. Apr 11, 2005 #1
    No idea where to start with this one...to prove that it is not possible to have a set B of 5 distinct positive single-digit integers such that every possible nonempty subset of B has a different sum. How do I approach it/do it?
     
  2. jcsd
  3. Apr 11, 2005 #2

    matt grime

    User Avatar
    Science Advisor
    Homework Helper

    Given 5 distinct numbers, there are 2^5 - 1 possible sums of subsets, excluding the sum of all 5 which is 31.

    However, the biggest possible sum of 4 distinct single digit numbres is 9+8+7+6= 28, so apply the pigeon hole principle.
     
  4. Apr 11, 2005 #3
    I'll try that, thanks for the suggestion!
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?



Similar Discussions: Nonempty subset proof
  1. A proof. (Replies: 2)

  2. Any subset (Replies: 2)

  3. Subset product (Replies: 2)

Loading...