Respuesta :
Answer:
The number of different schedules possible is given by:
[tex]P_{(n,3)} = \frac{n!}{(n-3)!}[/tex]
In which n is the number of European cities that Betty would eventually like to visit.
Step-by-step explanation:
The order in which the cities are visited is important, for example, visiting Paris on Monday and London on Tuesday is a different schedule than London on Monday and Paris on Tuesday. This means that the permutations formula is used to solve this question.
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:
[tex]P_{(n,x)} = \frac{n!}{(n-x)!}[/tex]
She wants to visit n cities on 3 days:
So the number of different schedules possible is given by:
[tex]P_{(n,3)} = \frac{n!}{(n-3)!}[/tex]
In which n is the number of European cities that Betty would eventually like to visit.
