How would I do this using recursion?
Suppose I start with N jelly beans abd k friends. I divide the jelly beans evebly to all friends. I eat any leftovers rather thangiving my friends parts of a bean. One friend eats all his beans, and the others divide their beans the same way, but each has one less friend. (for instance, if I start with 50 beans and 4 friends, 3 of these friends will each divide 12 beans to three of their friends). The process ends when all the beans have been eaten or the person has no friends. Assume that all the people in this process are different. If I start out with 400 beans and 6 friends, how many different people will be lucky enough to eat more than one jelly bean when this process terminates?
(I can code it but I need to know what it's asking, precisely/psuedocode)