2019 AMC 10B Problems/Problem 22

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 . A bell rings every seconds, at which time each of the players who currently have money simultaneously chooses one of the other two players independently and at random and gives to that player. What is the probability that after the bell has rung times, each player will have ? (For example, Raashan and Ted may each decide to give to Sylvia, and Sylvia may decide to give her her dollar to Ted, at which point Raashan will have , Sylvia will have , and Ted will have , and that is the end of the first round of play. In the second round Rashaan has no money to give, but Sylvia and Ted might choose each other to give their 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. QED

Solution 2

Either each person can have $1 (case 1), or one person has $2, one person has $1, and one person has $0 (case 2). No person can have $3 because then they would have had to receive their own dollar which is not possible.

	Case 1	Case 2
Case 1
Case 2

Given that you start on the case in the left column, the number in the cell is the chance that you go to the case in the top row after 1 bell. Since both cases have a chance or less to make case 1 the next case, the first two answer choices can be used. Since case 1 has less than a chance to make case 1 the next case, the answer is .

Solution by a1b2

See Also

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.