Question

Derek’s family is planning a trip to Asia. If they want to visit each of the cities listed in the table at the right, in how many different orders can they do so? Beijing, Shanghai, Taipei, Tokyo

Answer 1

The can do so in 24 different orders.

Explanation:

The number of arranjments of n elements, that is, in how many orders can n elements be organied is:

`A_(n) = n!`

In this problem, we have:

4 cities, which means that n = 4. So

`A_(4) = 4! = 24`

The can do so in 24 different orders.