Difference between revisions of "2017 AMC 12B Problems/Problem 22"

Revision as of 02:15, 6 February 2019

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?

$\textbf{(A)}\quad \dfrac{7}{576} \qquad \qquad \textbf{(B)}\quad \dfrac{5}{192} \qquad\qquad \textbf{(C)}\quad \dfrac{1}{36} \qquad\qquad \textbf{(D)}\quad \dfrac{5}{144} \qquad\qquad\textbf{(E)}\quad \dfrac{7}{48}$

Solution

It amounts to filling in a $4 \times 4$ matrix. Columns $C_1 - C_4$ are the random draws each round; rows $R_A - R_D$ are the coin changes of each player. Also, let $\%R_A$ be the number of nonzero elements in $R_A$ .

WLOG, let $C_1 = \begin{pmatrix} 1\\-1\\0\\0\end{pmatrix}$ . Parity demands that $\%R_A$ and $\%R_B$ must equal $2$ or $4$ .

Case 1: $\%R_A = 4$ and $\%R_B = 4$ . There are $\binom{3}{2}=3$ ways to place $2$ $-1$ 's in $R_A$ , so there are $3$ ways.

Case 2: $\%R_A = 2$ and $\%R_B=4$ . There are $3$ ways to place the $-1$ in $R_A$ , $2$ ways to place the remaining $-1$ in $R_B$ (just don't put it under the $-1$ on top of it!), and $2$ 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 $\%R_A = 4$ , $\%R_B = 2$ for a total of $24$ ways.

Case 3: $\%R_A=\%R_B=2$ . There are three ways to place the $-1$ in $R_A$ . Now, there are two cases as to what happens next.

Sub-case 3.1: The $1$ in $R_B$ goes directly under the $-1$ in $R_A$ . There's obviously $1$ way for that to happen. Then, there are $2$ ways to permute the two pairs of $1, -1$ in $R_C$ and $R_D$ . (Either the $1$ comes first in $R_C$ or the $1$ comes first in $R_D$ .)

Sub-case 3.2: The $1$ in $R_B$ doesn't go directly under the $-1$ in $R_A$ . There are $2$ ways to place the $1$ , and $2$ ways to do the same permutation as in Sub-case 3.1. Hence, there are $3(2+2 \cdot 2)=18$ ways for this case.

There's a grand total of $45$ ways for this to happen, along with $12^3$ total cases. The probability we're asking for is thus $\frac{45}{(12^3)}=\frac{5}{192}.$

Solution 2 (Less 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. Basically, (like the previous solution), we think of this as filling out a $4\text{x}2$ 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, C gives D a coin, and finally A gives D a coin, in this order. (This would not be a valid game, as D has a net gain of two coins.) $\begin{bmatrix} & A & B & \\ & B & C & \\ & C & D & \\ & A & D & \\ \end{bmatrix}$ Case 1: $2$ people. In this case, we have $\binom{4}{2}$ ways to choose the two people, and $\binom{4}{2}$ ways to order them to get a count of ${\binom{4}{2}}^2 = 36$ ways.

Case 2: $3$ 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 giving/receiving to/from the special person. Thus, we have $4\cdot\binom{3}{2}\cdot4! = 288$ ways here.

Case 3: $4$ 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 $3\cdot3\cdot4! = 216$ ways, after permuting.

So we have a total of $36+288+216=540$ ways to order the four pairs of people. Now we divide this by the total number of ways: $(4\cdot3)^4$ (four rounds, four ways to choose giver, three to choose receiver each round). So the answer is $\frac{540}{12^4} = \frac{5}{192}$ .

~ccx09

Diagram and explanations by no_u

Latex polished by Argonauts16

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

Page

Toolbox

Search

Difference between revisions of "2017 AMC 12B Problems/Problem 22"

Revision as of 02:15, 6 February 2019

Contents

Problem 22

Solution

Solution 2 (Less Casework)

See Also

@@ Line 26: / Line 26: @@
 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, C gives D a coin, and finally A gives D a coin, in this order. (This would not be a valid
+For example, the matrix below represents: A gives B a coin, then B gives C a coin, C gives D a coin, and finally A gives D a coin, in this order. (This would not be a valid game, as D has a net gain of two coins.)
 <cmath>\[
 \begin{bmatrix} & A & B & \\