- #1
EvLer
- 458
- 0
Hello,
I have another combinatorics problem:
find the number of ways in which 5 different jobs can be assigned to 3 identical processors so that each processor gets at least 1 job.
So, I am thinking that it is partitioning a set of 5 into 3 blocks, which would be S(5,3), is that correct? or am I missing something?
Thanks...
I have another combinatorics problem:
find the number of ways in which 5 different jobs can be assigned to 3 identical processors so that each processor gets at least 1 job.
So, I am thinking that it is partitioning a set of 5 into 3 blocks, which would be S(5,3), is that correct? or am I missing something?
Thanks...