Mathematics - Permutation & Combination Question with Solution | TestHub
Match the following counting problems in List-I with their correct numerical answers in List-II.
List - I | List - II |
|---|---|
(P) The number of distinct permutations of the letters of the word `MISSISSIPPI` such that no two 'S's are adjacent. | (1) 18 |
(Q) The number of ways to distribute 10 identical candies to 3 distinct children such that each child receives at least one candy and no child receives more than 5 candies. | (2) 210 |
(R) The number of ways to form 3 teams of 3 players each from 9 distinct players, such that two specific players are in different teams. | (3) 828 |
(S) The number of ways to arrange 4 married couples around a circular table such that no husband sits next to his wife. | (4) 7350 |
Options:
Answer:
Solution:
For (P): The letters are M(1), I(4), S(4), P(2). First, arrange the 7 letters other than 'S' (M, I, I, I, I, P, P) in ways. These 7 letters create 8 gaps. To ensure no two 'S's are adjacent, place the 4 'S's in 4 distinct gaps in ways. Total permutations = .
For (Q): We need solutions to with . Let , so with . Total non-negative solutions are . Using inclusion-exclusion, let be the condition . . So, . No solution exists for and simultaneously. Thus, .
For (R): Total ways to divide 9 distinct players into 3 teams of 3 is . If two specific players (A and B) are in the same team, choose 1 more player for their team from the remaining 7 in ways. The remaining 6 players form 2 teams of 3 in ways. So, A and B are in the same team in ways. Thus, A and B are in different teams in ways.
For (S): Total circular arrangements of 8 people is . Using inclusion-exclusion, let be the condition that couple sits together. . . . . The number of arrangements is .
