a)I have n zeros and m ones and I want to counting the number of circular permutation of this m+n numbers .
m<=50 and n<=50
b) I want to count the number of circular permutation of n zero and ones .
(number of zeros + number of ones = n)
n<=100
a)I have n zeros and m ones and I want to counting the number of circular permutation of this m+n numbers .
![]() alexander.yuriev
|
14 years ago,
#
|
←
Rev. 2
→
![]() ![]() You should use Burnside's lemma (this is a copy of my previous post in English interface)
→
Reply
|
![]() Verdona0
|
14 years ago,
#
|
←
Rev. 2
→
![]() ![]()
→
Reply
|