distinct mushrooms and Jimmy goes for picking all of them for his dinner. He took 3 identical bags with him, each of them can hold maximum mushrooms. If he takes home all of the mushrooms, then in how many ways can he put the mushrooms in the bags ? Write your answer as digit sum of the number .
In a mushroom forest, there areThis problem is a part of the set Vegetable combinatorics
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.
First off, since the bags hold a maximum of 30 mushrooms and they all add up to 90, all the bags will have exactly 30 mushrooms each.
There are 2 ways you can think about this:
The answer is 3 ! ( 3 0 9 0 ) ( 3 0 6 0 ) ( 3 0 3 0 )
We're choosing 30 mushrooms that we'll put into the first bag, 30 mushrooms that we'll put into the 2nd bag and 30 that will go to the 3rd one. Since the bags are identical, to eliminate the ordering of the bags we'll have to divide by 3 ! as well.
Arrange the mushrooms in a row. The amount of ways we can rearrange the distinct mushrooms in a row is 9 0 ! . The first 30 mushrooms will be in the first bag, the other 30 in the 2nd and the last 30 in the 3rd bag. Since the order in which the mushrooms appear in the bags doesn't matter, we'll divide this by 3 0 ! 3 0 ! 3 0 ! and since the bags are identical we'll additionally divide this by 3 ! , yielding 3 0 ! 3 0 ! 3 0 ! 3 ! 9 0 !
Both ways lead to the answer 3 0 ! 3 0 ! 3 0 ! 3 ! 9 0 ! = 1 3 2 6 7 9 6 4 9 2 7 9 2 1 8 7 2 7 0 2 4 2 9 0 5 7 7 4 2 3 9 3 6 3 0 4 4 1 8 5 6
Wolfram Alpha can tell you this. It can also tell you that the digits of this number add up to 1 8 6 .