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
n−rn(rn−r)
Solution
To find the number of ways to select r people out of n people arranged in a circle such that no two selected people are consecutive, we can use a standard combinatorial approach.
Let N be the total number of ways. We consider a specific person, say P1. There are two cases:
Case 1: P1 is selected.
If P1 is selected, then its immediate neighbors, Pn and P2, cannot be selected. This leaves us with n−3 people (P3,P4,…,Pn−1) arranged in a line. From these n−3 people, we need to select r−1 people such that no two are consecutive.
The number of ways to select k non-consecutive items from m items arranged in a line is given by (km−k+1).
In this case, m=n−3 and k=r−1.
So, the number of ways for Case 1 is (r−1(n−3)−(r−1)+1)=(r−1n−3−r+1+1)=(r−1n−r−1).
Case 2: P1 is not selected.
If P1 is not selected, then we need to select r people from the remaining n−1 people (P2,P3,…,Pn) arranged in a line such that no two are consecutive.
In this case, m=n−1 and k=r.
So, the number of ways for Case 2 is (r(n−1)−r+1)=(rn−r).
The total number of ways is the sum of the ways from Case 1 and Case 2:
N=(r−1n−r−1)+(rn−r).
We can simplify this expression. Let's use the identity for simplification: (r−1n−r−1)+(rn−r) =(r−1)!(n−2r)!(n−r−1)!+r!(n−2r)!(n−r)!
Factor out common terms: =(r−1)!(n−2r)!(n−r−1)!(1+rn−r) =(r−1)!(n−2r)!(n−r−1)!(rr+n−r) =(r−1)!(n−2r)!(n−r−1)!(rn)
Rearrange terms to form a binomial coefficient: =rn(r−1)!(n−2r)!(n−r−1)!
To get (rn−r), we need r!(n−2r)!(n−r)!. We have (n−r−1)! in the numerator and (r−1)! in the denominator.
=n−rnr!(n−2r)!(n−r)! =n−rn(rn−r)
This formula is valid for n≥2r. If n<2r, it's impossible to select r non-consecutive people.