## anonymous 4 years ago 10 distinct computational tasks are to be assigned to 3 processors. The first processor should receive 5 tasks, the second processor should receive 3 tasks, and the third processor should receive 2 tasks. The total number of different assignments that obey the given constraint is....

1. anonymous

is it 2520?, (10 choose 5) times (5choose3) times (2choose2)

2. 2bornot2b

$3!\times (^{10}C_5\times ^5C_3\times ^2C_2)$

3. anonymous

why multiply by 3 factorial?

4. 2bornot2b

I am considering that you are allowed to decide which machine you call 1 and which 2 and which 3

5. 2bornot2b

Is it OK?

6. anonymous

i understand what your saying but does the question mean that? i mean your answer would be appropriate if its just a division of tasks among 3 processors

7. 2bornot2b

The question doesn't state that out clearly. However, you know which answer is for which question..

8. anonymous

k this is the follow up question

9. anonymous

10 distinct computational tasks are to be assigned to 3 processors. The total number of different assignments is...

10. 2bornot2b

$3^{10}$

11. anonymous

ok

12. 2bornot2b

Any more questions? Or I am out of the way..

13. mathmate

3^10 assumes the processors are distinct. (not explicitly specified in the question). If the processors are not distinct (such as same model, same brand), then it is 3^10/3!.

14. anonymous

that works out to be 9841.5 possibilities