Question
In how many ways can persons be seated around a round table such that two specific persons and never sit next to each other?
Solution — Step by Step
For persons around a circular table, total arrangements .
Treat and as a single unit. Now we have “units” to arrange in a circle: . Within the unit, and can swap: factor of .
Final answer: arrangements.
Why This Works
The complement principle is the standard PnC weapon: rather than counting “not adjacent” directly (which means choosing ‘s seat, then carefully picking ‘s non-neighbouring seats — easy to miscount), count the easier opposite event “adjacent” and subtract from total.
The “treat together as a unit” trick reduces an adjacency problem to a permutation of fewer items. The internal swap (here, - vs -) is a separate factor.
Alternative Method
Direct counting: fix ‘s seat (since it’s circular, this kills the rotational symmetry — gives for the rest, but we’re working with already). Now has remaining seats, of which are adjacent to . So has non-adjacent choices. The remaining persons can be arranged in ways:
Same answer through different reasoning. Always cross-check using both methods on the day of the exam.
Common Mistake
Forgetting the internal when treating and as a unit. The unit could be "" or "", and these are different arrangements. Missing this factor gives — a popular wrong answer.
Using instead of for circular permutations. The first person’s seat doesn’t matter in a circular arrangement (all rotations look the same), so we lose one degree of freedom.
The “round table + adjacency” pattern shows up in roughly JEE Main paper out of in the last decade. Practise both versions: “always together” and “never together” — the second is just total minus the first.