The number of ways in which 5 boys and 3 girls can be seated on a round table if a particular boy and a particular girl never sit adjacent to each other, is:
Let us begin by observing that there are 5 boys and 3 girls, so altogether persons have to be seated around one round table.
On a circular table, rotations of a complete seating are not considered different. Therefore, if there were no restriction at all, the total number of circular permutations of the 8 distinct persons would be
Now impose the given restriction: the particular boy and the particular girl must never sit next to each other. A convenient way to handle such a restriction is to count the “bad” arrangements in which they are adjacent and then subtract that count from the total count.
Step 1: Count the arrangements in which and are adjacent.
When two specified persons have to be adjacent on a round table, we may temporarily tie them together and treat them as a single “super person.” However, note that inside that pair the order could be or ; hence there are internal arrangements.
After forming the pair we effectively have distinct entities to arrange around the circle.
The number of circular permutations of 7 distinct entities is
For each of these ways, the internal order of the pair can be chosen in ways. Hence the total number of “bad” arrangements is
Step 2: Subtract the “bad” arrangements from the total.
The number of desired arrangements (where and are not adjacent) equals
Now simplify this expression algebraically:
This quantity matches the expression given in Option B.
Hence, the correct answer is Option B.
Tagged Circular permutations. Machine-assigned, so read it as a strong shortlist rather than a verdict.