Chapter – Permutations & Combinations 1

CHAPTER – PERMUTATIONS & COMBINATIONS

CONCEPT 1: FACTORIALS
FACTORIAL The continued product of first n natural numbers is called the “n factorial” and is denoted by n
Thus, 3 = 3 x 2 x 1 = 6; 4 = 4 x 3 x 2 x 1 = 24, 5 = 5 x 4 x 3 x 2 x 1 = 120 etc.
ZERO FACTORIAL As we will require zero factorial in the later sections of this chapter and it does not
make any sense to define it as the product of the integers from 1 to Zero. So, we define 0 = 1.
20! 20×19×18!
Example : Compute: = = 380
18! 18!

1 1 x
Example : If + = , find x.
9! 10! 11!
𝟏 𝟏 𝐗
𝟗!
+ 𝟏𝟎×𝟗! = 𝟏𝟏×𝟏𝟎×𝟗!
𝟏 𝟏 𝒙
𝟗!
[𝟏 + 𝟏𝟎
] = 𝟏𝟏𝟎×𝟗!
𝟏𝟏 𝒙
𝟏𝟎
= 𝟏𝟏𝟎

X= 121
Example : Find n, if: (n+2) ! = 2550 x n!
(a) 48 (b) 49
(c) 50 (d) 51
(n+2)(n+1)(n)! = 2550 n!
(n+2) (n+1) = 2550
Put value of n from options and satisfy above equation.
N = 49, (51)(50) = 2550
CONCEPT 2:
(a) FUNDAMENTAL RULE OF ADDITION (“OR”, +)
If there are two jobs such that they can be performed independently in m and n ways respectively, then
either of the two jobs can be performed in (m + n) ways.

(b) FUNDAMENTAL RULE OF MULTIPLICATION (“AND”, ×)

If there are two jobs such that one of them can be completed in m ways and when it has been completed
in any one of these m ways, second job can be completed in n way ; then the two jobs in succession can
be completed in m n ways.
Example : There are 6 routes for journey from station A to station B. In how many ways you may go
from A to B and return if for returning you make a choice of any of the routes?
(a) 6 (b) 12
(c) 36 (d) 30
A → B And B → A (Both way journey)
6 × 6 = 36

GK INSTITUTE OF COMMERCE
 Chapter – Permutations & Combinations 2

Example : A person can go from place ‘A’ to ‘B’ by 11 different modes of transport but is allowed to
return back to "A" by any mode other than the one earlier. The number of different ways,
the entire journey can be complete is _______
(a) 110 (b) 1010
(c) 95 (d) 109
A → B And B → A (Different route)
11 × 10 = 110

CONCEPT 3: BASICS OF PERMUTATIONS

𝒏!
𝒏𝒑 = n → Total no. of things
𝒓 (𝒏−𝒓)!

r → Taken at a time
Ex: 2 digit numbers out of 1, 2, 3
𝟑!
n = 3, r = 2 3𝒑𝟐 = =6
𝟏!

12, 21, 13, 31, 23, 32

Example : Given : P (7, k) = 60 P(7, k - 3). Then:

(a) k=9 (b) k=8
(c) k=5 (d) k=0
7𝒑𝒌 = 60×7𝒑𝑲 = 60 × 7𝒑𝑲−𝟑
(a) K = 9, not Possible 7𝒑𝟗 (n ≥ 𝒓)
(b) K = 8, not Possible 7𝒑𝟖 (n ≥ 𝒓)
(c) K = 0, not Possible 7𝒑−𝟑 (𝒓 is not negative)
(d) K = 5, 7𝒑𝟓 = 60×7𝒑𝟐

CONCEPT 4: DIGIT PROBLEMS

Given digits : 0, 1, 2, 3, 4, 5
(1) 3 digits numbers (without repetition of digits)
1 0 -
5 option × 5 option × 4 options = 100.
(1,2,3,4,5) (0,2,3,4,5) (2,3,4,5)
except 0 except 1 except 1 and 0
(2) 3 digit numbers (repetition is allowed )

5 × 6 × 6 = 180.
(1, 2, 3, 4, 5) (All can come) (All can come)

Repetition is allowed

