# 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}} \\

\]

Last updated date: 25th Mar 2023

•

Total views: 310.5k

•

Views today: 3.87k

Answer

Verified

310.5k+ 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.

Recently Updated Pages

Calculate the entropy change involved in the conversion class 11 chemistry JEE_Main

The law formulated by Dr Nernst is A First law of thermodynamics class 11 chemistry JEE_Main

For the reaction at rm0rm0rmC and normal pressure A class 11 chemistry JEE_Main

An engine operating between rm15rm0rm0rmCand rm2rm5rm0rmC class 11 chemistry JEE_Main

For the reaction rm2Clg to rmCrmlrm2rmg the signs of class 11 chemistry JEE_Main

The enthalpy change for the transition of liquid water class 11 chemistry JEE_Main

Trending doubts

Difference Between Plant Cell and Animal Cell

Write an application to the principal requesting five class 10 english CBSE

Ray optics is valid when characteristic dimensions class 12 physics CBSE

Give 10 examples for herbs , shrubs , climbers , creepers

Write the 6 fundamental rights of India and explain in detail

Write a letter to the principal requesting him to grant class 10 english CBSE

List out three methods of soil conservation

Fill in the blanks A 1 lakh ten thousand B 1 million class 9 maths CBSE

Write a letter to the Principal of your school to plead class 10 english CBSE