Difference between revisions of "1993 AIME Problems/Problem 11"
Clutch noob (talk | contribs) m (→Solution 2 (Kind of Bashy)) |
Warriorcats (talk | contribs) m (→Solution 3) |
||
(7 intermediate revisions by 5 users not shown) | |||
Line 29: | Line 29: | ||
Since <math>a_6=\frac{364}{729}</math>, <math>m+n = 1093 \equiv \boxed{093} \pmod{1000}</math>. | Since <math>a_6=\frac{364}{729}</math>, <math>m+n = 1093 \equiv \boxed{093} \pmod{1000}</math>. | ||
− | ==Solution | + | ==Simpler Solution 1 == |
− | + | Same as solution 1 except that <math>b_n=1-a_n</math>. So you don't need that extra calculation for <math>b_n</math>. | |
− | + | ==Solution 2 (Kind of Bashy but very nice) == | |
− | + | In order to begin this problem, we need to calculate the probability that Alfred will win on the first round. | |
− | + | Because he goes first, Alfred has a <math>\frac{1}{2}</math> chance of winning (getting heads) on his first flip. | |
+ | |||
+ | Then, Bonnie, who goes second, has a <math>\frac{1}{2} \times \frac{1}{2} = \frac{1}{4}</math>, chance of winning on her first coin toss. | ||
+ | |||
+ | Therefore Alfred’s chance of winning on his second flip is <math>\frac{1}{4} \times \frac{1}{2} = \frac{1}{8}</math> | ||
+ | |||
+ | |||
+ | |||
+ | From this, we can see that Alfred’s (who goes first) chance of winning the first round is: <math>\frac{1}{2} + \frac{1}{8} + \frac{1}{32} + \cdots = \frac{2}{3}</math> | ||
+ | |||
+ | Bonnie’s (who goes second) chance of winning the first round is then <math>1 - \frac{2}{3} = \frac{1}{3}</math>. | ||
This means that the person who goes first has a <math>\frac{2}{3}</math> chance of winning the round, while the person who goes second has a <math>\frac{1}{3}</math> chance of winning. | This means that the person who goes first has a <math>\frac{2}{3}</math> chance of winning the round, while the person who goes second has a <math>\frac{1}{3}</math> chance of winning. | ||
+ | |||
+ | |||
Now, through casework, we can calculate Alfred’s chance of winning the second round. | Now, through casework, we can calculate Alfred’s chance of winning the second round. | ||
− | Case 1: Alfred wins twice; <math>\frac{2}{3}</math> | + | Case 1: Alfred wins twice; <math>\frac{2}{3} \times \frac{1}{3}</math> (Bonnie goes first this round) <math>=\frac{2}{9}</math>. |
+ | |||
+ | Case 2: Alfred loses the first round, but wins the second; <math>\frac{1}{3} \times \frac{2}{3} = \frac{2}{9}</math>. | ||
+ | |||
+ | Adding up the cases, we get <math>\frac{2}{9} + \frac{2}{9} = \frac{4}{9}</math>. | ||
+ | |||
+ | Alfred, therefore, has a <math>\frac{4}{9}</math> of winnning the second round, and Bonnie has a <math>1-\frac{4}{9} = \frac{5}{9}</math> chance of winning this round. | ||
+ | |||
+ | |||
+ | |||
+ | From here, it is not difficult to see that the probabilities alternate in a pattern. | ||
+ | |||
+ | Make <math>A</math> the probability that Alfred wins a round. | ||
+ | |||
+ | The chances of Alfred and Bonnie, respectively, winning the first round are <math>A</math> and <math>A - \frac{1}{3}</math>, which can be written as <math>2A - \frac{1}{3} = 1</math> | ||
+ | |||
+ | The second round’s for chances are <math>A</math> and <math>A + \frac{1}{9}</math>, which can also be written as <math>2A + \frac{1}{9}</math> | ||
+ | |||
+ | |||
+ | |||
+ | From this, we can conclude that for the <math>n</math>th even round, the probability that Alfred (<math>A</math>) wins can be calculated through the equation <math>2A + \frac{1}{3^n} = 1</math>. | ||
+ | |||
+ | Solving the equation for <math>n = 6</math>, we get <math>A = \frac{364}{729}</math>. | ||
+ | |||
+ | <math>364 + 729 = 1093</math>. | ||
+ | |||
+ | |||
+ | |||
+ | So our answer is <math>\boxed{093}</math>. | ||
− | |||
− | + | ==Solution 3== | |
− | Alfred, | + | Rather than categorizing games as wins or losses, we can categorize them as starters (S), where Alfred starts, and non-starters (NS), where Bonnie starts. Game 1 is a starter, and since Alfred must win Game 6, Game 7 is a non-starter. |
− | + | As shown in Solution 1, if a player starts a certain game, the probability <math>P(NS)</math> that they will not start the next game (i.e. win the current game) is <math>\frac{2}{3}</math>, and the probability <math>P(S)</math> that they will start the next game (i.e. lose the current game) is <math>\frac{1}{3}</math>. Similarly, if a player does not start a certain game, <math>P(NS) = \frac{1}{3}</math> and <math>P(S) = \frac{2}{3}</math>. We conclude that the probability of switching from S to NS or vice versa is always <math>\frac{2}{3}</math>, and the probability of staying the same is always <math>\frac{1}{3}</math>. | |
− | + | Listing out all the games from Game 1 to Game 7, we get: S, ?, ?, ?, ?, ?, NS. Between the 7 games, there are 6 opportunities to either switch or stay the same. We need to eventually switch from S to NS, so there must be an odd number of switches. Furthermore, this number is less than 6, so it must be 1, 3, or 5. | |
− | + | 1 switch: There are <math>{6 \choose 1} = 6</math> ways to place the switch, so <math>P = 6\left(\frac{1}{3}\right)^5\left(\frac{2}{3}\right) = \frac{12}{729}</math>. | |
− | + | 3 switches: There are <math>{6 \choose 3} = 20</math> ways to place the switches, so <math>P = 20\left(\frac{1}{3}\right)^3\left(\frac{2}{3}\right)^3 = \frac{160}{729}</math>. | |
− | + | 5 switches: There are <math>{6 \choose 5} = 6</math> ways to place the switch, so <math>P = 6\left(\frac{1}{3}\right)\left(\frac{2}{3}\right)^5 = \frac{192}{729}</math>. | |
− | 364 + 729 = 1093, so | + | Add up all these probabilities to get <math>\frac{12+160+192}{729} = \frac{364}{729}</math>. <math>364+729=1093</math>, so the answer is <math>\boxed{093}</math>. |
== See also == | == See also == | ||
{{AIME box|year=1993|num-b=10|num-a=12}} | {{AIME box|year=1993|num-b=10|num-a=12}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 19:57, 22 December 2020
Contents
Problem
Alfred and Bonnie play a game in which they take turns tossing a fair coin. The winner of a game is the first person to obtain a head. Alfred and Bonnie play this game several times with the stipulation that the loser of a game goes first in the next game. Suppose that Alfred goes first in the first game, and that the probability that he wins the sixth game is , where and are relatively prime positive integers. What are the last three digits of ?
Solution
The probability that the th flip in each game occurs and is a head is . The first person wins if the coin lands heads on an odd numbered flip. So, the probability of the first person winning the game is , and the probability of the second person winning is .
Let be the probability that Alfred wins the th game, and let be the probability that Bonnie wins the th game.
If Alfred wins the th game, then the probability that Alfred wins the th game is . If Bonnie wins the th game, then the probability that Alfred wins the th game is .
Thus, .
Similarly, .
Since Alfred goes first in the st game, .
Using these recursive equations:
Since , .
Simpler Solution 1
Same as solution 1 except that . So you don't need that extra calculation for .
Solution 2 (Kind of Bashy but very nice)
In order to begin this problem, we need to calculate the probability that Alfred will win on the first round.
Because he goes first, Alfred has a chance of winning (getting heads) on his first flip.
Then, Bonnie, who goes second, has a , chance of winning on her first coin toss.
Therefore Alfred’s chance of winning on his second flip is
From this, we can see that Alfred’s (who goes first) chance of winning the first round is:
Bonnie’s (who goes second) chance of winning the first round is then .
This means that the person who goes first has a chance of winning the round, while the person who goes second has a chance of winning.
Now, through casework, we can calculate Alfred’s chance of winning the second round.
Case 1: Alfred wins twice; (Bonnie goes first this round) .
Case 2: Alfred loses the first round, but wins the second; .
Adding up the cases, we get .
Alfred, therefore, has a of winnning the second round, and Bonnie has a chance of winning this round.
From here, it is not difficult to see that the probabilities alternate in a pattern.
Make the probability that Alfred wins a round.
The chances of Alfred and Bonnie, respectively, winning the first round are and , which can be written as
The second round’s for chances are and , which can also be written as
From this, we can conclude that for the th even round, the probability that Alfred () wins can be calculated through the equation .
Solving the equation for , we get .
.
So our answer is .
Solution 3
Rather than categorizing games as wins or losses, we can categorize them as starters (S), where Alfred starts, and non-starters (NS), where Bonnie starts. Game 1 is a starter, and since Alfred must win Game 6, Game 7 is a non-starter.
As shown in Solution 1, if a player starts a certain game, the probability that they will not start the next game (i.e. win the current game) is , and the probability that they will start the next game (i.e. lose the current game) is . Similarly, if a player does not start a certain game, and . We conclude that the probability of switching from S to NS or vice versa is always , and the probability of staying the same is always .
Listing out all the games from Game 1 to Game 7, we get: S, ?, ?, ?, ?, ?, NS. Between the 7 games, there are 6 opportunities to either switch or stay the same. We need to eventually switch from S to NS, so there must be an odd number of switches. Furthermore, this number is less than 6, so it must be 1, 3, or 5.
1 switch: There are ways to place the switch, so .
3 switches: There are ways to place the switches, so .
5 switches: There are ways to place the switch, so .
Add up all these probabilities to get . , so the answer is .
See also
1993 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.