Question:medium

There are four different types of bananas. In how many ways can 12 children select bananas so that at least one banana is selected from each type?

Show Hint

When a problem says “at least one from each category”, subtract 1 from each variable first, then apply the Stars and Bars formula for non-negative solutions.
Updated On: Feb 20, 2026
Show Solution

Correct Answer: 165

Solution and Explanation

Step 1: Understanding the Topic and Question
This question is a problem in combinatorics. The phrasing "in how many ways can 12 children select bananas" is ambiguous. It could mean the children are distinct (in which case it's a surjective function problem) or identical (in which case it's a partition problem). The provided solution uses a method (Stars and Bars) that applies to distributing **identical** items into **distinct** boxes. This implies an interpretation where the children are considered identical and the banana types are the distinct categories they are assigned to.
Step 2: Key Approach - Stars and Bars Method
We interpret the problem as: "Find the number of ways to group 12 identical children based on their choice of 4 distinct banana types, such that every banana type is chosen by at least one child." Let $x_i$ be the number of children who choose banana type $i$. The problem becomes finding the number of positive integer solutions to the equation: \[ x_1 + x_2 + x_3 + x_4 = 12, \quad \text{with } x_i \ge 1 \] Step 3: Detailed Calculation
A. Transform the equation for non-negative solutions:
To use the standard Stars and Bars formula, we need the variables to be non-negative ($y_i \ge 0$). We can introduce new variables $y_i = x_i - 1$. This substitution reflects that we are pre-assigning one child to each banana type. \[ (y_1 + 1) + (y_2 + 1) + (y_3 + 1) + (y_4 + 1) = 12 \] \[ y_1 + y_2 + y_3 + y_4 = 12 - 4 = 8 \] Now we need to find the number of non-negative integer solutions to this new equation.
B. Apply the Stars and Bars Formula:
The number of non-negative integer solutions to an equation of the form $y_1 + \dots + y_k = n$ is given by the formula: \[ \binom{n+k-1}{k-1} \] In our case, $n=8$ (the remaining "stars" or children) and $k=4$ (the "bins" or banana types). \[ \text{Number of ways} = \binom{8+4-1}{4-1} = \binom{11}{3} \] C. Calculate the binomial coefficient:
\[ \binom{11}{3} = \frac{11!}{3!(11-3)!} = \frac{11!}{3!8!} = \frac{11 \times 10 \times 9}{3 \times 2 \times 1} \] \[ = 11 \times 5 \times 3 = 165 \] Step 4: Final Answer
Based on the interpretation of identical children, there are 165 ways. \[ \boxed{165} \]
Was this answer helpful?
1