The number of ways in which we can arrange n ladies and n gentlemen at a round table so that 2 ladies and 2 gentlemen may not sit next to one another is:
\[
a.{\text{ }}\left( {n - 1} \right)!\left( {n - 2} \right)! \\
b.{\text{ }}\left( {{\text{n!}}} \right)\left( {n - 1} \right)! \\
c.{\text{ }}\left( {n + 1} \right)!\left( {n!} \right) \\
d.{\text{ None of these}} \\
\]
Answer
366.9k+ views
Hint: - Number of ways to sit n persons on a round table is $ = \left( {n - 1} \right)!$
First we have to arrange n gentlemen around the round table so, number of ways to do so
$ = \left( {n - 1} \right)!$
Now, when these men are arranged and seated than there are n spaces between each man where we will arrange and seated n ladies so that two ladies and two gentlemen may not sit each other$ = {}^n{C_n}\left( {n!} \right)\left( {n - n} \right)! = {}^n{C_n}\left( {n!} \right)\left( {0!} \right)$
As we know the value of ${}^n{C_n} = n,{\text{ }}0! = 1$
$ \Rightarrow {}^n{C_n}\left( {n!} \right)\left( {0!} \right) = 1 \times n! \times 1 = n!$
Hence, total number of ways of sitting so that two ladies and two gentlemen may not sit each other
$ = \left( {n - 1} \right)!\left( {n!} \right)$
Hence, option (b) is correct.
Note: - Whenever we face such types of problems first calculate the number of ways to sit $n$gentlemen on a round table, then calculate the number of ways to sit $n$ ladies between them, then multiply these two values we will get the required answer.
First we have to arrange n gentlemen around the round table so, number of ways to do so
$ = \left( {n - 1} \right)!$
Now, when these men are arranged and seated than there are n spaces between each man where we will arrange and seated n ladies so that two ladies and two gentlemen may not sit each other$ = {}^n{C_n}\left( {n!} \right)\left( {n - n} \right)! = {}^n{C_n}\left( {n!} \right)\left( {0!} \right)$
As we know the value of ${}^n{C_n} = n,{\text{ }}0! = 1$
$ \Rightarrow {}^n{C_n}\left( {n!} \right)\left( {0!} \right) = 1 \times n! \times 1 = n!$
Hence, total number of ways of sitting so that two ladies and two gentlemen may not sit each other
$ = \left( {n - 1} \right)!\left( {n!} \right)$
Hence, option (b) is correct.
Note: - Whenever we face such types of problems first calculate the number of ways to sit $n$gentlemen on a round table, then calculate the number of ways to sit $n$ ladies between them, then multiply these two values we will get the required answer.
Last updated date: 02nd Oct 2023
•
Total views: 366.9k
•
Views today: 5.66k
Recently Updated Pages
What do you mean by public facilities

Difference between hardware and software

Disadvantages of Advertising

10 Advantages and Disadvantages of Plastic

What do you mean by Endemic Species

What is the Botanical Name of Dog , Cat , Turmeric , Mushroom , Palm

Trending doubts
How do you solve x2 11x + 28 0 using the quadratic class 10 maths CBSE

Fill the blanks with the suitable prepositions 1 The class 9 english CBSE

What is meant by shramdaan AVoluntary contribution class 11 social science CBSE

The equation xxx + 2 is satisfied when x is equal to class 10 maths CBSE

Difference between Prokaryotic cell and Eukaryotic class 11 biology CBSE

Difference Between Plant Cell and Animal Cell

An alternating current can be produced by A a transformer class 12 physics CBSE

What is the value of 01+23+45+67++1617+1819+20 class 11 maths CBSE

Give 10 examples for herbs , shrubs , climbers , creepers
