This preview shows page 1. Sign up to view the full content.
Unformatted text preview: P . (4) A pile oF n identical coins are to be given to Adam, Brenda, Clarisse, Darryl, and Ethel; Adam and Brenda must each receive at least 2 coins, and Ethel can receive no more than 2. Let a n be the number oF ways to distribute all n oF the coins. ind a Formula For a n . (5) Let X be a set and Y X such that  X  = n and  Y  = k . ind a closed Formula For the number oF surjective Functions X Y (and prove its correctness). (6) Let a n be the number oF subsets oF { 1 , . . ., n } with no two consecutive elements. ind a closed Formula For a n . (7) Let X be a fnite set, and let 1 and 2 two partitions oF X such that  1  = n and  2  = n + 1. We call an element oF x X declining , iF the part oF 2 that contains x has Fewer elements than the part oF 1 that contains x . Prove that X has at least two declining elements. Date : November 28, 2011. 1...
View
Full
Document
This note was uploaded on 01/12/2012 for the course MATH 681 taught by Professor Wildstrom during the Fall '09 term at University of Louisville.
 Fall '09
 WILDSTROM
 Combinatorics, Binomial

Click to edit the document details