2021 AMC 10B Problems/Problem 22
Ang, Ben, and Jasmin each have blocks, colored red, blue, yellow, white, and green; and there are empty boxes. Each of the people randomly and independently of the other two people places one of their blocks into each box. The probability that at least one box receives blocks all of the same color is , where and are relatively prime positive integers. What is
Solution 1 (Principle of Inclusion-Exclusion)
Let our denominator be , so we consider all possible distributions.
We use PIE (Principle of Inclusion and Exclusion) to count the successful ones.
When we have at box with all balls the same color in that box, there are ways for the distributions to occur ( for selecting one of the five boxes for a uniform color, for choosing the color for that box, for each of the three people to place their remaining items).
However, we overcounted those distributions where two boxes had uniform color, and there are ways for the distributions to occur ( for selecting two of the five boxes for a uniform color, for choosing the color for those boxes, for each of the three people to place their remaining items).
Again, we need to re-add back in the distributions with three boxes of uniform color... and so on so forth.
Our success by PIE is yielding an answer of .
As In Solution 1, the probability is Dividing by , we get Dividing by , we get Dividing by , we get .
Solution 2 (Complementary Counting)
Use complementary counting. Denote as the total number of ways to put colors to boxes by 3 people out of which ways are such that no box has uniform color. Notice . From this setup we see the question is asking for . To find we want to exclude the cases of a) one box of the same color, b) 2 boxes of the same color, c) 3 boxes of same color, d) 4 boxes of the same color, and e) 5 boxes of the same color. Cases d) and e) coincide. From this, we have
In case b), there are ways to choose 2 boxes that have the same color, ways to choose the two colors, 2! ways to permute the 2 chosen colors, and ways so that the remaining 3 boxes don’t have the same color. The same goes for cases a) and c). In case e), the total number of ways to permute 5 colors is . Now, we just need to calculate , and .
We have , since we subtract the number of cases where the boxes contain uniform colors, which is 2.
In the same way, - again, we must subtract the number of ways at least 1 box has uniform color. There are ways if 3 boxes each contains uniform color. Two boxes each contains uniform color is the same as previous. If one box has the same color, there are ways to pick a box, and ways to pick a color for that box, 1! ways to permute the chosen color, and ways for the remaining 2 boxes to have non-uniform colors. Similarly,
Thus, the probability is and the answer is
Solution 3 (WLOG and PIE)
WLOG fix which block Ang places into each box. (This can also be thought of as labeling each box by the color of Ang's block.) There are then total possibilities.
As in Solution 1, we use PIE. With box of uniform color, there are possibilities ( for selecting one of the five boxes (whose color is fixed by Ang), for each of Ben and Jasmin to place their remaining items). We overcounted cases with boxes, of which there are possibilities, and so on.
The probability is thus at which point we can proceed as in #Alternate simplification to simplify to .
Solution 4 (Derangements)
denotes the number of derangements of elements, i.e. the number of permutations where no element appears in its original position. Recall the recursive formula .
We will consider the number of candidate boxes (ones that currently remain uniform-color) after each person places their blocks.
After Ang, all boxes are candidates, and each has a fixed color its blocks must be to remain uniform-color.
Ben has total ways to place blocks. There are ways to disqualify candidates, . (There are ways to choose the candidates to disqualify, and ways to arrange the disqualified candidates' same-color blocks.)
Jasmin has total ways to place blocks. Currently, boxes are no longer candidates. Consider the number of ways for Jasmin to place blocks such that no box remains a candidate, where is the number of boxes and is the number of non-candidates, and call it (not to be confused with partial derangements). We wish to find for each , .
Notice that , since all boxes are candidates and no block can be placed in the same-colored box. Also notice the recursive formula , since the first non-candidate box can either contain its same-color block (in which case it can be ignored), or a different-color block (in which case it can be treated as a candidate).
We can make a table ( horizontal, vertical): (Note that since there are no candidates to begin with, which checks out with the diagonal.)
The desired values of are in the rightmost column.
The probability that at least one box is of uniform color is thus
Video Solution by OmegaLearn (PIE)
Video Solution by Interstigation
~ Briefly went over Principal of Inclusion Exclusion using Venn Diagram
|2021 AMC 10B (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25|
|All AMC 10 Problems and Solutions|