Answer:
[tex]165[/tex].
Step-by-step explanation:
Since repetition isn't allowed, there would be [tex]11[/tex] choices for the first donut, [tex](11 - 1) = 10[/tex] choices for the second donut, and [tex](11 - 2) = 9[/tex] choices for the third donut. If the order in which donuts are placed in the bag matters, there would be [tex]11 \times 10 \times 9[/tex] unique ways to choose a bag of these donuts.
In practice, donuts in the bag are mixed, and the ordering of donuts doesn't matter. The same way of counting would then count every possible mix of three donuts type [tex]3 \times 2 \times 1 = 6[/tex] times.
For example, if a bag includes donut of type [tex]x[/tex], [tex]y[/tex], and [tex]z[/tex], the count [tex]11 \times 10 \times 9[/tex] would include the following [tex]3 \times 2 \times 1[/tex] arrangements:
Thus, when the order of donuts in the bag doesn't matter, it would be necessary to divide the count [tex]11 \times 10 \times 9[/tex] by [tex]3 \times 2 \times 1 = 6[/tex] to find the actual number of donut combinations:
[tex]\begin{aligned} \frac{11 \times 10 \times 9}{3 \times 2 \times 1} = 165\end{aligned}[/tex].
Using combinatorics notations, the answer to this question is the same as the number of ways to choose an unordered set of [tex]3[/tex] objects from a set of [tex]11[/tex] distinct objects:
[tex]\begin{aligned}\begin{pmatrix}11 \\ 3\end{pmatrix} &= \frac{11 !}{(11 - 3)! \times 3 !} \\ &= \frac{11 !}{8 ! \times 3 !} \\ &= \frac{11 \times 10 \times 9}{3 \times 2 \times 1} = 165\end{aligned}[/tex].
