Difference between revisions of "2019 AMC 12B Problems/Problem 19"
Expilncalc (talk | contribs) (Do regret to say this, but this is actually AMC 12B problem 16 and not 19. However, I will simply transfer the solution over to Problem 16.) (Tag: Replaced) |
Expilncalc (talk | contribs) (→Problem: Added problem statement.) |
||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
| + | Raashan, Sylvia, and Ted play the following game. Each starts with <math>1. A bell rings every 15 seconds, at which time each of the players who currently has money simultaneously chooses one of the other two players independently and at random and gives </math>1 to that player. What is the probability that after the bell has rung 2019 times, each player will have <math>1? | ||
| + | |||
| + | There is a long example given following the problem statement: | ||
| + | For example, Raashan and Ted may each decide to give </math>1 to Sylvia, and Sylvia may decide to give her dollar to Ted, at which point Raashan will have <math>0, Sylvia will have </math>2, and Ted will have <math>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 </math>1 to, and the holdings will be the same at the end of the second round. | ||
==Solution== | ==Solution== | ||
Revision as of 16:01, 14 February 2019
Problem
Raashan, Sylvia, and Ted play the following game. Each starts with 
1 to that player. What is the probability that after the bell has rung 2019 times, each player will have $1?
There is a long example given following the problem statement:
For example, Raashan and Ted may each decide to give$ (Error compiling LaTeX. Unknown error_msg)1 to Sylvia, and Sylvia may decide to give her dollar to Ted, at which point Raashan will have 
2, and Ted will have 
1 to, and the holdings will be the same at the end of the second round.
Solution
See Also
| 2019 AMC 12B (Problems • Answer Key • Resources) | |
| Preceded by Problem 18 |
Followed by Problem 20 |
| 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 | |
