Evaluate 32 + (5 − 2) ⋅ 4 − 6 over 3. (1 point)
1 answer:
You might be interested in
Answer:
D. 720
Step-by-step explanation:
For this case we have 6 different cities that needs to be ordered in different ways. And the best way to solve this problem is using permutations since we can't repeat the route.
We need to remember the concept of permutation.
A permutation, known as "arrangement number" "is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself". Where S correspond to the sample space. And the formula is given by:
And for this case we have a total of 6 cities and we want to know how many routes with these 6 cities we can create, so then n=6 and k=6 and if we replace we got:
And then we have 720 ways to visit six different cities. So the best option is:
D. 720