Question
Question: Prove that \({}^{\text{n}}{{\text{C}}_{\text{r}}}\) \( \times \) r!= \({}^{\text{n}}{{\text{P}}_{\te...
Prove that nCr × r!= nPr
Solution
In this question we use the theory of permutation and combination. So, before solving this question you need to first recall the basics formula of this chapter. For example, if we need to select two things out of four things. In this case, this can be done in 4C2 =6 ways. And similarly, if we need to arrange two things out of four things then it will be done by 4P2 ways. Here we first take LHS of the given expression and solve it until we will get the RHS i.e. nPr in this case as discuss below.
Complete step-by-step solution:
We need to prove-
nCr × r! = nPr
Now, we take LHS of the given expressions-
LHS =nCr×r!
As we know,
nCr = [r!(n - r)!]n!
And also,
nPr = [(n - r)!]n!
Now, put the value of nCr in LHS of the given expression and we get
LHS =nCr × r!
= [r!(n - r)!]n! ×r!
= [(n - r)!]n!
= nPr
As we know, [nPr = [(n - r)!]n!]
Therefore, we verify that nCr × r!=nPr
Note: A permutation is an act of arranging the objects or numbers in order. Combinations are the way of selecting the objects or numbers from a group of objects or collections, in such a way that the order of the objects does not matter. For example, suppose we have a set of three letters: A, B, and C. Each possible selection would be an example of a combination.