Formulas For Permutation Combination
Permutation and Combination Formulas
Permutation:
The different arrangements of a given number of things by taking some or all at a time, are called permutations. This is denoted by ^{n}P_{r}.
- Permutations are studied in almost every branch of mathematics, and in many other fields of science. In computer science, they are used for analyzing sorting algorithms.
Combination:
Each of the different groups or selections which can be formed by taking some or all of a number of objects is called a combination. This is denoted by ^{n}c_{r}.
Formula for Permutation and Combination
- Number of all permutations of n things, taken r at a time, is given by
^n P_r = \frac{n!}{(n-r)!} - Number of all combinations of n things, taken r at a time, is given by
^n C_r = \frac{n!}{(r)! (n-r)!}
Points to remember
- Factorial of any negative quantity is not valid.
- If a particular thing can be done in m ways and another thing can be done in n ways, then
- Either one of the two can be done in m + n ways and
- Both of them can be done in m × n ways
- 0! = 1
- 1! = 1
- If from the total set of n objects and ‘p_{1}’ are of one kind and ‘p_{2}’ and ‘p_{3}’ and so on …. till p_{r} are others respectively then
^n P_r = \frac{n!}{p_1 ! × q_2 ! × ……. p_r !} - ^{n}P_{n} = n!
- ^{n}c_{n} = 1
- ^{n}c_{0} = 1
- ^{n}c_{r} = ^{n}c_{(n-r)}
- ^{n}c_{0}+^{n}c_{1}+^{n}c_{2}+^{n}c_{3}+…^{n}c_{n} = 2^{n}
Permutation and Combinations Formulas- Factorial
n ! = n(n-1)(n-2) …… 1
Eg. – 5! = 5(5-1)(5-2)(5-3)(5-4) = 5(4)(3)(2)(1)
Standard Truths
- 0! = 1
- n! only exists of n >= 0 and doesn’t exist for n < 0
n | n! |
0 | 1 |
1 | 1 |
2 | 2 |
3 | 6 |
4 | 24 |
5 | 120 |
6 | 720 |
7 | 5 040 |
8 | 40,320 |
9 | 362 880 |
10 | 3 628 800 |
Permutations Formulas
Number of ways in which Permutations out of n things r things can be SELECTED & ARRANGED (denoted by ^{n}P_{r} ).
^{n}P_{r} = number of permutations (arrangements) of n things taken r at a time.
^n P_r = \frac{n!}{(n-r)!} n ≥ r
Eg.
- Arrangement of Letters/Alphabets to form words with meaning or without meaning.
- Arrangements of balls on a table.
Formulas for Combinations
The number of ways in which r things at a time can be SELECTED from from n things is Combinations (represented by ^{n}C_{r})..
^{n}C_{r} = Number of combinations (selections) of n things taken r at a time.
- ^n P_r = \frac{n!}{(r)! (n-r)!} ; where n ≥ r (n is greater than or equal to r).
Eg.
- Selections for people from total numbers who want to go out on a picnic.
- Filling posts with people
- Selection for a sports team out of available players
- Selection of balls from a bag
Imp Properties:
Property 1
Number of permutations (or arrangements) of n different things taken all at a time = n!
Property 2
For Objects in which P1 are alike and are of one type, P2 are alike or other different type and P3 are alike or another different type and the rest must be all different, Number of permutations = \frac{n!}{(p1)! (p2)! (p3)!}
Property 3
When repetition is allowed number of permutations of n different things taken r at a time = n × n× n ×… (r times) = n^{r}
Property 4
Here, we are counting the number of ways in which k balls can be distributed into n boxes under various conditions.
The conditions which are generally asked are
- The balls are either distinct or identical.
- No box can contain more than one ball or any box may contain more than one ball.
- No box can be empty or any box can be empty.
Distribution of | How many balls boxes can contain | ||||
k Balls | into n Boxes | No Restrictions | ≤ 1 (At most one) | ≥ 1 (At least one) | = 1 (Exactly one) |
Distinct | Distinct | n^{k} (formula 1) | ^{n}P_{k} (formula 2) | S(k,n) × n! (formula 3) (Not Imp) | ^{n}P_{n} = n! if k = n 0 if k ≠ n |
Identical | Distinct | ^{(k+n-1)}C_{(n-1)} (formula 5) | ^{n}C_{k} (formula 6) | ^{(k-1)}C_{(n-1)} (formula 7) | 1 if k = n 0 if k ≠ n |
Other Properties
- ^{n}P_{r} = r! ×^{n}C_{r}
- ^{n}C_{r} + ^{n}C_{r-1} =^{n+1}C_{r}
- ^{n}C_{x} = ^{n}C_{y} when x = y or x + y = n
- ^{n}C_{r} =^{n}P_{n-r}
- r . ^{n}C_{r} = n ^{n-1}C_{r-1}
- \frac{^nC_r}{r+1} = \frac{^{n+1}C_{r+1}}{n+1}
- For ^{n}C_{r} to be greatest,
- (a) if n is even, r = \frac{n}{2}
- (b) if n is odd, r =\frac{n+1}{2} or \frac{n – 1}{2}
Read Also – Tips & tricks to solve combination questions
Login/Signup to comment