PERMUTATIONS AND
COMBINATIONS
Overview
The study of permutations and combinations is concerned with
determining the number of different ways of arranging and
selecting objects out of a given number of objects, without
actually listing them. Permutation and Combination are the most
fundamental concepts in mathematics and with these concepts, a new
branch of mathematics is introduced to students i.e., combinatorics.
Permutation and Combination are the ways to arrange a group of objects
by selecting them in a specific order and forming their subsets. To arrange
groups of data in a specific order permutation and combination formulas
are used. Selecting the data or objects from a certain group is said to be
permutation, whereas the order in which they are arranged is called a
combination. There are some basic counting techniques which will
be useful in determining the number of different ways of
arranging or selecting objects. The two basic counting principles
are given below:
Fundamental principle of counting
1) Multiplication principle (Fundamental Principle of
Counting)
Suppose an event E can occur in m different ways and associated
with each way of occurring of E, another event F can occur in n
different ways, then the total number of occurrences of the two
events in the given order is m × n.
2) Addition principle
If an event E can occur in m ways and another event F can occur
in n ways, and suppose that both cannot occur together, then E or
F can occur in m + n ways.
Permutation
Permutation is the distinct interpretations of a provided number of
components carried one by one, or some, or all at a time. For
example, if we have two components A and B, then there are two
likely performances, AB and BA.
A numeral of permutations when ‘r’ components are positioned
out of a total of ‘n’ components is n Pr. For example, let n = 3 (A,
B, and C) and r = 2 (All permutations of size 2). Then there
are 3P2 such permutations, which is equal to 6. These six
permutations are AB, AC, BA, BC, CA, and CB. The six
permutations of A, B, and C taken three at a time are shown in the
image added below:
Permutation Formula
Permutation formula is used to find the number of ways to
pick r things out of n different things in a specific order and
replacement is not allowed and is given as follows:
Explanation of Permutation Formula
As we know, permutation is an arrangement of r things out of n
where order of arrangements is important (AB and BA are two
different permutation). If there are three different numerals 1, 2 and
3 and if someone is curious to permute the numerals taking 2 at a
moment, it shows (1, 2), (1, 3), (2, 1), (2, 3), (3, 1), and (3, 2). That
is, it can be accomplished in 6 methods.
Here, (1, 2) and (2, 1) are distinct. Again, if these 3 numerals shall
be put handling all at a time, then the interpretations will be (1, 2,
3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2) and (3, 2, 1) i.e. in 6 ways.
In general, n distinct things can be set taking r (r < n) at a time in
n(n – 1)(n – 2)…(n – r + 1) ways. In fact, the first thing can be any
of the n things. Now, after choosing the first thing, the second thing
will be any of the remaining n – 1 things. Likewise, the third thing
can be any of the remaining n – 2 things. Alike, the rth thing can be
any of the remaining n – (r – 1) things.
Hence, the entire number of permutations of n distinct things
carrying r at a time is n(n – 1)(n – 2)…[n – (r – 1)] which is written
as n Pr. Or, in other words,
Combination
It is the distinct sections of a shared number of components carried
one by one, or some, or all at a time. For example, if there are two
components A and B, then there is only one way to select two
things, select both of them.
For example, let n = 3 (A, B, and C) and r = 2 (All combinations of
size 2). Then there are 3C2 such combinations, which is equal to 3.
These three combinations are AB, AC, and BC.
Here, the combination of any two letters out of three letters A, B,
and C is shown below, we notice that in combination the order in
which A and B are taken is not important as AB and BA represent
the same combination.
Combination Formula
Combination Formula is used to choose ‘r’ components out of a
total number of ‘n’ components, and is given by:
Using the above formula for r and (n-r), we get the same result.
Thus, nCr = nC(n-r)
Explanation of Combination Formula
Combination, on the further hand, is a type of pack. Again, out of
those three numbers 1, 2, and 3 if sets are created with two
numbers, then the combinations are (1, 2), (1, 3), and (2, 3).
Here, (1, 2) and (2, 1) are identical, unlike permutations where they
are distinct. This is written as 3C2. In general, the number of
combinations of n distinct things taken r at a time is,
Derivation of Permutation and Combination Formulas:
We can derive these Permutation and Combination formulas using
the basic counting methods as these formulas represent the same
thing. Derivation of these formulas is as follows:
Derivation of Permutations Formula
Permutation is selecting r distinct objects from n objects without
replacement and where the order of selection is important, by the
fundamental theorem of counting and the definition of permutation,
we get P (n, r) = n . (n-1) . (n-2) . (n-3). . . . .(n-(r+1))
By Multiplying and Dividing above with (n-r)! = (n-r).(n-r-1).(n-r-
2). . .3. 2. 1, we get P (n, r)
=[n.(n−1).(n−2)….(nr+1)[(n−r)(n−r−1)(n-r)!] / (n-r)!
⇒ P (n, r) = n!/(n−r)!
Thus, the formula for P (n, r) is derived.
Derivation of Combinations Formula
Combination is choosing r items out of n items when the order of
selection is of no importance. Its formula is calculated as,
C(n, r) = Total Number of Permutations /Number of ways to
arrange r different objects.
C(n, r) = P (n, r)/ r! ⇒ C(n, r) = n!/(n−r)!r!
Thus, the formula for Combination i.e., C(n, r) is derived.
Difference Between Permutation and Combination
Permutation Combination
In Permutation order of In Combination order of
arrangement is important. arrangement is not important.
For example, AB and BA are For example, AB and BA are the
different combinations. same combinations.
A permutation is used when Combinations are used when the
different kinds of things same kind of things are to
are to be sorted or arranged. be sorted.
Permutation of two things out the combination of two things
of three given things from three given things
a, b, c is ab, ba, bc, cb, ac, ca. a, b, c is ab, bc, ca.
Formula for permutation The formula for Combination
is: n Pr = n!/(n – r)! is: n Cr = n! /{r! × (n – r)!}
Solved Examples on Permutation and Combination:
Example 1: Find the number of permutations and combinations
of n = 9 and r = 3.
Solution:
Given, n = 9, r = 3
Using the formula given above:
For Permutation:
n
Pr = (n!) / (n – r)!
⇒ nPr = (9!) / (9 – 3)!
⇒ nPr = 9! / 6! = (9 × 8 × 7 × 6! )/ 6!
⇒ nPr = 504
For Combination:
n
Cr = n!/r!(n − r)!
⇒ nCr = 9!/3!(9 − 3)!
⇒ nCr = 9!/3!(6)!
⇒ nCr = 9 × 8 × 7 × 6!/3!(6)!
⇒ nCr = 84
Example 2: In how many ways a committee consisting of 4 men
and 2 women, can be chosen from 6 men and 5 women?
Solution:
Choose 4 men out of 6 men = 6C4 ways = 15 ways
Choose 2 women out of 5 women = 5C2 ways = 10 ways
The committee can be chosen in 6C4 × 5C2 = 150 ways.
