Using the method of mathematical induction

In summary, the conversation discusses the proof that a ten-element set of positive integers from 1 to 99 can be divided into two disjoint subsets with equal sums. The hint given is to use the pigeonhole principle, using the fact that there are 1022 non-empty proper subsets of the set and the sum of any subset can only take on 1000 different values.
  • #1
cocobaby
9
0
--------------------------------------------------------------------------------

1. Homework Statement
Let H be a ten- element set of potive integers ranged from 1 to 99. Prove that H has two disjoint subsets A and B so that the sum of the elements of A is equal to the sum of the elements of B.
 
Physics news on Phys.org
  • #2
I think this is most naturally a pigeonhole problem. Pigeonhole hint: there are 2^10 - 2 = 1022 non-empty proper subsets of H, the sum of the elements of any such subset lies in 1..1000 so can take on at most 1000 different values (in fact it's quite less than this, but this is a strong enough statement) which is less than 1022.
 

Similar threads

Back
Top