Question

There are $n$ numbered seats around a round table. Total number of ways in which $n_{1}\left(n_{1}< n\right)$ persons can sit around the round table, is equal to

• A. ${ }^{n} C_{n_{1}}$
• B. ${ }^{n} p_{n_{1}}$
• C. ${ }^{n} C_{n_{1}-1}$
• D. ${ }^{n} p_{n-1}$

Answer 1

Answer: (B)

When seats are numbered, circular permutation is same as linear permutation as seat number is also important. Thus, total number of sitting arrangement $={ }^{n} p_{n_{1}}$