Sorry. Chasing not allowed

In Disneyland, Florida on the occasion of New Year a group of 10 children took a ride of a small merry-go-round.

Initially 10 10 children (say, A , B , C , D , E , F , G , H , I , J A,B,C,D,E,F,G,H,I,J ) sitting one behind the other in a 10 10 seater merry-go-round. Later, they decide to switch seats so that each child has a new companion in front in other words, J J shall not have A A in front, A A shall not have B B in front, C C shall not have D D in front and so forth.

In how many ways can this arrangement be done?

Conclusion: The seats are identical.


The answer is 120288.

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.

1 solution

Alapan Das
Jan 10, 2020

This is problem goes similar to the disarrangement problem. Consider that seats are not identical. Seat number matters.

  1. Total number of possible arrangement is 10 ! 10! .

  2. Now, choosing one child, say A A and saying it is chaser means in front of A A , B B is seated. So, the number of arrangements with such 1 c h a s e r 1-chaser is ( 10 1 ) × 10 × 8 ! \binom{10}{1} ×10×8!

  3. Number of arrangements with such 2 c h a s e r 2-chaser is ( 10 2 ) × 10 × 7 ! \binom{10}{2} ×10×7! ..

So, our required expression is

10 ! ( 10 1 ) × 10 × 8 ! + ( 10 2 ) × 10 × 7 ! . . . . . . ( 10 8 ) × 10 × 1 ( 10 9 ) × 10 + ( 10 10 ) × 10 = 1202880 10!-\binom{10}{1} ×10×8!+\binom{10}{2} ×10×7!-......\binom{10}{8} ×10×1-\binom{10}{9}×10+\binom{10}{10} ×10=1202880 .

We assumed that the seats are not identical for symmetry, but actually they are given to be identical.

So, we have to divide this obtained number by 10 10 as all 10 10 seats are identical. Hence, the number of such no-chasing arrangements is 120288 120288 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...