Difference between revisions of "2024 AMC 12A Problems/Problem 16"
(→Solution 2) |
Silverrush (talk | contribs) (Added a solution) |
||
Line 31: | Line 31: | ||
So the answer is <math>\boxed{\textbf{(C) }389}</math> | So the answer is <math>\boxed{\textbf{(C) }389}</math> | ||
~lptoggled | ~lptoggled | ||
+ | ==Solution 3== | ||
+ | We first assume there are designated red, white, and blue token players that will receive all of their respective one. | ||
+ | Consider each non-black token: The probability of the red player getting the first red token is <math>\frac{4}{12}</math>, because there are each player has 4 empty token "slots" for a total of 18. It follows that the probability of the player receiving all 3 red tokens is <math>(\frac{4}{12})(\frac{3}{11})(\frac{2}{10})</math>, the white token player is <math>(\frac{4}{9})(\frac{3}{8})</math>, and the blue token player is <math>\frac{4}{7}</math>. | ||
+ | |||
+ | The combined probability is <math>(\frac{4}{12})(\frac{3}{11})(\frac{2}{10})(\frac{4}{9})(\frac{3}{8})(\frac{4}{7})=\frac{2}{1155}</math>. | ||
+ | |||
+ | Finally, we multiply the probability by <math>3!=6</math> to remove our initial assumption to get <math>\frac{4}{385}</math>. | ||
+ | |||
+ | The requested sum is <math>4+385=\boxed{\textbf{(C) }389}</math>. | ||
+ | |||
+ | ~SilverRush | ||
==See also== | ==See also== | ||
{{AMC12 box|year=2024|ab=A|num-b=15|num-a=17}} | {{AMC12 box|year=2024|ab=A|num-b=15|num-a=17}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 20:35, 8 November 2024
Problem
A set of tokens ---- red, white, blue, and black ---- is to be distributed at random to game players, tokens per player. The probability that some player gets all the red tokens, another gets all the white tokens, and the remaining player gets the blue token can be written as , where and are relatively prime positive integers. What is ?
Solution 1 (12fact bash)
We have total possible arrangements of distinct tokens. If we imagine the first tokens of our arrangement go to the first player, the next go to the second, and the final go to the third, then we can view this problem as counting the number of valid arrangements.
Firstly, the tokens are not all distinct, so we multiply by , , , and to account for the fact that the red, white, blue, and black tokens, respectively can switch around from where they are.
Letting denote red, denote white, denote blue, and denote black, then our arrangement must be something like . The three players are arbitrary, so we multiply by ; then, the player who gets the reds has possible arrangements, the player who gets the whites has possibilities, and the player who gets the blacks has possibilities. Our total on top is thus , and the denominator is . Firstly, we have the in the numerator cancel out part of the denominator; we thus have the following:
Our answer is
~Technodoggo
Solution 2
Assume all of them are distinct even when some have the same color, Total possibility Next, assume that all the token are already in 3 different groups (3! Ways to do so) We then split the 6 black token into these 3 different groups There are a total of 3!(6c3)(3c2)(1c1) ways in doing so This the answer 3!(6!/1!2!3!)/(12!/4!4!4!)=4/385 So the answer is ~lptoggled
Solution 3
We first assume there are designated red, white, and blue token players that will receive all of their respective one.
Consider each non-black token: The probability of the red player getting the first red token is , because there are each player has 4 empty token "slots" for a total of 18. It follows that the probability of the player receiving all 3 red tokens is , the white token player is , and the blue token player is .
The combined probability is .
Finally, we multiply the probability by to remove our initial assumption to get .
The requested sum is .
~SilverRush
See also
2024 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 15 |
Followed by Problem 17 |
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 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.