The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Math Topics » discretemath

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Functions - Pigeonhole Principle
Replies: 1   Last Post: Sep 12, 2008 12:35 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 1
Registered: 9/11/08
Functions - Pigeonhole Principle
Posted: Sep 11, 2008 4:51 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Let S be a set of eight positive integers each of which is less than 30. Show that there must be two distinct subsets of S whose elements add up to the same sum. For instance, if the eight numbers are {2,4,5,8,12,15,18,24}, the two distinct subsets can be {2,4,12,15} and {4,5,24}. The sum in both of these is 33.

any one can help to explain and solve this? urgent.. :(

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.