Seating Arrangements for Different Table Shapes

  • Thread starter Thread starter ZombiesFTW
  • Start date Start date
  • Tags Tags
    Combinatorics
ZombiesFTW
Messages
6
Reaction score
0
A group of 3 couples has decided to start a dinner club. The first couple’s dinner table is rectangular with room for two people on either of the longer sides and room for one on either of the shorter sides. The second couple’s table is triangular, with room for two people on each side. The third couple’s table is circular. Up to rotations, how many different seating arrangements exist for each table?
1 2 3 4 ... n-1 n
1 2 3 4 ... 2 1
( n )
(m1, m2, ... mk)
this equals n! / (m1! * m2! * ... * mk!)
m1 + m2 + ... + mk = n

Let one seat be stationary at each different table. So then you have 5! which is the answer
 
Last edited:
Physics news on Phys.org
I am hoping someone here can be of some help.
 
For each table, think about how many arrangements are "equivalent" to a given one via some rotation. For example, at the triangular table, each possible seating arrangement is equivalent to exactly two others (there are two nontrivial ways to rotate an equilateral triangle into itself). Another way of saying this is that the size of an "equivalence class" of seating arrangements is 3. Thus, at the triangle, there are 6!/3 = 240 distinct ways of seating the couples.
 
VKint said:
For each table, think about how many arrangements are "equivalent" to a given one via some rotation. For example, at the triangular table, each possible seating arrangement is equivalent to exactly two others (there are two nontrivial ways to rotate an equilateral triangle into itself). Another way of saying this is that the size of an "equivalence class" of seating arrangements is 3. Thus, at the triangle, there are 6!/3 = 240 distinct ways of seating the couples.

So for the rectangle its 6! / 4 ? and the circle is 5! ?
 
Not quite; your answer for the circle is correct, but the total for the rectangular table is 6!/2. This is because the four sides of the table are not identical; two are distinguishable from the other two, so there's only one nontrivial way to rotate the table into itself.
 
Oh okay. Duh me :P lol. I should've caught that. Thanks for the help VKint.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top