Difference between revisions of "2016 AMC 12B Problems/Problem 20"
(→Solution 1) |
(→Solution 3.1 (very risky too)) |
||
(5 intermediate revisions by 2 users not shown) | |||
Line 17: | Line 17: | ||
==Solution 2== | ==Solution 2== | ||
− | As above, note that there are 21 teams, and call them A, B, C, ... T, U. WLOG, assume that A beat teams B-L and lost to teams M-U. We will count the number of sets satisfying the | + | As above, note that there are 21 teams, and call them A, B, C, ... T, U. WLOG, assume that A beat teams B-L and lost to teams M-U. We will count the number of sets satisfying the “cycle-win” condition—e.g. here, A beats a team in X which beats a team in Y which beats A. The first and third part of the condition are already met by our wlog, so we just need to count of number of ways the second condition is true (a team in X beats a team in Y). These are the number of cycle-wins that include A, then multiply by 21 (for each team) and divide by 3 (since every set will be counted by each of the 3 teams that are a part of that set). |
− | ==Solution 3 (very very | + | To do this, let X<math>=\{B, ..., L\}</math> and Y<math>=\{M, ..., U\}</math>. Since a total of <math>10*10=100</math> losses total were suffered by teams in Y and <math>\binom{10}{2}=45^{*}</math> losses were suffered by teams in Y from teams in Y, we have <math>100-45=55</math> losses suffered by teams in Y from teams in X. Hence, for each of these <math>55</math> losses, there is exactly one set of three teams that includes A that satisfies the problem conditions. Thus, the answer is <math>\frac{55\cdot 21}{3}=\boxed{385}</math>. |
+ | |||
+ | |||
+ | <math>~^{*}</math>the number of ways that two teams in Y play each other — each face-off guarantees 1 loss (and 1 win) | ||
+ | |||
+ | ==Solution 3 (very very risky—only try if you're running out of time)== | ||
Note that there are <math>21</math> teams total and <math>\binom{21}{3}=1330</math> ways to pick <math>{A,B,C}.</math> The possible arrangements are one team beats the other two or they each win/lose equally (we want the second case). Approximately <math>\frac{1}{4}</math> of all the arrangements satisfy the second case, and <math>\frac{1330}{4}=332.5,</math> which is by far the closest to <math>\boxed{(A)}.</math> | Note that there are <math>21</math> teams total and <math>\binom{21}{3}=1330</math> ways to pick <math>{A,B,C}.</math> The possible arrangements are one team beats the other two or they each win/lose equally (we want the second case). Approximately <math>\frac{1}{4}</math> of all the arrangements satisfy the second case, and <math>\frac{1330}{4}=332.5,</math> which is by far the closest to <math>\boxed{(A)}.</math> | ||
Latest revision as of 16:43, 10 August 2024
Contents
Problem
A set of teams held a round-robin tournament in which every team played every other team exactly once. Every team won games and lost
games; there were no ties. How many sets of three teams
were there in which
beat
,
beat
, and
beat
Solution 1
We use complementary counting. First, because each team played other teams, there are
teams total. All sets that do not have
beat
,
beat
, and
beat
have one team that beats both the other teams. Thus we must count the number of sets of three teams such that one team beats the two other teams and subtract that number from the total number of ways to choose three teams.
There are ways to choose the team that beat the two other teams, and
to choose two teams that the first team both beat. This is
sets. There are
sets of three teams total. Subtracting, we obtain
, thus
is our answer.
Solution 2
As above, note that there are 21 teams, and call them A, B, C, ... T, U. WLOG, assume that A beat teams B-L and lost to teams M-U. We will count the number of sets satisfying the “cycle-win” condition—e.g. here, A beats a team in X which beats a team in Y which beats A. The first and third part of the condition are already met by our wlog, so we just need to count of number of ways the second condition is true (a team in X beats a team in Y). These are the number of cycle-wins that include A, then multiply by 21 (for each team) and divide by 3 (since every set will be counted by each of the 3 teams that are a part of that set).
To do this, let X and Y
. Since a total of
losses total were suffered by teams in Y and
losses were suffered by teams in Y from teams in Y, we have
losses suffered by teams in Y from teams in X. Hence, for each of these
losses, there is exactly one set of three teams that includes A that satisfies the problem conditions. Thus, the answer is
.
the number of ways that two teams in Y play each other — each face-off guarantees 1 loss (and 1 win)
Solution 3 (very very risky—only try if you're running out of time)
Note that there are teams total and
ways to pick
The possible arrangements are one team beats the other two or they each win/lose equally (we want the second case). Approximately
of all the arrangements satisfy the second case, and
which is by far the closest to
See Also
2016 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 19 |
Followed by Problem 21 |
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.