Permutation and CombinationHard
Question
A gentleman invites a party of m + n (m ≠ n) friends to a dinner & places m at one table and n at another, the table being round. If the clockwise & anticlockwise arrangements are not to be distinguished and assuming sufficient space on both tables, then the number of ways in which he can arrange the guest is
Options
A.
B.
C.
D.none
Solution
First we select m friends for one table is m + nCm and select a table by 2C1 ways.
Now total number of arrangements is
2 (m + nCm) .
⇒ 2 .
= 2 .
Now total number of arrangements is
2 (m + nCm) .
⇒ 2 .
= 2 .
Create a free account to view solution
View Solution FreeMore Permutation and Combination Questions
Consider all the permutations of the word CORRUPTION. Number of words in which U appears prior to both R is equal to -...The number of proper divisors of apbqcrds where a, b, c, d are primes & p, q, r, s ∈ N is -...If a, b, c, d, e are prime integers, then the number of divisiors of ab2c2de excluding 1 as a factor, is -...In how many way can a game of tennis be played from 3 men and 4 women when each team contains one man and one woman-...How many numbers can be formed with the digits 3, 4, 5, 6, 7 which are greater than 1000 (Rept. not allowed) ?...