Difference between revisions of "2016 AMC 10B Problems/Problem 22"
Hotmonkey1 (talk | contribs) m (→Solution 2) |
Aops turtle (talk | contribs) m |
||
Line 18: | Line 18: | ||
Thus the answer is <math>1330-945=385</math> which is <math>\boxed{\textbf{(A)}}</math>. | Thus the answer is <math>1330-945=385</math> which is <math>\boxed{\textbf{(A)}}</math>. | ||
− | |||
− | |||
− | |||
==See Also== | ==See Also== | ||
{{AMC10 box|year=2016|ab=B|num-b=21|num-a=23}} | {{AMC10 box|year=2016|ab=B|num-b=21|num-a=23}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 23:44, 3 January 2020
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
There are teams. Any of the
sets of three teams must either be a fork (in which one team beat both the others) or a cycle:
But we know that every team beat exactly
other teams, so for each possible
at the head of a fork, there are always exactly
choices for
and
. Therefore there are
forks, and all the rest must be cycles.
Thus the answer is which is
.
See Also
2016 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 21 |
Followed by Problem 23 | |
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.