PERMUTATIONS & COMBINATIONS

Unit - 5
PERMUTATIONS & COMBINATIONS
Important definitions and results

1. (a) Permutation means arrangement.

(b) Combination means selection.
If order or objects is to be taken into account, then it is a case of permutation and if order of
objects is not to be taken into account, then it is a case of combination.
Example:
1. If numbers are to be formed with digits, then the order of digits is to be taken into account
because change of order of digits in any number may result in the change of number. For
example if we have to form numbers of 3 digits with the digits 1, 2, 3, 4, 5, then one such
number is 124 and if the order of digits is changed another number with the same digits 1,
2, 4 is 421 which is different from the number 124. Thus making numbers with digits is a
case of permutation of digits.

2. If triangles are to be formed with five points A, B, C, D, E in a plane, then for this we have
to select 3 points. But change of order of points does not result in change in triangle. Thus
triangle formed with points A, B, C is the same as the triangle formed by points B, C, A.
Thus making triangles with points is a case of combination.

3. If 5 persons are to be seated in a row it is a case of permutation of persons because

change of order of persons will result in different seating arrangement.

4. If 2 things are to be given to a person out of 4 different things, then it is a case of

combination because order of things given to the person is immaterial. For example if the
person is given two things A and B or B and A, it is the same thing.
Thus distribution of things among persons is a case of combination.
Summary: If order of objects is to be considered, it is a case of permutation and if order is
not to be considered, it is a case of combination.

2. Fundamental principle of counting:

(a) Multiplication Rule : If a work is done if and only if all of a number of works are done,
then the number of ways of doing this work = product of number of ways of doing all the
works.

Illustration:
1 a
Q
P b R
c
2
The number of ways to go from P to R = (the number of ways to go from P to Q) × (the
number of ways to go from Q to R) = 2 × 3 = 6
(b) Addition Rule: If a work is done if and only it exactly one of a number of works is done,
then number of ways of doing this work = sum of number of ways of doing all the works

C
Side II
Side I

A
Room D
B E
Illustration:
If a room has 5 doors 2 on one side and 3 on the other side, then number of ways to go
out = number of ways to go out from one side + number of ways to go out from other
side =2+3=5
Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
1
PERMUTATIONS & COMBINATIONS

3. Factorial of a Positive Integer:

(a) Def.: The product n (n – 1) (n – 2) ….3 . 2. 1
is denoted by the symbol n or n! and is read as ‘Factorial n’.
Thus, n or n! = n (n –1) (n – 2) ….3 . 2 . 1
= 1 . 2 . 3 …(n – 2) (n – 1) n
=Product of n consecutive positive integers beginning with 1.
We will take 0 = 1

(b) Cancellation of factorial:

10 n +1 1
= 10 × 9 × 8; =
7 n + 4 (n + 4) (n + 3) (n + 2)

4. Permutations:
(a) Number of permutations (or arrangements) of n different things taken r at a time is denoted
n!
by nPr and is given by
n
Pr =
( n – r )!
(b) Ist 2nd 3rd rth place

n (n – 1) (n – 2) (n – r + 1)
n
Pr = n (n – 1) (n – 2)....[n – (r – 1)] = n (n – 1) (n – 2).... to r factors
Examples:
10
P3 = 10  9  8
20
P5 = 20  19  18  17  16

(c) Number of permutations (or arrangements) of n different things taken all at a time = n !

(d) Number of permutations of n things out of which p are alike (identical) and are of one type,
q are alike and are of second type, r are alike and are of third type and rest are all different
n
=
pqr
Illustration: ‘Vice chancellor’
Total number of letters = 14
c occurs thrice, e occurs twice and l occurs twice
14!
 total number of arrangements (permutations) of the word vice chancellor =
3! 2! 2!
(e) Number of permutations of n different things taken r at a time when repetition is allowed =
n × n × n × ….to r factors = nr.

5. Combinations:
(a) Number of combinations (selections) of n different things taken r at a time is denoted by
n!
n
Cr and is given by
n
Cr =
r! (n – r)!
(b) Number of permutations of r things out of n things = [number of selections (combinations)
of r things out of n things] × [number of arrangements of r selected things among
themselves]

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
2
PERMUTATIONS & COMBINATIONS

n
Pr
(c) Pr = C r . r and C r =
n n n

r
(d) Number of selections of r things out of n identical things = 1 (for r = 1, 2, 3,…., n)

6. Properties of nCr:
(a)
n
C r + n C r –1 = n +1 C r (b)
n
C x = n C y  x = y or x + y = n

(c)
n
Cr = n Cn –r (d) r . n C r = n . n –1C r –1
n
C r n +1 C r +1 n
Cr n – r +1
(e) = (f) =
r +1 n +1 n
C r –1 r
n
(g) When n is even, for nCr to be greatest r = , when n is odd, for nCr to be greatest
2
n +1 n –1
r= or
2 2

7. Circular Permutations:
(a) In figure (i) all the 4 arrangements are same but in figure (ii), the four arrangements are
different.
C B

D B C A

A D
(i) (ii)
A B C D AD A
B B
C CD
A D

B D A C

 
C B
(iii) (iv)
C D A B B C D A
1
Number of circular arrangements of n different things = (number of linear
n
1
arrangements of n different things) = . n = n –1
n
Clockwise and anticlockwise arrangements:
Result: When clockwise and anticlockwise arrangements are not different, i.e. when
observation can be made from both sides, then the number of circular arrangements of n
n −1
different things =
2
C C Y Y

