Get 2 FREE Instant-Explanations on Filo with code FILOAPP

There are {2}{n} guests at a dinner party. Supposing that eh m

Question

There are $2 n$ guests at a dinner party. Supposing that eh master and mistress of the house have fixed seats opposite one another and that there are two specified guests who must not be placed next to one another, show that the number of ways in which the company can be placed is $(2 n - 2)! \times (4 n^{2} - 6 n + 4) ˙$

Views: 894 students

Found 4 tutors discussing this question

Noah Discussed

There are

2 n

guests at a dinner party. Supposing that eh master and mistress of the house have fixed seats opposite one another and that there are two specified guests who must not be placed next to one another, show that the number of ways in which the company can be placed is

(2 n - 2)! \times (4 n^{2} - 6 n + 4) ˙

6 mins ago

Discuss this question LIVE

6 mins ago

One destination for complete JEE/NEET preparation

One destination to cover all your homework and assignment needs

Learn Practice Revision Succeed

Instant 1:1 help, 24x7

Instant 1:1 help, 24x7

60, 000+ Expert tutors

Textbook solutions

Textbook solutions

Big idea maths, McGraw-Hill Education etc

Essay review

Essay review

Get expert feedback on your essay

Schedule classes

Schedule classes

High dosage tutoring from Dedicated 3 experts

Trusted by 4 million+ students

Doubt Icon

Doubt Icon

Stuck on the question or explanation?

Connect with our math tutors online and get step by step solution of this question.

231 students are taking LIVE classes

Question Text

There are

2 n

guests at a dinner party. Supposing that eh master and mistress of the house have fixed seats opposite one another and that there are two specified guests who must not be placed next to one another, show that the number of ways in which the company can be placed is

(2 n - 2)! \times (4 n^{2} - 6 n + 4) ˙