Difference between revisions of "2024 AMC 12A Problems/Problem 16"
Technodoggo (talk | contribs) (Created page with "A set of <math>12</math> tokens ---- <math>3</math> red, <math>2</math> white, <math>1</math> blue, and <math>6</math> black ---- is to be distributed at random to <math>3</ma...") |
m |
||
| Line 1: | Line 1: | ||
| + | ==Problem== | ||
A set of <math>12</math> tokens ---- <math>3</math> red, <math>2</math> white, <math>1</math> blue, and <math>6</math> black ---- is to be distributed at random to <math>3</math> game players, <math>4</math> 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 <math>\frac{m}{n}</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. What is <math>m+n</math>? | A set of <math>12</math> tokens ---- <math>3</math> red, <math>2</math> white, <math>1</math> blue, and <math>6</math> black ---- is to be distributed at random to <math>3</math> game players, <math>4</math> 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 <math>\frac{m}{n}</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. What is <math>m+n</math>? | ||
<math> | <math> | ||
| Line 21: | Line 22: | ||
~Technodoggo | ~Technodoggo | ||
| + | |||
| + | ==See also== | ||
| + | {{AMC12 box|year=2024|ab=A|num-b=15|num-a=17}} | ||
| + | {{MAA Notice}} | ||
Revision as of 18:01, 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:
![\[\dfrac{3\cdot2\cdot2\cdot3\cdot2\cdot4\cdot6\cdot4}{12\cdot11\cdot10\cdot9\cdot8\cdot7}=\dfrac{2^83^3}{2^63^35\cdot7\cdot11}=\dfrac4{385}.\]](http://latex.artofproblemsolving.com/4/6/2/4626567e9829f4d9c20a59621b51fa34eec8c553.png)
Our answer is 
~Technodoggo
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. 
