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...") |
(No difference)
|
Revision as of 12:37, 23 March 2017
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).
