Solveeit Logo

Question

Question: Number of ways when r people are selected out of n people such that they are not consecutive in a ci...

Number of ways when r people are selected out of n people such that they are not consecutive in a circle are

Answer

nnr(nrr)\frac{n}{n-r} \binom{n-r}{r}

Explanation

Solution

To find the number of ways to select rr people out of nn people arranged in a circle such that no two selected people are consecutive, we can use a standard combinatorial approach.

Let NN be the total number of ways. We consider a specific person, say P1P_1. There are two cases:

Case 1: P1P_1 is selected.

If P1P_1 is selected, then its immediate neighbors, PnP_n and P2P_2, cannot be selected. This leaves us with n3n-3 people (P3,P4,,Pn1P_3, P_4, \dots, P_{n-1}) arranged in a line. From these n3n-3 people, we need to select r1r-1 people such that no two are consecutive.

The number of ways to select kk non-consecutive items from mm items arranged in a line is given by (mk+1k)\binom{m-k+1}{k}.

In this case, m=n3m = n-3 and k=r1k = r-1.

So, the number of ways for Case 1 is ((n3)(r1)+1r1)=(n3r+1+1r1)=(nr1r1)\binom{(n-3)-(r-1)+1}{r-1} = \binom{n-3-r+1+1}{r-1} = \binom{n-r-1}{r-1}.

Case 2: P1P_1 is not selected.

If P1P_1 is not selected, then we need to select rr people from the remaining n1n-1 people (P2,P3,,PnP_2, P_3, \dots, P_n) arranged in a line such that no two are consecutive.

In this case, m=n1m = n-1 and k=rk = r.

So, the number of ways for Case 2 is ((n1)r+1r)=(nrr)\binom{(n-1)-r+1}{r} = \binom{n-r}{r}.

The total number of ways is the sum of the ways from Case 1 and Case 2:

N=(nr1r1)+(nrr)N = \binom{n-r-1}{r-1} + \binom{n-r}{r}.

We can simplify this expression. Let's use the identity for simplification: (nr1r1)+(nrr)\binom{n-r-1}{r-1} + \binom{n-r}{r} =(nr1)!(r1)!(n2r)!+(nr)!r!(n2r)!= \frac{(n-r-1)!}{(r-1)!(n-2r)!} + \frac{(n-r)!}{r!(n-2r)!}

Factor out common terms: =(nr1)!(r1)!(n2r)!(1+nrr)= \frac{(n-r-1)!}{(r-1)!(n-2r)!} \left( 1 + \frac{n-r}{r} \right) =(nr1)!(r1)!(n2r)!(r+nrr)= \frac{(n-r-1)!}{(r-1)!(n-2r)!} \left( \frac{r + n-r}{r} \right) =(nr1)!(r1)!(n2r)!(nr)= \frac{(n-r-1)!}{(r-1)!(n-2r)!} \left( \frac{n}{r} \right)

Rearrange terms to form a binomial coefficient: =nr(nr1)!(r1)!(n2r)!= \frac{n}{r} \frac{(n-r-1)!}{(r-1)!(n-2r)!}

To get (nrr)\binom{n-r}{r}, we need (nr)!r!(n2r)!\frac{(n-r)!}{r!(n-2r)!}. We have (nr1)!(n-r-1)! in the numerator and (r1)!(r-1)! in the denominator.

=nnr(nr)!r!(n2r)!= \frac{n}{n-r} \frac{(n-r)!}{r!(n-2r)!} =nnr(nrr)= \frac{n}{n-r} \binom{n-r}{r}

This formula is valid for n2rn \ge 2r. If n<2rn < 2r, it's impossible to select rr non-consecutive people.