We have the two relations
nPr=nPr+1andnCr=nCr−1.
First we use the permutation formula
nPk=(n−k)!n!.
Substituting k=r and k=r+1 we obtain
nPr=(n−r)!n!,</p><p>nPr+1=(n−r−1)!n!.
Since these two are equal, their quotient is 1:
nPr+1nPr</p><p>=</p><p>(n−r−1)!n!(n−r)!n!</p><p>=</p><p>(n−r)!(n−r−1)!</p><p>=</p><p>n−r1</p><p>=1.
Thus
n−r=1⟹r=n−1.−(1)
Next we use the combination formula
nCk=k!(n−k)!n!.
Putting k=r and k=r−1 we get
nCr=r!(n−r)!n!,</p><p>nCr−1=(r−1)!(n−r+1)!n!.
Because these two are equal, their quotient is also 1:
nCr−1nCr</p><p>=</p><p><r!(n−r)!n!/p><p>(r−1)!(n−r+1)!n!</p><p>=</p><p>r!(n−r)!(r−1)!(n−r+1)!</p><p>=</p><p>rn−r+1</p><p>=1.
Hence
n−r+1=r</p><p>⟹</p><p>n+1=2r</p><p>⟹</p><p>r=2n+1.−(2)
Now both (1) and (2) must hold simultaneously. Equating the two expressions for r we write
n−1=2n+1.
Multiplying by 2 and simplifying, we have
2n−2=n+1</p><p>⟹</p><p>n−3=0</p><p>⟹</p><p>n=3.
Finally, substituting n=3 into r=n−1 gives
r=3−1=2.
Therefore
r=2.
Hence, the correct answer is Option C.