To solve the problem of assigning 10 new workers to five shifts
(first, second, third, and two alternate shifts), with each shift
receiving exactly 2 workers, we need to use combinations and account
for the indistinguishability of the two alternate shifts.
Step-by-Step Solution:
Total Workers and Shifts:
There are 10 workers.
There are 5 shifts, each receiving 2 workers.
Choosing 2 Workers for Each Shift:
The number of ways to choose 2 workers out of 10 for the first shift
is (10 C 2).
After assigning 2 workers to the first shift, 8 workers remain. The
number of ways to choose 2 workers out of these 8 for the second shift
is (8 C 2).
After assigning 2 workers to the second shift, 6 workers remain. The
number of ways to choose 2 workers out of these 6 for the third shift
is (6 C 2).
After assigning 2 workers to the third shift, 4 workers remain. The
number of ways to choose 2 workers out of these 4 for the fourth shift
is (4 C 2).
Finally, the number of ways to choose 2 workers out of the remaining 2
for the fifth shift is (2 C 2).
Calculating the Combinations:
(10 C 2) × (8 C 2) × (6 C 2) × (4 C 2) × (2 C 2)
Simplifying the Combinations:
(10 C 2) = 10! / (2!(10-2)!) = 10 × 9 / 2 × 1 = 45
(8 C 2) = 8! / (2!(8-2)!) = 8 × 7 / 2 × 1 = 28
(6 C 2) = 6! / (2!(6-2)!) = 6 × 5 / 2 × 1 = 15
(4 C 2) = 4! / (2!(4-2)!) = 4 × 3 / 2 × 1 = 6
(2 C 2) = 2! / (2!(2-2)!) = 2 × 1 / 2 × 1 = 1
Multiplying the Results:
45 × 28 × 15 × 6 × 1 = 113400
Adjusting for Overcounting:
Since the two alternate shifts are indistinguishable, we need to
divide by the number of ways to arrange these 2 shifts, which is 2!:
113400 / 2 = 56700
Therefore, the number of different ways the plant manager can assign
the 10 new workers to the five shifts is: 56700