How many functions map nothing to a j-element subset j of k


Question: How many functions map nothing to a j-element subset J of K? Another way to say this is if I have n distinct candy bars and k children Sam, Mary, Pat, etc., in how many ways may I pass out the candy bars so that some particular j-element subset of the children don't get any (and maybe some other children don't either)?

Solution Preview :

Prepared by a verified Expert
Mathematics: How many functions map nothing to a j-element subset j of k
Reference No:- TGS02374063

Now Priced at $10 (50% Discount)

Recommended (91%)

Rated (4.3/5)