In Disneyland, Florida on the occasion of New Year a group of 10 children took a ride of a small merry-go-round.
Initially children (say, ) sitting one behind the other in a seater merry-go-round. Later, they decide to switch seats so that each child has a new companion in front in other words, shall not have in front, shall not have in front, shall not have in front and so forth.
In how many ways can this arrangement be done?
Conclusion: The seats are identical.
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.
This is problem goes similar to the disarrangement problem. Consider that seats are not identical. Seat number matters.
Total number of possible arrangement is 1 0 ! .
Now, choosing one child, say A and saying it is chaser means in front of A , B is seated. So, the number of arrangements with such 1 − c h a s e r is ( 1 1 0 ) × 1 0 × 8 !
Number of arrangements with such 2 − c h a s e r is ( 2 1 0 ) × 1 0 × 7 ! ..
So, our required expression is
1 0 ! − ( 1 1 0 ) × 1 0 × 8 ! + ( 2 1 0 ) × 1 0 × 7 ! − . . . . . . ( 8 1 0 ) × 1 0 × 1 − ( 9 1 0 ) × 1 0 + ( 1 0 1 0 ) × 1 0 = 1 2 0 2 8 8 0 .
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 1 0 as all 1 0 seats are identical. Hence, the number of such no-chasing arrangements is 1 2 0 2 8 8 .