Jill, who lives in City C, plans to visit 3 different cities, M, L, and S. She plans to visit each city exactly once and return to City C after the 3 visits. She can visit the cities in any order. In how many different orders can she visit the 3 cities

Question

Breanna Browning

Mathematics

7 February, 07:37

Jill, who lives in City C, plans to visit 3 different cities, M, L, and S. She plans to visit each city exactly once and return to City C after the 3 visits. She can visit the cities in any order. In how many different orders can she visit the 3 cities

+5

Answers (1)

Know the Answer?

Drew Stanton · Answer 1

Jill can visit these 3 cities in 6 different orders.

Step-by-step explanation:

As question clearly tells that Jill plan to visit 3 different cities M, L, and S.

She plans to visit each city exactly once and return to City C after 3 visits.

So the different orders in which she can visit 3 cities will be

M L S C

M S L C

L M S C

L S M C

S M L C

S L M C

In other words number of ways she can visit = 3! = 6

So there are 6 orders in which she can visit these three cities.