[Math] Number of permutations of $n$ different things, taken $r$ at a time, when $p$ particular things is to be always included in each arrangement

combinatoricspermutations

I am trying to find out No of permutations of n different things, taken $r$ at a time, when p particular things is to be always included in each arrangement:

first keep aside $p$ particular thing then the remaining $n-p$ elements can be arranged in $P(n-p,r-p)$ ways, while $p$ particular elements can be arranged in $p!$ ways. So total arrangement is $P(n-p,r-p)\cdot p!$ ways. Also the $r-p$ elements with $p$ particular thing together can be treated as $r-p+1$ elements, whose arrangement should be $(r-p+1)!$. So the final answer should be $P(n-p,r-p)\cdot p!\cdot (r-p+1)!$. I am not very sure about my answer. So can someone justify if am correct or not.

Best Answer

If $p$ particular things are to be included among the $r$ distinct objects that are being arranged, we must select $r - p$ of the remaining $n - p$ objects, which can be done in $\binom{n - p}{r - p}$ objects. We can then arrange the $r$ objects in $r!$ ways. Hence, there are $$\binom{n - p}{r - p}r!$$ possible permutations that include the $p$ particular objects.