Useful for JEE MAINS and ADVANCED Exams

Each topic contains Detailed Theory with images

Every topic contains Exercises and Detailed solutions

 PERMUTATION AND COMBINATION

INTRODUCTION
The most fundamental application of mathematics is counting. There are many natural methods used for counting
This chapter is dealing with various known techniques those are much faster than the usual counting methods.
We mainly focus, our methods, on counting the number of arrangements (Permutations) and the number of
selections (combinations), even although we may use these techniques for counting in some other situations also.

FUNDAMENTAL PRINCIPLE OF COUNTING (Counting Without Actual Counting)

If an event A can occur in 'm' different ways and another event B can occur in 'n' different ways, then the total
number of different ways of-

(a) simultaneous occurrence of both events in a definite order is m× n. This can be extended to any number of events
(known as multiplication principle).
(b) happening exactly one of the events is m + n (known as addition principle).

Ex. 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.
Ex. 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.

Ex. There are 8 buses running from Kota to Jaipur and 10 buses running from Jaipur to Delhi. In how many ways
a person can travel from Kota to Delhi via Jaipur by bus?
Sol. Let E1 be the event of travelling from Kota to Jaipur & E2 be the event of travelling from Jaipur to Delhi by the
person.
E1 can happen in 8 ways and E2 can happen in 10 ways.
Since both the events E1 and E2 are to be happened in order, simultaneously,
the number of ways = 8 × 10 = 80.

Ex. 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-
Sol. 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.

PERMUTATION & COMBINATION

(a) Factorial : A Useful Notation : n! = n.(n – 1).(n – 2)..............3. 2. 1 ; n! = n. (n – 1)! where n  N

(i) 0! = 1! = 1 (ii) Factorials of negative integers are not defined.

(iii) n! is also denoted by n (iv) (2n)! = 2n.n! [1. 3. 5. 7........(2n – 1)]
(v) Prime factorisation of n! : Let p be a prime number and n be a positive integer, then exponent of p in n! is
n   n  n   n 
denoted by Ep (n!) and is given by Ep(n!) =   +  2  +  p 3  + ..... +  p k 
p
  p
     
where pk < n < pk+1 and [x] denotes the integral part of x.
If we isolate the power of each prime contained in any number n, then n can be written as
   
n = 2 1 · 3 2 · 5 3 · 7 4 .... where i are whole numbers.

1
MATHS FOR JEE MAINS & ADVANCED

(b) Permutation : Each of the arrangements in a definite order which can be made by taking some or all of the things
at a time is called a PERMUTATION. In permutation, order of appearance of things is taken into account; when the
order is changed, a different permutation is obtained.
Generally, it involves the problems of arrangements (standing in a line, seated in a row), problems on digit,
problems on letters from a word etc.
nP denotes the number of permutations of n different things, taken r at a time (n  N, r  W, r  n)
r
n!
nP = n (n – 1) (n – 2) ............. (n – r + 1) =
r (n  r)!
 nP n!, nP0= 1, nP1= n
n=
 Number of arrangements of n distinct things taken all at a time = n!

 nP denoted by A nr or P(n,r).
r is also

(c) Combination : Each of the groups or selections which can be made by taking some or all of the things without
considering the order of the things in each group is called a COMBINATION.
Generally, involves the problem of selections, choosing, distributed groups formation, committee formation,
geometrical problems etc.
nC denotes the number of combinations of n different things taken r at a time (n  N, r  W, r < n)
r
n n!
Cr 
r !(n  r)!

 n
(i) nCr is also denoted by   or C (n, r).
r 

(ii) nPr = nCr. r!

Ex. How many three digit can be formed using the digits 1, 2, 3, 4, 5, without repetition of digits? How many of
these are even ?
Sol. Three places are to be filled with 5 different objects.
 Number of ways = 5P 3 = 5 × 4 × 3 = 60
For the 2nd part, unit digit can be filled in two ways & the remaining two digits can be filled in 4P 2 ways.
 Number of even numbers = 2 × 4P 2 = 24.

Ex. Find the exponent of 6 in 50!

 50   50   50   50   50   50 
Sol. E 2 (50!)                   (where [ ] denotes integral part)
 2   4   8   16   32   64 

 50   50   50   50 
E2(50!) = 25 + 12 + 6 + 3 + 1 + 0 = 47 E3(50!) =           
 3   9   27   81 

E3(50!) = 16 + 5 + 1 + 0 = 22
 50! can be written as 50! = 247. 322.........
Therefore exponent of 6 in 50! = 22

2
 PERMUTATION AND COMBINATION

Ex. If a denotes the number of permutations of (x + 2) things taken all at a time, b the number of permutations of x things
taken 11 at a time and c the number of permutations of (x – 11) things taken all at a time such that a = 182 bc, then
the value of x is
Sol. x2
Px  2  a  a   x  2!

x!
x
P11  b  b
 x  11!
and x 11
Px 11  c  c   x  11 !
 a = 182bc
x!
 x  2  !  182  x  11  !    x  2  x  1   182  14  13
 x  11  !
 x  1  13  x  12

Ex. How many 4 letter words can be formed from the letters of the word 'ANSWER' ? How many of these words start
with a vowel ?

Sol. Number of ways of arranging 4 different letters from 6 different letters are 6 C 4 4 !  6 !  360 .
2!
There are two vowels (A & E) in the word 'ANSWER'.
5!
Total number of 4 letter words starting with A : A .......... = 5 C 3 3 !   60
2!

5!
Total number of 4 letter words starting with E : E .......... = 5 C 3 3 !   60
2!
 Total number of 4 letter words starting with a vowel = 60 + 60 = 120.

n n
PROPERTIES OF Pr and Cr

(I) The number of permutation of n different objects taken r at a time, when p particular objects are always to be
included is r!.n–pCr–p (p  r  n)

(II) The number of permutations of n different objects taken r at a time, when repetition is allowed any number of times is nr.

(III) Following properties of nCr should be remembered :

n C = nC n n nC = nC  x = y or x + y = n
(i) r n–r ; C0 = Cn =1 (ii) x y
nC + nC n+1C nC + nC + nC + ............ + nC = 2n
(iii) r r–1 = r (iv) 0 1 2 n

nC n n–1
(v) r = Cr–1
r

nC is maximum when n n 1 n 1
(vi) r
r if n is even & r  or r  if n is odd.
2 2 2
(IV) The number of combinations of n different things taking r at a time,
(i) when p particular things are always to be included = n – pCr–p
(ii) when p particular things are always to be excluded = n – pCr
(iii) when p particular things are always to be included and q particular things are to be excluded  n – p – qCr–p

3
MATHS FOR JEE MAINS & ADVANCED

Ex. If 49C3r – 2 = 49C2r + 1, find 'r'.

n
Sol. Cr = nCs if either r = s or r + s = n.
Thus 3r – 2 = 2r + 1  r=3
or 3r – 2 + 2r + 1 = 49  5r – 1 = 49  r = 10
 r = 3, 10
Ex. If all the letters of the word 'QUEST' are arranged in all possible ways and put in dictionary order, then find the rank
of the given word.
Sol. Number of words beginning with E = 4P4 = 24
Number of words beginning with QE = 3P3 = 6
Number of words beginning with QS = 6
Number of words beginning withQT = 6.
Next word is 'QUEST'
 its rank is 24 + 6 + 6 + 6 + 1 = 43.
Ex. There are three coplanar parallel lines. If any p points are taken on each of the lines, then find the maximum number
of triangles with vertices at these points.
p p p 3
Sol. The number of triangles with vertices on different lines = C1 × C1 × C1 = p
The number of triangles with two vertices on one line and the third vertex on any one of the other two lines
3 p 2p p(p  1)
= C1 { C2 × C1} = 6p.
2 3 2 2
So, the required number of triangles = p + 3p (p – 1) = p (4p – 3)

Ex. There are 10 points in a row. In how many ways can 4 points be selected such that no two of them are consecutive ?
Sol. Total number of remaining non-selected points = 6
. . . . . .
Total number of gaps made by these 6 points = 6 + 1 = 7
If we select 4 gaps out of these 7 gaps and put 4 points in selected gaps then the new points will
represent 4 points such that no two of them are consecutive.
x . . x . x . . x .
7
Total number of ways of selecting 4 gaps out of 7 gaps = C4

FORMATION OF GROUPS
(I) (i) The number of ways in which (m + n) different things can be divided into two groups such that one of them
(m  n)!
contains m things and other has n things, is (m  n).
m! n!
(2n)!
(ii) If m = n, it means the groups are equal & in this case the number of divisions is . As in any one
n! n! 2!
way it is possible to interchange the two groups without obtaining a new distribution.
(2n)!
(iii) If 2n things are to be divided equally between two persons then the number of ways :  2! .
n ! n ! (2 !)
(II) (i) Number of ways in which (m + n + p) different things can be divided into three groups containing m, n & p
(m  n  p)!
things respectively is : , m  n  p....
m! n! p!
(3n)!
(ii) If m = n = p then the number of groups = .
n ! n ! n ! 3!
(iii) If 3n things are to be divided equally among three people then the number of ways in which it can be done
(3n)!
is .
(n !)3

4
 PERMUTATION AND COMBINATION

(III) In general, the number of ways of dividing n distinct objects into  groups containing p objects each and m groups
n !(   m)!
containing q objects each is equal to
 p !  q !m  !m !
Here p + mq = n
Ex. 12 different toys are to be distributed to three children equally. In how many ways this can be done ?
Sol. The problem is to divide 12 different things into three different groups.

12 !
Number of ways = = 34650.
4!4!4!

Ex. In how many ways can 15 students be divided into 3 groups of 5 students each such that 2 particular students are
always together ? Also find the number of ways if these groups are to be sent to three different colleges.
Sol. Assuming two particular students as one student (as they are always together), we have to make groups of
5 + 5 + 4 students out of 14 students.

14 !
Therefore total number of ways =
5 !5 !4 !2 !
Now if these groups are to be sent to three different colleges, the total number of ways

14 !
=  3!
5 !5 !4 !2 !

Ex. Find the number of ways of dividing 52 cards among 4 players equally such that each gets exactly one Ace.

48 !
Sol. Total number of ways of dividing 48 cards (Excluding 4Aces) in 4 groups 
(12 !) 4 4 !

48 !
Now, distribute exactly one Ace to each group of 12 cards. Total number of ways = 4!
(12!) 4 4 !
Now, distribute these groups of cards among four players

48 ! 48 !
 4
 4 !4 !   4!
(12!) 4 ! (12!) 4

CIRCULAR PERMUTATION
The number of circular permutations of n different things taken all at a time is (n  1) !.
(n  1)!
If clockwise & anticlockwise circular permutations are considered to be same, then it is .
2

Ex. In how many ways can we arrange 6 different flowers in a circle? In how many ways we can form a garland
using these flowers ?
Sol. The number of circular arrangements of 6 different flowers = (6 – 1)! = 120
When we form a garland, clockwise and anticlockwise arrangements are similar. Therefore, the
1
number of ways of forming garland = (6 – 1) ! = 60.
2

5
MATHS FOR JEE MAINS & ADVANCED

Ex. In how many ways can 5 boys and 5 girls be seated at a round table so that no two girls are together?
Sol. Leaving one seat vacant between two boys, 5 boys may be seated in 4! ways. Then at remaining 5 seats, 5 girls sit
in 5! ways. Hence the required number of ways = 4! × 5!

Ex. A person invites a group of 10 friends at dinner. They sit

(i) 5 on one round table and 5 on other round table,
(ii) 4 on one round table and 6 on other round table.
Find the number of ways in each case in which he can arrange the guests.
Sol. (i) The number of ways of selection of 5 friends for first table is 10C5. Remaining 5 friends are left for second table.
The total number of permutations of 5 guests at a round table is 4!. Hence, the total number of arrangements is
10!4!4! 10!
10C × 4! × 4! =
5

5!5! 25
(ii) The number of ways of selection of 6 guests is 10C6.
The number of ways of permutations of 6 guests on round table is 5!. The number of permutations of 4 guests on
round table is 3!

10 (10)! (10)!
Therefore, total number of arrangements is : C 6 5 ! 3 !  5 !3 ! 
6 !4 ! 24
Principle of Inclusion and Exclusion U
U
In the Venn's diagram (i), we get A B
A B
n(A  B) = n(A) + n(B) – n(A B)
n(A'  B') = n(U) – n(A  B)
In the Venn's diagram (ii), we get
C
(i)
(ii)

