Suppose we have $4$ identical red beads and $3$ identical blue beads. In how many ways can we form a necklace out of these?
I am a little confused here. Suppose we fix a red bead and treat the problem now as a linear arrangement, then the number of ways to form a necklace would be $\frac{6!}{2.3!.3!}$.
Suppose we fix a blue bead then the number of ways would be $\frac{6!}{2.2!.4!}$ .
What am I doing wrong here?
Also how can we generalize this problem? If we have $n$ beads out of which $r_1$ are of
color $a_1$, $r_2$ of color $a_2$ and so on such that $r_1 + r_2 + r_3 + ... + r_k = n$ ,what is the number of ways to form a necklace?.
Note-Here I am assuming clockwise and anticlockwise arrangements to be the same.
Asked
Active
Viewed 176 times
2
idpd15
- 1,994
- 1
- 17
- 38
-
have you already checked http://en.wikipedia.org/wiki/Necklace_%28combinatorics%29 ? – Wouter M. Mar 11 '14 at 17:24
1 Answers
1
If this would not be a necklace then the number of ways to order them would be $\frac{7!}{3!4!}$. But now we may rotate and we have $7$ kind of rotations. So the total becomes $\frac{7!}{3!4!7}=\frac{6!}{3!4!}$.
With the same reasoning we get that in general we have $\frac{(n-1)!}{r_1!r_2!...r_k!}$
Kaladin
- 1,485
-
We would divide your answer by 2 because clockwise and anticlockwise are the same. Ain't it? – idpd15 Mar 10 '14 at 11:20
-
Notice that clockwise turning $k$ times is the same as anti clockwise turning $n-k$ times. – Kaladin Mar 10 '14 at 11:33