Waste less time on Facebook — follow Brilliant.

There are five cities \(A,B,C,D,E \) on a certain island.Each city is connected to every other city by road . In how many ways can a person starting from city \(A\) come back to \(A\) after visiting a city more than once and without taking the same road more than once? (The order in which he visits the cities also matters e.g the routes \(A\rightarrow B \rightarrow C \rightarrow A \) and \(A\rightarrow C \rightarrow B \rightarrow A\) are different.

Note by Vilakshan Gupta
2 months ago

No vote yet
1 vote


There are no comments in this discussion.


Problem Loading...

Note Loading...

Set Loading...