Unformatted text preview: 5. How many onto functions are there from a set of 5 elements to a set of 3 elements? 6. How many ways can you return n hats to n people so that (a) Exactly one person gets their original hat back? (b) At least two people get their original hats back? 7. Show that n ! = ( n ) D n + ( n 1 ) D n1 + · · · + ( n n ) D 8. Show that the sequence D n (the number of derrangements of n objects) satisﬁes the recurrence relation D n = ( n1)( D n1 + D n2 ) 9. Find a generating function for the number of partitions of n that have only evensized pieces. 10. (Tricky but Cute) Show that for any positive integers n,k , the number of partitions of n that have k parts is the same as the number of partitions of n that have k as their largest part....
View
Full Document
 Summer '08
 STRAIN
 Math, Set Theory, Natural number, Rob Bayer, recurrence relation Dn, Indistinguishable Boxes Note

Click to edit the document details