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


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 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)?

Request for Solution File

Ask an Expert for Answer!!
Mathematics: How many functions map nothing to a j-element subset j of k
Reference No:- TGS01549296

Expected delivery within 24 Hours