The Roads of Mathematica
The beautiful country of Mathematica has
cities , and from each one lead at least
roads. Each road links two cities. It is known that you can reach any city from any other city by traveling along these roads.
Over all possible layouts that satisfy the above condition, what is the minimum number of transfers one must make to guarantee to reach any city from any city?
Details and Assumptions:
No two roads connect the same two cities.
The answer is 62.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!