GK INSTITUTE OF COMMERCE
 Chapter – Permutations & Combinations 3

(3) 4 digit numbers divisible by 5. (Repetition is not allowed)

Case I: Last digit is 0
1 2 - 0

5 × 4 × 3 × 1 = 60
(1, 2, 3, 4, 5) (2, 3, 4, 5) (3, 4, 5)
Except 1 Except
and 0 1, 2, 0
Case II: Last digit is 5.
1 2 - 5
4 × 4 × 3 × 1= 48
(1, 2, 3, 4) (0, 2, 3, 4) (0, 3, 4) (only 1 option)
except 0 and 5 except 1 and 5 except 1,2,5
Total numbers = 60 + 48 = 108.
CONCEPT 5: ALPHABET PROBLEMS (without repetition of letters)
Number of Permutation of n things (all different) taken all at a time is n!
MONDAY
(i) Total no. of words = 6! = 720.
(ii) Words with M and (i) M……….Y 4! = 24
(ii) Y……….M 4! = 24
Total = 48
(iii) Words with M and Y at M……… Y 4! = 24
First and last place
respectively
(iv) Words with vowels OA, M, N, D, Y
Together 1 2 3 4 5
5! × 2! = 240.

For arrangement of OA (OA, AO)

(v) words with vowels = Total – together = 720 - 240 = 480
Never come together
(vi) vowels at odd positions:
There are 3 odd position for 2 vowels = 3 × 2 = 6
Remaining 4 places (1 odd +3 even) for 4 consonants = 4 × 3 × 2 × 1 = 24
Total = 24 × 6 = 144

GK INSTITUTE OF COMMERCE
 Chapter – Permutations & Combinations 4

Example : Find the number of arrangements in which the letters of the word ‘MONDAY’ be
arranged so that the words thus formed begin with ‘M’ and do not end with ‘N’.
(a) 720 (b) 120
(c) 96 (d) None.
M __ __ __ __ __
4 × 3 × 2 × 1 × 4 options = 96
↓ (except M and N)
Except M and
Letter at last place
CONCEPT 6: ALPHABET PROBLEMS (with repetition of letters)
Number of permutations of n things taken all at a time of which r are alike.
𝒏!
=
𝒓!
“V E E R A”
𝟓!
(i) Total words = 𝟐!
= 60

(ii) words with vowels together = E E A , V, R = 𝟑! = 𝟔

1 2 3
𝟑!
3! × 𝟐! For arrangement of E, E, A

= 3! × 3 = 18.
(iii) words with E and V at first = E_ _ _ V
And Last place respectively = 3!
(For E, R, A)
𝟑!
(iv) words with V and R at = V_ _ _ R = =3
𝟐!

first and last place For (E, E, A)

Respectively
(v) Vowels at odd positions: =
3×2×1
Vowels (3) at odd positions (3) = 2! (for E, E) = 3

Consonants (2) at remaining (2) =2×1=2

Total =3×2=6
Example : There are 5 books on English, 4 Books on Tamil and 3 books on Hindi. In how many ways
can these books be placed on a shelf if the books on the same subjects are to be together?
(a) 1,36,800 (b) 1,83,600
(c) 1,03,680 (d) 1,63,800
5 English 4 Tamil 3 Hindi

5! × 4! × 3! × 3! = 1,03,680

GK INSTITUTE OF COMMERCE
 Chapter – Permutations & Combinations 5

(For 3 Slots)
Example : The number of arrangements that can be formed from the letters of the word
“ALLAHABAD”
(a) 7560 (b) 3780
(c) 30240 (d) 15320
Total no. of letters
𝟗!
= 7560
𝟒! × 𝟐!

(For 4 A’s) (For 2 L’s )

CONCEPT 7: 3 SPECIAL CASES