D B B D B G G B

A A R R

8. (a) Number of selections (combinations) of r things out of n different things

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
3
PERMUTATIONS & COMBINATIONS

(i) when p particular things are always included = pCp .n – pCr – p= n – pCr – p
(ii) when p particular things are excluded = n – pCr
(iii) number of selections of r things out of n different things such that all the p particular things
n–p
are not together in any selection = C r –
n
C r–p
9. (a) Number of selections of r consecutive things out of n things in a row = n – r + 1
(b) Number of selections of r consecutive things out of n things along a circle =
n , when r  n

1, when r = n
Selection of 2 consecutive things out of 5 things A, B, C, D, E along a circle is AB, BC, CD,
DE, EA
Number of such selections = 5
Selections of 3 consecutive things
ABC, BCD, CDE, DEA, EAB
Number of such selections = 5
Selection of 5 consecutive things out of 5 things along a circle is ABCDE
Number of such selection = 1

10. Selection of things: When minimum and maximum number of things to be selected are
known:
(a) number of selections of zero or more things out of n different things
= C 0 + C1 + C 2 + .... + C n = 2
n n n n n

(b) number of selections of one or more things out of n different things

= C1 + C 2 + C3 + .... + C n = 2 – 1
n n n n n

(c) number of selections of zero or more things out of n identical things = n + 1 (since
selection of r things out of n identical things can be made in 1 way)
(d) number of selections of one or more things out of n identical things = n
(e) number of selections of one or more things out of (p + q + r) things, out of which p things
are identical and are of one type, q things are identical and are of second type and r
things are identical and are of third type = (p + 1) (q + 1)(r + 1)–1
(f) number of selections of one or more things out (p + q + r + n) things out of which p are
identical and are of one type, q are identical and are of second type, r are identical and
arc of third type and rest n are different
= (p + 1)(q + 1)(r + 1) (nC0 + nC1 +…+ nCn)–1
= (p + 1) (q + 1) (r + 1) 2n – 1

11. Distribution of things among sets (groups) and persons:

(a) number of ways of dividing n different things in 3 sets containing x, y and z things, where
x, y, z are distinct and x + y + z = n
n–x n
n
= Cx . C y . n–x–yCz =
xyz
(b) number of ways of distributing n different things among 3 persons such that they get x, y,
z things

n n–x n–x–y
n
= ( Cx . Cy . Cz ) 3 = 3
xyz
(c) number of ways of dividing n different things in 5 sets having a, b, c, d, e things (a + b +
c + d + e = n)

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
4
PERMUTATIONS & COMBINATIONS

n
= , where a, b, c, d, e are distinct
abcde
n
= , when two sets have equal number of things and 3 sets have equal
a bcde23
number of things
n
= when all the 5 sets have equal number of things.
a b c d e. 5
(d) Number of ways of distributing among 5 persons
n
= 5 , when a, b, c, d, e are distinct
abcde
n
= . 5 , when 2 persons get equal number of things and 3 get equal number
a bcde23
of things
n
= . 5 when all the 5 persons get equal number of things
a bcde5

Illustration:
1. Dividing 4 different things A, B, C, D into 2 sets one having 1 thing and second set
having 3 things

Set I Set II No. of ways

A B, C, D
B A, C, D 4
4 = 4C1 . 3C3 =
31
C A, B, D
D A, B, C

Distribution of 4 different things among 2 persons such that one person gets 3 things and
other gets one things

Person I Person II No. of ways

A B, C, D
B A, C, D
C A, B, D
D A, B, C 4
8 = (4C3 . 4C1) 2 = .2
31
B, C. D A
A, C, D B
A, B, D C
A, B, C D

2. Dividing 4 different things A, B, C, D among two sets each having 2 things

Set I Set II No. of ways
(i) A, B C, D
(ii) A, C B, D

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
5
PERMUTATIONS & COMBINATIONS

(iii) A, D B, C 4
C2 . 2C2 4
3= =
2 ( 2 2 2)
(iv) B, C A, D
(v) B, D A, C
(vi) C, D A, B

Here sets in (i) and (vi) are same, sets in (ii) and (v) are same sets in (iii) and (iv) are same
Distribution of 4 different things among 2 persons such that each gets 2 things

A, B C, D
A, D B, C (4 C2 . 2C2 ) 2
6=
2
B, C A, D 4
= 2
222
A, C B, D
B, D A, C
C, D A, B
12. Combinations with Repetitions:
(a) The number of combinations of r things out of n things of which p are of one kind, q are of
second type, s are of third kind and so on.
= coeff. of xr in [(1 + x + x2 + …+ xp) (1 + x + x2 + ….xq) (1 + x + x2 + ….+ xs) …]
Explanation:
Let the different things be denoted by the letters a, b, c ….
Now we consider the continued product
(1 + ax + a2x2 + ….+ apxp) (1 + bx + b2x2 + …+ bqxq) (1 + cx + c2x2 + ….+ csxs)….
It is clear that all the terms in the product is of the same degree in the letters a, b, c as in x.
Also the coefficient of xr in the product is the number of ways of taking r of the letters a, b, c
…with the restriction that maximum number of a’s is p, maximum number of b’s is q, maximum
number of c’s is s and so on.
But the coefficient of xr in the product will not change if we take a = b = c = ….= 1.
Thus the number of combinations of r things out of n things of which p are alike and are of one
kind, q are alike and are of second kind s are alike and are of third kind and so on.
= coeff. of xr in [(1 + x + x2 + …+ xp) (1 + x + x2 + ….+xq) (1 + x + x2 + …+ xs)] …

