Number of Necklace/Bracelets With Fixed Number of Beads

Asked Aug 20 '10 at 20:57

Active Aug 20 '10 at 20:57

Viewed 555 times

Possible Duplicate:
Circular permutations with indistinguishable objects

We can compute the total number of k-ary necklaces/bracelets of length n using the Euler totient function:

http://en.wikipedia.org/wiki/Necklace_%28combinatorics%29

Apparently there is a formula for the number of k-ary necklaces/bracelets when the number of beads for each color is fixed.

For example, the number of necklaces/bracelets of length 5, made up of three colors (red, green, blue), with 2 red beads, 2 green beads, and 1 blue bead. etc.

Can anyone provide the formula or a reference?

Thanks

edited Apr 13 '17 at 12:20

Community

asked Aug 20 '10 at 20:57

Unreasonable Sin

1,086

1

Duplicate (asked and answered): http://math.stackexchange.com/questions/600/circular-permutations-with-indistinguishable-objects/825#825 – Qiaochu Yuan Aug 20 '10 at 21:29
Thanks Qiaochu. Should this question be closed since it's a duplicate? – Unreasonable Sin Aug 20 '10 at 21:42

Number of Necklace/Bracelets With Fixed Number of Beads

0 Answers0