Get 2 FREE Instant-Explanations on Filo with code FILOAPP

A gentlemen invest a party of m+n(m n) friends to a dinner & p

Question

A gentlemen invest a party of $m + n (m \neq = n)$ friends to a dinner & places $m$ at one table $T_{1}$ and $n$ another table $T_{2}$ , the table being round. If not all people shall have the same neighbour in any two arrangement, then the number of ways in which he can arrange the guests, is

\frac{( m + n )!}{4 mn}

\frac{1}{2} \frac{( m + n )!}{mn}

2 \frac{( m + n )!}{mn}

n o n e

Views: 605 students

Found 7 tutors discussing this question

Sebastian Discussed

A gentlemen invest a party of

m + n (m \neq = n)

friends to a dinner & places

m

at one table

T_{1}

and

n

another table

T_{2}

, the table being round. If not all people shall have the same neighbour in any two arrangement, then the number of ways in which he can arrange the guests, is

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

60, 000+ Expert tutors

Textbook solutions

Big idea maths, McGraw-Hill Education etc

Essay review

Get expert feedback on your essay

Schedule classes

High dosage tutoring from Dedicated 3 experts

Trusted by 4 million+ students

Stuck on the question or explanation?

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

231 students are taking LIVE classes

Question Text

A gentlemen invest a party of

m + n (m \neq = n)

friends to a dinner & places

m

at one table

T_{1}

and

n

another table

T_{2}

, the table being round. If not all people shall have the same neighbour in any two arrangement, then the number of ways in which he can arrange the guests, is

A gentlemen invest a party of $m + n (m \neq = n)$ friends to a dinner & places $m$ at one table $T_{1}$ and $n$ another table $T_{2}$ , the table being round. If not all people shall have the same neighbour in any two arrangement, then the number of ways in which he can arrange the guests, is

Filo tutor solution

Practice questions from similar books

A gentlemen invest a party of m+n(m=n) friends to a dinner & places m at one table T1​ and n another table T2​, the table being round. If not all people shall have the same neighbour in any two arrangement, then the number of ways in which he can arrange the guests, is

Filo tutor solution

Practice questions from similar books

A gentlemen invest a party of $m + n (m \neq = n)$ friends to a dinner & places $m$ at one table $T_{1}$ and $n$ another table $T_{2}$ , the table being round. If not all people shall have the same neighbour in any two arrangement, then the number of ways in which he can arrange the guests, is