(b) Number of combinations of r things out of n things of which p are alike and are of one kind,
q are alike and are of second kind and rest (n – p – q) things are all different.
= coeff. of x in [(1 + x + x + ….+ x ) (1 + x + x + ….+ xq)
r 2 p 2

{(1 + x) (1 + x) ….to (n – p – q) factors)}

= coeff. of xr in [(1 + x + x2 ….+ xp) (1 + x + ….+ xq) (1 + x)n – p – q]
(c) Number of selections of r things out of n things of which p are alike and are of one kind, q
are alike and are of second kind, s are alike and are of third kind when each things is taken
at least once
=coeff.of xr in[(x+ x2+ x3 +…+ xp)(x + x2 + x3+…+ xp)(x + x2+ x3+ …+ xs)]
= coeff.of xr–3 in[(1+x + x2 +…+ xp–1) (1+ x+ x2+…+ xq–1)(1+ x + x2 +…+xs–1)
n n(n – 1) 2
(d) (i) If n is a negative integer, then (1 + x)n = 1 + x + x + ...to 
1 2
(ii) If n is a positive integer, then
(–n ) (–n )(−n – 1) (–n ) (–n–1)(–n–2)
(1 + x )–n = 1 + (x ) + (– x )2 + (– x )3 + ...to 
1 2 3
Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
6
PERMUTATIONS & COMBINATIONS

n n (n + 1) 2 n (n + 1)(n + 2) 3
=1+ x+ x + x + ...to 
1 2 3
= 1 + nC1x + n+1C2x2 + n+2C3x3 + …. To 
 Coeff. of xr in (1 – x)–n = n + r – 1Cr

(e) Number of ways in which r identical things can be distributed among n persons when each
persons can get zero or more things.
= coeff. of xr in (1 + x + x2 + …+ xr)n
n
 1 – x r +1 
= coeff. of xr in  
 = coeff. of xr in [(1 – x r+1 ) n (1 – x) – n ]
 1 – x 
= coeff. of xr in (1 – x)–n
{Leaving terms containing powers of x greater than r}
= n + r – 1Cr
Explanation: Distribution of 4 identical things among two persons when each person gets
at least one thing
Person Person No. of ways
I II
things
No of

1 3 1×1=1
2 2 1×1=1
3 1 1×1=1
 Reqd. No = 3
Let power of x denote the number of things given to persons. Here each person will get
minimum one thing and maximum 3 things.
Now (x1 + x2 + x3) (x1 + x2 + x3)
= (x1x1 + x2x1 + x3x1) + (x1x2 + x2x2 + x3x2) + (x1x3 + x2x3 + x3x3)
= x2 + 2x3 + 3x4 + 2x5 + x6
 Reqd. number
= coeff. of x4 in (x1 + x2 + x3)2

(f) Number of non–negative integral solutions of equation

(x1 + x2 + …+ xn) = r
= number of ways of distributing r identical things among n persons when each person can
get zero or more things = n + r – 1Cr
(g) Number of terms in the expansion of (a1 + a2 + a3 + … + an)r
= number of ways of distributing r identical things among n persons when each person can
get zero or more things = n + r – 1Cr
(i) Number of non–negative integral solution of equation
x + 2y + 3z + 4w = n = coeff. of xn in (1 – x)–1(1 – x2)–1(1 – x3)–1(1 – x4)–1
(ii) Number of positive integral solutions of equation
x + 2y + 3z + 4w = n = coeff. of xn–(1 + 2 + 3 + 4) in
[(1 – x)–1 (1 – x2)–1 (1 – x3)–1 (1 – x4)–1]

13. Permutations with Repetitions:

The number of permutations of r things out of n things of which p are of one kind, q are of
second kind and so on = r . coeff. of xr in
 x x2 x p    x x2 x2  
1 + + + ... +   1 + + + ... +  .....
 1 2 p   
 
1 2 q  
Explanation: let the different things be denoted by a, b, c … Consider the product

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
7
PERMUTATIONS & COMBINATIONS

 ax a 2 x 2 a px p   bx b 2 x 2 bq x q 
1 + + + ... + . 1 + + + ... +  ….(i)
 1 2 p   1 2 q 
   
Reqd. number of permutations = sum of all possible terms of the form
r
a p b q ..., where p + q + … = r = r . coeff. of xr in
p q....

 x xp   x x q 
1 + + ... +  1 + + .... +  …
 1 p   1 q  

n

14. (i) Number of rectangles of any size in a square of size n × n = r

r =1
3

and number of squares = r

r =1
2

Explanation: Since r consecutive lines can be selected out of n parallel lines in (n – r + 1)

ways.
No. of selections of n consecutive lines out of n parallel lines = 1
No. of selections of (n – 1) consecutive lines = 2
No. of selections of (n – 2) consecutive lines = 3
… … … …
… … … …
No. of selections of 3 consecutive line s
No. of selections of 2 consecutive lines = n
 No. of rectangles
= [(1 + 2 + …+ n) (1 + 2 + …+ n)]
n

= (1 + 2 + … + n)2 = r
r =1
3

Here 1 × 1 means rectangle of size n × n, n × (n–1) means rectangle of size 1 × 2 etc.

(ii) No. of rectangles of any size in a rectangle of m × n size (n  m)
= (1 + 2 + 3 + ….+ m) (1 + 2 + 3 + …+ n)
m (m + 1) n (n + 1)
= .
2 2
n
No. of squares =  (m – r + 1) (n – r + 1)
r =1
Here (m – r + 1) = no. of selections of r consecutive lines out of m parallel lines and (n – r + 1)
= no of selections of r consecutive lines out of n parallel lines and (m – r + 1) (n – r + 1) = no.
of selections of squares of size r × r

15. If there are n different things and n corresponding places, then the number of ways of putting
(arranging) these things so that no thing occupies its corresponding place.
 1 1 1 1
= n 1 – + – + ... + (–1) n 
 1 2 3 n
If C0 + C1x + C2x2 + …+ Crxr + …
= (a0 + a1x + a2x2 + …) (b0 + b1x + b2x2 + …)
Then equating the coefficients of xr, we get
Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
8
PERMUTATIONS & COMBINATIONS

Cr = a0br + a1br–1 + a2br–2 + …+arb0

16. If p is prime, then exponent of p in n is denoted by Ep (n!) and is given by

n   n   n  n 
E p (n!) =   +   +  3  + ... +  k 
 p  p2  p  p 
where pk < n < pk+1
and [x] denotes the integral part of x.
Example: Exponent of 3 in 100
100  100  100  100 
E 3 (100! ) =   +  2  +  3  +  4  = 33 + 11 + 3 + 1 = 48
 3  3  3  3 

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
9
PERMUTATIONS & COMBINATIONS

PRACTICE AT YOUR HOME

1. If the (n + 1) numbers a, b, c, d,…….. be all different and each of them a prime number, then
the number of different factors (other than 1) of am.b. c.d….. is
(a) (m + 1) 2n (b) (m + 1) 2n – 1 (c) (m + 1) 2n + 1 (d) none of these.

2. Given that n is odd, the number of ways in which three numbers in A.P. can be selected from
1, 2, 3,….., n is
(n + 1) (n − 1) (n + 1) (n − 1)
2 2 2 2

(a) (b) (c) (d)

4 4 2 2

3. The number of rectangles that you can find on a chess board is

(a) 144 (b) 1296 (c) 256 (d) none of these.

4. A letter lock consists of three rings marked with 15 different letters. If N denotes the number
of ways in which it is possible to make unsuccessful attempts to open the lock, then
(a) 482/N and N is product of three distinct prime numbers.
(b) N is product of 4 distinct prime numbers.
(c) N is product of 2 distinct prime numbers.
(d) none of these.

5. Let p be a prime number such that p  23. Let x = p! + 1. The number of primes in the list n
+1, n + 2, n + 3,…., n + p – 1 is
(a) p– 1 (b) 2 (c) 1 (d) none of these.

6. The tens digit of 1! + 2! + 3! +….. + 49! is

(a)1 (b) 2 (c) 3 (d) 4.

7. At an election, a voter may vote for any number of candidates not greater than the number to
be chosen. There are 10 candidates and 5 members are to be chosen. The number of ways
in which a voter may vote for at least one candidate is given by
(a) 637 (b) 638 (c) 639 (d) 640

8. The number of ways in which a mixed double game can be arranged from amongst 5
married couples if no husband and wife play in the same game is
(a) 56 (b) 60 (c) 96 (d) none of these.

p
9. The number of distinct rational numbers x such that 0 < x < 1 and x= , where p,
q
q  {1, 2, 3, 4, 5, 6} is
(a) 14 (b) 15 (c) 12 (d) 11.

10. The total number of 5-digit numbers of different digits in which the digit in the middle is the
largest is
9
(a) 
n =4
n
P4 (b) 35 (3!) (c) 32 (3!) (d) none of these.

11. In a room there are 12 bulbs of the same wattage, each having a separate switch. The
number of ways to light the room with different amount of illumination is
(a) 122 – 1 (b) 212 (c) 212 – 1 (d) none of these

12. The number of proper divisors of 2p.6q.15r is

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
10
PERMUTATIONS & COMBINATIONS

(a) (p + q + 1) (q + r + 1) (r + 1) (b) (p + q + 1) (q + r + 1) (r + 1) – 2
(c) (p + q) (q + r) r – 2 (d) none of these.

13. The number of odd proper divisors of 3p.6m.21n is

(a) (p + 1) (m + 1) (n + 1) – 2 (b) (p + m + n + 1) (n + 1) – 1
(c) (p + 1) (m + 1) (n + 1) – 1 (d) none of these.

14. The number of even proper divisors of 1008 is

(a) 23 (b) 21 (c) 20 (d) none of these.

15. The total number of ways in which a begger can be given at least one rupee from four 25-
paise coins, three 50 paise coins and 2 one-rupee coins, is
(a) 54 (b) 50 (c) 52 (d) none of these.

n +1
16. The number of positive integers satisfying the inequality Cn −2 −n +1 Cn −1  100 is
(a) 5 (b) 8 (c) 9 (d) none of these.

17. The number of positive integers with the property that they can be expressed as the sum of
the cubes of 2 positive integers in two different ways is
(a) 10 (b) 100 (c) 40 (d) .

18. In an examination, the maximum marks for each of three papers are 50 each. Maximum
marks for the fourth paper are 100. The number of ways in which the candidate can score
60% marks in the aggregate is
(a) 110556 (b) 110500 (c) 110356 (d) none of these.

19. India and Sri Lanka play one day international series until one team wins 4 matches. No
match ends in a draw. The number of ways in which India can win the series is
(a) 35 (b) 70 (c) 40 (d) none of these.

20. A class has 21 students. The class teacher has been asked to make n groups of r students
each and go to zoo taking one group at a time. The size of group i.e. the value of r for which
the teacher goes to the zoo, maximum number of times is (no group can go to the zoo twice)
(a) 9 or 10 (b) 10 or 11 (c) 11 or 12 (d) 12 or 13
C
2
C2
21. +1
=
C4
(a) 2 (b) 3 (c) 4 (d) none of these.

22. If one test (on screening paper basis) was conducted on Batch A, maximum number of
marks is (90  3) = 270. 4 students get the marks lower than 80. Coaching institute decided
to inform their guardians, that is why their result card were sent to their home. The number of
ways, in which all the letters were put in wrong envelopes, is
(a) 8 (b) 9 (c) 10 (d) none of these.

23. 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 distributed 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.

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
11
PERMUTATIONS & COMBINATIONS

24. A team from class XII is to be chosen for Maths Quiz. The team can consist of 1 boy and 1
girl. The team is to be chosen from one of the n sections Ai (consisting) of mi boys and ni
girls), i = 1, 2, 3,…4. The number of ways of choosing the team is
(m1 + m2 + .... + mn ) (n1 + n2 + .... + nn )
(a)
m1n1 + m2n2 + ..... + mn nn
n n
(b)  mi n i (c) m n i i (d) none of these.
i =1 2i =1

