AIME 2026 II · 第 7 题
AIME 2026 II — Problem 7
题目详情
Problem
A standard fair six-sided die is rolled repeatedly. Each time the die reads 1 or 2, Alice gets a coin; each time it reads 3 or 4, Bob gets a coin; and each time it reads 5 or 6, Carol gets a coin. The probability that Alice and Bob each receive at least two coins before Carol receives any coins can be written as where and are relatively prime positive integers. Find
解析
Solution 1
Denote , , for Alice, Bob, and Carol respectively. Consider the situation after three rolls.
Case 1. One of or received two coins and the other received one, which occurs with probability since there are ways to permute or and ways to choose three letters in total. Then there is a that the player who received one will receive another before does while ignoring the third player.
Case 2. One of or received three coins and the other received none, which occurs with probability due to there being only two cases, namely and . Then, there is a chance of the second player receiving both coins before does while ignoring the third player.
The total probability is .
~ eevee9406
Solution 2
Let be the probability that Alice and Bob recieve two coins before Carol receives any, given that Alice and Bob respectively start with and coins. Let be a placeholder for all integers greater than two. Also, by symmetry, we have .
We find that and by symmetry. Then
and we find . Next, we have \begin{align*} P(1,1) &= \frac{2}{3}P(2,1) = \frac{1}{3},\\ P(1,0) &= \frac{1}{3}P(2,0)+\frac{1}{3}P(1,1) = \frac{1}{12}+\frac{1}{9} = \frac{7}{36}. \end{align*} Finally and the requested sum is . ~TThB0501
Solution 3 (Less Convoluted Solution 4)
Consider the ordering of the first four draws. We must have , or some permutation of such, giving us total configurations. The string has a probability of occurring, multiplying by total strings gives us the index probability or .
Now, from this index, we have four states. Given that Carlos rolls next, for more than five strings (four from the rolls and one from the roll),
- Either we draw and then (or vice versa)
- We draw
- We draw
From this, we can easily continue with series. To solve the first point, notice that there are orderings to . Multiplying by the probability of this string, which is , to the index and every other plausible index with the inclusion of the roll Carlos pertains results in:
The sum is an infinite geometric series with first term and common ratio , through the geometric series formula is a sum:
Multiplication by gives us .
Then, for the second and third points, notice the symmetry between the two. Thus, we solve for , and multiply by to account for . The chance of happening is , and we apply this to the index, along with Carlos' probability, obtaining:
This is an infinite geometric series with first term , and common ratio , and solving via the formula obtains:
Multiplication by gives us .
The answer is , which we can solve through LCD, obtaining a probability of , which is in the form , where . Thus the answer is nothing but .
~Pinotation
Solution 4 (Infinite Geometric Sums)
The problem is asking for the probability that both Alice and Bob have 2 coins before Carol gets her first coin. Thus, we only care about what happens before and up to the point where both Alice and Bob have 2 coins.
So, once we see that both Alice and Bob have two coins, we stop checking.
We can check all series of coin flip outcomes from length 4 to infinity. Let's first assume Alice gets to 2 coins first, then Bob. Length 4: Must be some form of ABAB -> last B is fixed, there are 3 ways to arrange the ABA, this has a chance of happening -> chance that it takes 4 tries for both Alice and Bob to have at least 2 coins is
Length 5: Must be some form of ABAAB -> Last B is fixed, there are 4 ways to arrange the ABAA, this has a chance of happening -> chance is
In general, for a sequence of length the probability is so our final probability sum will look something like this:
We can break the individual components of P after the first term down into 3 and several "1 bits":
So, from this, we can take first the sum
Then, we can do
Thus,
Note that we just talked about the case where Bob gets the last coin. But note that the case where Alice gets the last coin is symmetrical to this, and thus our answer is simply and thus our requested answer would be -DuoDuoling0
Solution 5 (basically steps of solution 4 but different math)
Like solution 4 we will stop the sequence after getting two of each and . and are symmetric in terms of probability so lets first tackle the case where it ends in .
- Case 1: String of where the strings of 's are of length 1 or more.
The chance of this is .
The chance of a string of 's can be evaluated using a geometric series:
Add all of these up and you get .
The total probability for this case is:
- Case 2 & 3: There are 2 more cases, or where the strings of 's is of length 2 or more.
So the total probability is:
Final Calculation:
- Chance of string ending in is equal to:
- Chance of ending in or is:
The requested answer is .
-Olecram(hopefully someone can make it into latex and format it)
-LI,CHENXI (no problem bro )