Find the numerical value.
-A manager of a road construction company must send one engineer to each of three different job sites to meet with government inspectors. There are 8 engineers available. How many different
Ways can the manager send one engineer to each of the job sites? (Assume that sending a particular
Engineer to job site 1 is different than sending the same engineer to either job site 2 or 3.)
A)6720
B)56
C)336
D)6

Question

Quizplus · Accepted Answer

This is a permutation problem because the order in which the engineers are sent to the job sites matters. The formula for permutations is P(n, r) = n! / (n-r)!, where n is the total number of items to choose from, r is the number of items to choose, and "!" denotes factorial, which is the product of all positive integers up to that number. Here, n = 8 engineers and r = 3 job sites. So, P(8, 3) = 8! / (8-3)! = 8! / 5! = (8*7*6*5!)/5! = 8*7*6 = 336.

Find the Numerical Value