Permutations and

01 Combinations

Introduction
Counting is the most fundamental application of mathematics. There are many natural methods used for
counting.
In this chapter we will be going to deal with various known techniques those are much faster than the usual
counting methods.

Important Point
𝐹𝑃𝐶 (Fundamental Principal of Counting) is used to count some event without actually counting them.
Let us take help of some model.
Model- I :
Find number of ways of in which one can travel from 𝑇1 (town1) to 𝑇3 (town3) via 𝑇2 (town2).
𝑅1 𝑅4
𝑅2
𝑇1 𝑇2 𝑇3
𝑅3
𝑅5

Total ways :-

𝑇1 𝑅1 𝑇2 𝑅4 𝑇3

𝑇1 𝑅1 𝑇2 𝑅5 𝑇3

𝑇1 𝑅2 𝑇2 𝑅4 𝑇3

𝑇1 𝑅2 𝑇2 𝑅5 𝑇3

𝑇1 𝑅3 𝑇2 𝑅4 𝑇3

𝑇1 𝑅3 𝑇2 𝑅5 𝑇3 = 6 ways

It is easy to proceed by 𝐹𝑃𝐶 𝑇1 to 𝑇2 ⎯ → 3

𝑇2 to 𝑇3 ⎯ → 2

Total ways = 3 × 2 = 6

Mathematics [1]
 JEE (Main + Advanced) : Mathematics
Model- II:
To find the number of ways by which a person can enter and leave cinema hall by a different door.
4 + 4 + 4 + 4 + 4 = 20
𝐷2
𝐷3
𝐷1
𝐷4
𝐷5
Cinema Hall 𝐷4
𝐷2 𝐷3
𝐷1 𝐷4
𝐷5 𝐷5
𝐷1
Cinema 𝐷2
𝐷3
Hall 𝐷4
𝐷2 𝐷4 𝐷5
𝐷1
𝐷3 𝐷2
𝐷4
𝐷3
𝐷5
𝐷1
𝐷5 𝐷2
𝐷3
𝐷4
By 𝐹. 𝑃. 𝐶.
(i) A person can enter in cinema hall by 5 ways & leave by 4 ways = 5 × 4 = 20.
(ii) If he can enter and leave by any door then number of ways = 5 × 5 = 25.
(iii) He can enter by 𝐷1 , 𝐷2 and leaves by 𝐷3 , 𝐷4 , 𝐷5 = 2 × 3 = 6
(iv) He enters with odd number gate and leaves the even number gate = 3 × 2 = 6
Basic Steps to Remember :
Step-I : Identify the independent events involved in a given problem.
Step-II : Find the number of ways performing/occurring each event
Step-III : Multiply these numbers to get the total number of ways of performing/occurring all the events
Example :
There are 15 IITs in India and let each IIT has 10 branches, then the IITJEE topper can select the IIT and
branch in 15 × 10 = 150 number of ways.
Example :
There are 15 IITs & 20 NITs in India, then a student who cleared both IITJEE & AIEEE exams can select an
institute in (15 + 20) = 35 number of ways.
Illustration 1:
Number of ways in which IITJEE topper can select the IIT and its branch, if there are 23 IITs in India and
each IIT has 10 branches.
Solution:
Number of ways = 23 × 10 = 230
Illustration 2:
Number of ways in which a student who cleared both IITJEE & AIEEE exams can select an institute if there
are 23 IITs & 31 NITs in India is :
Solution:
Number of ways = 23 + 31 = 54

[2] Mathematics
Permutations and Combinations
Fundamental Counting Problems
Illustration 3:
Shubham has 2 school bags, 3 tiffin boxes and 2 water bottles. In how many ways can she carry these items
(choosing one each).
Solution:
A school bag can be chosen in 2 different ways. After a school bag is chosen, a tiffin box can be chosen in 3
different ways. Hence, there are 2 × 3 = 6 pairs of school bag and a tiffin box. For each of these pairs a
water bottle can be chosen in 2 different ways.
Hence, there are 6 × 2 = 12 different ways in which, Shubham can carry these items to school. If we name
the 2 school bags as 𝐵1 , 𝐵2 , the three tiffin boxes as 𝑇1 , 𝑇2 , 𝑇3 and the two water bottles as 𝑊1 , 𝑊2 these
possibilities can be illustrated in the Figure.
12 Possibilities
𝑊1 𝐵1 𝑇1 𝑊1
𝑇1 𝑊2
𝐵1 𝑇1 𝑊2
𝑊1 𝐵1 𝑇2 𝑊1
𝑇2
𝑊2
𝑇3 𝐵1 𝑇2 𝑊2
𝐵1 𝑊1 𝐵1 𝑇3 𝑊1
𝑊2
𝐵1 𝑇3 𝑊2
𝑊1 𝐵2 𝑇1 𝑊1
𝑊2
𝐵2 𝑇1 𝐵2 𝑇1 𝑊2
𝑊1 𝐵2 𝑇2 𝑊1
𝑇2
𝑊2
𝑇3 𝐵2 𝑇2 𝑊2
𝑊1 𝐵2 𝑇3 𝑊1
𝑊2
𝐵2 𝑇3 𝑊2
Illustration 4:
A college offers 6 courses in the morning and 4 in the evening. The possible number of choices with the
student if he wants to study one course in the morning and one in the evening is-
(A) 24 (B) 2 (C) 12 (D) 10
Ans. (A)
Solution:
The student has 6 choices from the morning courses out of which he can select one course in 6 ways.
For the evening course, he has 4 choices out of which he can select one in 4 ways.
Hence the total number of ways 6 × 4 = 24.
Illustration 5:
A college offers 6 courses in the morning and 4 in the evening. The number of ways a student can select
exactly one course, either in the morning or in the evening-
(A) 6 (B) 4 (C) 10 (D) 24
Ans. (C)
Solution:
The student has 6 choices from the morning courses out of which he can select one course in 6 ways.
For the evening course, he has 4 choices out of which he can select one in 4 ways.
Hence the total number of ways 6 + 4 = 10.

Mathematics [3]
 JEE (Main + Advanced) : Mathematics
Illustration 6:
Tossing of a coin & Tree diagram
Solution:
𝑇
𝑇
𝐻
𝑇
𝑇
𝐻 8 ways
𝐻
Start (2 × 2 × 2)
𝑇
𝑇
𝐻
𝐻
𝑇
𝐻
𝐻
Illustration 7:
In an examination of 10 𝑇/𝐹 question, How many sequence of answers are possible.
Solution:
Any question can be answered in two ways , i.e. true or false.
So total task of answering tan question can be done in
2 × 2 × 2 × . . . . . . . . . . . 10 times = 210 ways
Illustration 8:
10 students complete in a swimming race. In how many ways can they occupy the first 3 positions.
Solution:
1st place can be occupied in 10 ways
2nd place can be occupied in 9 ways
3rd place can be occupied in 8 ways.
So total number of ways = 10 × 9 × 8 = 720
Illustration 9:
There are 7 flags of different colour. Find the number of different signals that can be transmitted by the
use of 2 flags one above the other.
Solution:
1st place can be occupied in 7 ways
2nd place can be occupied in 6 ways
So total number of ways = 7 ∙ 6 = 42

Fundamental Principle of Counting

Multiplication Principle (Fundamental Principle of Counting)
Suppose an event 𝐸 can occur in 𝑚 different ways and associated with each way of occurring of 𝐸, another
event 𝐹 can occur in 𝑛 different ways, then the total number of occurrences of the two events in the given
order is 𝑚 × 𝑛.
Addition Principle
If an event 𝐸 can occur in 𝑚 ways and another event 𝐹 can occur in 𝑛 ways, and suppose that both cannot
occur together, then 𝐸 or 𝐹 can occur in 𝑚 + 𝑛 ways.

[4] Mathematics
Permutations and Combinations
Notation of Factorial
1. Notation of Factorial & its Algebra
The continued product of first 𝑛, natural number is called as "𝑛 factorial" and denoted by 𝑛!
𝑛! = 𝑛. (𝑛 – 1). (𝑛 – 2). . . . . . . 3.2.1
4! = [Link] = 24
3! = 3.2.1 = 6
5! = 120 ; 6 ! = 720 ; 7 ! = 5040
Special Results :
(I) 0! = 1 i.e. factorial of zero is 1
Proof : 𝑛! = 𝑛. (𝑛 – 1)!
Putting 𝑛 = 1
1! = 1.0! ⇒ 0! = 1
(II) Factorial of negative number is undefined
n! 0! 1
( n − 1)! = if 𝑛 = 0 then (−1)! = = Not defined
n 0 0
Illustration 10:
Find 𝑛 if (𝑛 + 1)! = 12 × (𝑛 – 1)!
Solution:
(𝑛 + 1) 𝑛(𝑛 – 1)! = 12 × (𝑛 – 1)!
𝑛2 + 𝑛 – 1 2 = 0; (𝑛 + 4) (𝑛 – 3) = 0 ∴ 𝑛 = 3
Illustration 11:
(𝑛 + 2)! = 2550 𝑛!
Solution:
(𝑛 + 2) (𝑛 + 1) = 2550; (𝑛 + 52) (𝑛 – 4 9) = 0 ∴ 𝑛 = 49

2. Exponent of Prime Number (P) in n!

Let 𝑝 be a prime number and 𝑛 be a positive integer. Then, the last integer amongst 1, 2, 3,........
𝑛 𝑛 𝑛
(𝑛 – 1), 𝑛 which is divisible by 𝑝 is [ ] 𝑝, where [ ] denotes the greatest integer less than or equal to
𝑝 𝑝 𝑝
 10   12   15 
For example,   = 3,   = 2,   = 5 etc.
3 3 3
n  n   n  n 
E p ( n !) =   +  2  +  3  ++  s 
 p  p   p  p 
Where 𝑠 is the largest positive integer such that p s  n  p s +1
 100   100   100   100   100   100 
E2 (100!) = E2 (100!) =  + 2 + 3 + 4 + 5 + 6 
 2   2   2   2   2   2 
= 50 + 25 + 12 + 6 + 3 + 2
Illustration 12:
Exponent of 3 in 100! Is equal to.
Solution:
 100   100   100   100 
E3 = E3 =  + + + 
 3   9   27   81 
= [33.3] + [11.1] + [3.7] + [1.2] = 33 + 11 + 3 + 1 = 48

Mathematics [5]
 JEE (Main + Advanced) : Mathematics
Illustration 13:
Find number of zeros at the end of (1000)!
Solution:
In any usual factorial of a natural number of 2𝑠 are more than number of 5𝑠. Hence number of 10𝑠 are same
as number of 5𝑠.
Objective approach:
 1000   1000   1000   1000 
E5 (1000!) =  + 2 + 3 + 4 
 5   5   5   5 
= 200 + 40 + 8 + 1 = 249

Forming Numbers and Arranging Digits

Divisibility of Numbers:
The following chart shows the conditions of divisibility of numbers.
Divisible by Condition
2Whose last digit is even (0, 2, 4, 6, 8)
4Whose last two digits number is divisible by 4
8Whose last three digits number is divisible by 8
3Sum of whose digits is divisible by 3
9Sum of whose digits is divisible by 9
6Which is divisible by both 2 and 3
5Whose last digit is either 0 or 5
25Whose last two digits are divisible by 25
11 Difference of sum of digits at odd place with even place should be divisible by 11.
10Divisible by 2 and 5
Illustration 14:
How many 3 digits numbers can be formed by the digit 1, 2, 3, 4, 5 without repetition.
Solution:
Hundred's place digit can be selected in 5 ways.
Ten's place digit can be selected in 4 ways.
Unit's place digit can be selected in 3 ways.
So, 5 × 4 × 3 = 60
Illustration 15:
How many four digits numbers can be made by using 0, 1, 3, 4, 7, 9
(i) If repetition allowed
(ii) If repetition not allowed
(iii) Even Numbers (Repetition allowed)
(iv) Odd (Repetition allowed)
Solution:
Given digits: 0, 1, 3, 4, 7, 9 → 6 digits
(i)

   
5 × 6 × 6 × 6 = 1080
(zero not include)

[6] Mathematics
Permutations and Combinations
(ii)

   
5 × 5 × 4 × 3 = 300

(zero not include)

(iii)
0 or 4
   
5 × 6 × 6 × 2 = 360

(zero not include)

(iv)
1 or 3 or 7 or 9
   
