There are 6 cities, and every city is connected to each other. How many different routes can one trace from A to B, such that no city is touched more than once in any one route?

🎲 Try a Random Question  |  Total Questions in Quiz: 10  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
Cognizant Placement Quantitative Aptitude Practice Test — practice the complete quiz, review flashcards, or try a random question.


There are 6 cities, and every city is connected to each other. How many different routes can one trace from A to B, such that no city is touched more than once in any one route?