25. The number of prime numbers among the numbers 105! + 2, 105! + 3, 105! + 4,…105! + 104
and 105! + 105 is
(a) 31 (b) 32 (c) 33 (d) none of these.

100
26. The last two digits in X =  K ! are
K =1
(a) 10 (b) 11 (c) 12 (d) 13.

27. The number of ways in which 3 friends can stay in 2 hotels is

(a) 23 (b) 32 (c) 3P2 (d) none of these.

28. The number of ways in which Mr. A can give 2 hotels to his 3 rows is
(a) 23 (b) 32 (c) 3P2 (d) none of these.

29. There are p, q, r points on three parallel lines L1, L2 and L3 all of which lie in one plane. The
number of triangles which can be formed with vertices at these points is
(a) p+q+rC3 (b) p+q+rC3 - pC3 - qC3 –rC3
p q r
(c) C3 + C3 + C3 (d) none of these.

30. 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 taken from
the letters which appear with repetitions in the same word MATHEMATICS. The number of
different ways in which the five letter word be formed is
(a) 390 (b) 600 (c) 540 (d) 450.
31. In how many ways can 15 members of a council sit along a circular table, when the
Secretary is to sit on one side of the chairman and the Deputy Secretary on the other
side?
a) b) 24
c) d) None of these

32. Eight different letters of an alphabet are given. Words of four letters from these are
formed. The number of such words with at least one letter repeated is
a) b)

