Difference between revisions of "2017 AMC 12B Problems/Problem 22"
(→Solution) |
Silverlion (talk | contribs) (adding a solution) |
||
(45 intermediate revisions by 12 users not shown) | |||
Line 1: | Line 1: | ||
− | ==Problem | + | ==Problem== |
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? | 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? | ||
Line 5: | Line 5: | ||
==Solution== | ==Solution== | ||
− | It | + | It amounts to filling in a <math>4 \times 4</math> matrix. Columns <math>C_1 - C_4</math> are the random draws each round; rowof each player. Also, let <math>\%R_A</math> be the number of nonzero elements in <math>R_A</math>. |
− | + | WLOG, let <math>C_1 = \begin{pmatrix} 1\\-1\\0\\0\end{pmatrix}</math>. Parity demands that <math>\%R_A</math> and <math>\%R_B</math> must equal <math>2</math> or <math>4</math>. | |
− | + | Case 1: <math>\%R_A = 4</math> and <math>\%R_B = 4</math>. There are <math>\binom{3}{2}=3</math> ways to place <math>2</math> <math>-1</math>'s in <math>R_A</math>, so there are <math>3</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>. 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)}= \boxed{\textbf{(B)}\frac{5}{192}}</math>. | ||
+ | |||
+ | LaTex polished by [[Grace.yongqing.yu]]. | ||
+ | |||
+ | ==Solution 2 (Less Casework)== | ||
+ | We will proceed by taking cases based on how many people are taking part in this "transaction." We can have <math>2</math>, <math>3</math>, or <math>4</math> people all giving/receiving coins during the <math>4</math> turns. | ||
+ | Basically, (like the previous solution), we think of this as filling out a <math>4\text{x}2</math> matrix of letters, where a letter on the left column represents this person gave, and a letter on the right column means this person received. We need to make sure that for each person that gave in total certain amount, they received in total from other people that same amount, or in other words, we want it such that there are an equal number of A's, B's, C's, and D's in both columns of the matrix. | ||
+ | |||
+ | For example, the matrix below represents: A gives B a coin, then B gives C a coin, then C gives D a coin, and finally A gives D a coin, in this order. | ||
+ | <cmath>\[ | ||
+ | \begin{bmatrix} & A & B & \\ | ||
+ | & B & C & \\ | ||
+ | & C & D & \\ | ||
+ | & A & D & \\ | ||
+ | \end{bmatrix} | ||
+ | \] </cmath> | ||
+ | Case 1: <math>2</math> people. In this case, we have <math>\binom{4}{2}</math> ways to choose the two people, and <math>\binom{4}{2}</math> ways to order them to get a count of <math>{\binom{4}{2}}^2 = 36</math> ways. | ||
+ | |||
+ | Case 2: <math>3</math> people. In this case, one special person is giving/receiving twice. There are four ways to choose this person, then of the remaining three people we choose two, to be the people interacting with the special person. Thus, we have <math>4\cdot\binom{3}{2}\cdot4! = 288</math> ways here. | ||
+ | |||
+ | Case 3: <math>4</math> people. In this case. First note that no person can give/receive twice. If we keep the order of A, B, C, D giving in that order (and permute afterward), then there are three options to choose A's receiver, and three options for B's receiver afterward. Then it is uniquely determined who C and D give to. This gives a total of <math>3\cdot3\cdot4! = 216</math> ways, after permuting. | ||
+ | |||
+ | |||
+ | So we have a total of <math>36+288+216=540</math> ways to order the four pairs of people. | ||
+ | Now we divide this by the total number of ways: <math>(4\cdot3)^4</math> | ||
+ | (four rounds, four ways to choose giver, three to choose receiver each round). | ||
+ | So the answer is <math>\frac{540}{12^4} = \boxed{\textbf{(B)}\frac{5}{192}}</math>. | ||
+ | |||
+ | ~ccx09 | ||
+ | |||
+ | Latex polished by Argonauts16 and by [[Grace.yongqing.yu]]. | ||
+ | |||
+ | ==Solution 3== | ||
+ | Similar to solution 2, we think in terms of transactions. WLOG, for the 1st transaction, we assume that A gives to B, which we denote AB. For the 2nd transaction, there are 12 options to choose from, so there are <math>12^3</math> possible options. | ||
+ | |||
+ | Case 1 (Giving back immediately): The 2nd transaction is BA (1 option). Then, the 3rd transaction can be whatever you like (12 options), but the 4th transaction is now fixed to be the opposite of the 3rd transaction (1 option). So here we have <math>1\cdot 12\cdot 1 = 12</math> good options. | ||
+ | |||
+ | Case 2 (Allows a cycle or two back-and-forths): The 2nd transaction is one of BC, BD, CA, DA, CD, DC (6 options). Then, for the 3rd transaction, 2 options force a "cycle" on the 4th transaction (example 2.1), and 2 options force two "back-and-forths" on the 4th transaction (example 2.2). In total, there are <math>2+2=4</math> options for the 3rd transaction. So here we have <math>6\cdot 4\cdot 1 = 24</math> good options. | ||
+ | |||
+ | Example 2.1: suppose 2nd = BC. Then if 3rd = DA or CD, the 4th is forced to be CD or DA respectively, completing a transaction "cycle" | ||
+ | |||
+ | Example 2.2: suppose 2nd = BC. Then if 3rd = AB or BC, the 4th is forced to be BC or AB respectively. In the end, both A-B and B-C had back-and-forth transactions | ||
+ | |||
+ | Case 3 (Allows two back-and-forths only): The 2nd transaction is one of AC, AD, DB, CB (4 options). Then, for the 3th transaction, there are only 2 possible options (namely, to reverse one of the previous transactions). Of course, the final transaction is forced. Here, we have <math>4\cdot 2\cdot 1 = 8</math> good options. | ||
+ | |||
+ | Case 4 (AB again): The 2nd transaction is AB (same as 1st). This forces the later transactions to both be BA. Here we have 1 good option. | ||
+ | |||
+ | Summing, we have <math>12+24+8+1=45</math> good options among <math>12^3</math> total options, so the solution is <math>\frac{45}{(12^3)}= \boxed{\textbf{(B)}\frac{5}{192}}</math>. | ||
+ | |||
+ | SilverLion | ||
==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}} | ||
+ | |||
+ | [[Category:Intermediate Probability Problems]] |
Latest revision as of 16:07, 5 September 2021
Problem
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; rowof 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 .
LaTex polished by Grace.yongqing.yu.
Solution 2 (Less Casework)
We will proceed by taking cases based on how many people are taking part in this "transaction." We can have , , or people all giving/receiving coins during the turns. Basically, (like the previous solution), we think of this as filling out a matrix of letters, where a letter on the left column represents this person gave, and a letter on the right column means this person received. We need to make sure that for each person that gave in total certain amount, they received in total from other people that same amount, or in other words, we want it such that there are an equal number of A's, B's, C's, and D's in both columns of the matrix.
For example, the matrix below represents: A gives B a coin, then B gives C a coin, then C gives D a coin, and finally A gives D a coin, in this order. Case 1: people. In this case, we have ways to choose the two people, and ways to order them to get a count of ways.
Case 2: people. In this case, one special person is giving/receiving twice. There are four ways to choose this person, then of the remaining three people we choose two, to be the people interacting with the special person. Thus, we have ways here.
Case 3: people. In this case. First note that no person can give/receive twice. If we keep the order of A, B, C, D giving in that order (and permute afterward), then there are three options to choose A's receiver, and three options for B's receiver afterward. Then it is uniquely determined who C and D give to. This gives a total of ways, after permuting.
So we have a total of ways to order the four pairs of people.
Now we divide this by the total number of ways:
(four rounds, four ways to choose giver, three to choose receiver each round).
So the answer is .
~ccx09
Latex polished by Argonauts16 and by Grace.yongqing.yu.
Solution 3
Similar to solution 2, we think in terms of transactions. WLOG, for the 1st transaction, we assume that A gives to B, which we denote AB. For the 2nd transaction, there are 12 options to choose from, so there are possible options.
Case 1 (Giving back immediately): The 2nd transaction is BA (1 option). Then, the 3rd transaction can be whatever you like (12 options), but the 4th transaction is now fixed to be the opposite of the 3rd transaction (1 option). So here we have good options.
Case 2 (Allows a cycle or two back-and-forths): The 2nd transaction is one of BC, BD, CA, DA, CD, DC (6 options). Then, for the 3rd transaction, 2 options force a "cycle" on the 4th transaction (example 2.1), and 2 options force two "back-and-forths" on the 4th transaction (example 2.2). In total, there are options for the 3rd transaction. So here we have good options.
Example 2.1: suppose 2nd = BC. Then if 3rd = DA or CD, the 4th is forced to be CD or DA respectively, completing a transaction "cycle"
Example 2.2: suppose 2nd = BC. Then if 3rd = AB or BC, the 4th is forced to be BC or AB respectively. In the end, both A-B and B-C had back-and-forth transactions
Case 3 (Allows two back-and-forths only): The 2nd transaction is one of AC, AD, DB, CB (4 options). Then, for the 3th transaction, there are only 2 possible options (namely, to reverse one of the previous transactions). Of course, the final transaction is forced. Here, we have good options.
Case 4 (AB again): The 2nd transaction is AB (same as 1st). This forces the later transactions to both be BA. Here we have 1 good option.
Summing, we have good options among total options, so the solution is .
SilverLion
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.