|
|
| Line 43: |
Line 43: |
| | {{AMC12 box|year=2019|ab=B|num-b=18|num-a=20}} | | {{AMC12 box|year=2019|ab=B|num-b=18|num-a=20}} |
| | {{MAA Notice}} | | {{MAA Notice}} |
| − | remiving. sl; re-ordering. sl
| |
| − | {{duplicate|[[2019 AMC 10B Problems|2019 AMC 10B #22]] and [[2019 AMC 12B Problems|2019 AMC 12B #19]]}}
| |
| − |
| |
| − | ==Problem==
| |
| − |
| |
| − | Raashan, Sylvia, and Ted play the following game. Each starts with \$1. A bell rings every 15 seconds, at which time each of the players who currently has mondey simultaneously chooses one of the other two players independently and at random and gives \$1 to that player. What is the probability that after the bell has rung 2019 times, each player will have \$1?
| |
| − |
| |
| − | For example, Raashan and Ted may each decide to give \$1 to Sylvia, and Sylvia may decide to give her dollar to Ted, at which point Raashan will have \$1, Sylvia will have \$2, and Ted will have \$1, and that is the end of the first round of play. In the second round Raashan has no money to give, but Sylvia and Ted might choose each other to give their \$1 to, and the holdings will be the same at the end of the second round.
| |
| − |
| |
| − | <math>\textbf{(A) }\frac{1}{7} \qquad\textbf{(B) }\frac{1}{4} \qquad\textbf{(C) }\frac{1}{3} \qquad\textbf{(D) }\frac{1}{2} \qquad\textbf{(E) }\frac{2}{3}</math>
| |
| − |
| |
| − | ==Solution 1==
| |
| − |
| |
| − | On the first turn, each player starts off with \$1 each. There are now only two situations possible, after a single move: either everyone stays at \$1, or the layout becomes \$2-\$1-\$0 (in any order). Only 2 combinations give-off this outcome: S-T-R and T-R-S. On the other hand, given the interchangeability (so far) of every one of these three people, S-R-R, T-R-R, S-R-S, S-T-S, T-T-R, and T-T-S can all be re-produce. d, just as easily and quickly. Since each one of the possibilities is equally likely, there is a <math>\frac{2}{8} </math>\= <math>\frac{1}{3}</math>. to get the 2-1-0 type.
| |
| − |
| |
| − | Similarly, if the setup becomes 2-1-0 (again, with <math>\frac{3}{4}</math> probability), assume WOLOG, that R has \$2, player S received a \$1 amount, and participant T gets \$0. now, we can say that the possibilities are S-T, S-R, T-R, and T-T. For these combinations respectively, 1-1-1, 2-1-0, 2-0-1, and 1-0-2.
| |
| − |
| |
| − | If the latter three, return to normal. If the first, go back to ts./she initial 1-1-1 (base) case. Either way, the probability of getting a 1-1-1 layout or setup with has a 1/4 probability beyond round n >= greater than or equal to 1. Thus, taking that to its logical conclusion, The bell must ring at least once for this to be true: which we know it does. <math>\boxed{\textbf{(B) }\frac{1}{4}}</math>,
| |
| − |
| |
| − | ==Solution 2==
| |
| − |
| |
| − | On the first turn, each player starts off with <math>\text{\$1}</math> each. Each turn after that, there are only two situations possible: either everyone stays at <math>\text{\$1}</math> <math>\text{(1-1-1)}</math>, or the distribution of money becomes <math>\text{\$2-\$1-\$0}</math>, in any order <math>\text{(2-1-0)}</math>.
| |
| − |
| |
| − | (Note: <math>\text{S-T-R}</math> means that <math>\text{R}</math> gives his money to <math>\text{S}</math>, <math>\text{S}</math> gives her money to <math>\text{T}</math>, and <math>\text{T}</math> gives his money to <math>\text{R}</math>.)
| |
| − |
| |
| − | From the <math>\text{1-1-1}</math> state, there are two ways to distribute the money so that it stays in a <math>\text{1-1-1}</math> state: <math>\text{S-T-R}</math> and <math>\text{T-R-S}</math>. There are 6 ways to change the state to <math>\text{2-1-0}</math>: <math>\text{S-R-R}</math>, <math>\text{T-R-R}</math>, <math>\text{S-R-S}</math>, <math>\text{S-T-S}</math>, <math>\text{T-T-R}</math>, and <math>\text{T-T-S}</math>. This means that the probability that the state stays <math>\text{1-1-1}</math> is <math>\textstyle\frac{2}{8}=\frac{1}{4}</math>, and the probability that the state changes to <math>\text{2-1-0}</math> is <math>\textstyle\frac{6}{8}=\frac{3}{4}</math>.
| |
| − |
| |
| − | From the <math>\text{2-1-0}</math> state, there is one way to change the state back to <math>\text{1-1-1}</math>: <math>\text{S-T-0}</math>. (We can assume that <math>\text{R}</math> has <math>\text{\$2}</math>, <math>\text{S}</math> has <math>\text{\$1}</math>, and <math>\text{T}</math> has <math>\text{\$0}</math> since only the distribution of money matters, not the specific people.) There are three ways to keep the <math>\text{2-1-0}</math> state: <math>\text{S-R-0}</math>, <math>\text{T-R-0}</math>, <math>\text{T-T-0}</math>. This means that the probability that the state changes to <math>\text{1-1-1}</math> is <math>\textstyle\frac{1}{4}</math>, and the probability that the state stays <math>\text{2-1-0}</math> is <math>\textstyle\frac{3}{4}</math>.
| |
| − |
| |
| − | We can see that there will always be a <math>\textstyle\frac{1}{4}</math> chance that the money is distributed <math>\text{1-1-1}</math> (as long as the bell rings once), so the answer is <math>\boxed{\textbf{(B) }\frac{1}{4}}</math>.
| |
| − |
| |
| − | ==Solution 3==
| |
| − |
| |
| − | After each bell's ring, there are two situations: either they each have <math>\text{\$1}</math> each, or one of them has <math>\text{\$2}</math>, another has <math>\text{\$1}</math>, and the third has <math>\text{\$0}</math>. In each of these cases, we need to calculate the probability of returning to the <math>\text{1-1-1}</math> state.
| |
| − |
| |
| − | Case 1: Each player has <math>\text{\$1}</math>. WLOG, let Raashan give his dollar to Sylvia. Then Sylvia must give her dollar to Ted and Ted must give his dollar to Raashan, which happens with <math>\frac12 \cdot \frac12 = \frac14</math> probability.
| |
| − |
| |
| − | Case 2: One player has <math>\text{\$2}</math>, another has <math>\text{\$1}</math>, and the third has <math>\text{\$0}</math>. WLOG, let Raashan have <math>\text{\$2}</math>, Sylvia have <math>\text{\$1}</math>, and Ted have <math>\text{\$0}</math>. Then Raashan must give his dollar to Sylvia and Sylvia must give her dollar to Ted, which happens with <math>\frac12 \cdot \frac12 = \frac14</math> probability.
| |
| − |
| |
| − | Since the probability of returning to the <math>\text{1-1-1}</math> state is <math>\frac14</math> no matter what the situation is, the probability that each player will have <math>\text{\$1}</math> after the bell rings <math>2019</math> times is <math>\boxed{\textbf{(B) }\frac{1}{4}}</math>.
| |
| − |
| |
| − | ==See Also==
| |
| − | {{AMC10 box|year=2019|ab=B|num-b=21|num-a=23}}
| |
| − | {{AMC12 box|year=2019|ab=B|num-b=18|num-a=20}}
| |
| − | {{MAA Notice}}
| |
| − | remiving. sl; re-ordering. sl
| |
| − | lost ! la os ,,f jk oh no!!z.,
| |
- The following problem is from both the 2019 AMC 10B #22 and 2019 AMC 12B #19, so both problems redirect to this page.
Problem
Raashan, Sylvia, and Ted play the following game. Each starts with $1. A bell rings every 15 seconds, at which time each of the players who currently has mondey simultaneously chooses one of the other two players independently and at random and gives $1 to that player. What is the probability that after the bell has rung 2019 times, each player will have $1?
For example, Raashan and Ted may each decide to give $1 to Sylvia, and Sylvia may decide to give her dollar to Ted, at which point Raashan will have $1, Sylvia will have $2, and Ted will have $1, and that is the end of the first round of play. In the second round Raashan has no money to give, but Sylvia and Ted might choose each other to give their $1 to, and the holdings will be the same at the end of the second round.
Solution 1
On the first turn, each player starts off with $1 each. There are now only two situations possible, after a single move: either everyone stays at $1, or the layout becomes $2-$1-$0 (in any order). Only 2 combinations give-off this outcome: S-T-R and T-R-S. On the other hand, given the interchangeability (so far) of every one of these three people, S-R-R, T-R-R, S-R-S, S-T-S, T-T-R, and T-T-S can all be re-produce. d, just as easily and quickly. Since each one of the possibilities is equally likely, there is a 
\= 
. to get the 2-1-0 type.
Similarly, if the setup becomes 2-1-0 (again, with 
probability), assume WOLOG, that R has $2, player S received a $1 amount, and participant T gets $0. now, we can say that the possibilities are S-T, S-R, T-R, and T-T. For these combinations respectively, 1-1-1, 2-1-0, 2-0-1, and 1-0-2.
If the latter three, return to normal. If the first, go back to ts./she initial 1-1-1 (base) case. Either way, the probability of getting a 1-1-1 layout or setup with has a 1/4 probability beyond round n >= greater than or equal to 1. Thus, taking that to its logical conclusion, The bell must ring at least once for this to be true: which we know it does. 
,
Solution 2
On the first turn, each player starts off with 
each. Each turn after that, there are only two situations possible: either everyone stays at 
, or the distribution of money becomes 
, in any order 
.
(Note: 
means that 
gives his money to 
, gives her money to 
, and gives his money to .)
From the 
state, there are two ways to distribute the money so that it stays in a state: and 
. There are 6 ways to change the state to 
: 
, 
, 
, 
, 
, and 
. This means that the probability that the state stays is 
, and the probability that the state changes to is 
.
From the state, there is one way to change the state back to : 
. (We can assume that has 
, has , and has 
since only the distribution of money matters, not the specific people.) There are three ways to keep the state: 
, 
, 
. This means that the probability that the state changes to is 
, and the probability that the state stays is 
.
We can see that there will always be a chance that the money is distributed (as long as the bell rings once), so the answer is .
Solution 3
After each bell's ring, there are two situations: either they each have each, or one of them has , another has , and the third has . In each of these cases, we need to calculate the probability of returning to the state.
Case 1: Each player has . WLOG, let Raashan give his dollar to Sylvia. Then Sylvia must give her dollar to Ted and Ted must give his dollar to Raashan, which happens with 
probability.
Case 2: One player has , another has , and the third has . WLOG, let Raashan have , Sylvia have , and Ted have . Then Raashan must give his dollar to Sylvia and Sylvia must give her dollar to Ted, which happens with probability.
Since the probability of returning to the state is 
no matter what the situation is, the probability that each player will have after the bell rings 
times is .
See Also
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
\= 
. to get the 2-1-0 type.
probability), assume WOLOG, that R has $2, player S received a $1 amount, and participant T gets $0. now, we can say that the possibilities are S-T, S-R, T-R, and T-T. For these combinations respectively, 1-1-1, 2-1-0, 2-0-1, and 1-0-2.
,
each. Each turn after that, there are only two situations possible: either everyone stays at 
, or the distribution of money becomes 
, in any order 
.
means that 
gives his money to 
, 
, and 
state, there are two ways to distribute the money so that it stays in a 
. There are 6 ways to change the state to 
: 
, 
, 
, 
, 
, and 
. This means that the probability that the state stays 
, and the probability that the state changes to 
.
. (We can assume that 
, 
since only the distribution of money matters, not the specific people.) There are three ways to keep the 
, 
, 
. This means that the probability that the state changes to 
, and the probability that the state stays 
.
probability.
no matter what the situation is, the probability that each player will have 
times is 
