
$7$ gentlemen and $4$ ladies can sit at a round table so that two particular ladies may not sit together in
(a) \[7!3!2!{\text{ ways}}\]
(b) \[6! {}^6{P_4}\] ways
(c) \[6! {}^7{P_4}\] ways
(d) \[6! {}^4{P_2}\] ways
Answer
207.6k+ views
Hint: This problem can be solved by permutations. A Permutation of a set is an arrangement of its members into a sequence or linear ordered, a rearrangement of its elements.
Here we have to arrange $7$ gentlemen and $4$ ladies can sit at a round table so that two particular ladies may not sit together.
We know that \[n\] things can be arranged around a round table in \[\left( {n - 1} \right)!\] ways
First, we arrange $7$ gentlemen at a round table in \[6!\] ways
Then we arrange $4$ ladies so that two particular ladies may not sit together.
We know that if \[m\] gentlemen and \[n\] ladies are to be seated at a round table so that two particular ladies may not sit together can be arranged in \[{}^m{P_n}\] ways.
There are $7$ gaps between men and $4$ ladies are to be placed.
By using the above formula this can be done in \[{}^7{P_4}\] ways.
Therefore, that total arrangement can be done in \[6!{}^7{P_4}\] ways.
Thus the answer is option (c) \[6!{}^7{P_4}\] ways.
Note: In this problem we have used multiplicative principle of permutation i.e. if there are \[x\] ways of doing one thing and \[y\] ways of doing another, then the total number of ways of doing both the things is \[xy\] ways.
Here we have to arrange $7$ gentlemen and $4$ ladies can sit at a round table so that two particular ladies may not sit together.
We know that \[n\] things can be arranged around a round table in \[\left( {n - 1} \right)!\] ways
First, we arrange $7$ gentlemen at a round table in \[6!\] ways
Then we arrange $4$ ladies so that two particular ladies may not sit together.
We know that if \[m\] gentlemen and \[n\] ladies are to be seated at a round table so that two particular ladies may not sit together can be arranged in \[{}^m{P_n}\] ways.
There are $7$ gaps between men and $4$ ladies are to be placed.
By using the above formula this can be done in \[{}^7{P_4}\] ways.
Therefore, that total arrangement can be done in \[6!{}^7{P_4}\] ways.
Thus the answer is option (c) \[6!{}^7{P_4}\] ways.
Note: In this problem we have used multiplicative principle of permutation i.e. if there are \[x\] ways of doing one thing and \[y\] ways of doing another, then the total number of ways of doing both the things is \[xy\] ways.
Recently Updated Pages
JEE Main 2026 Cutoff Percentile: Rank Vs Percentile

JEE Main 2026 Session 1 Admit Card Release Date and Direct Download Link

JEE Main Exam Pattern 2026 - NTA Paper Pattern, Marking Scheme, Total Marks

JEE Main Slot Booking 2026 NTA Exam Slot Allotment Dates and Shifts

Self Declaration Form for JEE Mains 2026 - Mandatory Details and Filling Process

JEE Main 2026 Registration- Dates, Process, Documents, and Important Details

Trending doubts
JEE Main 2026: Application Form Open, Exam Dates, Syllabus, Eligibility & Question Papers

JEE Main Correction Window 2026- Edit Form Details, Dates and Link

Atomic Structure: Definition, Models, and Examples

Equation of Trajectory in Projectile Motion: Derivation & Proof

JEE Main Marking Scheme 2026- Paper-Wise Marks Distribution and Negative Marking Details

Angle of Deviation in a Prism – Formula, Diagram & Applications

Other Pages
JEE Advanced Marks vs Ranks 2025: Understanding Category-wise Qualifying Marks and Previous Year Cut-offs

Hybridisation in Chemistry – Concept, Types & Applications

Collision: Meaning, Types & Examples in Physics

Average and RMS Value in Physics: Formula, Comparison & Application

How to Convert a Galvanometer into an Ammeter or Voltmeter

Ideal and Non-Ideal Solutions Explained for Class 12 Chemistry