c) d)

33. Out of 8 given points, 3 are collinear. How many different straight lines can be drawn
by joining any two points from those 8 points?
a) 26 b) 28 c) 27 d) 25

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
12
PERMUTATIONS & COMBINATIONS

34. Everybody in a room shakes hands with everybody else. The total number of hand
shakes is 66. The total number of persons in the room is
a) 9 b) 12 c) 10 d) 14

35. are the speakers in a conference. If addresses only after , then the
number of ways the speakers address is
a) b) c) d)

36. In a chess tournament where the participants were to play one game with one
another, two players fell ill having played 6 games each, without playing among
themselves. If the total number of games is 117, then the number of participants at the
beginning was
a) 15 b) 16 c) 17 d) 18

37. The number of ways in which 5 boys and 5 girls can be seated for a photograph so that
no two girls sit next to each other is
a) b) c) d)

38. An -digit number is a positive number with exactly digits. Nine hundred distinct -
digit numbers are to be formed using only the three digits 2, 5 and 7. The smallest
value of for which this is possible, is
a) 6 b) 7 c) 8 d) 9

39. If a man and his wife enter in a bus, in which five seats are vacant, then the number of
different ways in which they can be seated, is
a) 2 b) 5 c) 20 d) 40

40. A man has 7 friends. In how many ways he can invite one or more of them for a tea
party?
a) 128 b) 256 c) 127 d) 130

41. The number of mappings (functions) from the set into the set
such that whenever , is
a) 84 b) 90
c) 88 d) None of these

42. Six points in a plane be joined in all possible ways by indefinite straight lines and if no
two of them be coincident or parallel, and no three pass through the same point (with
the exception of the original 6 points). The number of distinct points or intersection is
equal to
a) 105 b) 45
c) 51 d) None of these

43. These are 12 volleyball players in a college, out of which a team of 9 players is to be
formed. If the captain always remains the same, then in how many ways can the team
be formed?
a) 36 b) 108 c) 99 d) 165
Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
13
PERMUTATIONS & COMBINATIONS

44. In an election there are 8 candidates, out of which 5 are to be chosen. If a voter may
vote for any number of candidates but not greater than the number to be choosen,
then in how many ways can a voter vote?
a) 216 b) 114
c) 218 d) None of these

Assertion-Reason

