Posted by Jennifer on Monday, March 2, 2009 at 1:02am.
A manufacturing company in city A wishes to truck its product to 4 different cities, B, C, D, and E. If the cities are all interconnected by roads, how many different route plans can be constructed so that a single truck, starting from A, will visit each city exactly once, then return home?
Thank you for your help!!

Finite Math  mathstudent, Monday, March 2, 2009 at 10:56am
3! = 3*2*1 = 12
Starting at A, he can go to B or C or D (three choices). From there, the driver has two choices. Then will have only one route left.
That sounds like an easy version of the standard traveling sales person problem.
Answer This Question
Related Questions
 Algebra  I can not figure out how to set this problem up. I know the answer is ...
 Maths  On each business trip, a salesman visits three of the eight major cities...
 Math  A tourist in Ireland wants to visit seven different cities. If the route ...
 Statistics / Math  A tourist in Ireland wants to visit seven different cities. ...
 geometry  A tourist in France wants to visit 5 different cities. If the route ...
 fizik  i really need the answer quickly 1. Linda travels by car around one city...
 math  On vacation, Le Hong averaged 45 mph traveling from city A to city B. ...
 physics  A person travels by car from one city to another with different ...
 Math  A sales representative must visit five cities. There are direct air ...
 Math  A theater group made appearances in two cities. The hotel charge before ...
More Related Questions