AIME 2001 II · 第 11 题
AIME 2001 II — Problem 11
题目详情
Problem
Club Truncator is in a soccer league with six other teams, each of which it plays once. In any of its 6 matches, the probabilities that Club Truncator will win, lose, or tie are each . The probability that Club Truncator will finish the season with more wins than losses is , where and are relatively prime positive integers. Find .
解析
Solution 1
Note that the probability that Club Truncator will have more wins than losses is equal to the probability that it will have more losses than wins; the only other possibility is that they have the same number of wins and losses. Thus, by the complement principle, the desired probability is half the probability that Club Truncator does not have the same number of wins and losses.
The possible ways to achieve the same number of wins and losses are ties, wins and losses; ties, wins, and losses; ties, win, and loss; or ties. Since there are games, there are ways for the first, and , , and ways for the rest, respectively, out of a total of . This gives a probability of . Then the desired answer is , so the answer is .
Solution 2
At first, it wins games, only one way.
Secondly, it wins games, the other game can be either win or loss, there are ways.
Thirdly, it wins games, still the other two games can be either win or loss, there are ways.
Fourthly, it wins games, this time, it can't lose games but other arrangements of the three non-winning games are fine, there are ways.
Fifth case, it wins games, only lose and draw is ok, so there are cases.
Last case, it only wins game so the rest games must be all draw, game.
The answer is leads to
~bluesoul
Solution 3
This problem is symmetrical, and we should probably take advantage of that. We have that:
Now, all we need to do is find the probability that the number of wins is equal to the number of losses, and then it's simple linear equations from there! We have 4 cases. We can let be the format for these cases. For example, would mean 3 wins, 2 losses, and 1 tie. Now, we begin our casework.
Summing these up we get . Now, we have , where . Solving, we get
-jb2015007