1. Two statements:
Statement A: Assertion (A)
Statement R: Reasoning (R)
Then the answer will be
(a) A and R are both true, R is the correct explanation of A.
(b) A and R are both true but R is not the correct explanation of A
(c) A is true, but R is false
(d) A is false, but A is true.

2. Assertion (A): Total number of selections of r things from n different things when each thing
can be repeated unlimited number of times = n + r-1Cr.
Reason (R): the number of permutations of n things taking all at a time of which ‘p’ things are
n!
identical, ‘q’ things are identical of another type and the rest are different = .
( p + q )!
3. Assertion (A): The total number of ways to divide ‘n’ identical things among ‘r’ persons = n+r-
1
Cr-1
Reason (R): The total number of ways to divide n identical things among r persons so that
each gets at least one n-1Cr-1.

4. Assertion (A): the number of ways of arranging n distinct objects around a circle is (n – 1)!
Reason (R): Even if one object is already on the circle, then the circle has to be treated as
row, so far the arrangements of other objects around the circle is concerned.
n+r-1
5. Assertion (A): the number of ways of dividing n identical objects among r groups is Cn.

Reason (R): The number of ways of dividing n identical objects among r groups is equal to
number of arranging n identical objects of one kind and (r – 1) identical objects of other kind

in a row. Therefore, it is equal to

( n + r − 1) ! =n+r−1 C
n! ( r − 1) !
n.

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
14
PERMUTATIONS & COMBINATIONS

Answer key

Q. Ans. Q. Ans. Q. Ans. Q. Ans. Q. Ans.

1 b 11 c 21 b 31 a 41 a
2 b 12 b 22 b 32 c 42 c
3 b 13 b 23 b 33 a 43 d
4 a 14 a 24 b 34 b 44 c
5 d 15 a 25 d 35 d
6 a 16 b 26 d 36 a
7 a 17 d 27 a 37 a
8 b 18 a 28 b 38 b
9 d 19 b 29 b 39 c
10 d 20 b 30 c 40 c
Solutions

1. There are n prime factors (b, c, d,….) other than a. First we find the total no. of factors not
involving any power of a.
No. of prime factors in the factor of expression No. of ways
n
1 C1
n
2 C2
n
3 C3
…….
…
…. …….
n
n Cn
 total no. of ways
=nC1 + nC2 + …..+ nCn = 2n-1
Again consider the factors having the powers of a.
Factor of expression = ax  product of y prime no.
where 1  x  m and 0  y  x
 there are m values of ax and nCy values of product of y prime nos.
 total no. of factors having the powers of a
=m (nC0 + nC1 + ….. +nCn)= m.2n
Thus, the total no. of factors of the expression
= m.2n + 2n – 1 = (m + 1) 2n – 1.

2. Let n = 2m + 1
For the three nos. in A.P., we have the following pattern.
Common difference Nos. Ways
1 (1, 2, 3), (2, 3, 4)… (n – 2)
(n- 2, n – 1, n)
2. (1, 3, 5), (2, 4, 6),… (n – 4)
(n – 4, n – 2, n)
3 (1, 4, 7), (2, 5, 8),… (n -6)
(n – 6, n – 3, n)
… ……….. ………
… ……….. ………
m (1, m + 1, 2m + 1)
Favourable no. of ways

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
15
PERMUTATIONS & COMBINATIONS

(n − 2) + (n − 4 ) + (n − 6 ) + ....... + 3 + 1 m m (n − 1)
= = (n − 2 + 1) =
(m terms ) 2 2
 n − 1  n − 1  n − 1
=    m = 2 
 2  2 
(n − 1)
2

= .
4

3. Since there are 9 horizontal lines and 9 vertical lines on a chessboard and to form a
rectangle we need two horizontal and two vertical lines.
 the number of rectangles on the chessboard = 9C2  9C2 = 36  36 = 1296.

4. Since each ring has 15 positions.

 total no. of attempts that can be made to open the lock = 153
Out of these, there is just one attempt in which the lock will open.
 N = 153 – 1 = (15 – 1) (152 + 15 + 1)
= 2.7.241
Clearly 482/N and N is a product of three distinct prime nos.

5. For 1  K  p − 1,n + K = p !+ K + 1, is clearly divisible by K + 1.

 there is no prime number in the given list.

6. 1! + 2! + 3! + 4! = 33
5! = 120, 6! = 720, 7! = 5040
8! = 40320, 9! = 326880.
Thus the two digit of
1! + 2! + …… + 9! = 1
Also note that n! is divisible by 100 for all n  10.
 term digits of 10! + 11! + …..+49! = 0
 term digits of 1! + 2! + …… + 49! = 1.

7. Since a voter has to vote for atleast one candidate and almost 5 candidates.
 the number of ways in which the voter may vote
= 10C1 + 10C2 + 10C3 + 10C4 + 10C5
=10 + 45 + 120 + 210 + 252 = 637.

8. Let sides of game be A and B. Given 5 married couples i.e. 5 husbands and 5 wives. Now 2
husbands for two sides A and B be selected out of 5 = 5C2 = 10 ways.
After choosing the two husbands their wives are to be excluded. (Since no husband and wife
play in the same game)
 we are to choose 2 wives out of remaining 5 – 2 = 3 wives i.e. 3C2 = 3 ways.
Again two wives can interchange their sides A and B in 2! = 2 ways.
 reqd. no. of ways = 10  3  2 = 60

