Hello, I present to you an interesting combinatorics question:
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.
hello everyone. Im writing a project on the topic“ Solution of
Nonlinear partial differential equation using charpits methods”
curently writing chapter 2 but I′m a little bit confused about what ih
should include in my theoretical framework. Any ideas?