SOLUTION: From a pool of 7 secretaries, 3 are selected to be assigned to 3 managers, 1 secretary to each manager. In how many ways can this be done?

Algebra ->  Permutations -> SOLUTION: From a pool of 7 secretaries, 3 are selected to be assigned to 3 managers, 1 secretary to each manager. In how many ways can this be done?      Log On


   



Question 115975: From a pool of 7 secretaries, 3 are selected to be assigned to 3 managers, 1 secretary to each manager. In how many ways can this be done?
Answer by solver91311(24713) About Me  (Show Source):
You can put this solution on YOUR website!
There are 7 ways to select the first secretary from the pool of 7, and once that is done, there are 6 ways to select the second secretary, and then 5 ways to select the third,

Altogether then there are 7 X 6 X 5 or 210 different ways to select the three secretaries.

Of course, that presumes that selecting secretaries 1, 4, and 7 and assigning them in that order to bosses 1, 2, and 3 is a different result from selecting them in the order 4, 7, and 1, for example.