Respuesta :
This is a problem regarding permutation.
[tex]P\left(3,3\right)=3!=3\times 2\times 1=6[/tex]
There are 6 different ways.
[tex]P\left(3,3\right)=3!=3\times 2\times 1=6[/tex]
There are 6 different ways.
Answer:
Answer is 6 ways
Step-by-step explanation:
Given that a family wants to visit three different places as Philadelphia, Baltimore, and Washington.
We have to find the number of ways these three can be visited.
Here this is a question of permutation since order matters.
There are 3 cities and these can be visited in 3P3 ways =3!
=3x2x1 =6 ways
There are in total 6 different ways that the family can visit three different places as Philadelphia, Baltimore, and Washington.