This preview shows page 1. Sign up to view the full content.
Unformatted text preview: that the three numbers are all dierent? 3. (2 points) Suppose that n is a positive integer. Let S be a set with 2 n elements. Prove that if n > 1, then Sub ( S,n ) > 2 n . 4. (2 points) (Challenge!) Suppose that n is a positive integer. Let S be a set with 2 n elements. How many ways are there to partition S into n pairs. In other words, how many ways are there to choose n pairs from the set S , such that every member of S is a member of exactly one pair?...
View Full Document
This homework help was uploaded on 04/17/2008 for the course MATH 100 taught by Professor Weissman during the Fall '08 term at UCSC.
- Fall '08