Homework Help: Finite Math

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

social science - 1) Which large European city declined significantly in ...
Math - A sales representative must visit five cities. There are direct air ...
Math 0098 - A theater group made appearances in two cities. The hotel charge ...
Math - I am not sure about this problem Find four large cities around the world ...
Math - At 11:00am a car (1) leaves city "A" at a constant rate of 60 ...
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. ...
Econ - A firm is considering locating a 100 employee microprocessor production ...
American Studies - Affordable housing and improved transportation allowed people...
geometry - A tourist in France wants to visit 5 different cities. If the route ...

For Further Reading

First Name:
School Subject:
Answer: