Skip to content
Worked Examples · Example 33

Q.17 persons are invited to a party. How many seating arrangements are possible at a round table if

(i) the host can sit any where
(ii) the bigger chair is fixed for the host
(iii) there are two pairs of indistinguishable twins among the guests.
Sikkim CbseNCERTSubjective· 3mImportance★★★★★est
69% · 87/126 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

For 17 persons at a round table: host-anywhere =16!=16!; host's chair fixed =16!=16! (same, by how the circular formula arises); with two indistinguishable twin pairs =16!/(2!2!)=5,230,697,472,000=16!/(2!2!)=5{,}230{,}697{,}472{,}000.

Circular arrangement of nn distinct people =(n−1)!=(n-1)!. Fixing one specific seat for one specific person removes rotational ambiguity directly, giving the same count (n−1)!(n-1)! for the remaining people. When kk pairs among the people are mutually indistinguishable, divide by 2!2! for each such pair.

  1. n=17n=17 persons.
  2. (i) Host can sit anywhere — ordinary circular table, rotations equivalent:

(17−1)!=16!=20,922,789,888,000(17-1)!=16!=20{,}922{,}789{,}888{,}000

  1. (ii) The bigger chair is fixed for the host — this specific seat is now a distinguishable reference point, so the host's rotational freedom is already removed, and the remaining 16 people simply fill the other 16 seats:

16!=20,922,789,888,00016!=20{,}922{,}789{,}888{,}000

This is numerically identical to (i), since fixing one person's seat is precisely the standard device used to derive the (n−1)!(n-1)! circular formula in the first place. …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.