discrete math - permutations of nondistinct objects

Question

Find the number of ways m + n different objects can be divided into two (indistinguishable) subsets containing m and n objects, respectively.

Answer 1

This is m+n C m. Think about this as selecting m objects for subset 1 and placing the leftovers in subset 2. There are (m+n) C m ways to do this.