2018 AIME II Problems/Problem 13
Misha rolls a standard, fair six-sided die until she rolls in that order on three consecutive rolls. The probability that she will roll the die an odd number of times is where and are relatively prime positive integers. Find .
Let be the probability of getting it in an number of times. Let . It's easy to see that for all positive integers . Summing for gives
Let , with the subscript indicating an odd number of rolls. Then .
The ratio of is just .
We see that is the sum of ,,,... , while is the sum of , , ,... .
, the probability of getting rolls of 1-2-3 in exactly 3 rolls, is obviously .
We set this probability of aside, meaning we totally remove the chance of getting 1-2-3 in 3 rolls. Now the ratio of to should be equal to the ratio of , because in this case the 1st roll no longer matters, so we can disregard the very existence of it in counting how many times of rolls, and thus, 4 rolls, 6 rolls, 8 rolls... would become an odd number of rolls (while 5 rolls, 7 rolls, 9 rolls... would become even number of rolls).
Notice , and also
So we have .
Finally, we get . Therefore, .
Call the probability you win on a certain toss , where is the toss number. Obviously, since the sequence has length 3, and . Additionally, . We can call this value , to keep our further equations looking clean. We can now write our general form for as . This factors the probability of the last 3 rolls being 1-2-3, and the important probability that the sequence has not been rolled in the past (because then the game would already be over). Note that since you'll win at some point. An intermediate step here is figuring out . This is equal to . Adding up all the differences, i.e. will give us the amount by which the odds probability exceeds the even probability. Since they sum to 1, that means the odds probability will be half of the difference above one-half. Subbing in our earlier result from the intermediate step, the odd probability is equal to . Another way to find the odd probability is simply summing it up, which turns out to be . Note the infinite sums in both expressions are equal; let's call it . Equating them gives , or . Finally, substituting , we find that , giving us a final answer of . --DanDan0101
Let be the number of strings of length containing the digits through that do not contain the string . Then we have because we can add any digit to end of a string with length but we have to subtract all the strings that end in . We rewrite this as We wish to compute since the last three rolls are for the game to end. Summing over the recursion, we obtain Now shift the indices so that the inside term is the same: Note that and . Therefore, Solving for , we obtain .
Let . is a transition matrix for the prefix of 1-2-3 matched so far. The state corresponding to a complete match has no outgoing probability mass. The probability that we roll the dice exactly times is . Thus the probability that we roll the dice an odd number of times is . Thus the answer is .
Solution 5 quick cheat
Consider it as a contest of Odd and Even. Let and be probability that Odd and Even wins, respectively. If we consider every 3 rolls as an atomic action, then we can have a simple solution. If the rolls is 1-2-3, Odd wins; otherwise, Odd and Even switch the odds of winning. Therefore, we have Plug in and we can easily solve for .
Of course this is not a rigorous solution. I think it works because the requirement is a strict sequence of pure random events.
Solution 6 Elementary Probability
Consider it a contest for Odd or Even to win. Let , be the winning probabilities respectively. We call Odd is "in position" when a new sequence of 1-2-3 starts at odd position, and likewise, call Even is "in position" when a new sequence starts at even position. Now consider the situation when the first roll is 1. The conditional probability for Odd or Even to eventually win out depends on whose is in position. So let's denote by the probabilities of Odd and Even winning out, respectively, both when Odd is in position. Remember that the probabilities simply switch if Even is in position. Similarly, after 1-2 is rolled, we denote by the conditional probabilities of Odd and Even winning out, when Odd is in position.
Consider the first roll. If it's not a 1, the sequence restart, but Even is now in position; if it's a 1, then Odd's winning probability becomes . So, In the next roll, there are 3 outcomes. If the roll is 2, then Odd's winning probability becomes ; if the roll is 1, then we stay in the sequence, but Even is now in position, so the probability of Odd winning now becomes P_e(1); if the rolls is any other number, then the sequence restarts, and Odd is still in position. So, In the next roll after a 1-2 sequence, there are 3 outcomes. If the roll is a 3, Odd wins; if it's a 1, we go back to the state when 1 is just rolled, and Odd is in position; if it's any other number, then the sequence restarts, and Even is in position. So,
Plug in and , we have a 3-equation linear system which is not hard to solve. The final answer is . .
|2018 AIME II (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15|
|All AIME Problems and Solutions|