Question Number 209021 by hardmath last updated on 30/Jun/24

A group of people from k families should be seated around a round table, with a_{i} number of people in the i family. Each family member must sit together (i.e. no family member can sit between other family members). There are l spaces around the table. There are seats (l>k). How many ways can we seat k number of families around a round table under these conditions.
Commented by mr W last updated on 30/Jun/24

Commented by mr W last updated on 30/Jun/24

Commented by hardmath last updated on 30/Jun/24

Commented by mr W last updated on 30/Jun/24

Commented by hardmath last updated on 30/Jun/24

Commented by mr W last updated on 30/Jun/24

Commented by hardmath last updated on 30/Jun/24

Answered by mr W last updated on 30/Jun/24
![I seats around a round table are to be taken by the members of k families and the members of the same family must sit together. that means at least one member of each family must be choosen. to arrange k families around the round table there are (k−1)! ways. say from family i we choose n_i members, 1≤n_i ≤a_i . n_1 +n_2 +n_3 +...+n_k =I with I ≥k to select n_i from a_i members in the family i there are C_n_i ^a_i ways and to arrange them there are n_i ! ways. so the total number of ways is the coefficient of term x^I in the expansion (k−1)!Π_(i=1) ^k [Σ_(n_i =1) ^a_i C_n_i ^a_i (n_i !)x^n_i ]](https://www.tinkutara.com/question/Q209045.png)
Commented by hardmath last updated on 30/Jun/24

Commented by mr W last updated on 30/Jun/24

Commented by mr W last updated on 30/Jun/24

Commented by hardmath last updated on 30/Jun/24

Commented by mr W last updated on 01/Jul/24

Commented by mr W last updated on 01/Jul/24
