Question: How many functions are there from an n-element set N to a k-element set K = {y1, y2,...yk} that map nothing to y1? 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 Sam doesn't get any candy (and maybe some other children don't either)?