There are 6 jobs with distinct difficulty levels, and 3 computers with distinct processing speeds. Each job is assigned to a computer such that: - The fastest computer gets the toughest job and the slowest computer gets the easiest job. - Every computer gets at least one job. The number of ways in which this can be done is ______. A. 3 B. 5 C. 65 D. 15
GATE 2021 · Discrete Mathematics · Counting · hard
Answer: 65
- Fix the two constrained assignments: J1 -> C1 (slowest) and J6 -> C3 (fastest): both are forced. Free jobs remaining: J2, J3, J4, J5.
- Count all unconstrained assignments of the 4 free jobs: Each of 4 free jobs goes to one of 3 computers independently: 3^4 = 81 ways
- Subtract assignments where C2 gets none of the free jobs: If C2 gets no free job, each of the 4 free jobs goes to C1 or C3 only: 2^4 = 16 bad assignments. Valid assignments = 81 - 16 = 65