Difference between revisions of "2017 AMC 12B Problems/Problem 22"
(→Solution) |
(→Solution 2 (Casework)) |
||
Line 23: | Line 23: | ||
==Solution 2 (Casework)== | ==Solution 2 (Casework)== | ||
+ | We will proceed by taking cases based on how many people are taking part in this "transaction." We can have 2, 3, or 4 people all giving/receiving coins during the 4 turns. | ||
+ | |||
+ | Case 1: <math>2</math> people. In this case, we can 4C2 ways to choose the two people, and 6 ways to get order them to get a count of 6 * 6 = 36 ways. | ||
+ | |||
+ | Case 2: <math>3</math> people. In this case, we have 4*(3C2)*4! = 288 ways to order 3 people. | ||
+ | |||
+ | Case 3: <math>4</math> people. In this case, we have 3*3*4! = 216 ways to order 4 people. | ||
+ | |||
+ | So we have a total of 36+288+126=540 ways to order the four pairs of people. | ||
+ | Now we divide this by the total number of ways - (4*3)^4 ( 4 times, 4 ways to choose giver, 3 to choose receiver). | ||
+ | So the answer is 5/192. | ||
+ | |||
+ | ~ccx09 (NOTE: Due to the poor quality of this solution, please PM me and I will explain the numbers, I have some diagrams but I can't show it here) | ||
==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 21:04, 27 November 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
Solution 2 (Casework)
We will proceed by taking cases based on how many people are taking part in this "transaction." We can have 2, 3, or 4 people all giving/receiving coins during the 4 turns.
Case 1: people. In this case, we can 4C2 ways to choose the two people, and 6 ways to get order them to get a count of 6 * 6 = 36 ways.
Case 2: people. In this case, we have 4*(3C2)*4! = 288 ways to order 3 people.
Case 3: people. In this case, we have 3*3*4! = 216 ways to order 4 people.
So we have a total of 36+288+126=540 ways to order the four pairs of people. Now we divide this by the total number of ways - (4*3)^4 ( 4 times, 4 ways to choose giver, 3 to choose receiver). So the answer is 5/192.
~ccx09 (NOTE: Due to the poor quality of this solution, please PM me and I will explain the numbers, I have some diagrams but I can't show it here)
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.