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?
Asked
Active
Viewed 3,812 times
1 Answers
2
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.
Per Alexandersson
- 3,626