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?
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.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
migrated from mathoverflow.net Dec 8 '13 at 13:40
This question came from our site for professional mathematicians.