9. Since 0 < x < 1  p < q

The no. of rational nos. = 5 + 4 + 3 + 2 + 1 = 15
When p > q have a common factor, we get some rational numbers which are not different
from those already appeared.
2 2 3 4
There are 4 such nos. , , ,
4 6 6 6
Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
16
PERMUTATIONS & COMBINATIONS

 the reqd. no. of rational nos. = 15 – 4 = 11

10. The number of nos. with 4 in the middle = 4P4 – 3P3. [ the other four places are to be filled
by 0, 1, 2 and 3 and a number cannot begin with 0]
Similarly, the number of nos. with 5 in the middle = 5P4 – 4P3 and so on.
 the reqd. number of nos.
= (4P4 – 3P3) + (5P4 – 4P3) + (6P4 – 5P3) + (7P4 – 6P3) + (8P4 – 7P3) + (9P4 – 8P3)
9 8
= 
n =4
n
P4 −  n P3 .
n =3

11. Reqd. no. of ways

=12C1 + 12C2 + …..+12C12 = 212 – 1.
[ room can be illuminated by one bulb or two or three….out of 12 bulbs]

12. 2p.6q .15r = 2p +q .3q +r .5r

 the no. of proper divisors = (p + q + 1) (q + r + 1) (r + 1) – 2.

13. 3p.6m.21n = 2m.3p +m +n .7n

 the reqd. no. of odd proper divisors
= (p + m + n + 1) (n + 1) – 1.

14. 1008 = 24  32  71
 the reqd. no. of even proper divisors = 4(2 + 1) (1 + 1) – 1 = 23.

15. We have different possibilities

Possibilities Selection
(i) At least one rupee coin, any number of 50-paise coin, any
2  4  5 = 40
number of 25-paise coins.
(ii) At least two 50-paise coins, any number of 25-paise coins. 2  5 = 10
(iii) One 50-paise coin, at least two 25-paise coin. 13=3
(iv) Four 25-paise coins 1=1
 the reqd. no. of ways = 54.

16. n+1
Cn-2 - n+1Cn-1  100
(n + 1) ! (n + 1) ! (n + 1) n (n − 1) (n + 1) n
 −  100  −  100
(n − 2) ! 3 ! (n − 1) ! 2! 6 2
(n + 1) n
 (n − 1 − 3)  100
6
 (n + 1) n (n − 4 )  600 ... (1)
Similarly n  2, otherwise Cn-2 is not defined.
n+1

For n = 2, 3, 4, 5, 6, 7, 8, 9. (1) is satisfied.

For n  10, (1) is not satisfied.
Hence no. of + ve integers = 8.

17. 1729 = 13 + 123 = 93 + 103

If n is a + ve integer, then
1729 n3 = n3 (12 n)3 = (9n)3 (10n)3
Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
17
PERMUTATIONS & COMBINATIONS

 reqd. no. of ways = .

18. Total marks = 50  3 + 100 = 250

250  60
 60% of the total = = 150
100
The no. of ways of getting 150 marks in total
= co-eff. of x 150 in ( x 0 + x 1 + ... + x 50 ) (x + x 1 + .... + x 100 )
3 0

=co-eff.of x 150in (1 − x 51 ) (1 − x 101 ) (1 − x )

3 −4

= co-eff.of x 150 in (1 − 3x 51 + 3x 102 − x 153 )(1 − x 101 ) (1 − x )

−4

= co-eff.of x 150 in (1 − 3x 51 + 3x 102 )(1 − x 101 ) (1 − x )

−4

= co-eff.of x 150 in (1 − 3x 51 − x 101 + 3x 102 )(1 + 4 C1x +5 C2 x 2 + ...)

=153 C150 − 3.102 C99 −52 C49 + 3.51 C48
= 110556.

19. Let I denotes India and S denotes Sri Lanka. We can arrange I and S to show the wins for
India and Sri Lanka respectively.
e.g. SIIII means first match is won by Sri Lanka and second third, fourth, fifth by India.
This is one way in which India can win. Suppose India wins the series. Then the last match
is always won by India.
S.No. Wins of S Wins of I No. of ways
1
(i) 0 4 4!
=4
(ii) 1 4 3!
5!
= 10
(iii) 2 4 2!3!
6!
(iv) 3 4 = 20
3!3!

 total no. of ways = 35

In the same no. of ways Sri Lanka can win.
 total no. of ways = 70

20. Number of groups of r students each = 21Cr

Number of times the teacher can go to the zoo (Z).
= Number of groups (G) she can form
= 21Cr
 Z is maximum when G is maximum.
21 − 1 21 + 1
i .e. r = or
2 2
i .e. r = 10 or 11.

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
18
PERMUTATIONS & COMBINATIONS

