SOLUTION: There are European cities that Jim would eventually like to visit. On his next vacation, though, he only has time to visit of the cities: one on Monday, one on Tuesday, and one
Algebra ->
Probability-and-statistics
-> SOLUTION: There are European cities that Jim would eventually like to visit. On his next vacation, though, he only has time to visit of the cities: one on Monday, one on Tuesday, and one
Log On
Question 1153133: There are European cities that Jim would eventually like to visit. On his next vacation, though, he only has time to visit of the cities: one on Monday, one on Tuesday, and one on Wednesday. He is now trying to make a schedule of which city he'll visit on which day. How many different schedules are possible? (Assume that he will not visit a city more than once.) Answer by ikleyn(52756) (Show Source):
His schedule is in 3 lines.
1-st line is the name of one of 14 cities --- any one of 14.
2-nd line is the name of another of 14 cities --- any one of remaining 13 cities.
Finally, 3-rd line is the name of just another of 14 cities --- any one of remaining 12 cities.
In this way, 14*13*12 different schedules are possible.
14*13*12 = 2184. ANSWER
