Difference between revisions of "2017 AMC 12B Problems/Problem 22"
(→Solution) |
(→Solution) |
||
Line 13: | Line 13: | ||
Case 2: <math>\%R_A = 2</math> and <math>\%R_B=4</math>. There are <math>3</math> ways to place the <math>-1</math> in <math>R_A</math>, <math>2</math> ways to place the remaining <math>-1</math> in <math>R_B</math> (just don't put it under the <math>-1</math> on top of it!), and <math>2</math> ways for one of the other two players to draw the green ball. (We know it's green because Bernardo drew the red one.) We can just double to cover the case of <math>\%R_A = 4</math>, <math>\%R_B = 2</math> for a total of <math>24</math> ways. | Case 2: <math>\%R_A = 2</math> and <math>\%R_B=4</math>. There are <math>3</math> ways to place the <math>-1</math> in <math>R_A</math>, <math>2</math> ways to place the remaining <math>-1</math> in <math>R_B</math> (just don't put it under the <math>-1</math> on top of it!), and <math>2</math> ways for one of the other two players to draw the green ball. (We know it's green because Bernardo drew the red one.) We can just double to cover the case of <math>\%R_A = 4</math>, <math>\%R_B = 2</math> for a total of <math>24</math> ways. | ||
− | Case 3: <math>\%R_A=\%R_B=2</math>. | + | Case 3: <math>\%R_A=\%R_B=2</math>. There are three ways to place the <math>-1</math> in <math>R_A</math>. Now, there are two cases as to what happens next. |
− | + | Sub-case 3.1: The <math>1</math> in <math>R_B</math> goes directly under the <math>-1</math> in <math>R_A</math>. There's obviously <math>1</math> way for that to happen. Then, there are <math>2</math> ways to permute the two pairs of <math>1, -1</math> in <math>R_C</math> and <math>R_D</math>. (Either the <math>1</math> comes first in <math>R_C</math> or the <math>1</math> comes first in <math>R_D</math>.) | |
+ | |||
+ | Sub-case 3.2: The <math>1</math> in <math>R_B</math> doesn't go directly under the <math>-1</math> in <math>R_A</math>. There are <math>2</math> ways to place the <math>1</math>, and <math>2</math> ways to do the same permutation as in Sub-case 3.1. | ||
+ | Hence, there are <math>3(2+2 \cdot 2)=18</math> ways for this case. | ||
+ | |||
+ | There's a grand total of <math>45</math> ways for this to happen, along with <math>12^3</math> total cases. The probability we're asking for is thus <math>\frac{45}{(12^3)}=\frac{5}{192}.</math> | ||
==See Also== | ==See Also== | ||
{{AMC12 box|year=2017|ab=B|num-b=21|num-a=23}} | {{AMC12 box|year=2017|ab=B|num-b=21|num-a=23}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 14:15, 10 September 2017
Problem 22
Abby, Bernardo, Carl, and Debra play a game in which each of them starts with four coins. The game consists of four rounds. In each round, four balls are placed in an urn---one green, one red, and two white. The players each draw a ball at random without replacement. Whoever gets the green ball gives one coin to whoever gets the red ball. What is the probability that, at the end of the fourth round, each of the players has four coins?
Solution
It amounts to filling in a matrix. Columns are the random draws each round; rows are the coin changes of each player. Also, let be the number of nonzero elements in .
WLOG, let . Parity demands that and must equal or .
Case 1: and . There are ways to place 's in , so there are ways.
Case 2: and . There are ways to place the in , ways to place the remaining in (just don't put it under the on top of it!), and ways for one of the other two players to draw the green ball. (We know it's green because Bernardo drew the red one.) We can just double to cover the case of , for a total of ways.
Case 3: . There are three ways to place the in . Now, there are two cases as to what happens next.
Sub-case 3.1: The in goes directly under the in . There's obviously way for that to happen. Then, there are ways to permute the two pairs of in and . (Either the comes first in or the comes first in .)
Sub-case 3.2: The in doesn't go directly under the in . There are ways to place the , and ways to do the same permutation as in Sub-case 3.1. Hence, there are ways for this case.
There's a grand total of ways for this to happen, along with total cases. The probability we're asking for is thus
See Also
2017 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 21 |
Followed by Problem 23 |
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.