3 boys and 2 girls stand in a queue. The probability that the number of boys ahead of every girl is at least one more than the number of girls ahead of her is
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Clearly a boy must be first in the queue, for if a girl was first then they would have an equal number of boys and girls, (namely 0 ), ahead of them.
Now with one of the boys at the head of the queue and one of the girls in the second position, there would have to be a boy in the third position, since otherwise a girl in the third position would have an equal number of boys and girls ahead of them, (namely 1 each). Then with a boy in the third position, the second girl can go in either the fourth or fifth position and have the conditions of the problem satisfied.
With two boys at the head of the queue and a girl in the third position, the second girl can go in either the fourth or fifth position and have more boys ahead of them than girls.
Finally, having the girls in the fourth and fifth positions would satisfy the conditions as well. This gives us a total of 5 generic sequences, namely
B G B G B , B G B B G , B B G G B , B B G B G , B B B G G ,
that satisfy the conditions of the problem. As there are a total of 3 ! ∗ 2 ! 5 ! = 1 0 possible generic sequences without restrictions, the desired probability is 1 0 5 = 0 . 5 0 .
Note that by "generic" sequence I mean a sequence without regard for which boys and which girls fill each specific spot. Since every generic sequence has 5 ! ways in which it can be realized, and we are looking for a probability rather the number of possible sequences, there is no need to worry about the specific placements of boys and girls.