Case I: Persons/ seats
In how many ways 3 persons be sit on 6 chairs?
1st person → 6 options (any of the 6 chairs)
2nd person → 5 options (any of the remaining 5)
3rd person → 4 options (any of remaining 4)
Total = 6 × 5 × 4 = 120.
Case II: Letters/ Letter boxes
In how many ways can 4 Letters be placed in 3 Letter boxes.
1st Letter can be post in – 3 ways any of the 4 letters can be posted in
2nd Letter can be post in – 3 ways 3 letterboxes. In 1 Letter box multiple
3rd Letter can be post in – 3 ways Letters csn be
4th Letter can be post in – 3 ways Posted.
Total -3×3×3×3
= (𝟑𝟒 ) = 81.
Case III: Rings / Fingers (Repetition is allowed )
In how many ways can 3 rings be worn in 4 fingers?
1st ring can be worn in 4 ways any of the 4 Fingers
2nd ring can be worn in 4 ways In 1 finger multiple
3rd ring can be worn in 4 ways rings can be worn

Total ways = 4×4×4=64. (𝟒𝟑 )

GK INSTITUTE OF COMMERCE
 Chapter – Permutations & Combinations 6

COMBINATIONS
𝒏!
𝒏𝑪 𝒓 = (𝒏−𝒓)!×𝒓!

Shortcut without Formula

10 𝟏𝟎 × 𝟗 × 𝟖
𝑪𝟑 = 𝟑×𝟐×𝟏
= (Reverse 3 times (equal to base) )
11 𝟏𝟏 × 𝟏𝟎 × 𝟗 × 𝟖
𝑪𝟒 = 𝟒×𝟑×𝟐×𝟏
= (Reverse 4 times (base = 4))

= 330
CONCEPT 8: CONCEPT OF COMBINATION AND DIFFERENCE BETWEEN PERMUTATION
AND COMBINATIONS
In permutations ORDER of selection is important whereas in combination only selection is done
irrespective of order,
Example:
2 digit no. out of Straight Linae Formed out
1, 2, 3, 4 v/s of 4 points (P1 ,P2 ,P3 ,P4)
𝟒!
4
𝑷𝟐 = 𝟐! = 12. In this case P1 P2 or P2 P1

[In this case 12 and 21 are different] is same (same straight Line )
Case of Combination
4 𝟒×𝟑
𝑪𝟐 = 𝟐×𝟏 = 6.
Example : Number of ways of shaking hands in a group of 10 persons shaking hands to each other
are:
(a) 45 (b) 54
(c) 90 (d) 10
Case of Combination : A handshakes with B (A B) or B handshakes with A (B A) is same.
𝟏𝟎 × 𝟗
= 10𝑪𝟐 = = 45.
𝟐×𝟏

Example : If nPr = 720 and nCr = 120 then r is:

(a) 4 (b) 5
(c) 3 (d) 6
n
𝑪𝒓 × r! = n𝑷𝒓
120× r! = 720  r! = 6  r = 3
CONCEPT 9: PROPERTIES OF COMBINATIONS
(a) Property 1 (Base changing property)
n
𝑪𝒓 = n𝑪𝒏−𝒓
5
Ex : (i) 𝑪 𝟑 = 5𝑪 𝟐
𝟓×𝟒×𝟑 𝟓×𝟒
𝟑×𝟐×
= 𝟐×𝟏 = 10
6 6
(ii) 𝑪𝟒 = 𝑪𝟐
𝟔×𝟓×𝟒×𝟑 𝟔×𝟓
𝟒×𝟑×𝟐×𝟏
= 𝟒×𝟑
= 15

GK INSTITUTE OF COMMERCE
 Chapter – Permutations & Combinations 7

(b) Property 2
Same
Add 1
n n n+1
𝑪𝒓 + 𝑪𝒓+𝟏 = 𝑪𝒓+𝟏

Difference of 1 Carry Larger of two.

15 15 16
Ex: (i) 𝑪𝟒 + 𝑪𝟓 = 𝑪𝟓
20 20 21
(ii) 𝑪𝟔 + 𝑪𝟕 = 𝑪𝟕
Property 3:
𝑪𝟎 + n𝑪𝟏 + n𝑪𝟐 + ………….+ n𝑪𝒏 = 𝟐𝒏
n

Ex: 5
𝑪𝟎 + 5𝑪𝟏 + 5𝑪𝟐 + ………..+ 5𝑪𝟓 = 25 = 32.

