Question
Question: Prove that \[r!{}^n{C_r} = {}^n{P_r}\]...
Prove that r!nCr=nPr
Solution
Here in this question we must know the following permutation and combination formula. These are mentioned below: -
Permutation: - Number of permutation of ‘n’ things has taken ‘r’ at a time then permutation formula is given by: -
P(n,r)=nPr
P(n,r)=(n−r)!n!
Combination: -Number of combination of ‘n’ things has taken ‘r’ at a time then combination formula is given by: -
C(n,r)=nCr
C(n,r)=r!(n−r)!n!
Complete step-by-step answer:
We have to prove r!nCr=nPrso we will simply apply the formula of permutation and combination.
L.H.S (left hand side) =r!nCr
R.H.S (Right hand side) =nPr
So we will try to convert the L.H.S side to the R.H.S side.
r!nCr=r!r!(n−r)!n!
⇒(n−r)!n! (This is the formula of permutation)
Cancelling r! term from numerator and denominator.
∴(n−r)!n!=nPr
Additional Information:
There are basically two types of permutation:
Repetition is Allowed: such as the possibilities of arrangement in passwords in lock.
No Repetition: for example the first three people in a running race. You can't be first and second. So here repetition cannot apply.
There are also two types of combinations (remember the order doesn't matter now):
Repetition is Allowed: such as coins in your pocket (5, 5, 5, 10, 10) so if this 5,5,5,10,10 is selected then it can be selected three times because repetition is allowed.
No Repetition: For example if you are having three balls 1, 2 and 3. They are chosen so possibility is only one 123 while in permutation 6 arrangements can be made For example 123, 321 ,132 ,213, 231 ,312
Note: Some students may find little confusion while memorising formula of permutation and combination so here is one tip in combination there isr! term extra in denominator while whole formula is same as permutation. Also permutation is the arrangement of items in which order matters while combination is the selection of items in which order does not matter.