|
|
| (5 intermediate revisions by 2 users not shown) |
| Line 1: |
Line 1: |
| − | ==Problem==
| + | #REDIRECT[[2019_AMC_10B_Problems/Problem_22]] |
| − | 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==
| |
| − | | |
| − | 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 \frac{2}{8} \= \frac{1}{3} to get the 2-1-0 type.
| |
| − | | |
| − | Similarly, if the setup becomes 2-1-0 (again, with \frac{3}{4} 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, yes. If the latter three, return to normal. If the first, go back to the initial 1-1-1- case. Either way, the end up has 1/4 probability with the end, otherwise, 1/4 porbability that it is 1-1-1 which is what we want beyond step C, and the point is only for n >= greater than or eqwual tows (gres) than s1. Then, The bell must ring at least once for this to be true, which we know-it does. QED~~s
| |
| − | | |
| − | ==See Also==
| |
| − | {{AMC12 box|year=2019|ab=Bs|num-b=18|num-a=20}}
| |
