In a playground, 3 sisters and 8 other girls are playing together. In a particular game, how many ways can all the girls be seated in a circular order so that the three sisters are not seated together?

In a playground, 3 sisters and 8 other girls are playing together. In a particular game, how many ways can all the girls be seated in a circular order so that the three sisters are not seated together? Correct Answer 3386880

There are 3 sisters and 8 other girls in total of 11 girls. The number of ways to arrange these 11 girls in a circular manner = (11– 1)! = 10!. These three sisters can now rearrange themselves in 3! ways. By the multiplication theorem, the number of ways so that 3 sisters always come together in the arrangement = 8! × 3!. Hence, the required number of ways in which the arrangement can take place if none of the 3 sisters is seated together: 10! – (8! × 3!) = 3628800 – (40320 * 6) = 3628800 – 241920 = 3386880.

Related Questions

Two football teams, Team A and Team B, played in the tournament and scored the following goals in 6 matches. Game Goals by Team A Goals by Team B Game 1 2 3 Game 2 1 0 Game 3 0 1 Game 4 4 5 Game 5 3 2 Game 6 2 1   What can we conclude on the basis of average goals?