problem of permutation

in how many ways can 4 boys and 3 girls be seated in a row so that no two girls are together?


The answer is 1440.

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.

2 solutions

Shubham Nain
Aug 21, 2014

(4!*5!)/2!=1440

First we need to find the number of ways of arranging 4 4 b b 's and 3 3 g g 's so that no two g g 's are next to each other. Let w w be the number b b 's that appear prior to the first g g , x x the number of b b 's between the first and second g g , y y the number of b b 's between the second and third g g , and z z the number of b b 's after the third g g . Then we need to find the number of solutions to the equation

w + x + y + z = 4 w + x + y + z = 4 where w 0 , x 1 , y 1 , z 0 w \ge 0, x \ge 1, y \ge 1, z \ge 0 .

Now let x = x 1 x' = x - 1 and y = y 1 y' = y - 1 . We are then looking for the number of non-negative integer solutions to the equation

w + x + y + z = 2 w + x' + y' + z = 2 ,

which is a 'stars and bars' calculation with solution ( 5 2 ) = 10 \binom{5}{2} = 10 .

(This link describes the 'stars and bars' concept.)

Finally, for these 10 10 solutions we can arrange the boys in 4 ! 4! ways and the girls in 3 ! 3! ways, giving us a final solution of 10 4 ! 3 ! = 1440 10 * 4! * 3! = \boxed{1440} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...