Difference between revisions of "2017 AIME II Problems/Problem 11"
(→See Also) |
|||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
| − | Five towns are connected by a system of | + | Five towns are connected by a system of roads. 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== | ==Solution== | ||
Revision as of 16:07, 23 March 2017
Problem
Five towns are connected by a system of roads. 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 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. 
