2020 AMC 10A Problems/Problem 25
- The following problem is from both the 2020 AMC 12A #23 and 2020 AMC 10A #25, so both problems redirect to this page.
Contents
Problem
Jason rolls three fair standard six-sided dice. Then he looks at the rolls and chooses a subset of the dice (possibly empty, possibly all three dice) to reroll. After rerolling, he wins if and only if the sum of the numbers face up on the three dice is exactly Jason always plays to optimize his chances of winning. What is the probability that he chooses to reroll exactly two of the dice?
Solution 1
Consider the probability that rolling two dice gives a sum of , where . There are pairs that satisfy this, namely , out of possible pairs. The probability is .
Therefore, if one die has a value of and Jason rerolls the other two dice, then the probability of winning is .
In order to maximize the probability of winning, must be minimized. This means that if Jason rerolls two dice, he must choose the two dice with the maximum values.
Thus, we can let be the values of the three dice. Consider the case when . If , then we do not need to reroll any dice. Otherwise, if we reroll one die, we can reroll any one dice in the hope that we get the value that makes the sum of the three dice . This happens with probability . If we reroll two dice, we will roll the two maximum dice, and the probability of winning is , as stated above. However, , so rolling one die is always better than rolling two dice if .
Now consider the case where . Rerolling one die will not help us win since the sum of the three dice will always be greater than . If we reroll two dice, the probability of winning is, once again, . To find the probability of winning if we reroll all three dice, we can let each dice have dot and find the number of ways to distribute the remaining dots. By stars and bars, there are ways to do this, making the probability of winning .
In order for rolling two dice to be more favorable than rolling three dice, .
Thus, rerolling two dice is optimal if and only if and . The possible triplets that satisfy these conditions, and the number of ways they can be permuted, are
ways.
ways.
ways.
ways.
ways.
ways.
ways.
ways.
ways.
ways.
There are ways in which rerolling two dice is optimal, out of possibilities, Therefore, the probability that Jason will reroll two dice is .
Solution 2 (Illustration)
We conclude all of the following after the initial roll:
- Jason rerolls exactly zero dice if and only if the sum of the three dice is in which the probability of winning is always
- If Jason rerolls exactly one die, then the sum of the two other dice must be or The probability of winning is always as exactly of the possible outcomes of the die rerolled results in a win.
- If Jason rerolls exactly two dice, then the outcome of the remaining die must be or Applying casework to the remaining die produces the following table: The probability of winning is at most
- If Jason (re)rolls all three dice, then the probability of winning is always
For the denominator, rolling three dice gives a total of possible outcomes.
For the numerator, this is the same as counting the ordered triples of positive integers for which Suppose that balls are lined up in a row. There are gaps between the balls, and placing dividers in of the gaps separates the balls into piles. From left to right, the numbers of balls in the piles correspond to and respectively. There are ways to place the dividers. Note that the dividers' positions and the ordered triples have one-to-one correspondence, and holds for all such ordered triples.
The optimal strategy is that:
- If Jason needs to reroll at least zero dice to win, then he rerolls exactly zero dice.
- If Jason needs to reroll at least one die to win, then he rerolls exactly one die.
- If Jason needs to reroll at least two dice to win, then he rerolls exactly two dice if and only if the probability of winning is greater than the probability of winning for rerolling all three dice.
The first three cases in the table above satisfy this requirement. We will analyze these cases by considering the initial outcomes of the two dice rerolled. Note that any of the three dice can be the remaining die, so we need a factor of for all counts in the third column:
Finally, the requested probability is
~MRENTHUSIASM
Solution 3 (Similar to Solution 2)
We count the numerator. Jason will pick up no dice if he already has a as a sum. We need to assume he does not have a to begin with. If Jason decides to pick up all the dice to re-roll, by the stars and bars rule ways to distribute, , there will be bars and stars ( of them need to be guaranteed because a roll is at least ) for a probability of . If Jason picks up dice and leaves a die showing , he will need the other two to sum to . This happens with probability for integers . If the roll is not , Jason will pick up exactly one die to re-roll if there can remain two other dice with sum less than , since this will give him a chance which is a larger probability than all the cases unless he has a to begin with. We have We count the underlined part's frequency for the numerator without upsetting the probability greater than it. Let be the roll we keep. We know since would cause Jason to pick up all the dice. When , there are choices for whether it is rolled st, nd, or rd, and in this case the other two rolls have to be at least (or he would have only picked up ). This give ways. Similarly, gives because the can be rolled in places and the other two rolls are at least . gives . Summing together gives the numerator of . The denominator is , so we have .
Solution 4
We can quickly write out all possible rolls that result in a total of , to get that there is a chance that rolling three dice will result in a total of .
Claim 1: If all of Jason's initial outcomes are , or , Jason is best off rerolling everything.
Proof of if part: If Jason rerolls two dice, he would like for the sum of the two outcomes to be . Since in this case, every dice's initial outcome is , or , this value is , or . By basic dice probability, the probability that they add to one is ; the probability that they add to two is ; the probability that they add to three is . Each of these probabilities is less than , (the probability of winning by rerolling everything) so Jason should not reroll one dice in this scenario. Rolling one die is also nonsense in this situation, since the other two dice will already add up to something greater than .
Proof of only-if part: If Jason rolls a , or , even just once, then, the probability that rerolling the other two dice will result in win is , and , by basic die probability. Each of these is greater than , so if Jason rolls a , or , he should not reroll everything.
Claim 2: Iff the sum of any two of the initial dice is less than , Jason is best off rerolling one or zero die.
Proof of if part: If the sum of any two of the initial dice is less than , when the other die is rolled, there is always a fixed chance that this results in a win for Jason (or, he his initial roll already won, so he doesn't have to roll anything). Rerolling that one die is better than rerolling all three dice, since, as we have seen there is a chance that Jason wins from that. Rerolling that one die is also better than rerolling two dice: by basic die probability, if Jason wishes for the sum of two rerolled dice to equal one value, the maximum probability this happens is , and this is when he wishes for the sum to be ; however, since he wishes for the sum of all three dice to be , this will never happen, so the probability that rerolling two dice results in a win is always less than .
Proof of only-if part: If the sum of each pair of the three dice is at least , it would make no sense to reroll one die, since the final sum of all three dice will always be greater than . Also, if the sum of each pair of the three dice is at least , the total initial sum must also be greater than , so Jason should not reroll zero dice.
From having shown these two claims, we know that Jason should reroll two dice if at least one of them is a , or , and if the sum of any two of the initial dice is at least . We can write out all the possibilities of initial rolls, account for their permutations, and add everything together to see that there are total outcomes, where Jason should reroll two dice. Therefore, our final answer is .
~ ihatemath123
Solution 5
If the sum of the dice is 7, we reroll no dice. If the sum of any two dice is , we reroll 1 die because rolling 1 die will give Jason a chance of winning. Thus, we consider the scenario where the sum of any two dice is 7 or greater.
If the smallest die is 1, the other two dice must be 6, which has possible permutations.
If the smallest die is 2, the other two dice can be 5 or 6. There are 3 ways to choose the position of the smallest die, 2 ways each to choose the value of the other dice, so there are possible permutations.
If the smallest die is 3, the other two dice can be 4, 5, or 6. Similarly, there are 3 ways to choose the position of the smallest die, and 3 ways each to choose the value of the other dice, so there are possible permutations.
If all die are 4 or above, then we reroll 3 dice. When we reroll all 3 dice, the winning rolls are 1,1,5; 1,2,4; 1,3,3; 2,2,3 in some arrangement, for a total of 15 permutations. Thus, the probability of winning after rerolling 3 dice is . If we reroll only 2 dice with the smallest die being , we would need to roll 1,2 or 2,1 to win, which gives a chance of winning, so this is worse.
If the smallest die is 5 or 6, rerolling 2 dice gives us even worse odds.
Therefore, the cases where 1, 2, or 3 are the smallest die covers all cases where 2 rerolls is optimal. There are permutations out of 216 total permutations, giving us a probability of .
~JGsomeone, krwang
Video Solution 1 by Brain Math Club
Video Solution 2 (Richard Rusczyk)
https://artofproblemsolving.com/videos/amc/2020amc10a/516
Video Solution 3 by Confusion
https://www.youtube.com/watch?v=caUKXO7R0bc
See Also
2020 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 24 |
Followed by Last Problem | |
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 10 Problems and Solutions |
2020 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 22 |
Followed by Problem 24 |
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.