( ( − 1)  (  − 1)
. −1

 ( −1) 2 2
C2
C2 2!
C2 1.2
21. = =
+1
C4 (  + 1)  (  − 1) (  − 2) (  + 1)  (  − 1) (  − 2)
1.2.3.4 1.2.3.4
 −−2
2

2.2 (  − 2) (  + 1)
= . ( 3.4 ) = (12) = 3
(  + 1) (  − 2) 4 (  + 1) (  − 2)

22. The number of ways in which all the letters are in wrong envelopes.
 1 1 1 1 1 1 1 
= 4 ! 1 − + − +  = 4! − +  = 12 − 4 + 1 = 9
 1! 2! 3 ! 4 !   2 6 24 

23. Passengers refusing to sit in the lower deck (resp. upper deck) will sit in the upper deck
(resp. lower deck)
 5 passengers will sit only in the lower deck and 8 passengers will sit in the upper deck.
Remaining passengers = 20 – (5 + 8) = 7
Seats remaining in lower deck = 7 – 5 = 2
 number of ways of filling 2 seats in the lower deck = 7C2 = 21
Corresponding to each choice, the remaining 5(= 7 – 2) passengers will sit in the upper
deck.
 number of choice = 21
24. Sections : A1 A2 A3 … An
No. of boys : m1 m2 m3 … mn
No. of girls : n1 n2 n3 … nn
No. of ways of choosing a team (a boy and a girl) from a particular section
= total number of ways of choosing a team from section A1 or section A2 or … or section An
n
= m1n1 + m2n2 + … + mnnn = m n
i =1
i i

25. 105! + r is divisible by r for all r = 2, 3, …, 105

 all the given numbers are composite numbers.
Hence (d) is correct.

26. K! 1! 2! 3! 4! 5! 6! 7! 8! 9! 10! 11! …

Last 2 digits 01 02 06 24 20 20 40 20 80 00 00 …
9
 last two digits in X are the same as the last two digits of  K ! = 13
K =1

 01 + 02 + 06 + 24 + 20 + 20 + 40 + 20 + 80 = 213

27. Let the friends be denoted by F1, F2 and F3 and the hotel by H1 and H2
Different ways in which the friends can step in the hotels are shown as below:

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
19
PERMUTATIONS & COMBINATIONS

Each branch of the above diagram represents a way of staying. For example the third
branch H1 H2 H1 means that F1 stays in H1, F2 stays in H2 and F3 stays in H1
Hence, the total number of ways of staying
= total number of branches = 2  2  2 = 23 = 8

28. Let the sons be denoted by S1, S2, S3 and hotels by H1, H2.
Different ways in which Mr. A can give 2 hotels are shown as below:

 total number of giving away the hotels

= total number of branches
= 3  3 = 9 = 32

29. Total number of points = p + q + r

 number of triangles = p +q+rC3 – pC3 – qC3 - rC3
[ any three points given on a line will not give a triangle]

30. The letters appearing without repetitions are H, E, C, I and S, so they can be put on odd
places i.e. 5 letters can be placed on 3 places i.e. 5P3 ways
2nd and 4th position can be filled by the letter from M, A and T.
Even places can be filled in two ways.
(i) Choose 1 letter from 3 given letters M, A and T and arrange them in 2! ways i.e. 3C2  2!
ways.
So, the number of ways for even places = 3c1 + 3C2  2! = 9 ways
Hence he reqd. number of ways = 5P3  9 = 540 ways.
31. (a)
Since total number are 15, but three special members constitute one member.
Therefore, required number of arrangements are because, chairman remains
between the two specified persons and person can sit in two ways

32. (a)
Since total number are 15, but three special members constitute one member.
Therefore, required number of arrangements are because, chairman remains
between the two specified persons and person can sit in two ways

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
20
PERMUTATIONS & COMBINATIONS

33. (a)
Required number of straight lines

34. (b)
Let the total number of persons in the room
Total number of handshakes (given)

35. (d)
Since, speak after , Therefore two places
can be chosen out of 10 place in ways
and rest of the 8 speakers can speak in
ways.
Required number of ways

36. (a)
Let the number of participants at the
beginning was

37. (a)
Required number of ways
38. (b)
The number of distinct -digit numbers to be
formed using digits 2, 5 and 7 is . We have
to find so that

So the least value of is 7

39. (c)
There are five seats in a bus are vacant. A man
sit on any one of 5 seats in 5 ways. After the
man is seated his wife can be seated in any of
4 remaining seats in 4 ways.
Hence, total number of ways of seating
them
40. (c)
A man has two options for every friend either
they invited it or not.
Required number of ways
Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
21
PERMUTATIONS & COMBINATIONS

[Since, we have to subtract those cases in

which he does not invite any friend ,

Alternate Solution
Required number of ways

41. (a)
If the function is one-one, then select any
three from the set ways , 35
ways.
If the function is many-one, then there are
two possibilities. All three corresponds to
same element number of such functions
ways. Two corresponds to same
element. Select any two from the set . The
lerger one corresponds to the larger and the
smaller one corresponds to the smaller the
third may corresponds to any two. Number of
such functions
So, the required number of mappings

42. (c)
Number of lines from 6 points
Points of intersection obtained from these
lines
Now, we find the number of times, the
original 6 points come.
Consider one point say Joining to
remaiming 5 points, we get 5 lines and any
two lines from these 5 lines gives as the
point of intersection.
is commom in times out of 105
points of intersections.
Similar is the case with other five points.
6 original points come 6 times in
points of intersection.
Hence, the number of distinct points of
intersection

43. (d)
Required number of ways

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
22
PERMUTATIONS & COMBINATIONS

Assertion – Reason
Solution

n!
1. (c) A is true but ‘R’ is false. ‘R’ should be
P!q!

2. (b) Both ‘A’ and ‘R’ are correct but ‘R’ is not the explanation of A.

3. (b) Obviously (b) is the correct answer.

4. Both ‘A’ and ‘R’ are correct and R is the correct explanation of A.

5. (a) The exponent of 7 in 100C50 is zero.

 A is false.

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
23