|
支持一下楼主的观点吧,其实也不难,就排一下,顶多16种可能。比较懒,所以就用R模拟了一下:
> x<-rep(c("A","A","B"),300)
> for(i in 1:40000){
+ carray<-paste(sample(x,3,replace=T),collapse="")
+ }
>
> nx<-table(carray)
> nx
carray
AAA AAB ABA ABB BAA BAB BBA BBB
11682 5870 5943 3007 5981 2987 2976 1554
> sum(nx[c(1,2,5)])/40000
[1] 0.588325
16/27=0.5925926
###################
> carray<-array(0,40000)
>
> x<-rep(c("A","A","B"),300)
> for(i in 1:40000){
+ carray<-paste(sample(x,4,replace=T),collapse="")
+ }
>
> nx2<-table(carray)
> nx2
carray
AAAA AAAB AABA AABB ABAA ABAB ABBA ABBB BAAA BAAB BABA BABB BBAA BBAB BBBA
7928 4070 3966 1947 3796 2047 1932 999 3873 1920 2096 1002 1925 997 1008
BBBB
494
> sum(nx2[c(1,2,3,4,5,9,10,13)])/40000
[1] 0.735625
> 16/81+8/81+8/81+4/81+8/81+8/81+4/81+4/81
[1] 0.7407407
|