Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

For Circular Permutations with unique elements (mirrored ignored) the answer is (n - 1)!/2 (pretty straight forward). However I cant seem to figure out how to calculate circular permutations with repetitions allowed. So the Question is: Given 'm' elements, how many circular permutations (size 'n') with repetitions (mirrored ignored) are there?

share|improve this question

migrated from mathoverflow.net Dec 8 '13 at 13:40

This question came from our site for professional mathematicians.

add comment

1 Answer 1

This is exactly what you seek: http://en.wikipedia.org/wiki/Necklace_%28combinatorics%29

Now, please ask next question over at math.stackexchange instead, if it is not research level.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.