Home
Class 12
MATHS
There are 2n guests at a dinner party...

There are `2n` 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 `(2n-2!)xx(4n^2-6n+4)dot`

Promotional Banner

Similar Questions

Explore conceptually related problems

Given that n is odd, number of ways in which three numbers in AP can be selected from 1, 2, 3,……., n, is

A group of 2n students consisting of n boys and n girls are to be arranged in a row such that adjacent members are of opposite sex. The number of ways in which this can be done is

There are n seats round a table numbered 1,2, 3,..., n . The number of ways in which m(<=n) persons can take seats is

A person invites a group of 10 friends at dinner and sits 5 on a round table and 5 more on another round table, 4 on one round table and 6 on the other round table. Find the number of ways in each case in which he can arrange the guest.

A man invites a party to (m+n) friends to dinner and places m at one round table and n at another. The number of ways of arranging the guests is

A gentlemen hosts a party of (m+n) guests and places 'm' at one round table and the remaining 'n' at the other round table. Number of ways the guests can be arranged is

There are two bags each of which contains n balls. A man has to select an equal number of balls from both the bags. Prove that the number of ways in which a man can choose at least one ball from each bag is ^(2n)C_n-1.

There are two bags each of which contains n balls. A man has to select an equal number of balls from both the bags. Prove that the number of ways in which a man can choose at least one ball from each bag is^(2n)C_n-1.

Prove that the number of ways in which n books can be placed on a shelf when two particular books are never together is ( n-2) xx (n-1) !

A person is permitted to selected at least one and at most n coins from a collection of (2n+1) distinct coins. If the total number o ways in which he can select coins is 255, find the value of ndot