5 × 6 × 6 × 4 = 720

Illustration 16:
How many 6 digits odd number greater than 6,00,000 can be formed from the digits 5,6,7, 8, 9, 0 if
repetition of digit is allowed?
Solution:
Numbers greater than 6,00,000 and formed with the digit 5, 6, 7, 8, 9, 0 are of 6 digit but begin with 6, 7, 8 or 9.
Also, the numbers which end with 5, 7, 9 are odd.
Hence, first place can be filled by 4 ways (out of 6, 7, 8 or 9). Last place can be filled by 3 ways.
Hence, first and last place can be filled by 4 × 3 ways.
Also 2nd place can be filled by 6 ways.
3rd place can be filled by 6 ways
4th place can be filled by 6 ways.
5th place can be filled by 6 ways
Hence, all the 6 places can be filled by
4 × 3 × 6 × 6 × 6 × 6 = 15552 ways.

Definition of Permutation & Combination:

Permutation:
Permutation means arrangement in a definite order of things which may be alike or different taken some
or all at a time. Hence permutation refers to the situation where order of occurrence of the events is
important.
Example:
(i) Out of 𝐴, 𝐵, 𝐶, 𝐷 take 3 letters & form number plate of car.
(ii) Selection of cricket team of 11 players from 16 players is combination but deciding with batting order
is permutation.
Theorm-1 :
Number of permutations of 𝑛 distinct things taken all at a time symbolised as :
Pn = P ( n , n ) = Ann = n !
n

Mathematics [7]
 JEE (Main + Advanced) : Mathematics
Proof :
Let these are 𝑛 things arranged at 𝑛 places
n. ( n –1) . ( n –2) .........3.2.1 = n!
We also say that number of ways in which n distinct objects can be arranged amongst themselves in
Pn = n ! i.e. Find total number of words that of 10 letters that can be formed from all the letters of word
n

GANESHPURI.
n
A = Pn = 10! = n !
Theorm-2 :
Number of permutations of 𝑛 distinct things taken 𝑟 at a time
0  r  n
n n!
Pr = P( n , r ) = Arn =
( n − r )!
Things 𝑇1 , 𝑇2 . . . . . . 𝑇𝑛
Places 1, 2, 3 . . . . . . . . . . . 𝑟
Choice 𝑛. (𝑛 − 1). (𝑛 − 2) . . . . . . . . [𝑛 − (𝑟 − 1)]
n( n − 1)( n − 2)( n − r + 1)( n − r )! n!
Total way = =
( n − r )! ( n − r )!
Hence, we can say that
n n!
Pr =
( n − r )!

= ( n )( n –1)( n –2) ....... ( n – r + 1)


r factors
Note :
1. 100
P = 100  99
2
n
2. P1 = n
n n
3. P0 = =1
n
Illustration 17:
Simplify:
3 10 100
i. P ii. P iii. P
2 5 2

Solution:
3 3!
i. P= =6
2
( 3 − 2) !
10 10! [Link].6.5!
ii. P = = = [Link].6
5
(10 − 5)! 5!

iii. 100
P2 = 100  99

[8] Mathematics
Permutations and Combinations
Illustration 18:
In how many ways can 5 persons be made to occupy five different chairs.
Solution:
5
P5 = 5! = 120
Illustration 19:
In how many ways can 5 persons be made to occupy three different chairs.
Solution:
5
P3 = 5  4  3 = 60
Illustration 20:
In how many ways first three prizes are distributed in seven athletes?
Solution:
M-1 : P1 P2 P3

7 × 6 × 5  210

7
M-2 : P3
= 7. 6. 5 = 210
Combination:
Combination/selection/collection/committee refers to the situation where order of occurrence of the
event is not important. Combination is selection of one or more things out of 𝑛 things which may be alike
or different.
Note:
Things which are alike and which are different. All god made things in general are treated to be different
and all man made things are to be spelled whether like or different.
Hence, we say that permutation is arrangement of things in definite order.
Example:
(i) Out of four letters 𝐴, 𝐵, 𝐶, 𝐷 take any 3 letters & form triangle (possible).
Theorm-1 :
Number of combination/selections of 𝑛 distinct things taken 𝑟 at a time
n n!
n
Cr = c ( n , r ) =   =
 r  ( r )! ( n − r )!
Proof:
Let 10 different objects are given as 𝐴, 𝐵, 𝐶, 𝐷, 𝐸, 𝐹, 𝐺, 𝐻, 𝐼, 𝐽
Let combinations taking 3 at a time = 𝑥
Arrangement = ( x )  (3!)
10
x.3! = P3
10
P3 10!
x= =
3! (10 − 3)! 3!

Mathematics [9]
 JEE (Main + Advanced) : Mathematics