Property 4:
n
If 𝑪𝒙 = n 𝑪𝒚
(i) x=y (ii) x+y=n
n n n
Note: 𝑪𝟎 = 1, 𝑪𝒏 = 1, 𝑪𝟏 = n.
Example: If 18𝑪𝒓 = 18𝑪𝒓+𝟐 find the value of r𝑪𝟓
18
Sol. 𝑪𝒓 = 18𝑪𝒓+𝟐 n
𝑪𝒙 = n 𝑪𝒚
(i) x=y r = r + 2 (Not Possible)
(ii) x+y=n r + r + 2 = 18
2r = 16, r = 8
8
𝑪𝟓 = 8𝑪𝟑 = 56.
15
Example : C2 + 15C3 is equal to :
16 30
(a) C3 (b) C16
15 15
(c) C16 (d) C15

15 15
C2 + C3 = 16𝑪𝟑

Diff of 1
CONCEPT 10: CASES OF COMBINATIONS (Atleast, atmost, exact)
Example : From a group of 8 men and 4 women, 4 persons are to be selected to form a committee so
that at least 2 women are there on the committee. In how many ways can it be done?
(a) 201 (b) 168
(c) 202 (d) 220
4
Case 1: 2 women and 2 men = 𝑪𝟐 × 8𝑪𝟐 = 168
4
Case 2: 3 women and 1 men = 𝑪𝟑 × 8𝑪𝟏 = 32
4
Case 3: 4 women and 0 men = 𝑪𝟒 × 8𝑪𝟎 = 1
Total = 201

GK INSTITUTE OF COMMERCE
 Chapter – Permutations & Combinations 8

Example : Out of 6 Boys & 4 girls, Find the number of ways for selecting 5 member committee in
which there is exactly two girls ?
(a) 120 (b) 1440
(c) 720 (d) 71
Sol. Only 1 Case : (Exactly)
4
2 Girls and 3 Boys = 𝑪𝟐 × 6𝑪𝟑
= 6 × 20 = 120
CONCEPT 11: PRINCIPLE OF EXCLUSION / INCLUSION
Principal of inclusion/ Exclusion.
No. of Combination of r things out of n
(i) m particular must always be selected = n-m𝑪𝒓−𝒎
(ii) m particular must always be selected = n-m𝑪𝒓
Ex: Playing 11 out of 16 players
(i) No restriction = 16𝑪𝟏𝟏
(ii) Virat Kohli, Jasprit Bumrah must be selected = 14𝑪𝟗
(iii) Virat Kohli, Jasprit Bumrah must be eliminated = 14𝑪𝟏𝟏
Example : A person has ten friends of whom six are relatives. If the invites five guests such that three
of them are his relatives, then the total number of ways in which he can invite them are:
(a) 30 (b) 60
(c) 120 (d) 75
6 Relatives (3 Relatives)
10 Friends = 6𝑪𝟑 × 4𝑪𝟐
4 Friends (2 Relatives) = 120.
Example : How many ways a team of 11 players can be made out of 15 players if one particular
player is not to be selected in the team.
(a) 364 (b) 728
(c) 1,001 (d) 1,234
as 1 Player is excluded, 11 out of 14 14𝑪𝟏𝟏 = 14𝑪𝟑 = 364
If 1 Player is to be included, 10 out of 14 14𝑪𝟏𝟎 = 14𝑪𝟒 = 1001.
CONCEPT 12: GEOMETRICAL APPLICATIONS OF COMBINATIONS
Collinear points: Points which lie on same line.
Note:1 No. of straight lines act of n points of which m are collinear:
Which m are Collinear:
n
𝑪𝟐 - m𝑪𝟐 + 1.
Note:2 No. of Triangles formed out of n points of which m are collinear
n
𝑪𝟑 - m𝑪𝟑 .
Example : The number of triangles that can be formed by choosing the vertices from a set of 12
points, seven of which lie on the same straight line, is:
(a) 185 (b) 175
(c) 115 (d) 105
12 7
𝑪𝟑 - 𝑪𝟑 = 185
CONCEPT 13: CIRCULAR PERMUTATIONS
No. of circular arrangements of n different things = (n-1)!
Ex. 6 Persons sit around circular table
= (6-1) = 5! = 120.

GK INSTITUTE OF COMMERCE