Marvin bought bananas of different sizes. He wants to feed his two monkeys. In how many ways can he feed them? (The monkeys are very hungry so they will eat all the bananas.)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Theorem :Suppose there are n distinct objects that are to be distributed among r distinct bins. This can be done in r n precisely ways.
In this question, we can model the bananas as objects and the monkeys as bins. Since they are all distinct, the above formula holds true. Therefore, the total number of ways in which the monkeys can be fed is 2 5 = 3 2 .