Illustration 21:
Find the value of
10
i. 5 C2 ii. 10
C2 iii. C3
Solution:
5 5 5.4
i. C2 = = = 10
5 − 2 2 2
10 10 10  9  8 10  9
ii. C2 = = = = 45
8 2 8 2 2
10 10  9  8
iii. C3 =
3
Keep in Mind :
n
❖ C0 = 1
n
❖ C1 = n
n
❖ Cn = 1
Illustration 22:
Find the value of 𝑛 such that 𝑛 𝑃5 = 42 𝑛 𝑃3 , 𝑛 > 4
Solution:
Given that
𝑛
𝑃5 = 42 𝑛 𝑃3
or 𝑛(𝑛 − 1)(𝑛 − 2)(𝑛 − 3)(𝑛 − 4) = 42𝑛(𝑛 − 1)(𝑛 − 2)
Since 𝑛 > 4 so 𝑛(𝑛 − 1)(𝑛 − 2) ≠ 0
Therefore, by dividing both sides by 𝑛(𝑛 − 1)(𝑛 − 2), we get
(𝑛 − 3(𝑛 − 4) = 42
or 𝑛2 − 7𝑛 − 30 = 0
or 𝑛2 − 10𝑛 + 3𝑛 − 30 = 0
or (𝑛 − 10)(𝑛 + 3) = 0
or 𝑛 − 10 = 0 or 𝑛 + 3 = 0
or 𝑛 = 10 or 𝑛 = −3
As 𝑛 cannot be negative, so 𝑛 = 10.
Illustration 23:
n
P4 5
Find the value of 𝑛 such that n −1
= ,n  4
P4 3
Solution:
n
P4 5
Given that n −1
=
P4 3
Therefore 3𝑛(𝑛 − 1)(𝑛 − 2)(𝑛 − 3) = 5(𝑛 − 1)(𝑛 − 2)(𝑛 − 3)(𝑛 − 4)
or 3𝑛 = 5(𝑛 − 4)[𝑎𝑠(𝑛 − 1)(𝑛 − 2)(𝑛 − 3) ≠ 0, 𝑛 > 4] or 𝑛 = 10.
Illustration 24:
Find 𝑟, if 5 4 𝑃𝑟 = 6 5 𝑃𝑟−1 .

[ 10 ] Mathematics
Permutations and Combinations
Solution:
We have 5 4 𝑃𝑟 = 6 5 𝑃𝑟−1
4! 5!
Or 5  = 6
( 4 − r ) ! ( r + 1)!
5 −
5! 6  5!
Or =
( 4 − r ) (
! 5 − r + 1 )( − r )(5 − r − 1)!
5
or (6 − 𝑟)(5 − 𝑟) = 6
or 𝑟 2 − 11𝑟 + 24 = 0
or 𝑟 2 − 8𝑟 − 3𝑟 + 24 = 0
or (𝑟 − 8)(𝑟 − 3) = 0
or 𝑟 = 8 or 𝑟 = 3.
Hence 𝑟 = 8, 3.

Rank Problem or Dictionary Problems

Lexicography : The theory and practising of writing and editing dictionary is known as LEXICOGRAPHY
Note :
RANK of the word means, the no. from the starting at which the required word occurs in a special
dictionary which is formed by using all the letters of the given word.
Illustration 25:
Find rank of the word ′𝐶𝐴𝐵′.
Solution:
A, B, C
𝐴 = 2

𝐵 = 2

𝐶 𝐴 𝐵 = 1

Rank = 5
Illustration 26:
Find total number of 5 letter word that can be formed from letters of word "TOUGH".
Solution:

5 × 4 × 3 × 2 × 1 = 120
Illustration 27:
Find the rank of "TOUGH" if all the letters of the word are arranged in all possible orders & written out as
in a dictionary.
Solution:
The number of letters in the word "TOUGH" is 5 & all the five letters are different.
Alphabetical order of all the letters is G,H,O,T,U
Number of words beginning with G =4×3×2×1
Number of words beginning with H =4×3×2×1
Number of words beginning with O =4×3×2×1
Number of words beginning with TG = 3 × 2 × 1
Number of words beginning with TH = 3 × 2 × 1
Number of words beginning with TOG = 2 × 1
Number of words beginning with TOH = 2 × 1
Next words beginning with "TOU" and it is "TOUGH" = 1.
Rank = 24 + 24 + 24 + 6 + 6 + 2 + 2 + 1 = 89

Mathematics [ 11 ]
 JEE (Main + Advanced) : Mathematics
Illustration 28:
Find rank of the word 'BIHAR'.
Solution:
A, B, H, I, R
𝐴 = 4 = 24

𝐵 𝐴 = 3=6

𝐵 𝐻 = 3=6

𝐵 𝐼 𝐴 = 2=2

𝐵 𝐼 𝐻 𝐴 𝑅 = 1

Rank = 24 + 6 + 6 + 2 + 1 = 39

Problems based on words

Illustration 29:
Number of words which can be made by using all the letters of the word 𝐽𝑂𝐷𝐻𝑃𝑈𝑅.
(i) If no condition.
(ii) If word starts with ′𝐽′ and ends with ′𝑅′.
(iii) If word starts with ′𝐽′ or ends with ′𝑅′.
(iv) If word neither starts with ′𝐽′ nor ends with ′𝑅′.
(v) If all vowels occupy odd places.
(vi) If position of vowels or consonants remain same.
Solution:
(i) 𝐽, 𝑂, 𝐷, 𝐻, 𝑃, 𝑈, 𝑅 → 7
7 × 6 × 5 × 4 × 3 × 2 × 1 = 17
Number of words are 7! = 5040
(ii) Starts with ′𝐽′ and ends with ′𝑅′ then the number are comes in middle part is 5!.

      
1 × 5 × 4 × 3 2 × 1 × 1 = 120

(iii) (Starts with ′𝐽′) + (End with ′𝑅′)(Start 𝐽 and End 𝑅)

OR
𝐽 𝑅 𝐽 𝑅
( ……….) + (…………. )–( ………… )

𝐴 or 𝐵 = 𝐴 ∪ 𝐵
OR
= 𝐴 + 𝐵 − (𝐴 ∩ 𝐵)

(1 × 6!) + (6! × 1)– (5!)

6! + 6!– 5! = 1320

[ 12 ] Mathematics
Permutations and Combinations
(iv) Total words – [Case-iii]
= 5040– 1320 = 3720
(v)
1 2 3 4 5 6 7

4C × 2! × 5!
2
  
(2 odd places (O,U) (consonants)
for vowels)

(consonants)

(vi) 𝐽 𝑂 𝐷 𝐻 𝑃 𝑈 𝑅

vowels

Geometric Based Selections:

If there are n points in a plane of which 𝑚(< 𝑛) are collinear, then
(a) Total number of different straight lines obtained by joining these 𝑛 points is
n
C2 −m C2 + 1
(b) Total number of different triangles formed by joining these 𝑛 points is
n
C3 −m C3
(c) Number of diagonals in polygon of 𝑛 sides is
n( n − 3)
n
C2 − n i.e.
2
(d) If 𝑚 parallel lines in a plane are intersected by a family of other 𝑛 parallel lines. Then total number of
parallelograms so formed is
mn( m − 1)( n − 1)
m
C2 n C2 i.e.
4
(e) Number of triangles formed by joining vertices of convex polygon of n sides is n C3 of which

(i) Number of triangles having exactly two sides common to the polygon = 𝑛
(ii) Number of triangles having exactly one side common to the polygon = 𝑛(𝑛 − 4)
(iii) Number of triangles having no side common to the polygon
n ( n − 4 )( n − 5)
n
C3 − n ( n − 4 ) − n =
6

Mathematics [ 13 ]
 JEE (Main + Advanced) : Mathematics
(f) In a plane there are ′𝑚′ circle & ′𝑛′ straight lines then maximum number of intersection point is
𝐿

𝐿1 𝐿2
𝑆1 𝑆2
𝑆

( n
C2  1 ) + ( m
C1 .n C1  2 ) + ( m
C2  2 )
(g) In a chase board :
98 98
(i) Total number of rectangle = 9 C2 .9 C2 =  = (36)2 = 1296
2 2
(ii) Number of square =
Square size Number of squares
1×1 8 × 8 = (8)2
2×2 7 × 7 = (7)2
3×3 (6)2
4×4 (5)2
5×5 (4)2
6×6 (3)2
7×7 (2)2
8×8 (1)2
Total = 12 + 22 + ………. + 82
n( n + 1)(2n + 1) 8(9)(17)
= = = 204
6 6
(iii) Number of rectangle which are not square = 1296 − 204 = 1092

Playing Cards:
A pack of playing cards consists of 52 cards of 4 suits, 13 in each, as shown in figure.

[ 14 ] Mathematics
Permutations and Combinations
Recognition of Cards:

Face Cards:
Face cards contain 12 cards all of 𝐾, 𝑄 and 𝐽 having designed a figure of a person.
i.e., Face cards = 4 + 4 + 4 = 12,

String Method and Gap Method

Illustration 30:
Number of words which can be made by using all the letters of the word JODHPUR.
(i) If all vowels are together.
(ii) If word ′𝑃𝑈𝑅′ always comes.
(iii) If letters ′𝑃𝑈𝑅′ always together.
(iv) If letters ′𝑃𝑈𝑅′ occurs together but ′𝐽′ never comes with ′𝑃𝑈𝑅′.
(v) If no vowels comes together.
Solution:
(i) Vowels Consonants TIE Method
O, U J, D, H, P, R

𝑂, 𝑈 𝐽 𝐷 𝐻 𝑃 𝑅

= 6! × 2!
 
Blocks (O,U)

(ii) 𝐽 𝑂 𝐷 𝐻 𝑃𝑈𝑅

5! blocks

𝐽 , 𝑂 , 𝐷 , 𝐻 , 𝑃, 𝑈, 𝑅
(iii)

= 5! × 3!

P, U, R

Mathematics [ 15 ]
 JEE (Main + Advanced) : Mathematics

(iv) 𝑂 , 𝐷 , 𝐻 , 𝑃, 𝑈, 𝑅

= 4! × 3! × 3
𝐶1 × 1!
   
Blocks (P,U,R) Place for J
(v) 𝐽 , 𝐷 , 𝐻 , 𝑃 , 𝑅 GAP Method
= 5! × 6
𝐶2 × 2!
  
Blocks place for (O, U)
(consonants) (vowels)

Combinatorial Arguments for Identities on nCr

(1) 𝑛
𝐶0 = 1
n
(2) C1 = n
n
(3) Cn = 1
n n
(4) Cn − r = Cr

Number of selections = Number of rejections  n

Cr = n Cn − r
n n
Proof : n Cr = = = n Cn − r
r n − r n − (n − r ) n − r
(5) If n Cx =n C y  x + y = n or 𝑥 = 𝑦
(6) Pr =n Cr r !
n

i.e. permutation is defined total number of combinations of object then arrangements of objects.
n
(7) n Cr = . n −1Cr −1
r
n n n −1 n
Proof : = = . n − 1 Cr −1
n − r r ( n − 1) − ( r − 1) . r r − 1 r

Illustration 31:
10 9 10.9
10
C2 = . C1 =
2 2
n +1
(8) Cr + Cr −1 = Cr
n n

Solution:
n n
Proof : L.H.S = n Cr + n Cr −1 = +
n – r· r n – r + 1· r − 1

u n
= +
n – r· r –1 ( n – r + 1) n − r· r − 1

n 1 1 
= +
n – r r − 1  r n – r + 1 
n  ( n − r + 1) + r  n +1 n +1
=   = = Cr = R.H.S.
n – r r –1  r( n − r + 1)  n − r + 1 r

[ 16 ] Mathematics
Permutations and Combinations
Illustration 32:
52
C15 +52C36 = ?
Solution:
52
C37 +52C36 =53 C37
Illustration 33:
r
Cr + r +1Cr + r +2Cr + ......... + n Cr = ?
Solution:
r
Cr + r +1Cr + r +2Cr + ......... + n Cr
= r +1
Cr +1 + r +1Cr + r +2Cr + ......... + n Cr  r Cr = r +1Cr +1 = 1
r +2
= Cr +1 + r +2Cr + ......... + nCr
r +3
= Cr +1 + r +3Cr + ......... + nCr
= n Cr +1 + n Cr
n +1
= n +1
Cr +1 = Cn−r
Illustration 34:
n
Cr n − ( r − 1)
(9) n =
Cr −1 r
Solution:
Proof :
n
Cr
LHS = n
C r −1
 n   n 
n
Cr =  =  ...(1)
 n − r r   n − r r r −1
 n   n 
n
Cr −1 =  =  ...(2)
 n − r + 1 r − 1  ( n − r + 1) n − r . r − 1 
Divide equation (1) by (2)
n
Cr n − ( r − 1)
n
=
Cr −1 r

Arrangement of Alike Objects

Permutations when all the Objects are not Distinct Objects
Suppose we have to find the number of ways of rearranging the letters of the word 𝐵𝑂𝑂𝑇. In this
case, the letters of the word are not all different. There are 2𝑂𝑠, which are of the same kind.
Let us treat, temporarily, the 2𝑂𝑠 as different, say, 𝑂1 and 𝑂2 . The number of permutations of
4 −different letters, in this case, taken all at a time is 4!. Consider one of these permutations say, 𝐵𝑂𝑂𝑇.
Corresponding to this permutation, we have 2! permutations 𝐵𝑂1 𝑂2 𝑇 and 𝐵𝑂2 𝑂1 𝑇 which will be
exactly the same permutation if 𝑂1 and 𝑂2 are not treated as different, i.e., if 𝑂1 and 𝑂2 are the
same 𝑂 at both places.

Mathematics [ 17 ]
 JEE (Main + Advanced) : Mathematics
4!
Therefore, the required number of permutations = 3  4 = 12
2!
BO1O2T 
⎯→
⎯ BOOT
BO2O1T 
TO1O2 B 
⎯→
⎯ TOOB
TO2O1 B 
BO1TO2 
⎯→
⎯ BOTO
BO2TO1 
TO1 BO2 
⎯→
⎯ TOBO
TO2 BO1 
BTO1O2 
⎯→
⎯ BTOO
BTO2O1 
TBO1O2 
⎯→
⎯ TBOO
TBO2O1 
O1O2 BT 
⎯→
⎯ OOBT
O2O1 BT 
O1 BO2T 
⎯→
⎯ OBOT
O2 BO1T 
O1TO2 B 
⎯→⎯ OTOB
O2TO1 B 
O1 BTO2 
⎯→
⎯ OBTO
O2 BTO1 
O1TBO2 
⎯→
⎯ OTBO
O2TBO1 
O1O2TB 
⎯→
⎯ OOTB
O2O1TB 
Let us now find the number of ways of rearranging the letters of the word 𝐼𝑁𝑆𝑇𝐼𝑇𝑈𝑇𝐸. In this case there
are 9 letters, in which I appears 2 times and 𝑇 appears 3 times. Temporarily, let us treat these letters
different and name them as 𝐼1 , 𝐼2 , 𝑇1 , 𝑇2 , 𝑇3 . The number of permutations of 9 different letters, in this case,
taken all at a time is 9!. Consider one such permutation, say, 𝐼1 𝑁𝑇1 𝑆𝐼2 𝑇2 𝑈 𝐸 𝑇3 • Here if 𝐼1 , 𝐼2 are not same
and 𝑇1 , 𝑇2 , 𝑇3 are not same, then 𝐼1 , 𝐼2 can be arranged in 2! Ways and 𝑇1 , 𝑇2 , 𝑇3 an be arranged in 3! Ways.
Therefore, 2! × 3! Permutations will be just the same permutation corresponding to this chosen
9!
permutation 𝐼1 𝑁𝑇1 𝑆𝐼2 𝑇2 𝑈𝐸𝑇3 . Hence total number of different permutations will be
2!3!
Illustration 35:
Find the number of permutations of the letters of the word 𝐴𝐿𝐿𝐴𝐻𝐴𝐵𝐴𝐷.
Solution:
Here, there are 9 objects (letters) of which there are 4𝐴’𝑠, 2𝐿’𝑠 and rest are all different.
9! 5  6  7  8  9
Therefore, the required number of arrangements = = = 7560
4!2! 2

[ 18 ] Mathematics
Permutations and Combinations
Illustration 36:
In how many ways can 4 red, 3 yellow and 2 green discs be arranged in a row if the discs of the same colour
are indistinguishable?
Solution:
Total number of discs are 4 + 3 + 2 = 9. Out of 9 discs, 4 are of the first kind (red), 3 are of the second kind
(yellow) and 2 are of the third kind (green).
9!
Therefore, the number of arrangements = 1260
4!3!2!
Illustration 37:
In how many ways the letters of the word "𝐴𝑒𝑟𝑜𝑝𝑙𝑎𝑛𝑒" can be arranged without altering the relative
positions of vowels & consonants?
(A) 620 (B) 720 (C) 820 (D) 920
Ans. (B)
Solution:
The consonants in their positions can be arranged in 4! = 24 ways.
5!
The vowels in their positions can be arranged in = 30 ways
2!2!
⇒ Total number of arrangements = 24 × 30 = 720

Total Number of Combinations:

(a) Given n different objects, the number of ways of selecting atleast one of them is,
n
C1 +n C2 +n C3 + ..... +n Cn = 2n − 1 . This can also be stated as the total number of combinations of 𝑛
distinct things.
(b) (i) Total number of ways in which it is possible to make a selection by taking some or all out of
𝑝 + 𝑞 + 𝑟 + ...... things, where 𝑝 are alike of one kind, 𝑞 alike of a second kind, 𝑟 alike of third kind
& so on is given by :
( p + 1)( q + 1)( r + 1) ..... − 1
(ii) The total number of ways of selecting one or more things from 𝑝 identical things of one kind,
𝑞 identical things of second kind, 𝑟 identical things of third kind and 𝑛 different things is given by :
( p + 1)( q + 1)( r + 1) .....2  − 1
n

Illustration 38:
There are 3 books of mathematics, 4 of science and 5 of english. How many different collections can be
made such that each collection consists of-
(i) one book of each subject?
(ii) at least one book of each subject?
(iii) at least one book of English?
Solution:
(i) 3 𝐶1 × 4 𝐶1 × 5 𝐶1 = 60
(ii) (23 – 1) (24 – 1) (25 – 1) = 7 × 15 × 31 = 3255
(iii) (25 – 1) (23 ) (24 ) = 31 × 128 = 3968 Ans.

Mathematics [ 19 ]
 JEE (Main + Advanced) : Mathematics
Illustration 39:
Find the number of groups that can be made from 5 red balls, 3 green balls and 4 black balls, if at least one
ball of all colours is always to be included. Given that all balls are identical except colours.
Solution:
After selecting one ball of each colour, we have to find total number of combinations that can be made from
4 red. 2 green and 3 black balls. These will be (4 + 1)(2 + 1)(3 + 1) = 60

Divisors:
Let 𝑁 = 𝑝𝑎 . 𝑞 𝑏 . 𝑟 𝑐 ....... where 𝑝, 𝑞, 𝑟........ are distinct primes & 𝑎, 𝑏, 𝑐....... are natural numbers then :
(a) The total numbers of positive divisors of 𝑁 including 1 & 𝑁 is = (𝑎 + 1) (𝑏 + 1) (𝑐 + 1).......
(b) The sum of these divisors is
= (𝑝0 + 𝑝1 + 𝑝2 + . . . . + 𝑝𝑎 ) (𝑞0 + 𝑞1 + 𝑞 2 + . . . . + 𝑞 𝑏 ) (𝑟 0 + 𝑟1 + 𝑟 2 + . . . . +𝑟 𝑐 ). ..
(c) Number of ways in which 𝑁 can be resolved as a product of two positive factor is =
1
( a + 1) (b + 1) (c + 1)...... if N is not a perfect square
2
1
2
(a + 1) (b + 1) (c + 1)...... + 1 if N is a perfect square
(d) Number of ways in which a composite number 𝑁 can be resolved into two factors which are relatively
prime (or coprime) to each other is equal to 2𝑛−1 where n is the number of different prime factors in 𝑁.
Note :
(i) Every natural number except 1 has atleast 2 divisors. If it has exactly two divisors then it is called a
prime. System of prime numbers begin with 2. All primes except 2 are odd.
(ii) A number having more than 2 divisors is called composite. 2 is the only even number which is not
composite.
(iii) Two natural numbers are said to be relatively prime or coprime if their 𝐻𝐶𝐹 is one. For two natural
numbers to be relatively prime, it is not necessary that one or both should be prime. It is possible that
they both are composite but still coprime, eg. 4 and 25.
(iv) 1 is neither prime nor composite however it is co-prime with every other natural number.
(v) Two prime numbers are said to be twin prime numbers if their non-negative difference is 2
(e.g. 5 & 7, 19 & 17 etc).
(vi) All positive divisors except the number itself are called proper divisors.
Illustration 40:
Find the number of proper divisors of the number 38808. Also find the sum of these divisors.
Solution:
(i) The number 38808 = 23 . 32 . 72 . 11
Hence the total number of divisors (excluding itself i.e. 38808)
= (3 + 1)(2 + 1)(2 + 1)(1 + 1)– 1 = 71
(ii) The sum of these divisors
=(20 + 21 + 22 + 23 )(30 + 31 + 32 )(70 + 71 + 72 )(110 + 111 )– 38808
= (15)(13)(57)(12)– 38808 = 133380 – 38808 = 94572.

[ 20 ] Mathematics
Permutations and Combinations
Permutation & Combination of Things which are NOT all Different
Combination of Things which are not all Different :
(i) Number of ways of selection of ′𝑟′ identical things out of ′𝑛′ identical things = 1
(ii) Number of ways of selecting zero or more things out of ′𝑛′ identical things = 𝑛 + 1
Proof :
Selecting none thing = 1 way
Selecting 1 thing = 1 way
Selecting 2 things = 1 way
:
:
Selecting 𝑛 things = 1 way
Total number of ways = 1 + 1 + 1 . . . . . . (𝑛 + 1) times = 𝑛 + 1
(iii) Number of ways of selection of one or more things out of which,
′𝑝′ are alike of one kind,
′𝑞′ are alike of second kind,
′𝑟′ alike of third kind and
remaining ′𝑠′ are different is = (𝑝 + 1)(𝑞 + 1)(𝑟 + 1)2𝑆 – 1
Proof :
Selecting none thing (out of 𝑝 alike things) = 1 way
Selecting 1 thing (out of p alike things) = 1 way
Selecting 2 things (out of p alike things) = 1 way
:
:
Selecting 𝑝 things (out of 𝑝 alike things) = 1 way
Total number of ways = 1 + 1 + 1 . . . . . . . . . (𝑝 + 1) times = 𝑝 + 1
Similarly for 𝑞 alike, total ways = 𝑞 + 1
Similarly for 𝑟 alike, total ways = 𝑟 + 1
For s different things total ways of selection will be 2𝑆 , i.e. any item is selected or not.
So total number of required ways = (𝑝 + 1)(𝑞 + 1)(𝑟 + 1)2𝑆 – 1
(1 is subtracted when no item is selected)
(iv) Number of ways of selection of atleast one thing of each kind in point (iii) is = 𝑝. 𝑞. 𝑟 … = (2𝑠 − 1)
Illustration 41:
Find the number of ways in which one or more letter be selected from the letters "𝐴𝐴𝐴𝐴𝐵𝐵𝐶𝐶𝐶𝐷𝐸𝐹"
Solution:
Total number of ways = (4 + 1)(2 + 1)(3 + 1)23 – 1 = 479
𝐴 𝐵 𝐶 𝐷𝐸𝐹
Illustration 42:
How many total no. of ways of selections of letter can be possible from the word 𝑀𝐼𝑆𝑆𝐼𝑆𝑆𝐼𝑃𝑃𝐼.
OR
How many ways of selection of atleast one letter of word 𝑀𝐼𝑆𝑆𝐼𝑆𝑆𝐼𝑃𝑃𝐼.
Solution:
𝑀𝐼𝑆𝑆𝐼𝑆𝑆𝑃𝑃𝐼
𝑀1 , 𝐼 4 , 𝑆 4 , 𝑃2
   
(1 + 1)(4 + 1)(4 + 1)(2 + 1) − 1 = 2 ⋅ 5 ⋅ 5 ⋅ 3 − 1 = 149

Mathematics [ 21 ]
 JEE (Main + Advanced) : Mathematics
Illustration 43:
It is given that 4 Apples, 3 Mangoes, 2 Bananas, 2 Oranges, consider the following cases.
Case-I : Fruits of same species are alike and rests are different ,then
(i) Find the number of ways if atleast one fruit is selected.
(ii) Find the number of ways if atleast one fruit of each kind are selected.
(iii) Find the number of ways if atleast two apples & two mangoes are selected.
Case-II: Fruits of same species are different and rests are also different, then
(i) Find the number of ways, atleast one fruit is selected.
(ii) Find the number of ways, atleast one fruit of each kind is selected.
Solution:
Case-I :
(i) Apples can be selected in (4 + 1) ways
Total number of ways = (4 + 1)(3 + 1)(2 + 1)(2 + 1)– 1 = 179
(ii) Since we need atleast one fruit of each kind, Apples can be selected in 4 ways.
So total number of ways = 4 × 3 × 2 × 2 = 48
(iii) Since we need atleast two apples & two mangoes which can be selected in one way.
So total number of ways = (2 + 1)(1 + 1)(2 + 1)(2 + 1) = 54
Case-II :
(i) Since fruits of same kind are different.
Apples can be selected in 24 ways
Total number of ways = 24 × 23 × 22 × 22 – 1 = 2047
(ii) Since we need atleast one fruit of each kind, Apples can be selected in 24 – 1 ways.
So total number of ways = (24 – 1) × (23 – 1) × (22 – 1) × (22 – 1)

Formation of Groups
Number of ways in which (𝑚 + 𝑛) different things can be divided into two groups containing 𝑚 & 𝑛 things
( m + n )!
(i) If 𝑚 ≠ 𝑛, then number of ways is
m! n!
Explanation:
To find the number of ways in which (𝑚 + 𝑛) different things can be divided into two unequal groups, it
is equivalent to select ′𝑚′ persons. Since for each selection of ‘𝑚′ persons there will be a corresponding
rejection of 𝑛 persons hence each selection of 𝑚 and 𝑎 corresponding rejection of 𝑛 people will give a group.

( m + n )!
 Number of groups = 𝑚+𝑛
𝐶𝑚 =
m! n!

Note : If these groups are to be distributed among two persons or groups are to be named, then number
( m + n )!
of ways is =  2!
m! n!
(2n )!
(ii) If 𝑚 = 𝑛, then number of ways is
n ! n ! 2!

[ 22 ] Mathematics
Permutations and Combinations
Explanation:
Consider 4 different toys 𝑇1 𝑇2 𝑇3 𝑇4
When 𝑇1 𝑇2 is selected and 𝑇3 𝑇4 is rejected  one way of forming the group.
4!
When 𝑇3 𝑇4 is selected and 𝑇1 𝑇2 is rejected is not a different group hence gives double answer.
2! 2!
4!
Therefore, the correct answer is .
2! 2! 2!
Hence the number of ways in which 2𝑛 different things can be divided into two equal groups
2n
Cn 2n !
= = …(i)
2! n ! n ! 2!

Note : If these groups are to be distributed among two persons or groups are to be named, then number
2n !
of ways is =  2!
n ! n ! 2!
Proof : Divide 𝑃1 , 𝑃2 , 𝑃3 , 𝑃4 in two groups
Team - A Team - B
P1P2 P3P4
P1P3 P2P4
P1P4 P2P3
P2P3 P1P4
P2P4 P1P3
P3P4 P1P2

We see that half of the case are repeated.

4!
Thus gives us wrong answer.
2! 2!
4!
Correct answer =
(2!) (2!) (2!)
Actually, counting all such cases we observe that regrouping appears when equal size groups are
required. To avoid false counting we divided by factorial of number of equal size groups.

2. Similarly (𝑚 + 𝑛 + 𝑝) different things can be divided into 3 unequal groups of 𝑚, 𝑛 and 𝑝 things is
( m + n + p )!
m! n! p!
(3n )!
(i) If the groups are all equal then the number of ways =
( n !)3 3!

Mathematics [ 23 ]
 JEE (Main + Advanced) : Mathematics
(ii) If these groups are to be distributed among 3 persons or group are to be named, then number of
(3n )!.3!
ways =
( n !)3 3!
Proofs and Explanation of Above:
To understand the article considers 10 children to be divided into three unequal groups of 2, 3 and 5.
10!
First make two groups of 2 and 8 and this can be done in way say. 𝐴𝐵/𝐶𝐷𝐸𝐹𝐺𝐻𝐼𝐽.
2! 8!
8!
Consider one such group of 8 which can be divided into two groups of 3 and 5 in ways.
3! 5!
10! 8! 10!
Hence total = . =
2! 8! 3!5! 2!3!5!
Similar explanation will be valid if initial groups in 3 and 7 and then split 7 in 2 and 5. However if 10 is
10!
divided into two groups of 5 each initially, which can be done in ways …(i)
5!5!2!
One such grouping is say
𝐴𝐵𝐶𝐷𝐸𝐹𝐺𝐻𝐼𝐽
Consider 𝐹 𝐺 𝐻 𝐼 𝐽 keeping 𝐴 𝐵 𝐶 𝐷 𝐸 as it is. Now the group 𝐹 𝐺 𝐻 𝐼 𝐽 can be divided into two groups of 2
5!
and 3 in ways and similarly when 𝐹 𝐺 𝐻 𝐼 𝐽 is kept as it is, 𝐴 𝐵 𝐶 𝐷 𝐸 can be divided into two groups
2!3!
5! 5!
of 2 and 3 in ways. Hence one group (each of 5) given by (i) generated 2. different groups of 2, 3, 5.
2!3! 2!3!
10! 2.5! 10!
 Total number of groups = . =
5!5!2! 2!3! 2!3!5!
Similarly if 𝑚 = 𝑛 = 𝑝 situation becomes different.
Consider 𝑇1 𝑇2 𝑇3 𝑇4 𝑇5 𝑇6 to be divided into 3 equal groups.
6!
When we say 6 𝐶2 . 4 𝐶2 = is totally wrong why?
2!2!2!
Selected in 6C2 Selected in 4C2 Rejected in 4C2
(A)
T1T2 T3T4 T5T6
T1T2 T5T6 T3T4
T3T4 T1T2 T5T6
T3T4 T5T6 T1T2
T5T6 T1T2 T3T4
T5T6 T3T4 T1T2
R S G
Note the all these six groups are counted in (𝐴), however they are identical. Hence the answer in (𝐴) is as
many numbers of times more as many numbers of times these equal groups can be arranged i.e. 3! times.
6!
Hence the correct number of groups is equal to .
2!2!2!3!
6!×3!
In case these 6 toys are to be distributed between 𝑅/𝑆/𝐺 then our answer will be = .
2!2!2!3!

[ 24 ] Mathematics
Permutations and Combinations
Illustration 44:
In how many ways 10 children be divided into
(i) 2 groups having 4 & 6 [Link]! Bookmark not defined.
(ii) 2 groups each having equal number of children.
(iii) 3 groups, if groups having 2, 3, & 5 children. Error! Bookmark not defined.
(iv) 3 groups, if groups having 4, 4 & 2 children.
(v) 5 groups 𝐴, 𝐵, 𝐶, 𝐷, 𝐸 having equal number of children.
Solution:

10
(i) 
6· 4

10
(ii) 
5· 5× 2

10
(iii) 
2· 3· 5

10
(iv) 
4· 4· 2× 2

 10  10
(v)    × 5=
 2 · 2 · 2 · 2 · 2 × 5 ( 2)
5

Illustration 45:
Find number of ways by which 30 Jawan's can be divided into three groups of 12, 10, & 8 and send to three
different boarder's.
Solution:
(30!)×3!
Total ways =
(8!)(10!)(12!)
In above case if group are equal size (i.e., group of 10 each)
Send to three boarder's

(30!)×(3!)
=
(10!)3 (3)!

Three equal size groups

Mathematics [ 25 ]
 JEE (Main + Advanced) : Mathematics
Illustration 46:
Find number of ways by which five different objects given to three students.
Solution:
Two cases possible {1, 1, 3} {1, 2, 2}
 5! 5! 
 2
+ 2  3!
 (1!) 3!×2! 1!(2!) ×2! 
Illustration 47:
Number of ways in which 8 persons can be seated in three diff. taxies each having 3 seats for passengers
and duly numbered if
(a) If internal arrangement of persons inside the taxi is immaterial.
(b) If internal arrangement also matters
Solution:

 8! 1
(a)  2!3!3! × 2!  3!
 

 8! 1 
(b) Using grouping  ×  3! 3! 3! 3! = 9!
 2! 3! 3! 2!  
or arrange 8 people in 9 seat 9 𝐶8 × 8! = 9!
Illustration 48:
Find the number of ways of dividing 52 cards among 4 players equally such that each gets exactly one Ace.
48! 47! 46! 44!
(A) 4 × 4! (B) 4 × 5! (C) 4 × 8! (D) × 5!
(12!) (13!) (14!) (15!)4
Ans. (A)
Solution:
48!
Total number of ways of dividing 48 cards (Excluding 4 Aces) in 4 groups = 4
(12!) 4!
48!
Now, distribute exactly one Ace to each group of 12 cards. Total number of ways = 4 × 4!
(12!) 4!
48! 48!
Now, distribute these groups of cards among four players = 4 × 4! 4! = 4 × 4!
(12!) 4! (12!)

Principle of Inclusion and Exclusion

In the Venn's diagram (i), we get

𝑛(𝐴 ∪ 𝐵) = 𝑛(𝐴) + 𝑛(𝐵)– 𝑛(𝐴 ∩ 𝐵)

In the Venn's diagram (ii), we get

[ 26 ] Mathematics
Permutations and Combinations

𝑛(𝐴 ∪ 𝐵 ∪ 𝐶)
= 𝑛(𝐴) + 𝑛(𝐵) + 𝑛(𝐶)– 𝑛(𝐴 ∩ 𝐵) – 𝑛(𝐵 ∩ 𝐶) – 𝑛(𝐴 ∩ 𝐶) + 𝑛(𝐴 ∩ 𝐵 ∩ 𝐶)
Illustration 49:
How many words can be formed using all the letters of the word 𝐻𝑂𝑁𝑂𝐿𝑈𝐿𝑈 if no two alike letters are
together.
Solution:
Let 𝐴 represents ways when 𝑂𝑂 together, 𝐵 when 𝐿𝐿 together, 𝐶 when 𝑈𝑈 together.
Required ways = Total ways – [When all three alike letters together + when 2 alike letters together
+ when one alike letter together]
= Total ways – [𝑛(𝐸3 ) + 𝑛(𝐸2 ) + 𝑛(𝐸1 )] …(i)
8!
Total ways = = 5040
(2!) (2!)(2!)
(a) 𝑛(𝐸3 ) = 𝐴 ∩ 𝐵 ∩ 𝐶 (Region 7)
i.e., H N OO LL UU
𝑛(𝐸3 ) = 5! = 120
(b) 𝑛(𝐸2 ) = 3 [(𝐴 ∩ 𝐵)– (𝐴 ∩ 𝐵 ∩ 𝐶)] or [Region 4 + 5 + 6]
𝑛(𝐸3 )

 6! 
= 3  − 5!  = 720
 2! 

i.e., H OO N LL UU
(c) 𝑛(𝐸1 ) = 3 [𝐴– {(𝐴 ∩ 𝐵) + (𝐴 ∩ 𝐶)} + (𝐴 ∩ 𝐵 ∩ 𝐶)]
 7!  6!  
=  −   2  + 5! = 1980
 (2!)(2!)  2!  
Put in 1 𝑠𝑡

Required ways = 5040– [120 + 720 + 1980] = 2220 Ans.

Mathematics [ 27 ]
 JEE (Main + Advanced) : Mathematics
Alternate solution
No. of words = Total words – [At least on pair exist]
= 5040– 𝑛(𝐴 ∪ 𝐵 ∪ 𝐶)
𝑛(𝐴 ∪ 𝐵 ∪ 𝐶) = 𝑛(𝐴) + 𝑛(𝐵) + 𝑛(𝐶) − 𝑛(𝐴 ∩ 𝐵) − 𝑛(𝐵 ∩ 𝐶) − 𝑛(𝐶 ∩ 𝐴) + 𝑛(𝐴 ∩ 𝐵 ∩ 𝐶)
 7 7 7 6 6 6
  + +  − − − + 5 = (5040) – (2820) = 2220
2 2 2 2 2 2 2 2 2
Illustration 50:
In How many ways two Americans, two Britishers, two Chinese and one person each of France, Germany,
Egypt and Dutch can be sitted if persons of same nationality are to be separated.
Solution:
Number of ways = Total arrangements – [when atleast 1 pair exist together]
= 10! – 𝑛(𝐴 ∪ 𝐵 ∪ 𝐶)
 n( A) + n( B ) + n(C )– n( A  B )– 
= 10–  
 n( B  C )– n(C  A) + n( A  B  C )

( )
= 10 − ( 9  2)  3 − (( 8  2  2)  3 + 7  2  2  2 
 
= 3628800 – [2177280 – 483840 + 40320]
= 3628800 – [1733760] = 1895040

Circular Permutation
Permutation of objects in a row is called as linear permutation. If we arrange the objects along a closed
curve it is called as circular permutation.
Thus in, circular permutation, we consider one object fixed and the remaining objects are arranged as in
the case of a linear arrangements.
Case-I : When object are different:
Theorm-1: The number of circular permutation of 𝑛 distinct objects is (𝑛 − 1)!
Proof : Consider 5 objects 𝐴, 𝐵, 𝐶, 𝐷, 𝐸 to be arranged around a closed curve is called circular permutation.

All are same

Let the total number of circular permutation be 𝑥. Above circular permutation is equivalent to 5 linear
permutations given by 𝐴𝐵𝐶𝐷𝐸𝐹, 𝐸𝐴𝐵𝐶𝐷, 𝐷𝐸𝐴𝐵𝐶, 𝐶𝐷𝐸𝐴𝐵, 𝐵𝐶𝐷𝐸𝐴 that is one circular permutation is
equivalent to 5𝑥 linear permutation given by
𝑥 .5 = 5 !
5! 5.(5 − 1)!
𝑥= = = (5 − 1)!
5 5
Similarly for 𝑛 objects 𝑛𝑥 = 𝑛!
n!
x= = ( n − 1)!
n
(i) 𝑛 distinct things taken all at a time and arranged along circle in (𝑛 – 1)! ways
(ii) Taken 𝑟 things out of 𝑛 distinct things at a time and arranged along circle in 𝑛 𝐶𝑟 . (𝑟– 1)! ways.
Note : In the above theorem anti-clockwise and clockwise order of arrangements are considered as
distinct permutations.

[ 28 ] Mathematics
Permutations and Combinations
Illustration 51:
Find the number of ways in which 10 children can sit in a mary go round relative to one another.
Solution:
Here clockwise and anticlockwise arrangements are different.
Thus required ways = (10 − 1)! = 9!
Theorm-2 : If anticlockwise and clockwise are considered to be same total number of circular permutation
( n − 1)!
given by .
2
If we arrange flowers or garland beads in a necklace then there is no distinction between clockwise
& anticlockwise direction.
Turn over
Flip to right

=
Clock wise Counter clockwise Both same

Note : If we have 𝑛 different things taken 𝑟 at a time in form of a garland or necklace.

n
Cr .( r − 1)!
Required number of arrangements =
2
Illustration 52:
In how many ways garlands can be formed out of 10 different flowers, if each garland consist of :
(i) 10 flowers(ii) 6 flowers
Solution:
(i) Here clockwise and anticlockwise permutations are same
(10 − 1)! 9!
Hence total ways = =
2 2
(6 − 1)! 10 5!
(ii) Hence total ways = 10 C6  = C6 
2 2
Important note :
The distinction between clockwise and anticlockwise is ignored when a number of people have to be seated
around a table so as not to have the same neighbours.
Illustration 53:
Find the number of ways in which 9 people can be seated on a round table so that all shall not have the
same neighbours in any 2 arrangements.
Solution:
For same neighbour, clockwise and anticlockwise arrangements are same.
So total number of ways will be arrangement of 9 people taken clockwise and anticlockwise same and
8!
equal to .
2

Mathematics [ 29 ]
 JEE (Main + Advanced) : Mathematics
Distribution of Alike Objects
TYPE-1: Total number of ways in which ′𝑛′ identical coins can be distributed among ′𝑟′ persons so that
( n + r − 1)!
each person may get any number of coin is 𝑛+𝑟–1
𝐶𝑟–1 =
( r − 1)! ( n )!
Proof: Let 6 identical coins can be distributed among 3 persons 𝑅|𝑆|𝐺

(Separators)

Out of eight places if we8 select any two, then 3

partitions are formed by 𝐶2 ways

Illustration 54:
In how many ways 10 identical coins can be distributed among four persons (beggars) if each beggar can get?
(i) any number of coins.
(ii) at least one coin.
Solution:
𝑛 = 10
𝑟=4
(i) Number of ways = 𝑛+𝑟–1
𝐶𝑟–1
= 10+4–1
𝐶4–1
= 13
𝐶3 = 286
B1 B2 B3 B4
(ii)
1 1 1 1
Give one coin to each beggars
 Remaining coins = 10 − 4 = 6
𝑛 =6&𝑟 =4
 Number of ways = 6+4–1
𝐶4–1 = 9 𝐶3
Illustration 55:
Number of ways in which 5 identical balls can be kept into 3 different boxes so that no box remains empty
will be
(A) 1 (B) 3 (C) 6 (D) 15
Ans. (C)
Solution:
Keep one ball to each box
 Remaining balls = 5 – 3 = 2
4.3
The required number of ways = 𝑛+𝑟–1
𝐶𝑟–1 = 2+3–1
𝐶3–1 = 4
𝐶2 = =6
2

[ 30 ] Mathematics
Permutations and Combinations
Problems Based on Integral Solutions
Type-2 : Number of non-negative integral solutions of an equation 𝑥1 + 𝑥2 + 𝑥3 . . . . . . . + 𝑥𝑟 = 𝑛 is
= 𝑛+𝑟–1 𝐶𝑟–1
Illustration 56:
For an equation 𝑥 + 𝑦 + 𝑧 = 20, then find
(i) No. of non – 𝑣𝑒 integral solution.
(ii) No. of integral solution if 𝑥 > – 1, 𝑦 ≥ 0, 𝑧 > 3
(iii) No. of non – 𝑣𝑒 even integral solution.
(iv) No. of non – 𝑣𝑒 odd integral solution.
𝑥 + 𝑦 + 𝑧 = 20
Solution:
(i) 𝑥 ≥ 0𝑦 ≥ 0𝑧  0
𝑛 = 20𝑟 = 3
 Number of solutions = 𝑛+𝑟–1
𝐶𝑟–1 = 22
𝐶2
(ii) 𝑥 + 𝑦 + 𝑧 = 20
𝑥 > –1 𝑦 ≥ 0 𝑧 > 3
𝑥 ≥ 0𝑦 ≥ 0 𝑧 ≥ 4
𝑁 = 20– 4 = 16
 Number of solutions = 𝑛+𝑟–1 𝐶𝑟–1 = 16+3–1
𝐶3–1 = 18
𝐶2
(iii) 𝑥 + 𝑦 + 𝑧 = 20
𝑥 = 2𝑝 ; 𝑝 = 0,1,2. . . . . . . ; 𝑝 ≥ 0
𝑦 = 2𝑞 ; 𝑞 = 0,1,2. . . . . . . ; 𝑞 ≥ 0
𝑧 = 2𝑟 ; 𝑟 = 0,1,2. . . . . . . ; 𝑟 ≥ 0
𝑥 + 𝑦 + 𝑧 = 2𝑝 + 2𝑞 + 2𝑟
20 = 2(𝑝 + 𝑞 + 𝑟)
𝑝 + 𝑞 + 𝑟 = 10
 Number of solutions = 𝑛+𝑟–1 𝐶𝑟–1 = 10+3–1
𝐶3–1 = 12
𝐶2
(iv) 𝑥 + 𝑦 + 𝑧 = 20
Not possible
Illustration 57:
𝑥 + 𝑦 + 𝑧 = 21 ; Non negative odd.
Solution:
𝑥 + 𝑦 + 𝑧 = 21
𝑥 = 2𝑝 + 1 ; 𝑝 ≥ 0
𝑦 = 2𝑞 + 1 ; 𝑞 ≥ 0
𝑧 = 2𝑟 + 1 ; 𝑟 ≥ 0
𝑥 + 𝑦 + 𝑧 = 2𝑝 + 2𝑞 + 2𝑟 + 3
21 = 2(𝑝 + 𝑞 + 𝑟) + 3
𝑝+𝑞+𝑟 = 9
𝑛 = 9𝑟 = 3
 Number of solutions = 𝑛+𝑟–1
𝐶𝑟–1 = 11
𝐶2

Mathematics [ 31 ]
 JEE (Main + Advanced) : Mathematics
Some More Combinatorial Problems
Illustration 58:
Number of ways in which 8 people can be arranged in a line if 𝐴 and 𝐵 must be next each other and 𝐶 must
be somewhere behind 𝐷, is equal to
(A) 10080 (B) 5040 (C) 5050 (D) 10100
Ans. (B)
Solution:
𝐴𝐵𝐶 𝐷𝐸 𝐹 𝐺 𝐻
7 2
= 5040
2
𝐴 & 𝐵 are tied with string
So there are total 7 units.
Which can be arranged by 7× 2 ways

(A & B can beinterchanged)
Now 𝐶 is somewhere being 𝐷
 We divide it by 2
Hence option (B) is correct.
Illustration 59:
Number of ways in which ′𝑚′ different toys can be distributed in ′𝑛′ children if every child may receive any
number of toys, is
(A) 𝑛𝑚 (B) 𝑚 𝐶𝑛 (C) 𝑛 𝐶𝑚 (D) 𝑚𝑛
Ans. (A)
Solution:
Number of ways in which ′𝑚′ different toys can be distributed in ′𝑛′ children if every child may receive any
number of toys = 𝑛𝑚 .
Illustration 60:
Six married couple are sitting in a room. Find the number of ways in which 4 people can be selected so that
they do not form a couple.
(A) 240 (B) 280 (C) 255 (D) 480
Ans. (A)
Solution:
6
𝐶4 . 2 𝐶1 . 2 𝐶1 . 2 𝐶1 . 2 𝐶1 = 240
Illustration 61:
Number of 5 digit numbers divisible by 25 that can be formed using only the digits 1, 2, 3, 4, 5 & 0 taken
five at a time is
(A) 2 (B) 32 (C) 42 (D) 52
Ans. (C)
Solution:
If the number is divisible by 25 and digit used to form the number are 1, 2, 3, 4, 5, 0 the can last 2 digit can
be 25 or 50.

[ 32 ] Mathematics
Permutations and Combinations
Case-I Case-II
2 5 5 0

3 3 2 4 3 2
(1, 3, 4) (1, 2, 3, 4)

=3×3×2= 4×3×2
= 18 = 24
Total No. = 18 + 24 = 42
Station Problems
Illustration 62:
There are 𝑛 intermediate stations on a railway line from one terminus to another. In how many ways can
the train stop at 3 of these intermediate stations if
(a) all the three stations are consecutive
(b) at least two of the stations are consecutive
(c) no two of these stations are consecutive.
Solution:
(a) The number of triples of consecutive stations, viz.
𝑆1 𝑆2 𝑆3 , 𝑆2 𝑆3 𝑆4 , 𝑆3 𝑆4 𝑆5 , . . . . . . . . 𝑆𝑛–2 𝑆𝑛–1 𝑆𝑛
(b) The total number of consecutive pair of stations, viz.
𝑆1 𝑆2 , 𝑆2 𝑆3 . . . . . . . . . 𝑆𝑛–1 𝑆𝑛
is (𝑛 – 1).
Each of the above pair can be associated with a third station in (𝑛– 2) ways. Thus, choosing a pair of stations
and any third station can be done in (𝑛– 1) (𝑛– 2) ways. The above count also includes the case of three
consecutive stations. However, we can see that each such case has counted twice. For example, the pair
𝑆4 𝑆5 combined with 𝑆6 and the pair 𝑆5 𝑆6 combined with 𝑆4 are identical.
Hence, subtracting the excess counting, the number of ways which three stations can be chosen so that at
least two of them are consecutive
n( n − 1)( n − 2)
= (𝑛– 1) (𝑛– 2)– (𝑛– 2) = (𝑛– 2)2 .
1.2.3
(c) Without restriction, the train can stop at any three stations in 𝑛 𝐶3 ways.
Hence, the number of ways the train can stop so that no two stations are consecutive
= 𝑛 𝐶3 – (𝑛– 2)2 = – (𝑛– 2)2
 n2 − n − 6n + 12  ( n − 2)( n − 3)( n − 4) n −2
= (𝑛 – 2)  = = C3
 6  6

Summation of Numbers
Illustration 63:
Find sum of all the numbers greater then 10000 formed by the digits 1,3,5,7,9 if no digit being repeated.
Solution:
All possible numbers = 5! = 120
If one occupies the units place then total numbers = 24.

Mathematics [ 33 ]
 JEE (Main + Advanced) : Mathematics

Hence 1 enjoys units place 24 times 1

|||ly 1 enjoys each place 24 times
Sum due to 1 = 1 × 24 (1 + 10 + 102 + 103 + 104 )
|||ly Sum due to the
digit 3 = 3 × 24 (1 + 10 + 102 + 103 + 104 )
: : : : : : :
Required total sum = 24 (1 + 10 + 10 + 103 + 104 ) (1 + 3 + 5 + 7 + 9)
2

Illustration 64:
Find sum of all the numbers greater than 10000 formed by the digit 0, 1, 2, 4, 5 no digit being repeated.
Solution:
Using all the given digits we can form a five digit number except when zero is at first place.
So to find the sum of all the possible five digit number
= (Sum of all possible arrangement) – (Sum of all the arrangements when zero is at first place)
5!
 5 different digits can be arranged in 5! ways so each digit will appear at every place = times
5
i.e. 24 times
Sum of all digits at unit place = 24(0 + 1 + 2 + 4 + 5)
Sum of all digits at ten's place = 24(0 + 1 + 2 + 4 + 5)
........................................................................
Sum of all digits at 10000𝑡ℎ place = 24(0 + 1 + 2 + 4 + 5)
In this way sum of all possible arrangement = 24(0 + 1 + 2 + 4 + 5) [1 + 10 + 102 + 103 + 104 ]
when zero is at first place 4 digit number will be formed.
Each number will appear 6 times at every place.
Sum of all 4 digit number at unit place = 6 (1 + 2 + 4 + 5)
Sum of all 4 digit number at ten's place= 6 (1 + 2 + 4 + 5)
........................................................................
Hence sum of all four digit numbers = 6 (1 + 2 + 4 + 5) (1 + 10 + 102 + 103 )
Required sum = 24[0 + 1 + 2 + 3 + 4 + 5] [1 + 10 + 102 + 103 + 104 ]
– 6(1 + 2 + 4 + 5) (1 + 10 + 102 + 103 )
Illustration 65:
Find the sum of the five digit numbers that can be formed using the digits 3, 4, 5, 6, 7 not using any digit
more than once in any number.
Ans. (6666600)
Solution:
If 3 is placed at units place, the remaining 4 places can be filled in 4! = 24 ways
Thus, 3 occurs at unit place 24 times.
The other digits similarly, each occurs at the unit places 24 times.
Similarly, each of the digit occurs at the other places tens, hundreds and so on, 24 times.
Hence, the required sum, is
= 24 (3 + 4 + 5 + 6 + 7) (100 + 101 + 102 + 103 + 104 )
= 24 × 25 × 11111
= 6666600

[ 34 ] Mathematics
Permutations and Combinations
Grid Problem:
Illustration 66:
Complete cartesian plane is partitioned by drawing line | | to 𝑥 and 𝑦 −axis equidistant apart like the lines
on a chess board, then the number of ways in which an ant can reach from (1, 1) to (4, 5) via shortest path.
Solution:
What ever may be the mode of travel of the ant; it has to traverse 3𝐻 (Horizontal) and 4𝑉 (Vertical) paths.
7! 7
Hence required number of ways = = C3
4! 3!

(4,5)

(1,1)

Note: If there are 𝑛 vertical and 𝑚 horizontal lines then there will be (𝑛– 1) horizontal and (𝑚– 1) vertical
paths
Illustration 67:

6
𝐵 (4,5)
5
4
(3,3)
3
𝐶
2

(1,1) 𝐴
2 3 4 5 6

Number of ways in which an insect can reach from (1, 1) to (4, 5) via 𝐶 but having shortest path.
Solution:
(𝐴 𝑡𝑜 𝐶) and (𝐶 𝑡𝑜 𝐵)
(1, 1) – (3, 3) and (3, 3) – (4, 5)
(𝑋 3 – 1 , 𝑌 3 – 1 ) and (𝑋 4 – 3 , 𝑌 5 – 3 )
(𝑋 2 , 𝑌 2 ) and (𝑋1 , 𝑌 2 )
Number of ways = 4 𝐶2 × 3 𝐶1 = 6 × 3 = 18

Mathematics [ 35 ]
 JEE (Main + Advanced) : Mathematics
Problems Based on Sets and Subsets
Illustration 68:
Set 𝐴 contains 4 different elements and 𝐵  𝐴. In how many ways set 𝐵 can be formed?
Solution:
Let 𝑎  𝐴 then
𝑎𝐵 ...(i)
𝑎𝐵 …(ii)
for each element of 𝐴 we have 2 options for that element to be present or absent from 𝐵.
So total cases = 2 × 2 × 2 × 2 = 24
𝐵 can be formal in 24 ways.
Illustration 69:
Set 𝐴 = {1, 2, 3, 4, 5, 6} and 𝐵  𝐴 & 𝐶  𝐴. In how many ways sets 𝐵 & 𝐶 can be formed such that
𝐵𝐶=
(A) 35 (B) 36 (C) 26 (D) 35 − 1
Ans. (B)
Solution:
Let 𝑎  𝐴 then total 4 cases are possible
𝑎  𝐵, 𝑎  𝐶 ...(i)
𝑎  𝐵, 𝑎  𝐶 …(ii)
𝑎  𝐵, 𝑎  𝐶 …(iii)
𝑎  𝐵, 𝑎  𝐶 …(iv)
we require 𝐵  𝐶 = 
thus, for a, equation (ii) (iii) and (iv)
can satisfy 𝐵  𝐶 = 
therefore 𝐵  𝐶 =  ℎ𝑎𝑠 3 options
thus, No. of equation possible for 6 elements = 36
Illustration 70:
Set 𝐴 = {1, 2, 3, 4, 5, 6, 7, 8} and 𝐵  𝐴 & 𝐶  𝐴. In how many ways set 𝐵 & 𝐶 can be formed such that
𝐵  𝐶 = {2, 5, 7} ?
Solution:
1 B 1 C 

1  B 1  C  3 options 2 B 2C1 option
1 B 1 C  

3 B 3 C  4 B 4C 
 
3  B 3  C  3 options 4  B 4  C  3 options
3  B 3  C  4  B 4  C 
6 B 6C 

5 B 5C1 option 6  B 6  C  3 options
6  B 6  C 
8 B 8C 

7 B 7C1 option 8  B 8  C  3 options
8  B 8  C 
So total possible ways = 3 × 1 × 3 × 3 × 1 × 3 × 1 × 3 = 35

[ 36 ] Mathematics
Permutations and Combinations
Illustration 71:
Let 𝑋 = {1, 2, 3, …….., 10}. Find the number of pair {𝐴, 𝐵} such that 𝐴  𝑋, 𝐵  𝑋, 𝐴  𝐵 and
𝐴  𝐵 = {5, 7, 8}.
Solution:
Let 𝐴𝐵 = 𝑌, 𝐵\𝑎 = 𝑀, 𝐴\𝐵 = 𝑁 and 𝑥\𝑦 = 𝐿. then 𝑋 is the disjoint union of 𝑀, 𝑁, 𝐿 and 𝐴  𝐵. Now
𝐴  𝐵 = {5, 7, 8} is fixed. The remaining seven elements 1, 2, 3, 4, 6, 9, 10 can be distributed in any of the
remaining sets 𝑀, 𝑁, 𝐿. this can be done in 37 ways. Of these if all the elements are in the set 𝐿, then
𝐴 = 𝐵 = {5, 7, 8} and this case has to be omitted. Hence the total number of pairs {𝐴, 𝐵} such that 𝐴  𝑋,
𝐵  𝑋, 𝐴  𝐵 and 𝐴  𝐵 = {5, 7, 8}is 37 − 1.
Illustration 72:
Let 𝑆 = {1, 2, 3, 4, 5}. The total number of unordered pairs of disjoint subsets of 𝑆 is equal to –
(A) 121 (B) 122 (C) 123 (D) 124
Ans. (B)
Solution:
𝑆 = {1,2,3,4,5}
According to the definition of disjoint sets, if there exist two sets 𝐴 and 𝐵, 𝐴  𝐵 = .
Every element of 𝑆 can be an element of 𝐴 or 𝐵 or of neither of the subsets.
There exist 3 possibilities for each element
Since there are for 5 elements, there are 35 possibilities are present
Total number of ordered pairs of subsets = 35 + 1 = 244
Total number of unordered pairs = 244/2 = 122
Illustration 73:
𝐴 is a set containing 𝑛 elements. A subset 𝑃 of 𝐴 is chosen. The set 𝐴 is reconstructed by replacing the
elements of 𝑃. A subset 𝑄 of 𝐴 is again chosen. The number of ways of choosing 𝑃 and 𝑄 so that 𝑃  𝑄 = 
is :-
(A) 22𝑛 − 2𝑛 𝐶𝑛 (B) 2𝑛 (C) 2𝑛 − 1 (D) 3𝑛
Ans. (D)
Solution:
Let 𝐴 = {𝑎1 , 𝑎2 , 𝑎3 , … . . 𝑎𝑛 }. For 𝑎𝑖  𝐴, we have the following choices:
(i) 𝑎𝑖  𝑃 and 𝑎𝑖  𝑄 (ii) 𝑎𝑖  𝑃 and 𝑎𝑖  𝑄
(iii) 𝑎𝑖  𝑃 and 𝑎𝑖  𝑄 (iv) 𝑎𝑖  𝑃 and 𝑎𝑖  𝑄
Out of these only (ii), (iii) and (iv) imply 𝑎𝑖  𝑃  𝑄. Therefore, the number of ways in which none of
𝑎1 , 𝑎2 , ….𝑎𝑛 belong to 𝑃  𝑄 is 3𝑛 .

Derangement Theorem
Derangement means arrangement in which none can occupy its own place.
(i) If 𝑛 things are arranged in a row, the number of a ways they can be deranged so that 𝑟 things occupy
wrong places while (𝑛 – 𝑟) things occupy their original places, is
= 𝑛 𝐶𝑛−𝑟 𝐷𝑟
 1 1 1 1
where 𝐷𝑟 = r !  1 − + − + ..... + ( −1)r 
 1! 2! 3! r! 

Mathematics [ 37 ]
 JEE (Main + Advanced) : Mathematics
(ii) If 𝑛 things are arranged in a row, the number of ways they can be deranged so that none of them
occupies its original place, is
𝑛  1 1 1 1
= 𝐶0 𝐷𝑛 = n !  1 − + − + ..... + ( −1)n 
 1! 2! 3! n! 
Alter :
𝐷𝑛 = ways in which 𝑛 things are arranged so that all 𝑛 things occupy wrong places
= arranged without restriction
– ways in which 1 thing is in correct position while (𝑛 – 1) things are deranged
– ways in which 2 things are in correct position while (𝑛– 2) things are deranged
......................................
......................................
– ways in which all 𝑛 things are in correct position and there is no derangement
𝑛 𝑛 𝑛
= 𝑛! − 𝐶1 𝐷𝑛−1 − 𝐶2 𝐷𝑛−2 − ………. − 𝐶𝑛 𝐷0
n
= 𝑛! −  n Cr Dn − r
r =1

Thus, we have
𝐷0 = 0! = 1
𝐷1 = 1! − 1 𝐶1 𝐷0 = 0
𝐷2 = 2! − 2 𝐶1 𝐷1 − 2 𝐶2 𝐷0 = 1
𝐷3 = 3! − 3 𝐶1 𝐷2 − 3 𝐶2 𝐷1 − 3 𝐶3 𝐷0 = 2
𝐷4 = 4! − 4 𝐶1 𝐷3 − 4 𝐶2 𝐷2 − 4 𝐶3 𝐷1 − 4 𝐶4 𝐷0 = 9
𝐷5 = 5! − 5 𝐶1 𝐷4 − 5 𝐶2 𝐷3 − 5 𝐶3 𝐷2 − 5 𝐶4 𝐷1 − 5 𝐶5 𝐷0 = 44
and so on.
Short Trick :
Number of derangement of 𝑛-different objects =
1 1 1 1 1 1
Dn = n !  − + − + + ....... + (−1)n 
 0! 1! 2! 3! 4! n! 
1 1 1 1 1 1 
D2 = 2!  − +  = 2  − +  = 1
 0! 1! 2!  1 1 2 
1 1 1 1 1 1  3 − 1 
D3 = 3!  − + −  = 6  −  = 6  =2
 0! 1! 2! 3!  2 6   6 
1 1 1 1 1 1 1 1   12 − 4 + 1 
D4 = 4!  − + − +  = 24  − +  = 24  =9
 0! 1! 2! 3! 4!   2 6 24   24 
1 1 1 1 1 1 1 1 1 1   60 − 20 + 5 − 1 
D5 = 5!  − + − + −  = 120  − + −  = 120   = 44
 0! 1! 2! 3! 4! 5!   2 6 24 120   120
Illustration 74:
In how many ways three letters be posted in three addressed envelopes if
(i) all are at right place.
(ii) exactly two of them are at right place.
(iii) exactly one is at right place.
(iv) No one letter is at right place.

[ 38 ] Mathematics
Permutations and Combinations
Solution:
(i) All 3 are at correct place = 1 way
(ii) Zero way
(iii) 3 𝐶1 × 1 = 3 ways
(iv) Number of ways in which no one at right place is = 𝐾(let)
𝐾 = Total ways – (case (i) + (ii) + (iii))
𝐾 = 3! − (1 + 0 + 3)
𝐾 =6−4
𝐾 = 2 ways
𝐷2 = 1; 𝐷3 = 2; 𝐷4 = 9; 𝐷5 = 44
Short Trick :
Number of derangement of 𝑛 −different objects = 𝐷3 = 2
Illustration 75:
A person writes letters to five friends and addresses the corresponding envelopes. In how many ways can
the letters be placed in the envelops so that
(a) all letters are in the wrong envelopes.
(b) at least three of them are in the wrong envelopes.
Solution:
 1 1 1 1 1  5! 5! 5! 5!
(a) Required number of ways = 5!  1 − + − + −  = − + −
 1! 2! 3! 4! 5!  2! 3! 4! 5!
(b) Required number of ways
n
= 
r =1
n
Cr Dn − r where 𝑛 = 5

= 5 𝐶2 𝐷3 + 5 𝐶1 𝐷4 + 5
𝐶0 𝐷5
 1 1 1  1 1 1 1  1 1 1 1 1
= 10 × 3!  1 − + −  + 5 × 4!  1 − + − +  + 1 × 5!  1 − + − + − 
 1! 2! 3!   1! 2! 3! 4!   1! 2! 3! 4! 5! 
= 10(3 − 1) + 5(12 − 4 + 1) + (60 − 20 + 5 − 1) = 20 + 45 + 44 = 109.

Illustration 76:
A family consists of a grandfather, 𝑚 sons and daughters and 2𝑛 grand children. They are to be seated in a
row for dinner. The grand children wish to occupy the 𝑛 seats at each end and the grandfather refuses to
have a grand children on either side of him. In how many ways can the family be made to sit.
(A) (2𝑛)! 𝑚! (𝑚 − 1) (B) (2𝑛)! 𝑚! 𝑚
(C) (2𝑛)! (𝑚 – 1)! (𝑚 − 1) (D) (2𝑛 − 1)! 𝑚! (𝑚 − 1)
Ans. (A)
Solution:
First we select 𝑛 grand children from 2𝑛 grand children is 2𝑛 𝐶𝑛
Now arrangement of both group is 𝑛! × 𝑛!
Now Rest all (𝑚 + 1) place where we occupy the grandfather and 𝑚 sons but grandfather refuse the sit to
either side of grand children so the out of 𝑚– 1 seat one seat can be selected
Now required number of sitting in 2𝑛 𝐶𝑛 × 𝑛! × 𝑛! × (𝑚 –1) 𝐶1 . 𝑚!
12n
= × 𝑛! × 𝑛! × (𝑚 –1) 𝐶1 . 𝑚! = 2𝑛! . 𝑚! . (𝑚 − 1)
n ! n !

Mathematics [ 39 ]
 JEE (Main + Advanced) : Mathematics
Illustration 77:
′𝑛′ digits positive integers formed such that each digit is 1, 2 or 3. How many of these contain all three of
the digits 1, 2 and 3 atleast once?
(A) 3(𝑛 − 1) (B) 3𝑛 − 2.2𝑛 + 3 (C) 3𝑛 − 3.2𝑛 – 3 (D) 3𝑛 − 3.2𝑛 + 3
Ans. (D)
Solution:
Total 𝑛 −digit numbers using 1, 2 or 3 = 3𝑛
total 𝑛 −digit numbers using any two digits out of 1, 2 or 3= 3 𝐶2 × 2𝑛 − 6 = 3 × 2𝑛 − 6
total 𝑛 −digit numbers using only one digit of 1, 2 or 3 = 3
 the numbers containing all three of the digits
1, 2 and 3 at least once = 3𝑛 − (3 × 2𝑛 − 6) − 3 = 3𝑛 − 3 . 2𝑛 + 3
Illustration 78:
There are ′𝑛′ straight line in a plane, no two of which are parallel and no three pass through the same point.
Their points of intersection are joined. Then the maximum number of fresh lines thus introduced is
1 1
(A) 𝑛(𝑛 − 1)2 (𝑛 − 3) (B) 𝑛(𝑛 − 1) (𝑛 + 2) (𝑛 − 3)
12 8
1 1
(C) 𝑛(𝑛 − 1) (𝑛 − 2) (𝑛 − 3) (D) 𝑛(𝑛 + 1) (𝑛 + 2) (𝑛 − 3)
8 8
Ans. (C)
Solution:
If ′𝑛′ straight line intersect each other then total
n( n − 1)
number of intersection point is 𝑛 𝐶2 =
2
n( n −1)
Now, from these 𝑛 𝐶2 points we can make 2
C2
n −1
lines. (total old + new lines) and number of old lines are C2 × 𝑛
n( n −1)
n −1 1
So fresh lines are 2
C2 – C2 × 𝑛 = 𝑛(𝑛 − 1) (𝑛 − 2) (𝑛 − 3)
8

Illustration 79:
In how many ways can a pack of 52 cards be divided
(i) equally in four sets
(ii) equally among four players
Solution:
52 1  52! 1
(i) 4
 (ii)  4
   4!
(13!) 4!  (13!) 4! 
Illustration 80:
In how many ways 52 playing cards can be distributed among 4 players if each get equal no. of cards :
(i) If no condition
(ii) If each player can get 𝐴, 𝐽, 𝑄, 𝐾 of same suit.

[ 40 ] Mathematics
Permutations and Combinations
Solution:
52

13  52  52
(i) 13 13 13   4 
  13· 13· 13· 13· 4  ( 13)
4

36

9
(ii) 9 9 9 52 – 16 = 36(𝐴, 𝐽, 𝑄, 𝐾 of 4 suits)

  36  
 4   4  4 Remaining 𝐴, 𝐽, 𝑄, 𝐾 of same suits to 4 players.
  ( 9) · 4  
Illustration 81:
In how many ways can a pack of 52 cards be
(i) distributed among four players having 10, 12, 14 and 16 cards.
(ii) divided into four sets of 7, 15, 15 and 15 cards.
Solution:
52!
(i)  4!
10! 12! 14! 16!
52! 1
(ii) 3

7! (15!) 3!
Illustration 82:
𝑋 = {1, 2, 3, 4, . . . . . . 2017} and 𝐴 ⊂ 𝑋 ; 𝐵 ⊂ 𝑋 ; 𝐴 ∪ 𝐵 ⊂ 𝑋 here 𝑃 ⊂ 𝑄 denotes that 𝑃 is subset of
𝑄(𝑃 ≠ 𝑄). Then number of ways of selecting unordered pair of sets 𝐴 and 𝐵 such that 𝐴 ∪ 𝐵 ⊂ 𝑋.
(42017 − 32017 ) + (22017 − 1) (42017 − 32017 )
(A) (B)
2 2
42017 − 32017 + 22017
(C) (D) None of these
2
Ans. (A)
Solution:
Ordered pair = total – (𝐴 ∪ 𝐵 = 𝑋) = 4𝑛 – 3𝑛
Subsets of 𝑋 = 2𝑛 will not repeat in both but here the whole set 𝑋 has not been taken
So subsets of 𝑥 which are not repeated (2𝑛 – 1)
(4n − 3n ) − (2n − 1)
Hence unordered pair = +(2𝑛 − 1)
2
Illustration 83:
The number of ways in which 15 identical apples & 10 identical oranges can be distributed among three
persons, each receiving none, one or more is:
(A) 5670 (B) 7200 (C) 8976 (D) 7296
Ans. (C)

Mathematics [ 41 ]
 JEE (Main + Advanced) : Mathematics
Solution:
Using multinomial theorem
17  16 12  11
Total no. of ways = 15 + 3 – 1
𝐶15 × 10+3–1
𝐶10 = 17
𝐶15 × 12
𝐶10 =  = 8976
2 2
Illustration 84:
If 𝑛 identical dice are rolled, then number of possible outcomes are.
6n
(A) 6𝑛 (B) (C) ( n + 5) c5 (D) None of these
n!
Ans. (C)
Solution:
Let 𝑖 appears on 𝑎𝑖 dice 𝑖 = 1, 2, 3, 4, 5, 6
Do number of outcomes is equal to no. of solution of 𝑎1 + 𝑎2 + 𝑎3 + 𝑎4 + 𝑎5 + 𝑎6 = 𝑛 = ( n + 5) c5
Illustration 85:
Find the number of solutions of the equation 𝑥𝑦𝑧 = 360 when 𝑥, 𝑦, 𝑧 ∈ 𝑁
(A) 150 (B) 180 (C) 210 (D) 240
Ans. (B)
Solution:
𝑥𝑦𝑧 = 360 = 23 × 32 × 5 (𝑥, 𝑦, 𝑧 ∈ 𝑁)
𝑥 = 2𝑎1 3𝑎2 5𝑎3 (where 0  𝑎1  3, 0  𝑎2  2, 0  𝑎3  1)
𝑦 = 2𝑏1 3𝑏2 5𝑏3 (where 0  𝑏1  3, 0  𝑏2  2, 0  𝑏3  1)
𝑧 = 2𝑐1 3𝑐2 5𝑐3 (where 0  𝑐1  3, 0  𝑐2  2, 0  𝑐3  1)
 2𝑎1 3𝑎2 5𝑎3 . 2𝑏1 3𝑏2 5𝑏3 . 2𝑐1 3𝑐2 5𝑐3 = 23 × 32 × 51
 2𝑎1 +𝑏1 +𝑐1 . 3𝑎2 +𝑏2 +𝑐2 . 5𝑎3 +𝑏3 +𝑐3 = 23 × 33 × 51
 𝑎1 + 𝑏1 + 𝑐1 = 3 → 5 𝐶2 = 10
𝑎2 + 𝑏2 + 𝑐2 = 2 → 4 𝐶2 = 6
𝑎3 + 𝑏3 + 𝑐3 = 1 → 3 𝐶2 = 3
Total solutions = 10 × 6 × 3 = 180.
Illustration 86:
Find the number of solutions of the equation 𝑥𝑦𝑧 = 360 when 𝑥, 𝑦, 𝑧 ∈ 𝐼
(A) 410 (B) 520 (C) 610 (D) 720
Ans. (D)
Solution:
𝑥𝑦𝑧 = 360 = 23 × 32 × 5 (if 𝑥, 𝑦, 𝑧  𝑁)
𝑥 = 2𝑎1 3𝑎2 5𝑎3 (where 0  𝑎1  3, 0  𝑎2  2, 0  𝑎3  1)
𝑦 = 2𝑏1 3𝑏2 5𝑏3 (where 0  𝑏1  3, 0  𝑏2  2, 0  𝑏3  1)
𝑧 = 2𝑐1 3𝑐2 5𝑐3 (where 0  𝑐1  3, 0  𝑐2  2, 0  𝑐3  1)
 2𝑎1 3𝑎2 5𝑎3 . 2𝑏1 3𝑏2 5𝑏3 . 2𝑐1 3𝑐2 5𝑐3 = 23 × 32 × 51
 2𝑎1 +𝑏1 +𝑐1 . 3𝑎2 +𝑏2 +𝑐2 . 5𝑎3 +𝑏3 +𝑐3 = 23 × 33 × 51
 𝑎1 + 𝑏1 + 𝑐1 = 3 → 5 𝐶2 = 10
𝑎2 + 𝑏2 + 𝑐2 = 2 → 4 𝐶2 = 6
𝑎3 + 𝑏3 + 𝑐3 = 1 → 3 𝐶2 = 3
Total solutions = 10 × 6 × 3 = 180.
As in this question 𝑥, 𝑦, 𝑧  𝐼 then, (𝑎) all positive (𝑏) 1 positive and 2 negative.
Total number of ways = 180 + 3 𝐶2 × 180 = 720.

[ 42 ] Mathematics
Permutations and Combinations
Illustration 87:
Number of ways in which a pack of 52 playing cards be distributed equally among four players so that each
have the Ace, King, Queen and Jack of the same suit, is
36 ! . 4 ! 36 ! 52 ! . 4 ! 52 !
(A) (B) (C) (D)
( 9 !) ( 9 !) (13 !) (13 !)
4 4 4 4

Ans. (A)
Solution:
36!
Required number of ways 36
𝐶9 . 27
𝐶9 . 18
𝐶9 . 9 𝐶9 . 4 ! = × 4!
(9!)4
Illustration 88:
Find total number of positive integral solutions of 15 < 𝑥1 + 𝑥2 + 𝑥3 ≤ 20.
(A) 685 (B) 1140 (C) 455 (D) 1595
Ans. (A)
Solution:
𝑥1 + 𝑥2 + 𝑥3 = 20 – 𝑡
𝑡 = 0, 1, 2, 3, 4
4
Required value = 
t =0
19– t
C2 = 20
𝐶3 − 15
𝐶3 = 1140 − 455 = 685

Illustration 89:
Seven persons 𝑃1 , 𝑃2 , . . . . . . . . . , 𝑃7 initially seated at chairs 𝐶1 , 𝐶2 . . . . . . . . , 𝐶7 respectively. They all left their
chairs simultaneously for hand wash. Now in how many ways they can again take seats such that no one
sits on his own seat and 𝑃1 sits on 𝐶2 and 𝑃2 sits on 𝐶3 ?
(A) 52 (B) 53 (C) 54 (D) 55
Ans. (B)
Solution:
If 𝑃3 sits on 𝐶1
 1 1 1 1
4!  1– + – + 
 1! 2! 3! 4! 
= 4.3 − 4 + 1 = 9
If 𝑃3 does not sit on 𝐶1
 1 1 1 1 1
= 5!  1– + – + –  = 44
 1! 2! 3! 4! 5! 
total number of ways = 44 + 9 = 53
 P1 C1
P C → P
 2 2 1
 P3 C3 → P2

 P4 C4
P C
 5 5

 P6 C6

 P7 C7

Mathematics [ 43 ]
 JEE (Main + Advanced) : Mathematics
Illustration 90:
Given six line segments of length 2, 3, 4, 5, 6, 7 units, the number of triangles that can be formed by these
segments is
(A) 6 𝐶3 − 7 (B) 6 𝐶3 − 6 (C) 6 𝐶3 − 5 (D) 6 𝐶3 − 4
Ans. (A)
Solution:
First we select 3 length from the given 6 length so the no. of ways = 6 𝐶3
But these some pair i.e. (2, 3, 7), (2, 3, 6), (2, 3, 5) (2, 4, 6), (2, 4, 7), (2, 5, 7), (3, 4, 7) are not form a triangle
so that total no. of ways is 6 𝐶3 − 7 ways
Illustration 91:
In how many ways 𝐴, 𝐴, 𝐵, 𝐵, 𝐶, 𝐶, 𝐷, 𝐸, 𝐹, 𝐺 can be arranged around a circle. If no two identical letters are
together.
Solution:
𝐴, 𝐴, 𝐵, 𝐵, 𝐶, 𝐶, 𝐷, 𝐸, 𝐹, 𝐺 ⎯ → 10
10 − 1 𝐴
 ൬ 2⋅ 2⋅ 2 ൰ −
𝐵 𝐶

𝐴 𝐵 𝐶
𝑛(𝐴) + 𝑛(𝐵) + 𝑛(𝐶) − 𝑛(𝐴 ∩ 𝐵) − 𝑛(𝐵 ∩ 𝐶) − (𝐶 ∩ 𝐴) + 𝑛(𝐴 ∩ 𝐵 ∩ 𝐶)
 9   9 − 1   8 –1  
  2·2·2  –   3–    3 + ( 7 –1 ) 
   2 · 2   2  
  
B C C
C A A
A B B

Illustration 92:
There are 𝑚 apples and 𝑛 oranges to be placed in a line such that the two extreme fruits being both oranges.
Let 𝑃 denotes the number of arrangements if the fruits of the same species are different and 𝑄 the
corresponding figure when the fruits of the same species are alike, then the ratio 𝑃/𝑄 has the value equal
to:
(A) 𝑛 𝑃2 . 𝑚 𝑃𝑚 . (𝑛 − 2) ! (B) 𝑚 𝑃2 . 𝑛 𝑃𝑛 . (𝑛 − 2) !
(C) 𝑛 𝑃2 . 𝑛 𝑃𝑛 . (𝑚 − 2) ! (D) none
Ans. (A)
Solution:
For 𝑷 → If same species are different
Total number of arrangements is 𝑛 𝑃2 . (𝑚 + 𝑛 − 2) !
( m + n − 2)!
For 𝑸 → If same species are alike then number of arrangement is
m ! .( n − 2)!
P
Hence = 𝑛 𝑃2 . 𝑚! . (𝑛 − 2)! = 𝑛
𝑃2 . 𝑚
𝑃𝑚 . (𝑛 − 2)!
Q

[ 44 ] Mathematics
Permutations and Combinations
Illustration 93:
The number of intersection points of diagonals of 2009 sides regular polygon, which lie inside the polygon.
(A) 2009 𝐶4 (B) 2009 𝐶2 (C) 2008 𝐶4 (D) 2008 𝐶2
Ans. (A)
Solution:
We know that in odd sides polygon no two or more then two diagonals are parallel, so if we take any 4
vertices, we get one point of intersection of diagonals.
Hence required no of points will be 2009 𝐶4 .
Illustration 94:
A rectangle with sides 2𝑚 – 1 and 2𝑛 – 1 is divided into squares of unit length by drawing parallel lines as
shown in the diagram, then the number of rectangles possible with odd side lengths is
2𝑛 − 1

2
1

1 2 2𝑚 − 1
(A) (𝑚 + 𝑛– 1)2 (B) 4𝑚+𝑛–1 (C) 𝑚2 𝑛2 (D) 𝑚(𝑚 + 1)𝑛(𝑛 + 1)
Ans. (C)
Solution:
2𝑛 − 1
2𝑛 − 2

3
2
1 2𝑚 − 2
0 2𝑚 − 1
0 1 2 3 2𝑚 − 3
No. of ways of choosing horizontal side of rectangle of one unit length = 2𝑚 − 1
No. of ways of choosing horizontal side of rectangle of 3 unit length = 2𝑚 − 3
 Total no. of ways of choosing horizontal side of rectangle of odd length
= (2𝑚– 1) + (2𝑚– 3)+. . . +1 = 𝑚2
Similarly no. of ways of choosing the vertical side of rectangle of odd length = 𝑛2.
 Total no. of ways of choosing the rectangle = 𝑛2 𝑚2

Mathematics [ 45 ]