in how many ways can 4 boys and 3 girls be seated in a row so that no two girls are together?
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.
First we need to find the number of ways of arranging 4 b 's and 3 g 's so that no two g 's are next to each other. Let w be the number b 's that appear prior to the first g , x the number of b 's between the first and second g , y the number of b 's between the second and third g , and z the number of b 's after the third g . Then we need to find the number of solutions to the equation
w + x + y + z = 4 where w ≥ 0 , x ≥ 1 , y ≥ 1 , z ≥ 0 .
Now let x ′ = x − 1 and y ′ = y − 1 . We are then looking for the number of non-negative integer solutions to the equation
w + x ′ + y ′ + z = 2 ,
which is a 'stars and bars' calculation with solution ( 2 5 ) = 1 0 .
(This link describes the 'stars and bars' concept.)
Finally, for these 1 0 solutions we can arrange the boys in 4 ! ways and the girls in 3 ! ways, giving us a final solution of 1 0 ∗ 4 ! ∗ 3 ! = 1 4 4 0 .
Problem Loading...
Note Loading...
Set Loading...
(4!*5!)/2!=1440