Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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|cite|improve this question

migrated from Dec 8 '13 at 13:40

This question came from our site for professional mathematicians.

This is exactly what you seek:

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

share|cite|improve this answer

Your Answer


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