不尽相同元的环排列计数问题

The Counting Problems of Round Permutation with Repetition

不尽相同元的环排列是一个比较复杂的问题.通过举例分析了圆排列中的各种情况,利用圆排列计数和对称圆排列计数,给出了不尽相同元的环排列公式,并且给予了证明,为更好地使用环排列公式打下坚实的基础.

Round permutation with repetition is a very complicated problem. This paper analyzed a variety of situations in circular permutation, using the counting of circular permutation and symmetric circular permutation, gave and proved the formula of round permutation with repetition, which has laid a good foundation for its further application.