We are seeking the situations of the form
(x1 boys)(a girl)(x2 boys)(a girl)(x3 boys)(a girl)(x4 boys),
where x2,x3>0. The number of such situations is the number of sequences of nonnegative integers x1,x2,x3,x4 such that x1+x2+x3+x4=8 and x2,x3>0 times the number of permutations between girls and boys, i.e. 8!⋅3!. The number of those sequences is the number of sequences of positive integers y1,y2,y3,y4 such that y1+y2+y3+y4=10 with the bijection (x1,x2,x3,x4)↦(x1+1,x2,x3,x4+1)=(y1,y2,y3,y4), and we indeed have y1+y2+y3+y4=(x1+1)+x2+x3+(x4+1)=10. It's bijective with taking a line of 10 balls and choosing 3 borders between them with the bijection
(y1,y2,y3,y4)↦(borders after the balls y1,y1+y2,y1+y2+y3).
We choose 3 borders from 9 places between balls, which gives (39) such sequences. Thus, the probability that no two girls sit near each other equals (39)⋅8!⋅3!/11!=28/55, where we divide by 11! since it's the number of permutations of 8+3=11 boys and girls.
Comments
Leave a comment