Difference between revisions of "2017 AIME II Problems/Problem 11"
The turtle (talk | contribs) (Created page with "<math>\textbf{Problem 11}</math> Five towns are connected by a system of raods. There is exactly one road connecting each pair of towns. Find the number of ways there are to m...") |
|||
| Line 1: | Line 1: | ||
| − | + | ==Problem== | |
Five towns are connected by a system of raods. There is exactly one road connecting each pair of towns. Find the number of ways there are to make all the roads one-way in such a way that it is still possible to get from any town to any other town using the roads (possibly passing through other towns on the way). | Five towns are connected by a system of raods. There is exactly one road connecting each pair of towns. Find the number of ways there are to make all the roads one-way in such a way that it is still possible to get from any town to any other town using the roads (possibly passing through other towns on the way). | ||
| − | + | ==Solution== | |
<math>\boxed{544}</math> | <math>\boxed{544}</math> | ||
| + | |||
| + | =See Also= | ||
| + | {{AIME box|year=2017|n=II|num-b=9|num-a=11}} | ||
| + | {{MAA Notice}} | ||
Revision as of 13:00, 23 March 2017
Problem
Five towns are connected by a system of raods. There is exactly one road connecting each pair of towns. Find the number of ways there are to make all the roads one-way in such a way that it is still possible to get from any town to any other town using the roads (possibly passing through other towns on the way).
Solution
See Also
| 2017 AIME II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 9 |
Followed by Problem 11 | |
| 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. 
