Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2001 AIME II Problems/Problem 11

Revision as of 22:25, 20 February 2023 by Ayush agarwal (talk | contribs) (→‎solution 2)

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 $\frac {1}{3}$. The probability that Club Truncator will finish the season with more wins than losses is $\frac {m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Solution

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 $0$ ties, $3$ wins and $3$ losses; $2$ ties, $2$ wins, and $2$ losses; $4$ ties, $1$ win, and $1$ loss; or $6$ ties. Since there are $6$ games, there are $\frac{6!}{3!3!}$ ways for the first, and $\frac{6!}{2!2!2!}$, $\frac{6!}{4!}$, and $1$ ways for the rest, respectively, out of a total of $3^6$. This gives a probability of $141/729$. Then the desired answer is $\frac{1 - \frac{141}{729}}{2} = \frac{98}{243}$, so the answer is $m+n = \boxed{341}$.


Solution 2

At first, it wins $6$ games, only one way

Secondly, it wins $5$ games, the other game can be either win or loss, there are $\binom{6}{5}\cdot 2=12$ ways

Thirdly, it wins $4$ games, still the other two games can be either win or loss, there are $\binom{6}{4}\cdot 2^2=60$ ways

Fourthly, it wins $3$ games, this time, it can't lose $3$ games but other arrangements of the three non-winning games are fine, there are $\binom{6}{3}\cdot (2^3-1)=140$ ways

Fifth case, it wins $2$ games, only $0/1$ lose and $4/3$ draw is ok, so there are $\binom{6}{2}(1+\binom{4}{1})=75$ cases

Last case, it only wins $1$ game so the rest games must be all draw, $1$ game

The answer is $\frac{1+12+60+140+75+6}{3^6}=\frac{98}{243}$ leads to $\boxed{341}$

~bluesoul

See also

2001 AIME II (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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2001_AIME_II_Problems/Problem_11&oldid=190096"