Combinatorics Circular Arrangement

click
Messages
10
Reaction score
0

Homework Statement


A circular table is arranged so as to have 9 different robots occupy the table. If there are 5 different types of robots, what is the number of possible arrangements of these robots?


Homework Equations





The Attempt at a Solution



If it wasn't a circular table, the answer would be 5^9, I suppose. But since it is circular, there would be repetitions.

<1,2,3,4,5,6,7,8,9> is the same as <2,3,4,5,6,7,8,9,1> and so on.

So I think I need to find the number of repetitions, and subtract it at from 5^9.

There are 9 equivalent seating arrangements for each 'permutation'.
for example,

<1,2,3,4,5,6,7,8,9>
<2,3,4,5,6,7,8,9,1>
<3,4,5,6,7,8,9,1,2>
<4,5,6,7,8,9,1,2,3>
<5,6,7,8,9,1,2,3,4>
<6,7,8,9,1,2,3,4,5>
<7,8,9,1,2,3,4,5,6>
<8,9,1,2,3,4,5,6,7>
<9,1,2,3,4,5,6,7,8>

So, is the answer 5^9/ 9 ?

If yes, why isn't it a whole number?
 
Physics news on Phys.org
not quite, consider the case when all 9 places have the same robot type, linking the circle doe snot make this equivalent to any other arrangements and there will not by any repetitions, so you need to be a little more careful with counting repeated sequences
 
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