n(A  B C) = n(A) + n(B) + n(C) – n(A B) – n(B C) – n(A  C) + n(A  B  C)
n(A'  B' C') = n(U) – n(A B C)
In general, we have n(A1 A2 ........ An)
  n( Ai )   n( Ai  Aj )   n( Ai  Aj  Ak )  .....  (1)n  n( A1  A2  ...  An )
i j i jk

Ex. Find the number of permutations of letters a,b,c,d,e,f,g taken all at a time if neither 'beg' nor 'cad' pattern appear.

A B U
Sol. The total number of permutations without any restrictions; n(U) = 7!

beg acdf

Let A be the set of all possible permutations in which 'beg' pattern always appears : n(A) = 5!

cad befg

Let B be the set of all possible permutations in which 'cad' pattern always appears : n(B) = 5!

cad beg f

n(A B) : Number of all possible permutations when both 'beg' and 'cad' patterns appear.
n(A B) = 3!.

6
 PERMUTATION AND COMBINATION

Therefore, the total number of permutations in which 'beg' and 'cad' patterns do not appear
n(A'  B') = n(U) – n(A B) = n(U) – n(A) – n(B) + n(AB)
= 7! – 5! – 5! + 3!.
Arrangement of n Things, Those are not All Different
The number of permutations of 'n' things, taken all at a time, when 'p' of them are same & of one type, q of them
ar e same & of second typ e, 'r' of them are same & o f a third typ e & the r emaining

n!
n  (p + q + r) things are all different, is .
p! q! r !

Ex. In how many ways we can arrange 3 red flowers, 4 yellow flowers and 5 white flowers in a row ? In how many
ways this is possible if the white flowers are to be separated in any arrangement ?
(Flowers of same color are identical).
Sol. Total we have 12 flowers 3 red, 4 yellow and 5 white.
12 !
Number of arrangements = = 27720.
3! 4 !5 !
For the second part, first arrange 3 red & 4 yellow

7!
This can be done in = 35 ways
3! 4 !

Now select 5 places from among 8 places (including extremes) & put the white flowers there.
This can be done in 8C5 = 56.
 The number of ways for the 2 nd part = 35 × 56 = 1960.

Ex. How many numbers can be formed with the digits 1, 2, 3, 4, 3, 2, 1 so that the odd digits always occupy the
odd places ?
Sol. There are 4 odd digits (1, 1, 3, 3) and 4 odd places (first, third, fifth and seventh). At these places the odd digits can
4!
be arranged in  6 ways
2 !2 !
3!
Then at the remaining 3 places, the remaining three digits (2, 2, 4) can be arranged in  3 ways
2!
 The required number of numbers = 6 × 3 = 18.

Ex. Find the total number of 4 letter words formed using four letters from the word ''PARALLELOPIPED'.
Sol. Given letters are PPP, LLL, AA, EE, R, O, I, D.
No. of way
No. of ways
Cas es of Total
of s election
arrangements
8 8
A ll dis tinct C4 C4  4 ! 1680
4 7 4 7 4!
2 a like, 2 dis tinct C1  C2 C1  C2  1008
2!

4 4!
2 a like, 2 other a like C2 4C2  36
2!2!

3 a like, a dis tinct 2 7 2 7 4! 56

C1  C1 C1  C1 
3!
Total 2780

7
MATHS FOR JEE MAINS & ADVANCED

Total Number of Combination

If nCr denotes the number of combinations (selections) of n different things taken r at a time, then
n
n! P
n
Cr = = r where r  n ; n  N and r  W.
r! (n  r)! r!
(a) Given n different objects , the number of ways of selecting atleast one of them is,
nC + nC2 + nC3 +........+ nCn = 2n – 1. This can also be stated as the total number of combinations of n distinct
1
things.
(b) (i) Total number of ways in which it is possible to make a selection by taking some or all out of
p + q + r +......things, where p are alike of one kind, q alike of a second kind, r 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 p identical things of one kind,
q identical things of second kind, r identical things of third kind and n different things is given by :
(p + 1) (q + 1) (r + 1) 2n –1

(i) nCr = nCn – r (ii) nCr + nCr – 1 = n + 1Cr (iii) nCr = 0 if r  {0, 1, 2, 3........, n}

Ex. Fifteen players are selected for a cricket match.

(i) In how many ways the playing 11 can be selected ?
(ii) In how many ways the playing 11 can be selected including a particular player ?
(iii) In how many ways the playing 11 can be selected excluding two particular players ?
Sol. (i) 11 players are to be selected from 15
Number of ways = 15C11 = 1365.
(ii) Since one player is already included, we have to select 10 from the remaining 14
Number of ways = 14C10 = 1001.
(iii) Since two players are to be excluded, we have to select 11 from the remaining 13.
Number of ways = 13C11 = 78.

Ex. 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 ?
3 4 5 3 4 5
Sol. (i) C1 × C1 × C1 = 60 (ii) (2 –1) (2 – 1) (2 –1) = 7 × 15 × 31 = 3255
5 3 4
(iii) (2 – 1) (2 ) (2 ) = 31 × 128= 3968

DIVISORS
Let N = pa. qb. rc ....... where p, q, r........ are distinct primes & a, b, c....... are natural numbers then :
(a) The total numbers of divisors of N including 1 & N is = (a + 1) (b + 1) (c + 1).......
(b) The sum of these divisors is = (p0 + p1 + p2 + ....+ pa) (q0 + q1 + q2 + ....+ qb) (r0 + r1 + r2 + ....+ rc)...
(c) Number of ways in which N can be resolved as a product of two factor is =
1
( a  1) ( b  1) ( c  1)...... if N is not a perfect square
2
1
 ( a  1) (b  1) ( c  1)......  1 if N is a perfect square
2
(d) Number of ways in which a composite number N can be resolved into two factors which are relatively
prime (or coprime) to each other is equal to 2n–1 where n is the number of different prime factors in N.

8
 PERMUTATION AND COMBINATION

(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 HCF 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 divisors except 1 and the number itself are called proper divisors.

Ex. Find the number of proper divisors of the number 38808. Also find the sum of these divisors.
Sol. (i) The number 38808 = 23 . 32 . 72 . 11
Hence the total number of divisors (excluding 1 and itself i.e.38808)
= (3 + 1) (2 + 1) (2 + 1) (1 + 1) – 2 = 70

(ii) The sum of these divisors

=(20 + 21 + 22 + 23) (30 + 31 + 32) (70 + 71 + 72) (110 + 111) – 1 – 38808
= (15) (13) (57) (12) – 1 – 38808 = 133380 – 1 – 38808 = 94571.

Ex. In how many ways the number 18900 can be split in two factors which are relative prime (or coprime) ?
Sol. Here N = 18900 = 22 . 33 . 52 . 71
Number of different prime factors in 18900 = n = 4
Hence number of ways in which 18900 can be resolved into two factors which are relative prime
(or coprime) = 24–1 = 23 = 8.

TOTAL DISTRIBUTION
(a) Distribution of Distinct Objects : Number of ways in which n distinct things can be distributed to p persons if
there is no restriction to the number of things received by them is given by : pn

(b) Distribution of Alike Objects : Number of ways to distribute n alike things among p persons so that each may get
none, one or more thing(s) is given by n+p–1Cp–1.

Ex. Find the number of solutions of the equation x + y + z = 6, where x, y, z  W.

Sol. Number of solutions = coefficient of x6 in (1 + x + x2 + ....... x6)3
= coefficient of x6 in (1 – x7)3 (1 – x)–3
= coefficient of x6 in (1 – x)–3
= 3+6–1C6 = 8C2 = 28.

9
MATHS FOR JEE MAINS & ADVANCED

Ex. In how many ways can 5 different mangoes, 4 different oranges & 3 different apples be distributed among 3 children
such that each gets alteast one mango ?
Sol. 5 different mangoes can be distributed by following ways among 3 children such that each gets atleast 1 :
311
221
 5! 5! 
Total number of ways :     3!
 3 !1!1!2 ! 2 !2 !2 ! 
Now, the number of ways of distributing remaining fruits (i.e. 4 oranges + 3 apples)
among 3 children = 37 (as each fruit has 3 options).
 5! 5!  7
 Total number of ways      3 ! 3
 3 !2 ! (2 !) 3 

Ex. Find the number of non negative integral solutions of the inequation x + y + z  20.
Sol. Let w be any number (0 < w < 20), then we can write the equation as :
x + y + z + w = 20 (here x, y, z, w  0)
Total ways = 23C3

ARRANGEMENTS

If nP r denotes the number of permutations (arrangements) of n different things, taking r at a time, then

n
n!
P r = n (n  1) (n  2)..... (n  r + 1) =
(n  r)!

DEARRANGEMENT
There are n letters and n corresponding envelopes. The number of ways in which letters can be placed in the

 1 1 (1) n 
envelopes (one letter in each envelope) so that no letter is placed in correct envelope is n!1    .....  
 1! 2! n! 

Proof : n letters are denoted by 1,2,3,........,n. Let Ai denote the set of distribution of letters in envelopes (one letter
th
in each envelope) so that the i letter is placed in the corresponding envelope. Then,
n(Ai) = 1 × (n–1)! [since the remaining n–1 letters can be placed in n –1 envelops in (n–1)! ways]
Then, n(Ai  Aj) represents the number of ways where letters i and j can be placed in their corresponding envelopes.
Then,
n(Ai  Aj) = 1 × 1 × (n–2)!
Also n(Ai  Aj  Ak) = 1 × 1 × 1× (n–3)!
Hence, the required number is
n(A1'  A2'  ..... An') = n! – n(A1 A2......... An)

 n !   n(A i )   n(A i  A j )   n(A i  A j  A k )  .......  ( 1) n  n(A i  A 2 .....  A n ) 

n n n n–1 n
= n! – [ C1(n–1)! – C2(n–2)! + C3(n–3)! + .......+ (–1) × Cn1]

 n! n!   1 1 ( 1) n 
 n !  (n  1)! (n  2)! .......  ( 1) n 1   n ! 1    ........  
 1!(n  1)! 2 !(n  2)!   1! 2 ! n! 

10
 PERMUTATION AND COMBINATION

Ex. A person writes letters to six friends and addresses the corresponding envelopes. In how many ways can the letters
be placed in the envelopes so that
(i) All the letters are in the wrong envelopes.
(ii) At least two of them are in the wrong envelopes.
Sol. (i) The number of ways is which all letters be placed in wrong envelopes

 1 1 1 1 1 1 1 1 1 1 1 
= 6!  1     –  = 720  2 – 6  24  120  720 
1! 2 ! 3 ! 4 ! 5 ! 6 !   

= 360 – 120 + 30 – 6 + 1 = 265.

(i) The number of ways in which at least two of them in the wrong envelopes

6  1 1 6  1 1 1 6  1 1 1 1
= C4 . 2!  1    + C3 . 3!  1  1!  2 !  3 !  + C2 . 4!  1  1!  2 !  3 !  4 ! 
1! 2 !

6  1 1 1 1 1 6  1 1 1 1 1 1
+ C1. 5!  1     – + C0 6!  1  1!  2 !  3 !  4 ! – 5 !  6 ! 
1! 2 ! 3 ! 4 ! 5 ! 

= 15 + 40 + 135 + 264 + 265 = 719

11
MATHS FOR JEE MAINS & ADVANCED

TIPS & FORMULAS

1. Fundamental Principle of Counting (Counting Without Actually Counting)
If an event can occur in ‘m’ different ways, following which another event can occur in ‘n’ different ways, then the
total number ofdifferent ways of
(a) Simultaneous occurrence of both events in a definite order is m × n. This can be extended to any number of event
(known as multiplication principle).
(b) Happening of exactly one of the events is m + n (known as addition principle).

2. Factorial
A Useful Notation : n! = n (n – 1) (n – 2).........3.2.1;
n! = n. (n – 1)! where n  W
0! = 1! = 1
(2n)! = 2n . n! [1. 3. 5. 7.........(2n – 1)]
Note that factorials of negative integers are not defined.

3. Permutation
(a) nP denotes the number of permutations of n different things, taken r at a time (n  N, r  W, n  r)
r

nP
n!
= n (n – 1) (n – 2) .............(n – r + 1) =
r
  r !
n
(b) The number of permutations of n things taken all at a time when p of them are similar of one type, q of them are similar
of second type, r of them are similar of third type and the remaining
n!
n – (p + q + r) are all different is : .
p!q!r!
(c) The number of permutation of n different objects taken r at a time, when a particular objects is always to be included
is r! . n–1Cr–1.
(d) The number of permutation of n different objects taken r at a times, when repetition be allowed any number of times
is n × n × n ........r times = nr.
n
Pn
(e) (i) The number of circular permutations of n different things taken all at a time is : ( n – 1)! = .
n
 n  1!
If clockwise & anti-clockwise circular permutations are considered to be same, then it is .
n
(ii) The number of circular permutation of n different things taking r at a time distinguishing clockwise & anticlockwise
n
Pr
arrangement is
r

4. Combination
n
n! P
(a) nC denotes the number of combinations of n different things taken r at a time, and nC =  r
r r r! n  r ! r!

12
 PERMUTATION AND COMBINATION

n
where r  n ; n  N and r  W. nCr is also denoted by   or A nr or C (n, r).
r
(b) The number of combination of n different things taking r at a time.
(i) when p particular things are always to be included = n–pCr–p
(ii) when p particular things are always to be excluded = n–pCr
(iii) when p particular things are always to be included and q particular things are to be excluded = n – p – qCr–p
(c) Given n different objects, the number of ways of selecting atleast one of them is, nC1 + nC2 + nC3 + .....+ nCn = 2n – 1.
This can also be started as the total number of combinations of n distinct things.
(d)
(i) Total number of ways in which it is possible to make a selection by taking some or all out of p + q + r + ......
things, where p are alike of one kind, q alike of a second kind, r 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 p identical things of one kind ,q identical things of
second kind, r identical things of thrid kind and n different things is (p + 1) (q + 1) (r + 1) 2n – 1.
n n
5. Properties of Pr and Cr
(a) The number of permutation of n different objects taken r at a time, when p particular objects are always to be
included is r!.n–pCr–p (p  r  n)
(b) The number of permutations of n different objects taken r at a time, when repetition is allowed any number
of times is n r.
(c) Following properties of nCr should be remembered :
n C = nC n n nC = nC  x = y or x + y = n
(i) r n–r ; C0 = Cn = 1 (ii) x y
(iii) n n
Cr + Cr–1 = n+1 Cr (iv) nC + nC + nC + ............ + nC = 2n
0 1 2 n

(v) nC = n n–1C
r r r–1

nC is maximum when n n 1 n 1
(vi) r
r if n is even & r  or r  if n is odd.
2 2 2

(d) The number of combinations of n different things taking r at a time,

(i) when p particular things are always to be included = n – pCr–p
(ii) when p particular things are always to be excluded = n – pCr
(iii) when p particular things are always to be included and q particular things are to be excluded  n – p – qCr–p

6. Circular Permutation
The number of circular permutations of n different things taken all at a time is (n  1) !.
(n  1)!
If clockwise & anticlockwise circular permutations are considered to be same, then it is .
2

7. Arrangement of n Things, Those are not all Different

The number of permutations of 'n' things, taken all at a time, when 'p' of them are same & of one type, q of them
ar e same & of second typ e, 'r' of them are same & o f a third typ e & the r emaining

13
MATHS FOR JEE MAINS & ADVANCED

n!
n  (p + q + r) things are all different, is .
p! q! r !

8. Divisors
Let N = pa. qb. rc ....... where p, q, r .......are distinct primes & a, b, c.......are natural numbers then :
(a) The total numbers of divisors of N including 1 & N is = (a + 1) (b + 1) (c + 1).........
(b) The sum of these divisors is = (p0 + p1 + p2 + ......+ pa) (q0 + q1 + q2 + ......+ qb) (r0 + r1 + r2 + .....+ rc).....
(c) Number of ways in which N can be resolved as a product of two factor is =

1
 a  1 b  1 c  1 ....... if N is not a perfect sqaure
2

1
 a  1 b  1 c  1 ........  1 if N is a perfect square
2
(d) Number of ways in which a composite number N can be resolved into two factors which are relatively prime
(or coprime) to each other is equal to 2 n–1 where n is number of different prime factors is N.

9. Division and Distribution

(a) (i) The number of ways in which (m + n ) different things can be divided into two groups containing m & n

 m  n !
things respectively is : (m  n)
m!n!

 2n !
(ii) If m = n, it means the groups are equal & in this case the number of subdivision is ; for in any one
n!n!2n!
way it is possible to inter change the two groups without obtaining a new distribution.

 2n !
(iii) If 2n things are to be divided equally between two persons then the number of ways =  2! .
n!n! 2!

(b) (i) Number of ways in which (m + n + p) different things can be divided into three groups containing m, n &

 m  n  p !
p things respectively is , m  n  p
m!n!p!

 3n !
(ii) If m = n = p then the number of groups = .
n!n!n!3!
(iii) If 3n things are to be divided equally among three people then the number of ways in which it can be done

 3n !
is 3 .
 n!
(c) In general, the number of ways of dividing n distinct objects into  groups containing p objects each, m groups

n!   m !
containing q objects each is equal to  m
 p!  q!  !m!

Here p + mq = n

14
 PERMUTATION AND COMBINATION

(d) Number of ways in which n distinct things can be distributed to p person if there is no restriction to the number of
things received by them = pn
(e) Number of ways in which n identical things may by distributed among p persons if each person may receive none,
one or more things is; n+p–1Cn
10. Total Distribution

(a) Distribution of Distinct Objects : Number of ways in which n distinct things can be distributed to p persons if there
is no restriction to the number of things received by them is given by : pn
(b) Distribution of Alike Objects : Number of ways to distribute n alike things among p persons so that each may get
none, one or more thing(s) is given by n+p–1Cp–1.

11. Arrangements

If nP r denotes the number of permutations (arrangements) of n different things, taking r at a time, then

n
n!
P r = n (n  1) (n  2)..... (n  r + 1) =
(n  r)!

12. Dearrangement
Number of ways in which n letters can be placed in n directed envelopes so that no letter goes into its own envelope
is
 1 1 1 1 n 1 
= n! 1      ........   1
 1! 2! 3! 4! n!

13. Important Results

n n
3 2
(a) Number of rectangle of any size in a square of size n × n is r
r 1
& number of square of any size is r
r 1

np
(b) Number of rectangle of any size in a rectangle of size n × p (n < p) is (n + 1) (p + 1) & number of squares of any
4
n
size is   n  1  r  p  1  r 
r 1

(c) If there are n points in a plane of which m(<n) are collinear :

(i) Total number of lines obtained by joining these points is nC2 – mC2 + 1
(ii) Total number of different triangle nC3 – mC3
(d) Maximum number of point of intersection of n circles is nP2 & n lines is nC2.

15
Useful for JEE MAINS and ADVANCED Exams

Each topic contains Detailed Theory with images

Every topic contains Exercises and Detailed solutions

MATHS FOR JEE MAINS & ADVANCED

SOLVED EXAMPLES
Ex. 1 How many numbers between 10 and 10,000 can be formed by using the digits 1, 2, 3, 4, 5 if
(i) No digit is repeated in any number. (ii) Digits can be repeated.
Sol.
(i) Number of two digit numbers = 5 × 4 = 20
Number of three digit numbers = 5 × 4 × 3 = 60
Number of four digit numbers = 5 × 4 × 3 × 2 = 120
Total = 200

(ii) Number of two digit numbers = 5 × 5 = 25

Number of three digit numbers = 5 × 5 × 5 = 125
Number of four digit numbers = 5 × 5 × 5 × 5 = 625
Total = 775

Ex. 2 If 7all the letters of the word 'RAPID' are arranged in all possible manner as they are in a dictionary, then find the rank
of the word 'RAPID'.
Sol. First of all, arrange all letters of given word alphabetically : 'ADIPR'
Total number of words starting with A _ _ _ _ = 4! = 24
Total number of words starting with D _ _ _ _ = 4! = 24
Total number of words starting with I_ _ _ _ = 4! = 24
Total number of words starting with P _ _ _ _ = 4! = 24
Total number of words starting with RAD _ _ = 2! = 2
Total number of words starting with RAI _ _ = 2! = 2
Total number of words starting with RAPD _ =1
Total number of words starting with RAPI _ =1
 Rank of the word RAPID = 24 + 24 + 24 + 24 + 2 + 2 + 1 + 1 = 102

Ex.3 A delegation of four students is to be selected from a total of 12 students. In how many ways can the delegation
be selected, if-
(A) all the students are equally willing ?
(B) two particular students have to be included in the delegation ?
(C) two particular students do not wish to be together in the delegation ?
(D) two particular students wish to be included together only ?
(E) two particular students refuse to be together and two other particular students wish to be together only in
the delegation ?
Sol. (A) Formation of delegation means selection of 4 out of 12.
12
Hence the number of ways = C4 = 495.
(B) If two particular students are already selected. Here we need to select only 2 out of the remaining 10. Hence
10
the number of ways = C2 = 45.
(C) The number of ways in which both are selected = 45. Hence the number of ways in which the two are not
included together = 495 – 45 = 450
(D) There are two possible cases
(i) Either both are selected. In this case, the number of ways in which the selection can be made = 45.
(ii) Or both are not selected. In this case all the four students are selected from the remaining ten students.
10
This can be done in C4 = 210 ways.
Hence the total number of ways of selection = 45 + 210 = 255

16
 PERMUTATION AND COMBINATION

(e) We assume that students A and B wish to be selected together and students C and D do not wish to be
together. Now there are following 6 cases.
(i) (A, B, C) selected, (D) not selected
(ii) (A, B, D) selected, (C) not selected
(iii) (A, B) selected, (C, D) not selected
(iv) (C) selected, (A, B, D) not selected
(v) (D) selected, (A, B, C) not selected
(vi) A, B, C, D not selected
8
For (i) the number of ways of selection = C1 = 8
8
For (ii) the number of ways of selection = C1 = 8
8
For (iii) the number of ways of selection = C2 = 28
8
For (iv) the number of ways of selection = C3 = 56
8
For (v) the number of ways of selection = C3 = 56
8
For (vi) the number of ways of selection = C4 = 70
Hence total number of ways = 8 + 8 + 28 + 56 + 56 + 70 = 226.

Ex. 4 A box contains 5 different red and 6 different white balls. In how many ways can 6 balls be drawn so that there are
atleast two balls of each color ?
Sol. The selections of 6 balls, consisting of atleast two balls of each color from 5 red and 6 white balls, can be made in the
following ways

Red balls (5) White balls (6) Number of ways

5 6
2 3 C2× C4 = 150
5 6
3 3 C3× C3 = 200
5 6
4 2 C4× C2 = 75

Therefore total number of ways = 425

Ex. 5 How many functions can be defined from a set A containing 5 elements to a set B having 3 elements ? How
many of these are surjective functions ?
Sol. Image of each element of A can be taken in 3 ways.
 Number of functions from A to B = 3 5 = 243.
Number of into functions from A to B = 25 + 25 + 2 5 – 3 = 93.
 Number of onto functions = 150.

Ex. 6 In how many ways the letters of the word "ARRANGE" can be arranged without altering the relative position of
vowels & consonants.
4!
Sol. The consonants in their positions can be arranged in = 12 ways.
2!
3!
The vowels in their positions can be arranged in = 3 ways
2!
 Total number of arrangements = 12 × 3 = 36

17
MATHS FOR JEE MAINS & ADVANCED

Ex. 7 (A) How many permutations can be made by using all the letters of the word HINDUSTAN ?
(B) How many of these permutations begin and end with a vowel ?
(C) In how many of these permutations, all the vowels come together ?
(D) In how many of these permutations, none of the vowels come together ?
(E) In how many of these permutations, do the vowels and the consonants occupy the same relative positions as in
HINDUSTAN ?
Sol.

9!
(A) The total number of permutations = Arrangements of nine letters taken all at a time = = 181440.
2!
(B) We have 3 vowels and 6 consonants, in which 2 consonants are alike. The first place can be filled in 3 ways a n d

7!
the last in 2 ways. The rest of the places can be filled in ways.
2!
7!
Hence the total number of permutations = 3 × 2 × = 15120.
2!
7!
(C) Assume the vowels (I, U, A) as a single letter. The letters (IUA), H, D, S, T, N, N can be arranged in ways.
2!
Also IUA can be arranged among themselves in 3! = 6 ways.
7!
Hence the total number of permutations = × 6 = 15120.
2!
6!
(D) Let us divide the task into two parts. In the first, we arrange the 6 consonants as shown below in ways.
2!
× C × C × C × C × C × C × (Here C stands for a consonant and × stands for a gap between two consonants)
7
Now 3 vowels can be placed in 7 places (gaps between the consonants) in C3.3! = 210 ways.

6!
Hence the total number of permutations = × 210 = 75600.
2!
(E) In this case, the vowels can be arranged among themselves in 3! = 6 ways.
6!
Also, the consonants can be arranged among themselves in ways.
2!
6!
Hence the total number of permutations = × 6 = 2160.
2!

Ex. 8 In how many ways can 8 different books be distributed among 3 students if each receives at least 2 books ?
Sol. If each receives at least two books, then the division trees would be as shown below :

8 8

2 2 4 3 3 2
(i) (ii)

 8! 
The number of ways of division for tree in figure (i) is  2 .
 (2!) 4!2! 

18
 PERMUTATION AND COMBINATION

 8! 
The number of ways of division for tree in figure (ii) is  .
 (3!) 2
2!2! 

 8! 8! 
The total number of ways of distribution of these groups among 3 students is  2
 2   3!
 (2!) 4!2! (3!) 2!2! 

Ex. 9 In how many ways 10 persons can be divided into 5 pairs ?

Sol. We have each group having 2 persons and the qualitative characteristic are same (Since there is no purpose
mentioned or names for each pair).
10 !
Thus the number of ways = (2 !)5 5! = 945.

Ex. 10 Find the number of all 6 digit numbers such that all the digits of each number are selected from the set {1,2,3,4,5}
and any digit that appears in the number appears at least twice.

No. of ways No. of ways of Total

Cases
of selection arrangements
5 5
All alike C1 C1 × 1 5
5
C2 × 2 ! 5 6!
4 alike + 2 other alike C2  2  300
2!4!
5
C2 5 6!
Sol. 3 alike + 3 other alike C2  200
3!3!
2 alike + 2 other alike + 5
C3 5 6!
C3  900
2 other alike 2!2!2!
Total 1405
Ex. 11 A student is allowed to select at most n books from a collection of (2n + 1) books. If the total number of ways in
which he can select books is 63, find the value of n.
Sol. Given student selects at most n books from a collection of (2n + 1) books. It means that he selects one book or two
books or three books or ............ or n books. Hence, by the given condition-
2n+1C + 2n+1C + 2n+1C +.........+ 2n+1C = 63 .....(i)
1 2 3 n
But we know that
2n+1C + 2n+1C + 2n+1C + 2n+1C + ....... + 2n+1C 2n+1
0 1 2 3 2n + 1 = 2 .....(ii)
Since 2n+1C = 2n+1C
0 2n + 1 = 1, equation (ii) can also be written as
2 + (2n+1C1 + 2n+1C2 + 2n+1 C3 + ....... + 2n+1Cn) +
(2n+1Cn+1 + 2n+1Cn+2 + 2n+1 Cn + 3 + ....... + 2n+1C2n–1 + 2n+1C2n) = 22n + 1

 2 + (2n+1C1 + 2n+1C2 + 2n+1C3 + ......... + 2n+1Cn) + (2n+1Cn + 2n+1Cn–1 + ........ + 2n+1C2 + 2n+1C1) = 22n+1
( 2n+1Cr = 2n+1C2n + 1 – r)
 2 + 2 (2n+1C1 + 2n+1C2 + 2n+1C3 + ....... + 2n+1Cn) = 22n + 1 [from (i)]
 2 + 2.63 = 22n+1  1+ 63 = 22n
 64 = 22n  26 = 22n  2n = 6
Hence, n = 3.

19
MATHS FOR JEE MAINS & ADVANCED

Ex. 12 Find the number of ways in which 20 different pearls of two colours can be set alternately on a necklace, there being
10 pearls of each color.
1
Sol. Ten pearls of one color can be arranged in . 10  1 ! ways. The number of arrangements of 10 pearls of the other
2
color in 10 places between the pearls of the first color = 10!
1 2
 The required number of ways   9! 10! = 5 (9!)
2
Ex. 13 Find the number of positive integral solutions of the inequation x + y + z 150, where 0 < x  60, 0 < y  60, 0 < z  60.
Sol. Let x = 60 – t1, y = 60 – t2, z = 60 – t3 (where 0  t1  59, 0  t2  59, 0  t3  59)
Given x + y + z  150
or x + y + z – w = 150 (where 0 w  147) .....(i)
Putting values of x, y, z in equation (i)
60 – t1 + 60 – t2 + 60 – t3 – w = 150
30 = t1 + t2 + t3 + w
Total solutions = 33C3

Ex. 14 Find sum of all numbers formed using the digits 2,4,6,8 taken all at a time and no digit being repeated.
Sol. All possible numbers = 4! = 24
If 2 occupies the unit's place then total numbers = 6
Hence, 2 comes at unit's place 6 times.
Sum of all the digits occuring at unit's place
= 6 × (2 + 4 + 6 + 8)
Same summation will occur for ten's, hundred's & thousand's place. Hence required sum
= 6 × (2 + 4 + 6 + 8) × (1 + 10 + 100 + 1000) = 133320

Ex.15 Four slip of papers with the numbers 1, 2, 3, 4 written on them are put in a box. They are drawn one by one
(without replacement) at random. In how many ways it can happen that the ordinal number of atleast one slip
coincide with its own number ?
Sol. Total number of ways = 4 ! = 24.
The number of ways in which ordinal number of any slip does not coincide with its own number is the number
1 1 1
of dearrangements of 4 objects = 4 !     = 9
 2 ! 3! 4 ! 
Thus the required number of ways. = 24 – 9 = 15

Ex. 16 Find the total number of proper factors of the number 35700. Also find
(i) sum of all these factors, (ii) sum of the odd proper divisors,
(iii) the number of proper divisors divisible by 10 and the sum of these divisors.
Sol. 35700 = 52 × 22 × 31 × 71 × 171
The total number of factors is equal to the total number of selections from (5,5), (2,2), (3), (7) and (17), which is given
by 3 × 3 × 2 × 2 × 2 = 72.
These include 1 and 35700. Therefore, the number of proper divisors (excluding 1 and 35700) is 72 – 2 = 70

(i) Sum of all these factors (proper) is :

(5° + 51 + 52) (2° + 21 + 22) (3° + 31) (7° + 71) (17° + 171) –1 –35700
= 31 × 7 × 4 × 8 × 18 – 1 – 35700 = 89291

20
 PERMUTATION AND COMBINATION

(ii) The sum of odd proper divisors is :

(5° + 51 + 52) (3° + 31) (7° + 71) (17° + 171) – 1
= 31 × 4 × 8 × 18 – 1 = 17856 – 1 = 17855

(iii) The number of proper divisors divisible by 10 is equal to number of selections from (5,5), (2,2), (3), (7), (17)
consisting of at least one 5 and at least one 2 and 35700 is to be excluded and is given by 2 × 2 × 2 × 2 × 2 – 1 = 31.
Sum of these divisors is :
(51 + 52) (21 + 22) (3° + 31) (7° + 71) (17° + 171) – 35700
= 30 × 6 × 4 × 8 × 18 – 35700 = 67980
Ex. 17 Find the number of solutions of the equation xyz = 360 when (i) x,y,z  N (ii) x,y,z  I
Sol. (i) xyz = 360 = 23 × 32 × 5 (x,y,z  N)
x = 2a1 3a2 5a3 (where 0  a1  3, 0  a2  2, 0  a3  1)
y = 2b1 3b2 5 b3 (where 0  b1  3, 0  b2  2, 0  b3  1)
z = 2c1 3c2 5 c3 (where 0  c1  3, 0  c2  2, 0  c3  1)
 2a1 3a2 5a3 .2b1 3b2 5 b3 .2c1 3c2 5c3  23  32  51

 2a1  b1  c1 .3a2  b2  c2 .5a3  b3  c3  23  33  51

 a1 + b1 + c1 = 3 5C2 10
a2 + b2 + c2 = 2 4C2  6
a3 + b3 + c3 = 1 3C2  3
Total solutions = 10 × 6 × 3 = 180.
(ii) If x,y,z  I then, (A) all positive (B) 1 positive and 2 negative.
Total number of ways = 180 + 3C2 × 180 = 720

Ex. 18 Find the number of positive integral solutions of x + y + z = 20, if x  y  z.

Sol. x1
y = x + t1 t1  1, z = y + t2 t2  1, x + x + t1 + x + t1 + t2 = 20
3x + 2t1 + t2 = 20
(i) x=1 2t1 + t2 = 17
t1 = 1,2 ......... 8  8 ways
(ii) x=2 2t1 + t2 = 14
t1 = 1,2 ......... 6  6 ways
(iii) x=3 2t1 + t2 = 11
t1 = 1,2 ......... 5  5 ways
(vi) x=4 2t1 + t2 = 8
t1 = 1,2,3  3 ways
(v) x=5 2t1 + t2 = 5
t1 = 1, 2  2 ways
Total = 8 + 6 + 5 + 3 + 2 = 24
But each solution can be arranged by 3! ways.
So total solutions = 24 × 3! = 144.

21
MATHS FOR JEE MAINS & ADVANCED

Exercise # 1 [Single Correct Choice Type Questions]

1. A 5 digit number divisible by 3 is to be formed using the numerals 0, 1, 2,3,4 & 5 without repetition. The total number
of ways this can be done is -
(A) 3125 (B) 600 (C) 240 (D) 216

2. The total number of words which can be formed using all the letters of the word "AKSHI" if each word begins with
vowel or terminates with vowel -
(A) 84 (B) 12 (C) 48 (D) 60

3. The number of signals that can be made with 3 flags each of different colour by hoisting 1 or 2 or 3 above the
other, is:
(A) 3 (B) 7 (C) 15 (D) 16

4. Number of words that can be made with the letters of the word "GENIUS" if each word neither begins with G
nor ends in S, is:
(A) 24 (B) 240 (C) 480 (D) 504

5. Number of ways in which 9 different prizes can be given to 5 students, if one particular student receives 4 prizes and
the rest of the students can get any numbers of prizes is -
(A) 9C4 . 210 (B) 9C5 . 54 (C) 4 . 45 (D) none of these

6. Boxes numbered 1, 2, 3, 4 and 5 are kept in a row and they are necessarily to be filled with either a red or a blue ball
such that no two adjacent boxes can be filled with blue balls. How many different arrangements are possible, given
that the balls of a given colour are exactly identical in all respects ?
(A) 8 (B) 10 (C) 13 (D) 22

7. In a conference 10 speakers are present. If S1 wants to speak before S2 & S2 wants to speak after S3, then
the number of ways all the 10 speakers can give their speeches with the above restriction if the remaining
seven speakers have no objection to speak at any number is :

10 !
(A) 10C3 (B) 10P8 (C) 10P3 (D)
3
8. If all the letters of the word “QUEUE” are arranged in all possible manner as they are in a dictionary, then the rank
of the word QUEUE is -
(A) 15th (B) 16th (C) 17th (D) 18th

9. Number of ways in which 9 different toys can be distributed among 4 children belonging to different age groups in such
a way that distribution among the 3 elder children is even and the youngest one is to receive one toy more is -

(5!) 2 9! 9!
(A) (B) (C) (D) none of these
8 2 3!(2!)3
10. The number of ways of arranging the letters AAAAA, BBB, CCC, D, EE & F in a row if no two 'C's are
together :

12! 13! 14! 13!

(A) 13C3 . (B) (C) (D) 11.
5!3!2! 5!3!3!2! 5!3!2! 6!

22
 PERMUTATION AND COMBINATION

11. Passengers are to travel by a double decked bus which can accommodate 13 in the upper deck and 7 in the
lower deck. The number of ways that they can be divided if 5 refuse to sit in the upper deck and 8 refuse to
sit in the lower deck, is
(A) 25 (B) 21 (C) 18 (D) 15

12. How many nine digit numbers can be formed using the digits 2, 2, 3, 3, 5, 5, 8, 8, 8 so that the odd digits occupy
even positions?
(A) 7560 (B) 180 (C) 16 (D) 60

13. A box contains 2 white balls, 3 black balls & 4 red balls. In how many ways can three balls be drawn from the
box if atleast one black ball is to be included in draw (the balls of the same color are different).
(A) 60 (B) 64 (C) 56 (D) none

14. Number of ways in which 25 identical pens can be distributed among Keshav, Madhav, Mukund and Radhika such
that at least 1, 2, 3 and 4 pens are given to Keshav, Madhav, Mukund and Radhika respectively, is -
(A) 18C4 (B) 28C3 (C) 24C3 (D) 18C3

15. The number of proper divisors of apbqcrds where a, b, c, d are primes & p, q, r, s  N is -
(A) pqrs (B) (p + 1) (q + 1) (r + 1) (s + 1) – 4
(C) pqrs – 2 (D) (p + 1) (q + 1) (r + 1) (s + 1) – 2

16. The number of way in which 10 identical apples can be distributed among 6 children so that each child receives
atleast one apple is -
(A) 126 (B) 252 (C) 378 (D) none of these

17. How many divisors of 21600 are divisible by 10 but not by 15?
(A) 10 (B) 30 (C) 40 (D) none

18. If chocolates of a particular brand are all identical then the number of ways in which we can choose
6 chocolates out of 8 different brands available in the market, is:.
(A) 13C6 (B) 13C8 (C) 86 (D) none

19. The sum of all numbers greater than 1000 formed by using the digits 1, 3, 5, 7 such that no digit is being repeated in
any number is -
(A) 72215 (B) 83911 (C) 106656 (D) 114712

20. A set contains (2n + 1) elements. The number of subset of the set which contain at most n elements is : -
(A) 2n (B) 2n+1 (C) 2n – 1 (D) 2 2n

21. The number of ways in which we can arrange n ladies & n gentlemen at a round table so that 2 ladies or 2 gentlemen
may not sit next to one another is -
(A) (n – 1)! (n – 2)! (B) (n)! (n – !)! (C) (n + 1)! (n)! (D) none of these

22. If  = mC2, then aC2 is equal to

(A) m+1 C4 (B) m–1C4 (C) 3 m+2C4 (D) 3 m+1C4

23. The number of ways in which the number 27720 can be split into two factors which are co-primes, is:
(A) 15 (B) 16 (C) 25 (D) 49

23
MATHS FOR JEE MAINS & ADVANCED

24. Number of numbers greater than a million and divisible by 5 which can be formed by using only the digits
1, 2, 1, 2, 0, 5 & 2 is -
(A) 120 (B) 110 (C) 90 (D) none of these

25. The number of ways in which 6 red roses and 3 white roses (all roses different) can form a garland so that all
the white roses come together, is
(A) 2170 (B) 2165 (C) 2160 (D) 2155

26. Ten different letters of alphabet are given. Words with four letters are formed from these letters, then the number of
words which have at least one letter repeated is -
(A) 104 (B) 10P4 (C) 10C4 (D) 4960

27. Number of positive integral solutions of x1 . x2 . x3 = 30, is

(A) 25 (B) 26 (C) 27 (D) 28

28. The number of ways in which 5 different books can be distributed among 10 people if each person can get at most
one book is -
(A) 252 (B) 105 (C) 510 (D) 10C5 . 5!

29. A shopkeeper has 10 copies of each of nine different books, then number of ways in which atleast one book
can be selected is
(A) 911 – 1 (B) 1010 – 1 (C) 119 – 1 (D) 109

30. Out of seven consonants and four vowels, the number of words of six letters, formed by taking four consonants and
two vowels is (Assume that each ordered group of letter is a word) -
(A) 210 (B) 462 (C) 151200 (D) 332640

24
 PERMUTATION AND COMBINATION

Exercise # 2 Part # I [Multiple Correct Choice Type Questions]

1. N = 22. 33.54.7, then -

(A) Number of proper divisors of N(excluding 1 & N) is 118
(B) Number of proper divisors of N(excluding 1 & N) is 120
(C) Number of positive integral solutions of xy = N is 60
(D) Number of positive integral solutions of xy = N is 120

2. There are (p + q) different books on different topics in Mathematics. (p  q)

If L = the number of ways in which these books are distributed between two students X and Y such that X
get p books and Y gets q books.
M = The number of ways in which these books are distributed between two students X and Y such that one
of them gets p books and another gets q books.
N = The number of ways in which these books are divided into two groups of p books and q books then -
(A) L = N (B) L = 2M = 2N (C) 2L = M (D) L = M

3. A student has to answer 10 out of 13 questions in an examination. The number of ways in which he can
answer if he must answer atleast 3 of the first five questions is:
(A) 276 (B) 267 (C) 13C10 – 5C3 (D) 5C3 . 8C7 + 5C4 . 8C6 + 8C5

4. The number of ways in which 10 students can be divided into three teams, one containing 4 and others 3
each, is
10 ! 10 ! 1
(A) (B) 2100 (C) 10C4 . 5C3 (D) .
4 !3!3! 6 !3!3! 2
5. Number of dissimilar terms in the expansion of (x1 + x2 + ...... + xn)3 is -

n 2 (n  1)2 n(n  1)( n  2) n3  3n 2

(A) (B) (C) n+1C2 + n+1C3 (D)
4 6 4

6. The number of ways in which 200 different things can be divided into groups of 100 pairs, is:

200 !  101   102   103   200 

(A) (B)     ....  
2100  2  2  2   2 

200 !
(C) 100 (D) (1. 3. 5...... 199)
2 (100) !

50
7. C36 is divisible by
(A) 19 (B) 52 (C) 192 (D) 53

8. The number of five digit numbers that can be formed using all the digits 0, 1, 3, 6, 8 which are -
(A) divisible by 4 is 30
(B) greater than 30,000 and divisible by 11 is 12
(C) smaller than 60,000 when digit 8 always appears at ten's place is 6
(D) between 30,000 and 60,000 and divisible by 6 is 18.

9. The number of non-negative integral solutions of x1 + x2 + x3 + x4  n (where n is a positive integer) is

(A) n+3C3 (B) n+4C4 (C) n+5C5 (D) n+4Cn

25
MATHS FOR JEE MAINS & ADVANCED

10. Which of the following statement(s) is/are true :-

(A) 100C50 is not divisible by 10
(B) n(n – 1)(n – 2) .........(n – r + 1) is always divisible by r! (n  N and 0  r  n)
(C) Morse telegraph has 5 arms and each arm moves on 6 different positions including the position of rest.
Number of different signals that can be transmitted is 56 – 1.
(D) There are 5 different books each having 5 copies. Number of different selections is 65 –1.

11. The number of ways of arranging the letters AAAAA, BBB, CCC, D, EE & F in a row if the letter C are
separated from one another is:
12! 13 ! 14 ! 13 !
(A) 13C3. 5! 3! 2! (B) 5 ! 3 ! 3 ! 2 ! (C) 3 ! 3 ! 2 ! (D) 11. 6 !

12. Number of ways in which 3 numbers in A.P. can be selected from 1, 2, 3,...... n is:
(n  2)(n  4) n 2  4n  5
(A) if n is even (B) if n is odd
4 2
2
 n 1 n  n  2
(C) if n is odd (D) if n is even
4 4

13. All the 7 digit numbers containing each of the digits 1, 2, 3, 4, 5, 6, 7 exactly once and not divisible by 5 are arranged
in the increasing order. Then -
(A) 1800th number in the list is 3124567 (B) 1897th number in the list is 4213567
th
(C) 1994 number in the list is 4312567 (D) 2001th number in the list is 4315726

14. The kindergarten teacher has 25 kids in her class. She takes 5 of them at a time, to zoological garden as often
as she can, without taking the same 5 kids more than once. Then the number of visits, the teacher makes to the
garden exceeds that of a kid by:
(A) 25C5  24C4 (B) 24C5 (C) 25C5  24C5 (D) 24C4

15. A persons wants to invite one or more of his friend for a dinner party. In how many ways can he do so if he has
eight friends : -
(A) 28 (B) 28 – 1 (C) 82 (D) 8C1 + 8C2 + .....+ 8C8
16. You are given 8 balls of different color (black, white,...). The number of ways in which these balls can be
arranged in a row so that the two balls of particular colour (say red & white) may never come together is:
(A) 8 !  2.7 ! (B) 6. 7 ! (C) 2. 6 !. 7C2 (D) none

17. In an examination, a candidate is required to pass in all the four subjects he is studying. The number of ways
in which he can fail is
(A) 4P1 + 4P2 + 4P3 + 4P4 (B) 44 – 1 (C) 2 4 – 1 (D) 4C1 + 4C2 + 4C3 + 4C4

18. If P(n, n) denotes the number of permutations of n different things taken all at a time then P(n, n) is also identical
to
(A) n.P(n – 1, n – 1) (B) P(n, n – 1) (C) r! . P(n, n – r) (D) (n – r) . P(n, r)
(where 0  r  n)

19. There are 12 points in a plane of which 5 are collinear. The number of distinct quadrilaterals which can be
formed with vertices at these points is:
(A) 2. 7P3 (B) 7P3 (C) 10. 7C3 (D) 420

20. There are 10 seats in the first row of a theatre of which 4 are to be occupied. The number of ways of arranging
4 persons so that no two persons sit side by side is:
(A) 7C4 (B) 4. 7P3 (C) 7C3. 4 ! (D) 840

26
 PERMUTATION AND COMBINATION

Part # II [Assertion & Reason Type Questions]

These questions contain, Statement I (assertion) and Statement II (reason).

(A) Statement-I is true, Statement-II is true ; Statement-II is correct explanation for Statement-I.
(B) Statement-I is true, Statement-II is true ; Statement-II is NOT a correct explanation for statement-I.
(C) Statement-I is true, Statement-II is false.
(D) Statement-I is false, Statement-II is true.

1. Statement-I : If a, b, c are positive integers such that a + b + c  8, then the number of possible values of
the ordered triplets (a, b, c) is 56.
Statement-II : The number of ways in which n distinct things can be distributed among r girls such that each
get at least one is n–1Cr–1.

2. Statement-I : Number of terms in the expansion of (x1 + x2 + x3 + .... + x11)6 = 16C6.

Statement-II : Number of ways of distributing n identical things among r persons when each person get zero
or more things = n+r–1Cn

3. Statement -I : The maximum number of points of intersection of 8 unequal circles is 56.

Statement -II : The maximum number of points into which 4 unequal circles and 4 non coincident straight lines
intersect, is 50.

4. Statement-I : Number of ways in which 400 different things can be distributed between Ramu & Shamu so that each
receives 200 things > Number of ways in which 400 different things can be distributed between Sita
& Geeta. So that Sita receives 238 things & Geeta receives 162 things.
Statement-II : Number of ways in which (m + n) different things can be distributed between two receivers such that
one receives m and other receives n is equal to m+nCm, for any two non-negative integers m and n.

5. Statement-I : The number of positive integral solutions of the equation xyzw = 770 is 28.
Statement-II : The number of ways of selection of atleast one thing from n things of which 'p' are alike of one kind,
q are alike of 2nd kind and rest of the things are different is (p + 1)(q + 1) 2n–(p+q) – 1.

6. Statement-I : If a polygon has 45 diagonals, then its number of sides is 10.

Statement-II : Number of ways of selecting 2 points from n non collinear points is nC2.

7. Statement -I : If there are six letters L1, L2 , L3, L4, L5, L6 and their corresponding six envelopes E1, E2, E3, E4, E5, E6.
Letters having odd value can be put into odd value envelopes and even value letters can be put into
even value envelopes, so that no letter go into the right envelopes,the number of arrangement will
be equal to 4.
Statement -II : If Pn number of ways in which n letter can be put in ‘n’ corresponding envelopes such that
 1 1 (1) n 
no letter goes to correct envelope, then Pn = n!  1   – ....  
 1! 2! n! 

27
MATHS FOR JEE MAINS & ADVANCED

Exercise # 3 Part # I [Matrix Match Type Questions]

Following question contains statements given in two columns, which have to be matched. The statements in
Column-I are labelled as A, B, C and D while the statements in Column-II are labelled as p, q, r and s. Any given
statement in Column-I can have correct matching with one or more statement(s) in Column-II.
1. Column-I Column-II
(A) 24C + 23C + 22C + 21C + 20C + 20C is equal to (p) 102
2 2 2 2 2 3
(B) In the adjoining figure number of progressive
4 (4,4)

3
(2,2)
2

1
(q) 2300

0
1 2 3 4
ways to reach from (0,0) to (4, 4) passing
through point (2, 2) are
(particle can move on horizontal or vertical line)
(C) The number of 4 digit numbers that can be made with the digits (r) 82
1, 2, 3, 4, 3, 2

 500! 
(D) If  k   0, then the maximum natural value of k is equal to (s) 36
 14 
(where {.} is fractional part function)

2. Column – I Column – II
(A) The total number of selections of fruits which can be made (p) Greater than 50
from, 3 bananas, 4 apples and 2 oranges is, it is given that
fruits of one kind are identical
(B) If 7 points out of 12 are in the same straight line, then (q) Greater than 100
the number of triangles formed is
(C) The number of ways of selecting 10 balls from unlimited (r) Greater than 150
number of red, black, white and green balls is, it is given
that balls of same colours are identical
(D) The total number of proper divisors of 38808 is (s) Greater than 200

3. 5 balls are to be placed in 3 boxes. Each box can hold all the 5 balls. Number of ways in which the balls can be placed
so that no box remains empty, if :

Column-I Column-II
(A) balls are identical but boxes are different (p) 2
(B) balls are different but boxes are identical (q) 25
(C) balls as well as boxes are identical (r) 50
(D) balls as well as boxes are identical but boxes are kept in a row (s) 6

28
 PERMUTATION AND COMBINATION

4. Consider the word "HONOLULU".

Column – I Column – II
(A) Number of words that can be formed using (p) 26
the letters of the given word in which consonants
& vowels are alternate is
(B) Number of words that can be formed without (q) 144
changing the order of vowels is
(C) Number of ways in which 4 letters can be (r) 840
selected from the letters of the given word is
(D) Number of words in which two O's are together (s) 900
but U's are separated is

5. Consider all the different words that can be formed using the letters of the word HAVANA, taken 4 at a time.
Column-I Column-II
(A) Number of such words in which all the 4 letters are different (p) 36
(B) Number of such words in which there are 2 alike letters & (q) 42
2 different letters.
(C) Number of such words in which A's never appear together (r) 37
(D) If all such 4 letters words are written, by the rule of dictionary then (s) 24
the rank of the word HANA

Part # II [Comprehension Type Questions]

Comprehension # 1

Let p be a prime number and n be a positive integer, then exponent of p is n! is denoted by Ep (n!) and is given
by
n n n n
Ep(n!) =   +  2  +  3  + ..... +  k 
p  p  p  p 
where pk < n < pk+1
and [x] denotes the integral part of x.
If we isolate the power of each prime contained in any number N, then N can be written as
   
N = 2 1 · 3 2 · 5 3 · 7 4 ....
where i are whole numbers.

100
1. The exponent of 7 in C50 is -
(A) 0 (B) 1 (C) 2 (D) 3

2. The number of zeros at the end of 108! is -

(A) 10 (B) 13 (C) 25 (D) 26

3. The exponent of 12 in 100! is -

(A) 32 (B) 48 (C) 97 (D) none of these

29
MATHS FOR JEE MAINS & ADVANCED

Comprehension # 2

There are 8 official and 4 non-official members, out of these 12 members a committee of 5 members is to be formed,
then answer the following questions.

1. Number of committees consisting of 3 official and 2 non-official members, are

(A) 363 (B) 336 (C) 236 (D) 326

2. Number of committees consisting of at least two non-official members, are

(A) 456 (B) 546 (C) 654 (D) 466

3. Number of committees in which a particular official member is never included, are

(A) 264 (B) 642 (C) 266 (D) 462

Comprehension # 3

S = {0, 2, 4, 6, 8}. A natural number is said to be divisible by 2 if the digit at the unit place is an even number. The
number is divisible by 5, if the number at the unit place is 0 or 5. If four numbers are selected from S and a four digit
number ABCD is formed.

1. The number of such numbers which are even (all digits are different) is
(A) 60 (B) 96 (C) 120 (D) 204
2. The number of such numbers which are even (all digits are not different) is
(A) 404 (B) 500 (C) 380 (D) none of these
3. The number of such numbers which are divisible by two and five (all digits are not different) is
(A) 125 (B) 76 (C) 65 (D) 100

Comprehension # 4

Consider the letters of the word MATHEMATICS.

1. Possible number of words taking all letters at a time such that at least one repeating letter is at odd position in each
word is
11! 9! 9! 9! 11!
(A)  (B) (C) (D)
2!2!2! 2!2! 2!2!2! 2!2! 2!2!2!

2. Possible number of words taking all letters at a time such that in each word both M’s are together and both T’s are
together but both A’s are not together is
11! 10! 6!4! 9!
(A)  (B) 7! 8C2 (C) (D)
2!2!2! 2!2! 2!2! 2!2!2!

3. Possible number of words in which no two vowels are together is

4! 7! 8 4! 7! 8 4! 7! 8 4!
(A) 7! 8C4 (B) C (C) C (D) C
2! 2! 4 2! 2!2! 4 2! 2!2!2! 4 2!

30
 PERMUTATION AND COMBINATION

Comprehension # 5
We have to choose 11 players for cricket team from 8 batsmen. 6 bowlers, 4 allrounders and 2 wicketkeeper, in the
following conditions.

1. The number of selections when at most 1 allrounder and 1 wicketkeeper will play -

(A) 4C1 .14C10 + 2C1 .14C10 + 4C1 .2C1 .14C9 + 14C11 (B) 4C1 . 15C11 + 15C11

(C) 4C1 . 15C10 + 15C11 (D) none of these

2. Number of selections when 2 particular batsmen don't want to play, if a particular bowler will play -

(A) 17C10 + 19C11 (B) 17C10 + 19C11 + 17C11

(C) 17C10 + 20C11 (D) 19C10 + 19C11

3. Number of selections when a particular batsman and a particular wicketkeeper don't want to play together -

(A) 2 18C10 (B) 19C11 + 18C

10 (C) 19C10 + 19C11 (D) none of these

31
MATHS FOR JEE MAINS & ADVANCED

Exercise # 4 [Subjective Type Questions]

1. In how many ways can a team of 6 horses be selected out of a stud of 16, so that there shall always be 3 out of
ABC A'B'C', but never AA', BB' or CC' together ?

2. How many different permutations are possible using all the letters of the word MISSISSIPPI, if no two 's are
together ?

3. There are n straight lines in a plane, no 2 of which are parallel & no 3 pass through the same point. Their points of
n(n  1)(n  2)(n  3)
intersection are joined. Show that the number of fresh lines introduced is .
8
4. A family consists of a grandfather, m sons and daughters and 2n grand children. They are to be seated in a
row for dinner. The grand children wish to occupy the n 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.

5. There are 2 women participating in a chess tournament. Every participant played 2 games with the other partici-
pants. The number of games that the men played between themselves exceeded by 66 as compared to the number
of games that the men played with the women. Find the number of participants & the total number of games played
in the tournament.
200!
6. Prove that : is an integer
(10!) 20 19!

7. A party of 10 consists of 2 Americans, 2 Britishmen, 2 Chinese & 4 men of other nationalities (all different). Find the
number of ways in which they can stand in a row so that no two men of the same nationality are next to one another.
Find also the number of ways in which they can sit at a round table.

8. Find the number of words those can be formed by using all letters of the word ‘DAUGHTER’. If
(i) Vowels occurs in first and last place.
(ii) Start with letter G and end with letters H.
(iii) Letters G,H,T always occurs together.
(iv) No two letters of G,H,T are consecutive
(v) No vowel occurs together
(vi) Vowels always occupy even place.
(vii) Order of vowels remains same.
(viii) Relative order of vowels and consonants remains same.
(ix) Number of words are possible by selecting 2 vowels and 3 consonants.
9. How many different ways can 15 candy bars be distributed between Ram, Shyam, Ghanshyam and Balram, if Ram can
not have more than 5 candy bars and Shyam must have at least two ? Assume all candy bars to be alike.

10. In how many other ways can the letters of the word MULTIPLE be arranged ;
(i) without changing the order of the vowels ?
(ii) keeping the position of each vowel fixed ?
(iii) without changing the relative order/position of vowels & consonants ?
11. Find the number of ways to invite one of the three friends for dinner on 6 successive nights such that no friend is
invited more than 3 times.

32
 PERMUTATION AND COMBINATION

12. Let N = 24500, then find

(i) The number of ways by which N can be resolved into two factors.
(ii) The number of ways by which 5N can be resolved into two factors.
(iii) The number of ways by which N can be resolved into two coprime factors.
13. A man has 7 relatives, 4 of them are ladies & 3 gentlemen; his wife has also 7 relatives, 3 of them are ladies & 4
gentlemen. In how many ways can they invite a dinner party of 3 ladies & 3 gentlemen so that there are 3 of the man's
relatives & 3 of the wife's relatives ?
14. Words are formed by arranging the letters of the word "STRANGE" in all possible manner. Let m be the
number of words in which vowels do not come together and 'n' be the number of words in which vowels come
together. Then find the ratio of m: n.
15. A firm of Chartered Accountants in Bombay has to send 10 clerks to 5 different companies, two clerks in each. Two of
the companies are in Bombay and the others are outside. Two of the clerks prefer to work in Bombay while three others
prefer to work outside. In how many ways can the assignment be made if the preferences are to be satisfied ?
16. One hundred management students who read at least one of the three business magazines are surveyed to study
the readership pattern. It is found that 80 read Business India, 50 read Business world, and 30 read Business Today.
Five students read all the three magazines. Find how many read exactly two magazines?
17. (A) Prove that : nPr = n–1Pr + r. n–1Pr–1
(B) If 20Cr+2 = 20C2r–3 find 12Cr
(C) Find r if 15C3r = 15Cr+3
(D) Find the ratio 20Cr to 25Cr when each of them has the greatest value possible.
18. Find number of ways in which five vowels of English alphabets and ten decimal digits can be placed in a row
such that between any two vowels odd number of digits are placed and both end places are occupied by vowels
19. Prove by combinatorial argument that :
(A) n+1C = nC + nC
r r r–1
n+mC = nC . mC + nC . mC n m + ..... + nCr . mC0
(B) r 0 r 1 r–1 + C2 . Cr–2

20. A number lock has 4 dials, each dial has the digits 0, 1, 2, ........, 9. What is the maximum unsuccessful attempts
to open the lock ?
21. 5 boys & 4 girls sit in a straight line. Find the number of ways in which they can be seated if 2 girls are together &
the other 2 are also together but separated from the first 2.
22. X = {1, 2, 3, 4, ...... n} and A  X ; B  X ; A  B  X here P  Q denotes that P is subset of
Q(P  Q).Find number of ways of selecting unordered pair of sets A and B such that A  B  X.
23. In how many ways 11 players can be selected from 15 players, if only 6 of these players can bowl and the 11
players must include atleast 4 bowlers ?
24. There are 20 books on Algebra & Calculus in our library. Prove that the greatest number of selections each of which
consists of 5 books on each topic is possible only when there are 10 books on each topic in the library.
25. Find number of divisiors of 1980.
(i) How many of them are multiple of 11 ? find their sum
(ii) How many of them are divisible by 4 but not by 15.

33
MATHS FOR JEE MAINS & ADVANCED

Exercise # 5 Part # I [Previous Year Questions] [AIEEE/JEE-MAIN]

1. Numbers greater than 1000 but not greater than 4000 which can be formed with the digits 0, 1, 2, 3, 4 (repetition of
digits is allowed), are
(A) 350 (B) 375 (C) 450 (D) 576

2. A five digit number divisible by 3 has to formed using the numerals 0, 1, 2, 3, 4 and 5 without repetition. The total
number of ways in which this can be done is
(A) 216 (B) 240 (C) 600 (D) 3125

3. Total number of four digit odd numbers that can be formed using 0, 1, 2, 3, 5, 7 are
(A) 192 (B) 375 (C) 400 (D) 720

4. The number of ways in which 6 men and 5 women can dine at a round table if no two women are to sit together
is given by
(A) 6! × 5! (B) 30 (C) 5! × 4! (D) 7! × 5!

5. A student is to answer 10 out of 13 questions in an examination such that he must choose at least 4 from the first
five question. The number of choices available to him is
(A) 140 (B) 196 (C) 280 (D) 346
6. If nCr denotes the number of combinations of n things taken r at a time, then the expression
n
Cr 1  n Cr 1  2  n Cr equals
(A) n+2Cr (B) n+2Cr+1 (C) n+1Cr (D) n+1Cr+1

7. How many ways are there to arrange the letters in the word 'GARDEN' with the vowels in alphabetical order ?

(A) 120 (B) 240 (C) 360 (D) 480

8. The number of ways of distributing 8 identical balls in 3 distinct boxes so that none of the boxes is empty is

(A) 5 (B) 21 (C) 38 (C) 8C3

9. If the letters of the word 'SACHIN' are arranged in all possible ways and these words are written out as in dictionary,
then the word 'SACHIN' appears at serial number
(A) 602 (B) 603 (C) 600 (D) 601
6
50
10. The value of C4   56  r C3 is
r 1
56 56 55 55
(A) C4 (B) C3 (C) C3 (D) C4

11. At an election, a voter may vote for any number of candidates, not greater than the number to be elected. There
are 10 candidated and 4 are to be elected. If a voter votes for at least one candidates, then the number of ways
in which he can vote is
(A) 385 (B) 1110 (C) 5040 (D) 6210

12. The set S = {1, 2, 3,.....,12} is to partitioned into three sets A, B, C of equal size. Thus,A B  C = S,
A B = B C = C A = , then number of ways to partition S are-
12! 12! 12! 12!
(A) 4 (B) 3 (C) 4 (D)
3!(3!) (4!) (3!) 3!(4!)3

34
 PERMUTATION AND COMBINATION

13. In a shop there are five types of ice–creams available. A child buys six ice–creams.
Statement –I : The number of different ways the child can buy the six ice–creams is 10C5.
Statement –2 : The number of different ways the child can buy the six ice–creams is equal to the number of different
ways of arranging 6 A’s and 4 B’s in a row.
(A) Statement –1 is false, Statement –2 is true
(B) Statement–1 is true, Statement–2 is true; Statement–2 is a correct explanation for Statement–1
(C) Statement–1 is true, Statement–2 is true; Statement–2 is not a correct explanation for Statement–1
(D) Statement–1 is true, Statement–2 is false

14. From 6 different novels and 3 different dictionaries, 4 novels and 1 dictionary are to be selected and arranged in
a row on a shelf so that the dictionary is always in the middle. Then the number of such arrangements is :-

(A) At least 750 but less than 1000 (B) At least 1000
(C) Less than 500 (D) At least 500 but less than 750
15. There are two urns. Urn A has 3 distinct red balls and urn B has 9 distinct blue balls. From each urn two balls are
taken out at random and then transferred to the other. The number of ways in which this can be done
is :-
(A) 3 (B) 36 (C) 66 (D) 108
16. Statement - I : The number of ways of distributing 10 identical balls in 4 distinct boxes such that no box is empty
is 9C3.
Statement - II : The number of ways of choosing any 3 places from 9 different places is 9C3.
(A) Statement-1 is true, Statement-2 is false.
(B) Statement-1 is false, Statement-2 is true
(C) Statement-1 is true, Statement-2 is true; Statement-2 is a correct explanation for Statement-1
(D) Statement-1 is true, Statement-2 is true; Statement-2 is not a correct explanation for Statement-1.
17. There are 10 points in a plane, out of these 6 are collinear. If N is the number of triangles formed by joining these
points, then :
(A) N > 190 (B) N < 100 (C) 100 < N < 140 (D) 140 < N < 190
18. Assuming the balls to be identical except for difference in colours, the number of ways in which one or more balls
can be selected from 10 white, 9 green and 7 black balls is :-
(A) 879 (B) 880 (C) 629 (D) 630
19. Let A and B be two sets containing 2 elements and 4 elements respectively. The number of subsets of A × B having
3 or more elements is
(A) 256 (B) 220 (C) 219 (D) 211
20. Let Tn be the number of all possible triangles formed by joining vertices of an n-sided regular polygon. If
Tn+1 – Tn = 10, then the value of n is :
(A) 7 (B) 5 (C) 10 (D) 8

21. The number of points, having both co-ordinates as integers, that lie in the interior of the triangle with vertices (0, 0),
(0, 41) and (41, 0), is
(A) 820 (B) 780 (C) 901 (D) 861

22. The number of integers greater than 6,000 that can be formed, using the digits 3, 5, 6, 7 and 8, without repetition, is :
(A) 120 (B) 72 (C) 216 (D) 192
23. Let A and B be two sets containing four and two elements respectively. Then the number of subsets of the set
A × B, each having at least three elements is :
(A) 275 (B) 510 (C) 219 (D) 256

35
MATHS FOR JEE MAINS & ADVANCED

24. Let two fair six-faced dice A and B be thrown simultaneously. If E1 is the event that die A shows up four, E2 is the
event that die B shows up two and E3 is the event that the sum of numbers on both dice is odd, then which of the
following statements is NOT true ?
(A) E2 and E3 are independent (B) E1 and E3 are independent
(C) E1, E2 and E3 are independent (D) E1 and E2 are independent

Part # II [Previous Year Questions][IIT-JEE ADVANCED]

1. How many different nine digit numbers can be formed from the number 223355888 by rearranging its digits so that
the odd digits occupy even positions ?
(A) 16 (B) 36 (C) 60 (D) 180

2. (A) Let Tn denote the number of triangles which can be formed using the vertices of a regular polygon of ‘n’ sides. If
Tn+1 – Tn = 21, then ‘n’ equals -
(A) 5 (B) 7 (C) 6 (D) 4

(B) Let E = {1, 2, 3, 4} and F = {1, 2}. Then the number of onto functions from E to F is -
(A) 14 (B) 16 (C) 12 (D) 8

3. The number of arrangements of the letters of the word BANANA in which two 'N's do not appear adjacently
is -
(A) 40 (B) 60 (C) 80 (D) 100

4. Number of points with integral co-ordinates that lie inside a triangle whose co-ordinates are (0, 0), (0, 21) and (21, 0)

(A) 210 (B) 190 (C) 220 (D) none of these

2
(n )!
5. Using permutation or otherwise prove that is an integer, where n is a positive integer..
(n!)n
6. A rectangle with sides 2m – 1 and 2n – 1 is divided into squares of unit length by drawing

parallel lines as shown then number of rectangles possible with odd side lengths is -

(A) (m + n + 1)2 (B) 4m + n – 1 (C) m2 n2 (D) mn (m + 1) (n + 1)

7. If r, s, t are the prime numbers and p, q are the positive integers such that the LCM of p & q is r2t4s2, then the number
of ordered pair (p, q) is :
(A) 252 (B) 254 (C) 225 (D) 224

8. The letters of the word COCHIN are permuted and all the permutations are arranged in an alphabetical order as in an
English dictionary. The number of words that appear before the word COCHIN is -
(A) 360 (B) 192 (C) 96 (D) 48

36
 PERMUTATION AND COMBINATION

9. Consider all possible permutations of the letters of the word ENDEANOEL.

Match the Statements / Expressions in Column I with the Statements / Expressions in Column II.
Column I Column II
(A) The number of permutations containing the word ENDEA is (p) 5!
(B) The number of permutations in which the letter E occurs in the first (q) 2 × 5!
and the last positions is
(C) The number of permutations in which none of the letters D, L, N (r) 7 × 5!
occurs in the last five positions is
(D) The number of permutations in which the letters A, E, O occur only in (s) 21 × 5!
odd positions is

10. The number of seven digit integers, with sum of the digits equal to 10 and formed by using the digits 1, 2 and 3 only is -

(A) 55 (B) 66 (C) 77 (D) 88

11. Let S = {1,2,3,4}. The total number of unordered pairs of disjoint subsets of S is equal to -

(A) 25 (B) 34 (C) 42 (D) 41

12. The total number of ways in which 5 balls of different colours can be distributed among 3 persons so that
each person gets at least one ball is -
(A) 75 (B) 150 (C) 210 (D) 243

Paragraph for Question 13 and 14

Let an denotes the number of all n-digit positive integers formed by the digits 0, 1 or both such that no consecutive
digits in them are 0. Let bn = the number of such n-digit integers ending with digit 1 and cn = the number of such n-
digit integers ending with digit 0.

13. The value of b6 is

(A) 7 (B) 8 (C) 9 (D) 11

14. Which of the following is correct ?

(A) a17 = a16 + a15 (B) c17  c16 + c15 (C) b17  b16 + c16 (D) a17 = c17 + b16

15. Six cards and six envelopes are numbered 1, 2, 3, 4, 5, 6 and cards are to be placed in envelopes so that each
envelope contains exactly one card and no card is placed in the envelope bearing the same number and
moreover the card numbered 1 is always placed in envelope numbered 2. Then the number of ways it can be
done is
(A) 264 (B) 265 (C) 53 (D) 67

16. Let n  2 be an integer. Take n distinct points on a circle and join each pair of points by a line segment. Colour
the line segment joining every pair of adjacent points by blue and the rest by red. If the number of red and
blue line segment are equal, then the value of n is
17. Let n1 < n2 < n3 < n4 < n5 be positive integers such that n1 + n2 + n3 + n4 + n5 = 20. Then the number of such
distinct arrangements (n1, n2, n3, n4, n5) is
18. A debate club consists of 6 girls and 4 boys. A team of 4 members is to be selected from this club including the
selection of a captain (from among these 4 members) for the team. If the team has to include at most one boy, then
the number of ways of selecting the team is
(A) 380 (B) 320 (C) 260 (D) 95

37
MATHS FOR JEE MAINS & ADVANCED

MOCK TEST
SECTION - I : STRAIGHT OBJECTIVE TYPE
1. A shopkeeper has 10 copies of each of nine different books, then number of ways in which atleast one book
can be selected is
(A) 911 – 1 (B) 1010 – 1 (C) 119 – 1 (D) 109

2. No. of different squares of any size (side of square be natural no.) which can be made from a rectangle of size 15 × 8, is
(A) 456 (B) 120 (C) 228 (D) None of these

3. The number of different ways in which five ‘alike dashes’ and eight ‘alike dots’ can be arranged, using only seven
of these ‘dashes’ & ‘dots’ is
(A) 1287 (B) 119 (C) 120 (D) 1235520

4. In a hockey series between team X and Y, they decide to play till a team win ‘m’ match. Then the no. of ways in which
team X wins -
(A) 2m (B) 2mPm (C) 2mCm (D) None of these

5. There are three coplanar parallel lines. If any p points are taken on each the lines, the maximum number of
triangles with vertices at these points is
(A) 3p 2 ( p – 1) + 1 (B) 3p2 (p – 1) (C) p 2 (4p – 3) (D) none of these

6. A gentleman invites a party of m + n (m  n) friends to a dinner & places m at one table and n at another, the
table being round. If the clockwise & anticlockwise arrangements are not to be distinguished and assuming
sufficient space on both tables, then the number of ways in which he can arrange the guest is
(m  n)! 1 (m  n)! (m  n)!
(A) (B) (C) 2 (D) none
4 mn 2 4 mn 4 mn

7. Number of ways in which 6 different toys can be distributed among two brothers in ratio 1 : 2, is
(A) 30 (B) 60 (C) 20 (D) 40

8. There are m apples and n oranges to be placed in a line such that the two extreme fruits being both oranges.
Let P denotes the number of arrangements if the fruits of the same species are different and Q the corresponding
figure when the fruits of the same species are alike, then the ratio P/Q has the value equal to :
(A) nP 2. mP m. (n  2) ! (B) mP 2. nP n. (n  2) ! (C) nP2. nPn. (m  2) ! (D) none

9. S1 : For some natural N, the number of positive integral ‘x’ satisfying the equation,
1 ! + 2 ! + 3 ! + ..... + (x !) = (N)2 is 3
S2 : A women has 11 close friends then the number of ways in which she can invite 5 of them to
dinner, if two particular of them are not on speaking terms & will not attend together is 378
S3 : An old man while dialing a 7 digit telephone number remembers that the first four digits consists
of one 1’s, one 2’s and two 3’s. He also remembers that the fifth digit is either a 4 or 5 while has
no memorizing of the sixth digit, he remembers that the seventh digit is 9 minus the sixth digit.
Maximum number of distinct trials he has to try to make sure that he dials the correct telephone
number, is 240
S4 : The number of times the digit 3 will be written when listing the integers from 1 to 1000 is 300
(A) TTTF (B) FTTF (C) FTTT (D) FTFT

38
 PERMUTATION AND COMBINATION

10. A five letter word is to be formed such that the letters appearing in the odd numbered positions are taken from the
letters which appear without repetition in the word "MATHEMATICS". Further the letters appearing in the even
numbered positions are taken from the letters which appear with repetition in the same word "MATHEMATICS".
The number of ways in which the five letter word can be formed is:
(A) 720 (B) 540 (C) 360 (D) none

SECTION - II : MULTIPLE CORRECT ANSWER TYPE

11. Identify the correct statement(s).
(A) Number of zeroes standing at the end of 125 ! is 30.
(B) A telegraph has 10 arms and each arm is capable of 9 distinct positions excluding the position of rest.
The number of signals that can be transmitted is 1010  1.
(C) Numb er of number s greater than 4 lacs which can be for med by using o nly the d igits
0, 2, 2, 4, 4 and 5 is 90.
(D) In a table tennis tournament , every player plays with every other player. If the number of
games played is 5050 then the number of players in the tournament is 100.

12. Six cards are drawn one by one from a set of unlimited number of cards, each card is marked with numbers 
1, 0 or 1. Number of different ways in which they can be drawn if the sum of the numbers shown by them
vanishes, is:
(A) 111 (B) 121 (C) 141 (D) none

13. The number of different seven digit numbers that can be written using only three digits 1, 2 & 3 under the
condition that the digit 2 occurs exactly twice in each number is -
(A) 672 (B) 640 (C) 512 (D) none

14. Number of different words that can be formed using all the letters of the word "DEEPMALA", if two vowels
are together and the other two are also together but separated from the first two is
(A) 960 (B) 1200 (C) 2160 (D) 1440

15. The number of ways of arranging the letters AAAAA, BBB, CCC, D, EE & F in a row if the letters C are
separated from one another is:
12 ! 13 !
(A) 13C3. (B)
5! 3! 2! 5! 3! 3! 2!
14 ! 15! 13! 12! 13
(C) (D) 2
– – C2
3! 3! 2! 5!(3!) 2! 5!3! 2! 5!3!

SECTION - III : ASSERTION AND REASON TYPE

1 1  1 2 
16. Statement - I : Let E =         .... upto 50 terms, then E is divisible by exactly two primes.
 3 50   3 50 
Statement - II : [x + n] = [x] + n, n  I and [x + y] = [x] + [y] if x, y  I
(A) Statement-1 is True, Statement-2 is True; Statement-2 is a correct explanation for Statement-1.
(B) Statement-1 is True, Statement-2 is True; Statement-2 is NOT a correct explanation for Statement-1
(C) Statement-1 is True, Statement-2 is False
(D) Statement-1 is False, Statement-2 is True

39
MATHS FOR JEE MAINS & ADVANCED

17. Statement I : The sum of the digits in the tens place of all numbers with the help of 2, 3, 4, 5 taken all at a time is 84.
Statement II: The sum of the digits in the units place of all numbers formed with the help of
(a1, a2,...., an) taken all at a time is (n –1) ! (a1 + a2 + ........+ an) (repetition of digits not allowed)
(A) Statement-1 is True, Statement-2 is True; Statement-2 is a correct explanation for Statement-1.
(B) Statement-1 is True, Statement-2 is True; Statement-2 is NOT a correct explanation for Statement-1
(C) Statement-1 is True, Statement-2 is False
(D) Statement-1 is False, Statement-2 is True
18. Statement - I : Let A = {x | x is a prime number and x < 30}. Then the number of different rational nubmers,
whose numerator and denominator belong to A is 93.
p
Statement - II : is a rational number  q  0, and p, q I
q
(A) Statement-1 is True, Statement-2 is True; Statement-2 is a correct explanation for Statement-1.
(B) Statement-1 is True, Statement-2 is True; Statement-2 is NOT a correct explanation for Statement-1
(C) Statement-1 is True, Statement-2 is False
(D) Statement-1 is False, Statement-2 is True

19. Statement -I : A five digit number divisible by 3 is to be formed using the digits 0, 1, 2, 3, 4 and 5 with
repetition. The total number of numbers formed is 216.
Statement -II : If sum of digits of any number is divisible by 3 then the number must be divisible by 3.
(A) Statement-1 is True, Statement-2 is True; Statement-2 is a correct explanation for Statement-1.
(B) Statement-1 is True, Statement-2 is True; Statement-2 is NOT a correct explanation for Statement-1
(C) Statement-1 is True, Statement-2 is False
(D) Statement-1 is False, Statement-2 is True

20. Statement - I : The number of ordered pairs (m, n) ; m,n  {1, 2, 3, .....20} such that 3m + 7n is a multiple of 10, is equal to 100.
Statement - II : 3m + 7n has last digit zero, when m is of 4k + 2 type and n is of 4 type where k,   W.
(A) Statement-1 is True, Statement-2 is True; Statement-2 is a correct explanation for Statement-1.
(B) Statement-1 is True, Statement-2 is True; Statement-2 is NOT a correct explanation for Statement-1
(C) Statement-1 is True, Statement-2 is False
(D) Statement-1 is False, Statement-2 is True

SECTION - IV : MATRIX - MATCH TYPE

21. Match the following :

Column -  Column - 
(A) The number of five - digit numbers having the (p) 77
product of digits 20 is
(B) A man took 5 space plays out of an engine to (q) 30
clean them. The number of ways in which he can
place atleast two plays in the engine from
where they came out is
(C) The number of integers between 1 & 1000 inclusive (r) 50
in which atleast two consecutive digits are equal is
1
(D) The value of   i. j
15 1  i  j  9
(s) 181
(t) 31

40
 PERMUTATION AND COMBINATION

22. Column I Column II

(A) Number of increasing permutations of m numbers (p) nm
from the n set number {a1 , a2 ,......, an}
where the order among the numbers is given by
a1 < a2 < a3 < .........an–1 < an is
(B) There are m men and n monkeys. Number of ways (q) mC
n
in which every monkey has a master, if a man can
have any number of monkeys
(C) Number of ways in which n red balls and (m –1) green (r) nC
m
balls can be arranged in a line, so that no two red
balls are together, is (balls of the same colour are alike)
(D) Number of ways in which ‘m’ different toys can be distributed (s) mn
in ‘n’ children if every child may receive any number of toys is

SECTION - V : COMPREHENSION TYPE

23. Read the following comprehensions carefully and answer the questions.
Consider the letters of the word MATHEMATICS. There are eleven letters some of them are identical. Letters
are classified as repeating and non-repeating letters. Set of repeating letters = {M, A, T}. Set of non-repeat-
ing letters = {H, E, I, C, S}
1. Possible number of words taking all letters at a time such that atleast one repeating letter is at odd position
in each word, is
9! 11! 11! 9! 9!
(A) (B) (C) – (D)
2!2!2! 2!2!2! 2!2!2! 2!2! 2!2!

2. Possible number of words taking all letters at a time such that in each word both M's are together and both T's
are together but both A's are not together, is
11! 10 ! 6!4! 9!
(A) 7 ! . 8C2 (B) 2 ! 2 ! 2 ! – 2 ! 2 ! (C) 2 ! 2 ! (D) 2 ! 2 ! 2 !

3. Possible number of words in which no two vowels are together, is

7! 8 4! 7! 8 4! 4! 7! 4!
(A) . C4 . (B) . C4 . (C) 7 ! . 8C4 . (D) . 8C4 .
2!2! 2! 2! 2! 2! 2!2!2! 2!
24. Read the following comprehensions carefully and answer the questions.
5 ball are to be placed in 3 boxes. Each box can hold all the 5 balls. Number of ways in which the balls can be
placed so that no box remains empty, if :

1. balls are identical but boxes are different

(A) 2 (B) 25 (C) 50 (D) 6

2. balls are different but boxes are identical

(A) 2 (B) 25 (C) 50 (D) 6

3. balls as well as boxes are identical

(A) 2 (B) 25 (C) 50 (D) 6

41
MATHS FOR JEE MAINS & ADVANCED

25. Read the following comprehensions carefully and answer the questions.
Counting by critical paranthesis method
Suppose we have to arrange n-pairs of paranthesis in such a way that every arrangement is matched i.e.
number of left paranthesis are always greater than or equal to number of right paranthesis in any length of the
chain from start.
2n!
S is the number of ways of arranging n - right and n - left paranthesis in a row = .
n! n!
(2n) !
Let T be the arrangement of (n + 1) right and (n – 1) left paranthesis = .
(n  1)!(n  1)!
It can be shown that set of mismatched arrangements of paranthesis in ‘S’ has bijective relation with the set
of arrangements of T.
Since the set of mismatched arrangements in S has bijective relation with the set of arrangements in T.
2n !
 number of the mismatched arrangements in S =
(n  1)!(n  1)!
2n ! 2n ! 2n !
 Number of matched arrangements in S = – =
n ! n ! (n  1)!(n  1)! n ! (n  1)!

1. The number of ways in which ‘4’ pairs of paranthesis be arranged so that every arrangement is matched is:
8
C4
(A) 3 (B) (C) 8C4 (D) 8C5
5

2. If a stamp vendor sells tickets of 1 rupee each and there are 3 persons having 1 rupee coin and 3 having 2
rupee coin standing in a row. Then the probability that stamp vendor do not run out of change if he does not
have any money to start with is:
1 1 3
(A) (B) (C) (D) None of these
4 2 4
3. Number of ways of arranging the 5 pairs of paranthesis, if first pair is matched but the next four pairs are not
matched is:
(A) 10C6 (B) 8C5 (C) 4 C2 × 4 C2 (D) None of these

SECTION - VI : INTEGER TYPE

26. In a row, there are n rooms, whose door no. are 1,2,.......,n, initially all the door are closed. A person takes n round of
the row, numbers as 1st round, 2nd round ........ nth round. In each round, he interchange the position of those door no.,
whose no is multiple of the round no. Find out after nth round,How many doors will be open.

27. 10 IIT & 2 PET students sit in a row. The total number of ways in which exactly 3 IIT students sit between 2
PET students is 10! , then find .

28. The integers from 1 to 1000 are written in order around a circle. Starting at 1, every fifteenth number is marked
(that is 1, 16, 31, .... etc.). This process in continued untill a number is reached which has already been
marked, then find number of unmarked numbers.

29. 17 persons can depart from railway station in 2 cars and 3 autos, given that 2 particular person depart by same car
15!
are . (4 persons can sit in a car and 3 persons can sit in an auto), then find the value of .
 !(3!)3

30. Find the number of positive unequal integral solution of the equation x + y + z = 20.

42
 PERMUTATION AND COMBINATION

ANSWER KEY

EXERCISE - 1
1. D 2. A 3. C 4. D 5. A 6. C 7. D 8. C 9. C 10. A 11. B 12. D 13. B
14. D 15. D 16. A 17. A 18. A 19. C 20. D 21. B 22. D 23. B 24. B 25. C 26. D
27. C 28. D 29. C 30. C

EXERCISE - 2 : PART # I

1. AD 2. AC 3. ACD 4. BC 5. BC 6. BCD 7. AB 8. ABD 9. BD

10. ABD 11. AD 12. CD 13. BD 14. AB 15. BD 16. ABC 17. CD 18. ABC
19. AD 20. BCD

PART - II
1. C 2. A 3. B 4. D 5. B 6. D 7. A

EXERCISE - 3 : PART # I
1. Aq Bs CP Dr 2. A  p B  p,q,r C  p,q,r,s D  p 3. As Bq Cp Ds
4. Aq Br Cp Ds 5. As Bp Cq Dr

PART - II
Comprehension # 1 : 1. A 2. C 3. B Comprehension # 2 : 1. B 2. A 3. D
Comprehension # 3 : 1. B 2. A 3. B Comprehension # 4 : 1. D 2. B 3. C
Comprehension # 5 : 1. A 2. A 3. B

EXERCISE - 5 : PART # I
1. B 2. A 3. A 4. A 5. B 6. B 7. C 8. B 9. D 10. A 11. A 12. B 13. A
14. B 15. A 16. C 17. B 18. A 19. C 20. B 21. B 22. D 23. C 24. C

PART - II
1. C 2. A  p B  q 3. A 4. B 6. C 7. C 8. C 9. A  p B  s C  q D  q
10. C 11. D 12. B 13. B 14. A 15. C 16. 5 17. 7 18. A

MOCK TEST

1. C 2. A 3. C 4. D 5. C 6. C 7. A 8. A 9. C 10. B 11. B, C 12. C

13. A 14. D 15. A, D 16. D 17. A 18. D 19. A 20. B
21. A  r B  t C  s D  p 22. A  r B  s C  p D  q
23. 1. B 2. A 3. A 24. 1. D 2. B 3. A 25. 1. B 2. A 3. B

26.  n  27. 16 28. 800 29. 4 30. 144

 

43
Useful for JEE MAINS and ADVANCED Exams

Each topic contains Detailed Theory with images

Every topic contains Exercises and Detailed solutions

MATHS FOR JEE MAINS & ADVANCED

HINTS & SOLUTIONS

EXERCISE - 1 17. Here 21600 = 25. 33. 52
Single Choice  (2 × 5) × 2 4 × 33 × 51
Now numbers which are divisible by 10
2. Total possible words – words do not begin or terminate = (4 + 1)(3 + 1)(1 + 1) = 40
with vowel (2 × 3 × 5) × (2 4 × 32 × 5 1) now numbers which are
Total words = 5! = 120 divisible by both 10 and 15
Words which do not begin and terminate with vowel = (4 +1)(2 +1)(1+1) = 30
So the numbers which are divisible by only
= 3 × 3 × 2 × 1 × 2 = 36
40 – 30 = 10
Desired words : 180 – 36 = 84
II-Method  words which begin with vowel 18. Using multinomial theorem
(A/I) = 4! × 2 = 48 ways  say = n(A) Total no. of ways of choosing 6 chocolates out of
Similarly words terminating with vowel 8 different brand is = 8 + 6–1C6 = 13C6
= 4! × 2 = 48 ways  say = n(B)
24. For a number to be divisible by 5,5 or 0 should be at
Now exclude words which begin as well as terminates units place.
with vowel  Unit place can be filled by 2 ways
2 × 3 × 2 × 1 × 1 = 12 ways  n(A  B)
6!
Desired number of words :- Remaining digits can be filled in ways.
3 ! 2 !
48 + 48 – 12 = 84 ways
2  6!
( n(A B) = n(A) + n(B) – n(A  B)) Total ways =
3 !2 !
6. Make cases when all 5 boxes are filled by: But these arrangements also include cases where 0 is
Case I : identical 5 red balls at millions place and 5 at units place, which are
5
C5 1 way undesirable cases
Case II : 4 identical red balls and 1 blue ball 5!
5  ways (undesirable)
C1 = 5 ways 3 ! 2 !
Case III : 3 blue and 2 red balls i.e. xRxRx subtract it from total ways.
 4 gaps, for 2 blue balls 6! 5!
 4C2 = 6 ways  Desired ways = 2 × – = 110
3 ! 2 ! 3 ! 2 !
Case IV : 2 red and 3 blue balls i.e. xRxRx  3
gaps, 3 blue balls 27. Total number of positive integral solution of
 3C3 = 1 way x1 . x2 . x3 = 80 = 2 × 3 × 5 is 3 × 3 × 3 = 27
 Total number of ways are 1+5+6+1 = 13 ways
30. Number of selections of 4 consonants out of 7 is 7C4
7. First we select 3 speaker out of 10 speaker and put in Number of selections of 2 vowels from 4 is 4C2
any way and rest are no restriction i.e. total number Arrangement of words in 6! ways
10! Desired words : 7C4 × 4C2 × 6! = 151200
of ways = 10C3 . 7.2 ! =
3

8. EEQUU
4!
Words starting with E 
2!
3!
Words starting with QE 
2!
next word will be QUEEU  1
and finally QUEUE  1
Rank is 12 + 3 + 1 + 1 = 17th

44
 PERMUTATION AND COMBINATION

EXERCISE - 2 2
 n 1 
Part # I : Multiple Choice =  
 2 
3. Total number of required possibilities n2
Case - II when n is even = rmax =
5 C . 8C + 5 C . 8 C + 5 C . 8 C . 5 C 2
3 7 4 6 5 5 5
so total no. selection is
= 5C3 . 8C7 + 5C4 . 8C6 + 8C6 = 13C10 – 5C3 = 276
n2n
(n  2)/2
n(n  2) 2  2  2
6.
200
C 2 . 198C 2 . 196 C 2 ......2 C 2 200!
= 100
= 
r 1
(n  2r) =
2
–
2
100! 2 .100!
n2  n n(n  2)
101.102.103.....200 =   n   =
=  2   2 4
2100
14. Total no. of visits that a teacher goes is = 25C5
 100   102   103   100 
=   .  .  .....   (selection of 5 different kids each time & teacher goes
 2  2  2   2 
every time)
1.2.3.4.5.6.7.8.....200 Number of visits of a boy = select one particular boy &
and
2100 .100! 4 from rest 24 = 24C4
So extra visits of a teacher from a boy is
(1.3.5.7.....199)(2.4.6.8......200)
= = 25C5 – 24C4 = 24
C5
2100 .100!

(1.3.5......199).2100 .100! 17. Number of ways he can fail is either one or two, three
= = 1.3.5 .199 or four subject then total of ways.
2100 .100!
4 C + 4 C + 4 C + 4C = 2 4 – 1
1 2 3 4
9. x1 + x2 + x3 + x4  n
 x1 + x2 + x3 + x4 + y = n 19. Total number of required quadrilateral
(where y is known as pseudo variable) 7C + 7C × 5C + 7C × 5C
4 3 1 2 2
Total no. of required solution is = n + 5 –1Cn
= n+4Cn or n+4
C4 7  6  5 4 7  6  5 7 6 5 4
=  .5  
12! 1 2  3  4 1 2  3 1 2 1 2
11. We have arrange all the letter except ‘ccc’ is = 35 + 175 + 210 = 420 = 2 .7p3
5!.3!.2!
new there all 13 place where ‘i’ can be placed 13C3
Hence required number of ways is Part # II : Assertion & Reason
12! 13!
= 13 C = 11 .
5!3! 2! 3 3. Statement -1: Two circles intersect in 2 points.
6!
 Maximum number of points of intersection
12. Here given no. be 1,2,3,.........n
= 2 × number of selections of two circles from 8 circles.
Let common difference = r
Total way of selection = (1, 1 + r, 1+2r), = 2 × 8C2 = 2 × 28 = 56
(2, 2 + r, 2 + 2r), ..(n – 2r, n – r, n) Statement -2: 4 lines intersect each other in 4C2 = 6 points.
Total numbers are = (n – 2r) 4 circles intersect each other in 2 × 4C2 = 12 points.
Here rmin. = 1 and rmax. = (n – 1)/2
Further, one lines and one circle intersect in two points.
Case- I When n is odd
So, 4 lines will intersect four circles in 32 points.
(n  1)
 r max = & to tal no. of selection is  Maximum number of points = 6 + 12 + 32 = 50.
2
 n  1  n  1  5. x1 x2 x3 x4 = 2 × 5 × 7 × 11  N = 4 4
(n 1)/2 2  
n(n  1)  2  2 
=  (n  2r) = –
r 1 2 2

45
MATHS FOR JEE MAINS & ADVANCED

EXERCISE - 3 Comprehension # 04
Part # II : Comprehension 1. Since there are 5 even places and 3 pairs of repeated
Comprehension # 01 letters, therefore at least one of these must be at an odd
1. Exponent of 7 in 100! – place. Therefore, the number of ways is 11!/(2!2!2!).

2. Make a group of both M’s and another group of T’s.

100  14 
 7    7  = 14 + 2 = 16 Then except A’s we have 5 letters remaining. So M’s,
T’s, and the letters except A’s can be arranged in 7! ways.
exponent of 7 in 50! Therefore, total number of arrangements is 7! × 8C2.

 50   7  3. Consonants can be placed in 7!/(2!2!) ways. Then there

 7    7  = 8
are 8 places and 4 vowels. Therefore, number of ways is

7! 8 4!
100! 716 C .
Exponent of 7 in 100C50 = = 8 8 = 70 2!2! 4 2!
50!50! 7 7

 exponent of 7 will be 0.

2. Product of 5's & 2's constitute 0's at the end of a number

 No. of 0's in 108!
= exponent of 5 in 108!
(Note that exponent of 2 will be more than exponent of 5
in 108 !)

108   21
   = 21 + 4 = 25
 5   5 

3. As 12 = 22.3, here we have to calculate exponent of 2 and

exponent of 3 in 100!
exponent of 2

100   50   25  12   6   3 
=      =97
 2   2   2   2   2   2 

100   33  11   3 
exponent of 3 =     = 48
 3   3   3   3 

Now, 12 = 2 × 2 × 3
we require two 2's & one 3
 exponent of 3 will give us the exponent of 12 in 100!
i.e. 48

46
 PERMUTATION AND COMBINATION

EXERCISE - 4 4. First we select n grand children from 2n grand children

Subjective Type is 2nCn
Now arrangement of both group is n! × n!
1. Selecting 3 horses out of ABC A'B'C' is 6C3 ways
Now Rest all (m + 1) place where we occupy the
When AA' is always selected among (ABC A'B'C')
grandfather and m sons but grandfather refuse the
Remaining (BB'CC') can be selected in 4C1 ways similarly, sit to either side of grand children so the out of m – 1
when BB' and CC' is selected seat one seat can be selected
 Undesirable ways will be (4C1) × 3 Now required number of sitting in
using, total ways–undesirable ways 2nC × n ! × n ! × (m –1)C . m !
n 1
= desired ways we get
(6C3 – (4C1)3)  This is selection of 3 horses among 12n
= × n ! × n ! × (m –1)C1 . m ! = 2n ! . m ! . (m –1)
(ABC A'B'C') under given condition. n! n!
Remaining 3 can be selected in 10C3 ways.
6. Number of ways of distributing 200 objects into 20
Hence, desired ways will be [6C3 – 4C1 × 3]10C3 = 792
groups each containing 10 objects
Method II : Select one horse each from AA', BB' and CC'
hence 2C1 × 2C1 × 2C1 ways. Now select 3 horses from 200! 200!
= 20 × 20 = which must be an integer..
remaining 10 horses in 10C3 ways.
(10!) .20! (10!) 20 .19!
Total ways = 10C3 × 2C1× 2C1 × 2C1
7. (i) Total ways = 10!
2. Total no. of M are = 1 Total no. of  are = 4
Total no. of P are = 2 Total no. of S are = 4 undesirable cases : when 2 Americans are together (A1A2)
First we arrange all the words other than 's are or two British are together (B1B2) or two Chinese are
together (C1C2)
7! 765
  105 we plot them on Venn diagram :
2! 4! 1 2

Now, there are 8 places which can be fulfilled by I's i.e. A 1A 2 B1B2
the number of ways is 8C4
105  8  7  6  5 C1C2
Total required no. = 105 × 8C4 =
1 2  3  4
= 105 × 70 = 7350 we use,
n(A1A2  B1B2  C1C2)
st n
3. Step 1 : Select 2 lines out of n lines in C2 ways to get a = n (A1A2) + n(B1B2) + n(C1C2) – n[(A1A2)  (B1B2)]
point (say p).
– n [(B1B2)  (C1C2)] – n [(C1C2)  (A1A2)]
nd n–2
Step-2 : Now select another 2 lines in C2 ways, to get
+ n [(A1A2)  (B1B2)  (C1C2)]
another point (say Q)
where n(A 1 A 2 ) denotes  when 2 Americans
Step-3rd : When P and Q are joined we get a fresh line. are together = 9! 2! correspondingly for B1B2&C1C2
n[(A1A2)  (B1B2)] denotes when 2 Americans and 2
P Q Britishmen are together
Fresh line
= 8! × 2! × 2!
But when we select P first then Q and Q first then P we
correspondingly same for others.
get same line.
n[(A1A2)  (B1B2)  (C1C2)] denotes when 2 Americans,
n
C  n 2C 2 2 Britishmen and 2 Chinese are together
 2 Fresh lines
2
= 7! × 2! × 2! × 2! = 86

47
MATHS FOR JEE MAINS & ADVANCED

Put values we get

13  4 1 16
n(A1A2  B1B2  C1C2) R, S, G, B in = C3 ways
13 . 3
= 9! × 2! × 3 – 8! × 2 × 2 × 3 + 8!
In 16C3 ways, we have to remove undesirable ways,
= 8!(43)
when R > 5
These are undesired ways
Undesirable ways : R > 5  R  6
Desired ways = 10! – 8! (43) = 8!(47) give at least 6 to R and 2 to S and distribute remaining
between R, S, G, B
(ii) Now they are on a round table
15 – (2 + 6) = 7 remaining can be distributed between R,
Total ways = (n – 1) ! = (10 – 1) ! = 9 !
7  4 1 10
Undesired ways : S, G, B in = = C3 ways
7. 4 1
n(A1A2  B1B2  C1C2)
10
= 8! × 2! × 3 – 7! × 2! × 2!× 3 + 6! × 2! × 2! × 2! C3 are the undesirable cases
= 6! × 4 [7 × 2 × 2 × 3 – 7 × 3 + 2] Desired ways = 16C3 – 10C3 = 440

= 6! × 260 10. (i)Without changing the order of the vowels of MULTIPLE

Desired ways = 9! – 6! × 260 So we choose the first three place in 8C3 ways
= (244) 6! ways 8! 5! 8!
and the rest are arranged is  = = 3360
3!5! 2! 3!2!
8. (i) Vowels Consenents
  Hence required no. is 3360 – 1 = 3359
3 5 (ii) Keeping the position of each vowel fixed M_LT_PL_
3
C2 . 2! 6! = 6 × 6! = 4320
5!
Number of ways = = 60
2
(ii) G H other ways = 60–1 = 59
Start with G end with H
6! = 720 (iii) without changing the relative order/position of
vowels & consonants
(iii) GHT 5!
so number of ways is =  3! = 60 × 6 = 360
3! 6! = 6 × 6! = 4320 2!
Hence required number is = 360–1 = 359
(iv) – – – – –  5! . 6C3 . 3!
6 gap 13. Husband – H, Wife – W
(v) Same as above Given :
Relatives of husband (H) (a) Ladies (LH) = 4
(vi) – – – – – – – – 4C3 . 3! . 5! (b) Gentlemen (GH) = 3
(vii) – – – – – – – – 8C3 . 1 . 5! = 8C3 . 5! = 6720 Relatives of Wife (W) (a) Ladies (LW) = 3
(b) Gentlemen (GW) = 4
(viii) 3! . 5! = 720
Case 1 : Selecting (3LH) and 3(GW)
3
(ix) C2 . 5C3 . 5! = 3.10 . 5! = 120 × 30 = 3600 ways : 4
C3 × 4C3 = 16
9. Distribute 15 candies among. Case 2 : Selecting (3GH) and 3(LW)
3
ways : C3 × 3C3 = 1
Ram (R) + Shyam(S) + Ghanshyam(G) + Balram(B)
Case 3 : Selecting (2LH & 1GH) & (1Lw & 2Gw)
with condition given : R+S+G+B=15 & R 5 & S  2 ways : 4
C2 × 3C1 × 3C1 × 4C2 = 324
After giving 2 to Shyam, remaining candies 15–2=13 Case 4 : Selecting (1LH & 2GH) & (2LW & 1Gw)
4
ways : C1 × 3C2 × 3C2 × 4C1 = 144
Now distribute 13 candies in
Add all cases we get : 485 ways

48
 PERMUTATION AND COMBINATION

15. 2 clerks who prefer Bombay are to be sent to 22. Ordered pair = total – (A  B = X) = 4 n – 3n
2 different companies in Bombay, and Out of remaining 5 Subsets of X = 2 n will not repeat in both but here the
clerks (excluding 3 clerks who prefer for outside) 2 clerks whole set X has not been taken
are chosen in 5C2 ways. So subsets of x which are not repeated (2 n – 1)
Now these 4 can be sent to 2 different companies into 2 (4n  3n )  (2n  1)
groups of 2 each in 4C2 ways Hence unordered pair = + (2n – 1)
2
5
 C2 × 4C2 23. Total No. of bowlers = 6
Now for outside companies we have 6 clerks remaining Now,
we select them as (2 for each company) (i) If 4 bowlers are including the no. of ways
6 4
C2 × C2 × C2 2 selecting 11 players out of 15 players
= 6C4 × 9C7 = 15 × 36 = 540
Desired ways = (5C2 × 4C2) (6C2 × 4C2 × 2C2) = 5400 ways.
(ii) If 5 bowlers are selected = 6C5 × 9C6 = 6 × 84 = 504
16. Total students n(A  B  C) = 100 (iii) If all 6 bowlers are selected = 6C6 × 9C5 = 1 × 126 = 126
Students reading Business India = n(A) = 80 Hence total no. of ways = 540 + 504 + 126 = 1170
Students reading Business World = n(B) = 50
25. 1980 = 22 . 32 . 5 . 11,
Students reading Business Today = n(C) = 30
number of divisiors of 1980 = 36
Students reading all the three magazines = n(ABC) = 5 (i) 3.3.2 = 18
sum = 11.(1 + 2 + 22)
A B
. (1 + 3 + 32)
. (1 + 5)
(ii) 3.2 + 1.1.2 = 8
C

Hence students reading exactly two magazines

= n(A) + n(B) + n(C) – n(A  B  C) – 2 × n(A  B  C)
= 80 + 50 + 30 – 100 – 2 × 5 = 50

19. (a) Selection of r things out of n +1 different things

= Selection of r things out of n +1 different things, when
a particular thing is excluded + a particular thing is
included.
(b) Selection of r things out of not m + n different Things
can be made by selecting x thing from m and y thing
from such that x +y = r
& (x, y) = (0, r), (1, r – 1), (2, r – 2), .......(r, 0)

21. Step 1st : Arrange 5 boys in 5! ways

Step 2 nd : Select 2 gaps from 6 gaps for 4 girls
(2 girls for each gap) in 6C2 ways.
Step 3rd : Select 2 girls to sit in one of the gaps and other
2 in remaining selected gaps = 4C2 ways
Step 4th : Arrange 1st, 2 girls in 2! and other 2 in 2! ways
Hence, total ways 5! × 6C2 × 4C2 × 2 × 2 = 43200

49
MATHS FOR JEE MAINS & ADVANCED

EXERCISE - 5 14. The no. of ways to select 4 novels & 1 dictionary from
Part # I : AIEEE/JEE-MAIN 6 different novels & 3 different dictionary are 6C4 × 3C1
and to arrange these things in shelf so that dictionary is
1. Numbers greater than 1000 and less than or equal to 4000 always in middle _ _ D _ _ are 4!
Required No. of ways 6C4 × 3C1 × 4! = 1080
will be of 4 digits and will have either 1 (except 1000) or
2 or 3 in the first place with 0 in each of the remaining 15. Urn A  3 Red balls
places. Urn B  9 Blue balls
So the number of ways = selection of 2 balls from
After fixing 1st place, the second place can be filled by urn A & B each.
any of the 5 numbers. Similarly third place can be filled = 3C2 . 9C2 = 108
up in 5 ways and 4th place can be filled up in 5 ways.
Thus there will be 5 × 5 × 5 = 125 ways in which 1 will be 16. B1 + B2 + B3 + B4 = 10
in first place but this include 1000 also hence there will Statement - I
be 124 numbers having 1 in the first place. Similarly 125 B1  1, B2  1, B3  1, B4  1
for each 2 or 3. One number will be in which 4 in the first so no. of negative integers solution of equation
place and i.e. 4000. Hence the required numbers x1 + x2 + x3 + x4 = 10 – 4 = 6
6 + 4 – 1C = 9C
are 124 + 125 + 125 + 1 = 375 ways. 4–1 3
Statement - II
2. We know that a five digit number is divisible by 3, if and
Selction of 3 places from out of
only if sum of its digits ( = 15) is divisible by 3. Therefore 9 places = 9C3
we should not use 0 or 3 while forming the five digit Both statements are true and correct explaination
numbers. Now,
10  9  8 6  5  4
(i) In case we do not use 0 the five digit number can be 17. N = 10C3 – 6C3 = 
3  2 1 3  2 1
formed (from the digit 1, 2, 3, 4, 5) in 5P5 ways. = 120 – 20 = 100
(ii) In case we do not use 3, the five digit number can be N  100
formed (from the digit 0, 1, 2, 4, 5) in 18. W10, G9, B7
5
P5  4P4 = 5 !  4! = 120  24 = 96 ways. selection of one or more balls
 The total number of such 5 digit number = (10 + 1) (9 + 1) (7 + 1) – 1
= 5P5 + (5P5  4P4) = 120 + 96 = 216 = 11 × 10 × 8 – 1 = 879
4. No. of ways in which 6 men can be arranged at a round 19. (A, B)
table = (6  1)! 
Now women can be arranged in 6! ways. 2×4=8
8C + 8C + ..... + 8C = 28 – 8C – 8C – 8C
Total Number of ways = 6! × 5! 3 4 8 0 1 2
= 256 – 37 = 219
5. As for given question two cases are possible
(i) Selecting 4 out of first 5 question and 6 out of remaining 20. Tn = nC3
 n+1C3 – nC3 = 10
8 questions = 5C4 × 8C6 = 140 choices
(n + 1) n (n – 1) – n(n – 1) (n – 2) = 60
(ii) Selecting 5 out of first 5 questions and 5 out of remaining n(n – 1) = 20
8 questions = 5C5 × 8C5 = 56 choices. n=5
 Total no. of choices = 140 + 56 = 196 1 1
23. P(E1) = P(E2) =
7. Number of ways to arrange in which vowels are in 6 6
6! P(E1  E2) = P(A shows 4 and B shows 2)
alphabetical order = = 360 1
2!
= = P(E1) . P(E2)
8. Number of ways = n–1Cr–1 = 8–1C3–1 = 7C2 = 21 36
So E1, E2 are independent
10
11. C1+ 10C2 + 10C3 + 10C4 = 385 Also as E1  E2  E3 = 
12! 12! So P(E1  E2  E3)  P(E1. P(E2). P(E3)
12. Number of ways = 3 × 3! = So E1, E2, E3 are not independent.
(4!) .3! (4!)3

50
 PERMUTATION AND COMBINATION

Part # II : IIT-JEE ADVANCED 12 Balls can be distributed as 1, 1, 3 or 1, 2, 2 to each person.

When 1, 1, 3 balls are distributed to each person, then
4. x + y < 21 total number of ways :
x + y  20
x + y  18 ( x > 0 & y > 0) 5! 1
 . .3!  60
Introducing new variable t 1! 1! 3! 2 !
When 1, 2, 2 balls are distributed to each person, then
total number of ways :
x + y + t = 18 x>0 5! 1
 . .3 !  90
y>0 1! 2! 2! 2 !
Now dividing 18 identical things among 3 persons.  total = 60 + 90 = 150
18  3  1 Paragraph for Question 13 and 14 : For an
= 18 + 3 – 1 C3 – 1 = = 190
18 3  1 The first digit should be 1

5. Total number of ways of distributing n2 objects into n For bn

groups, each containing n objects 1
_ _ _ _
_.... _ _1

 n 2 Places 
(n 2 )! (n 2 )!
= .n ! = = integer Last digit is 1. so bn is equal to number of ways of
(n !) n n ! (n !) n
an–1 (i.e. remaining (n – 1) places)
(Since number of ways are always integer) bn = an–1

7. Since, r, s, t are prime numbers. For cn

 Selection of p and q are as under Last digit is 0 so second last digit must be 1
p q number of ways So cn = an–2
r0 r2 1 way bn + c n = a n
1 2
r r 1 way So an = an–1 + an–2
2 0 1 2
r r ,r ,r 3 ways Similarly bn = bn–1 + bn–2
 Total number of ways to select r = 5 13. (B)
s0 s4 1 way a1 = 1, a2 = 2
s1 s4 1 way
So a3 = 3, a 4 = 5 a5 = 8
2 4
s s 1 way
 b6 = a 5 = 8
s3 s4 1 way
4 0 1 2 3 4 14. (A)
s s,s,s,s,s 5 ways
 Total number of ways to select s = 9. an = an–1 + an–2
Similarly total number of ways to select t put n = 17
= 5 number of ways = 5 × 9 × 5 = 225. a17 = a16 + a15 (A) is correct
cn = cn–1 + cn–2
11. (D)
So put n = 17
Case- I : The number of elements in the pairs can be
1,1; 1,2; 1,3,; 2,2 c17 = c16 + c15 (B) is incorrect
C2 . 2C2 4 bn = bn–1 + bn–2
4 4 3 4 3
= C2 + C1 × C2 + C1 × C3 + = 25 put n = 17
2
Case- II : Number of pairs with  as one of subsets b17 = b16 + b15 (C) is incorrect
4
= 2 = 16 a17 = a16 + a15
 Total pairs = 25 + 16 = 41 while (D) says a17 = a15 + a15 (D) is incorrect

51
MATHS FOR JEE MAINS & ADVANCED

MOCK TEST
2 ( m + nCm) . (m  1)! (n  1)!
2 2
1. (C)
(m  n)!
B1

B2

B3
 .........
B9
  2. (m  n)! (m  1)! (n  1)! = 2.
10 10 10 10 m! n! 2 2 4mn

Selectio n of atleast one bo ok 7. (A)

(10  1)(10  1)......(10  1) 6!

 – 1 = 11 9 – 1 Number of ways = × 2 = 30
9 times 2!  4!

2. maximum size of square can be 8 x 8 8. For P  If same species are different

8 Total number of arrangements is
n
so required no. of square be  (16  r) (9  r) P 2 . (m + n – 2) !
For Q  If same species are alike then number
r 1
8 (m  n  2)!
of arrangement is
=  r 2  25 r  144  456 m!.(n  2)!
r 1 P
3. (C) Hence = nP2 . m! . (n – 2)! = nP2 . mPm . (n – 2)!
Q
arrangem 9. (C)
Dashes dots
ents S1 : 1! = 1
7
5 2 C2 1! + 2! = 3
7 1! + 2! + 3! = 9
4 3 C3 1! + 2! + 3! + 4! = 33
7
3 4 C4 1! + 2! + 3! + 4! + 5! = 153
7
further in every number unit digit is 3 so it can’t
2 5 C5 be a perfect square.
1 6 7
C6 Hence only possible values are x = 1 or x = 3
7
0 7 C7 S2 : Total – both together
11 C – 9C = 378
5 3
= 7C2 + 7C3 + 7C4 + 7C5 + 7C6 + 7C7 = 27 – 8 = 120
S3 : 1 2 3 3 4
or 5 x 9 – x
4. Team X will win if it wins (m + r)th match and  
4! 2 ways 10 ways
wins m – 1 match from the first m + r – 1 matches , 2!
ways

m 2m
Cm Hence 12 × 2 × 10 = 240
so total no. of ways =  m  r 1 C m 1
=
2 S4 : (i) One digit number
r 0
number of 3’s = 1.
5. (C) (ii) Two digit number
Maximum no. of triangle one 3’s _ 3 + 3 _ = 8 + 9 = 17
two 3’s 3 3 = 2
3p(3p  1)(3p  2)  3p(p  1)(p  2)
=  number o f 3 ’s in two digit
6 numbers is 17 + 2 = 19
p (iii) Three digit numbers one 3’s
= [9p 2 – 9p + 2 – p 2 + 3p – 2] = p [4p2 – 3p] 3__+_3_+__3
2
= 9.9 + 8.9+8.9 = 225
= p 2 [4p – 3] two 3’s 33_ + 3 _ 3 + _3 3
= 2(9+9+8) = 26.2 = 52
6. First we select m friends for one table is three 3’s 333 = 3.1 = 3
m+n
Cm and select a table by 2C1 ways.  number of 3’s in three digit numbers is
Now total number of arrangements is 225 + 52 + 3 = 280
Hence answer is 1 + 19 + 280 = 300

52
 PERMUTATION AND COMBINATION

CaseIII : If selected one card each of number –1

10. and 1 and 4 cards of no. 0.
6!
There are 2M, 2T, 2A and 1 H, E, , C, S so no. of arrangement is = 30
1! 1! 4!
First find the number of ways if odd’s no. position
place be filled is 5p 3 = 60 Case IV : If all cards selected fram the no. 0
Now Case  If even place words is same i.e no. 6!
So no. of arrangement is =1
of ways = 3 6!
Case  If even place words is different i.e no. of Hence total no. of arrangement is
ways = 3c2 × 2! = 6 20 + 90 + 30 + 1 = 141
Hence total no. of arragment is 60 × (3 + 6) = 540
13. (A)
11. First find no. of ‘2’ at the end of (125)! is
two 2’s five 1’s
125  125  125  125  125  125  125  two 2’s four 1’s one 3
(A)  2    22    23    24    25    26    27 
              two 2’s three 1’s two 3’s
= 62 + 31 + 15 + 7 + 3 + 1 + 0 = 119 two 2’s two 1’s three 3’s
Find the number of ‘5’ at the end of (125)! two 2’s one1 four 3’s
two 2’s five 3’s
125  125  125   7!
is     + ...... 7! 7! 
 5   52   53  = 2    = 672
 2! 5! 2! 4! 2! 3! 2! 
= 25 + 5 + 1 = 31
Hence no. of zero is 31 14. (D)
(B) Total no. of signals can made by each arm D P M L can be arranged in 4 ! ways & the two
= 10 so total number of different signals can be gaps out of 5 gaps can be selected in 5C2 ways.
formed = 10 10 – 1 {A A and E E} or {A E and A E} can be placed in 6
(here – 1 is because if all arms are at the ways.
Total = 4 !. 5C2. 6 = 1440
position of rest, then no signal will pass away)
15. (A,D)
(C) 4
All AAAAA BBB D EEF can be arranged in
5 12!
ways
5! 3! 2!
5! 5!
= 60 Between the gaps C can be arranged in 13C3 ways
2! 2!.2! = 30
12!
Total number of arrangement = 90 Total ways = 13C3 ×
5!  3!  2!
(D) Let number of player is n
then total number of games is nc2 = 5050 Number of ways
= without considering separation of C – in which
 n = 101
all C's are together – in which exactly two C's are
12. Here the sum of the numbers are vanishes of six 15! 13! 12! 13
together = 2 – – C2
cards i.e 5!(3!) 2! 5! 3! 2! 5! 3!
Case I If selected 3 cards each of number –1 or 1 16. (D)
6!
i.e The number of arrangement = = 20 1 
3! 3! If    = 0
 3 50 
Case II : If selected 2 cards each of no. –1, 0 or 1 i.e
1 
6!  0   <1
number of arrangement = = 90 3 50
2! 2! 2!

53
MATHS FOR JEE MAINS & ADVANCED

1  2 50 2
 number of ways = 25
 –   or –   3m gives 3 at unit place if m = 4k + 1
3 50 3 3 3
 1 33  these are 5 in number
n
7 gives 7 at unit place if n = 4 + 1
1   1   these are 5 in number
If  3  50  = 1, 1  3 + 50 < 2
   number of ways = 25
2  5 3m gives 7 at unit place if m = 4k + 3
  
3 50 3  these are 5 in number
n
7 gives 3 at unit place if n = 4 + 3
100 250
   these are 5 in number
3 3
 number of ways = 25
 34  83 m
3 gives 9 at unit place if m = 4k + 2
 E = (0 + 0 + 0 .... + 33 times ) +
 these are 5 in number
(1 + 1 + 1 + ...... + 17 times )
= 0 + 17 = 0 + 17 7n gives 1 at unit place if n = 4
= 17 (which a prime number)  these are 5 in number
17. (A)  number of ways = 25
Sum of the digits in the tens places  total number of ways = 100
= sum of the digits in the unit’s place  statement-1 is true
= (4 – 1)! (2 + 3 + 4 + 5) statement-2
= 6.14 = 84 if m = 4k + 2, then 3m gives 9 at units place
18. (D) if n = 4, then 7n gives 1 at units place
A = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29}  statement-2 is true but does not explain
Two different numbers for numerator and denomi- statement-1
nator from these can be obtained in 10P 2
p q 21. (A)  (r), (B)  (t), (C)  (s), (D)  (p)
= 10.9 = 90 ways and if p or q = 1
(a) Two cases
(If numerator and denominator same) 5!
 Number of ways = 90 + 1 = 91 (i) 5, 4, 1, 1, 1 = 20
3!
19. (A) 5!
Number of numbers formed by using 1, 2, 3, 4, 5 is (ii) 5, 2, 2, 1, 1 = 30
2! 2!
= 5! = 120
Total 20 + 30 = 50
Number of numbers formed by using 0, 1, 2, 4, 5 is
= 4.4.3.2.1 = 96 (b) 5 ! – D 5 – 5 . D 4.
Total number of numbers formed, which are (D5 stands for dearrangements of 5 things)
divisible by 3 (taking numbers without repitition) = 120 – 44 – 5 × 9 = 31
is = 216 (c) 1000 – 93 – 92 – 9 = 181
STATEMENT 1  Incorrect
1
STATEMENT 2  Correct (d)
15
 i . j
1 i  j  9
20. (B)
3m gives 1 at unit place if m = 4k 1  
2 2 2
 these are 5 in number =    i . j  (1  2  ......  9 
15 1 i  j 9 
7n gives 9 at unit place if n = 4 + 2
 these are 5 in number

54
 PERMUTATION AND COMBINATION

24.
1  (1  2  ........  9)2  (12  22  ...  92 ) 2 2 
=   (1  2  ...  92 ) 1. (D)
15  2  3 1 1  3C
1
2 2 1  3C
1
1   9  10  2 9  10  19   3C + 3C = 6
=     = 77 1 1
30   2  6 
2. (B)

22. (A)  (r) ; (B)  (s) ; (C)  (q) ; (D)  (p)

(A) Select m out of n = nCm 5!
number of ways of arranging in 3 1 1  = 10
3!1!1! 2!
increasing order = 1
Hence nCm 5!
2 2 1  = 15
1! 2! 2! 2!
(B) A monkey has m choice  10 + 15 = 25
m  m  ..m
  = mn 3 (A)

n times 3 1 1  1
(C) Arrange (m –1) green balls then out of 2 2 1  1
 1+1=2
m gaps select n positions for red balls
and arrange red balls = 1. mCn . 1 25.
= mCn 1. (B)
n
 n 
..n Since n = 4
(D) = nm  Number of matched arrangements
m times
8
8! C4
23. = =
4! 5! 5
1 (B)
Since there are 5 even places and 3 pairs of re- 2. (A)
peated letters therefore at least one of these must n=3
be at an odd place.  Number of matched arrangements

11 ! 6!
 the number of ways = =
2! 2 ! 2 ! 3!4!

6!
2 (A) Total number of arrangements =
3!3!
Make a bundle of both M's and another bundle
of T's. Then except A's we have 5 letters remain- 1
ing so M's, T's and the letters except A's can be  probability =
4
arranged in 7 ! ways
3. (B)
 total number of arrangements = 7 ! × 8C2
Since first pair is matched and it can be done
in 1 way
3 (A)
 for mismatched pairs n = 4
7!  Number of mismatched pairs = 8C5
Consonants can be placed in ways
2!2! 26. Here, we note the following.
1. A door will open if it face odd no of changes.
Then there are 8 places and 4 vowels
2. No. of changes faced by any door will be equal
7! 8 4! to no. of factors of the door no.
 Number of ways = . C4
2!2! 2! 3. So only those door will open, whose number is
perfect square so ans is  n ,
[where [ ] denotes the G.I.F.]

55
MATHS FOR JEE MAINS & ADVANCED

27. (16)
Now No. of solution of equation (2) is
10 IIT students T 1, T 2,..... T 10 can be arranged in
= Co-efficient of x20 in (x3 + x6 + x9 + ....) ×
10 ! ways. Now the number of ways in which two
(x2 + x4 + x6 + ....) × (x + x2 + x3 + ...)
PET student can be placed will be equal to the
number of ways in which 3 consecutive IIT = Co-efficient of x in (1 + x3 + x6 + x9 + ....)
14

students can be taken i.e. in 8 ways and can be (1 + x2 + x4 + -....) × (1 + x + x2 +....)

arranged in two ways  (10!) (8) (2!). = (1 + x + x + x + x5 + 2x6 + x7 + 2x8 + 2x9
2 3 4

Alternatively 3 IIT students can be selected in +2x10 + 2x11 + 3x12 + 2x13 + 3x14 + 3x15 + ....)
10
C3 ways. Now each selection of 3 IIT and 2 PET (1 + x + x2 + x3 + .......)
students in P 1 T 1 T 2 T 3 P 2 can be arranged in (2 !) = Co-efficient of x14 is 1 + 1 + 1 + 1 +1 + 2 +1
(3!) ways. Call this box X. Now this X and the + 2+2+2+2+3+2+3
remaining IIT students can be arranged in 8! ways = 24
 Total ways 10C3 (2 !) (3 !) (8 !) But x , y and z are arranged in 3! ways
So Required no of solution = 24 × 6 = 144
28. In one round, marked numbers are 1, 16, 31, ..., 991
 67 numbers
In second round marked numbers are 6, 21, 36, ..., 996
 67 numbers
In third round marked numbers are 11, 26, 41, ..., 986
 66 numbers
the next number will be 1 which has already been
marked
 total marked numbers = 67 + 67 + 66 = 200
 unmarked numbers = 1000 – 200 = 800
29. (4)
Make 1 group of 2 persons, 1 group of 4
persons and 3 group of 3 persons among 15
persons (except 2 particular persons)
15!
hence by grouping method =
2! 4! (3!)3 3!
Now we add that 2 person in the group of 2
persons and thus number of arrangement of these
groups into cars and autos is
15! 15!
× 2! × 3! =
3
2! 4! (3!) 3! 4! (3!)3
30. The given equation is x + y + z = 20 .........(1)
We have to find the number of different values
of x, y, z
Such that x  y  z and x, y, z  1
Let us assume that x < y < z
and x = x1, y – x = x2 and z – y = x3
then x = x1 ; y = x1 + x2 and z = x1 + x2 + x3
also x1 , x2 , x3  1
Substitution these values in (1) we get
3x1 + 2x2 + x3 = 20 ..........(2)
Where x1 , x2 , x3  1

56