11

Permutations and Combinations 11.1

Chapter Permutations and Combinations

INTEXT EXERCISE: 1
n
P4 1 (since repetition is allowed).The number of five
1. n
=
P5 2 digit telephone numbers which have none of the
n! (n − 5)! 1 digits repeated = 10P5 = 30240

⇒ × =
(n − 4)! n! 2

\ The required number of telephone numbers

⇒n – 4 = 2 ⇒ n = 6 .
= 105 – 30240 = 69760.
5 5! 5! 120 9! 9!
2. Number of ways are = P3 = = = = 60 .
8. Number of words = = [Since here total
(5 − 3)! 2! 2 2!2!2! (2!)3

9 9! 9! number of letters is 9 and 2M’s, 2T’s and 2E’s]

3. Required numbers of words = P3 = = = 504
(9 − 3)! 6! 9. E2(50!) =
.
 50   50   50   50   50   50 
4. Given numbers are 2, 0, 4, 3, 8 Numbers can be E2 (50!) =   +   +   +   +   +  

 2   4   8   16   32   64 
formed = {Total – Those beginning with 0} = {5
! – 4 !} = 120 – 24 = 96.
(where [ ] denotes integral part)

E2(50!) = 25 + 12 + 6 + 3 + 1 + 0 = 47
5. All the 5 digit numbers and 6 digit numbers are greater
 50   50   50   50 
than 3000. Therefore number of 5 digit numbers E3(50!) =   +   +   +  
6 5  3   9   27   81 
= P5 − P5 = 600 .{Since the case that 0 will be
at ten thousand place should be omit}. Similarly E3(50!) = 16 + 5 + 1 + 0 = 22
number of 6 digit numbers 6 ! – 5 ! = 600. Now
⇒ 50! can be written as 50! = 247. 322...
the numbers of 4 digit numbers which are greater

Therefore exponent of 6 in 50! = 22
than 3000, having 3, 4 or 5 at first place, this can
10. Pr + r. n - 1Pr - 1
n-1

be done in 3 ways and remaining 3 digit may be

aa n Pr = (n -
n! k
(n - 1)! (n - 1)!
filled from remaining 5 digits i.e., required number
= (n - 1 - r)! + r (n - r)! r)!

of 4 digit numbers are 5P3 × 3 = 180. Hence total (n - 1)!
& 1 0
required number of numbers = 600 + 600 + 180 (n - 1 - r)! 1 + r. n - r

` n j
= 1380. (n - 1)! n! n
(n - 1 - r)! (n - r)! n - r = (n - r)! = Pr
8!
6. Required number of ways
= = 5040. [since
Aliter: We know that n-1
Cr + n - 1 Cr - 1 = n Cr
2!2!2!
here 2C’s, 2T’s and 2A’s] n-1
P n-1
P n
P
& r! r + (r - 1r -)!1 = r!r & n - 1 Pr + r .n - 1 Pr - 1 = n Pr

7. Using the digits 0, 1, 2,...,9 the number of five digit
telephone numbers which can be formed is 105.
INTEXT EXERCISE: 2

1. First we arrange 3 consonants in 3! ways and then at four places (two places between them and two places on two
4 1 1
sides) 3 vowels can be placed in P3 × ways. Hence the required ways = 3! × 4 P3 × = 72 .
2! 2!
11.2 Mathematics
2. The word ‘MOBILE’ has three even places and 6. Since at any place, any of the digits 2, 5 and 7 can be
three odd places. It has 3 consonants and 3 vowels. used total number of such positive n-digit numbers
In three odd places we have to fix up 3 consonants
are 3n. Since we have to form 900 distinct numbers,
which can be done in 3P3 ways. Now remaining
three places we have to fix up remaining three places hence 3n ≥ 900 ⇒ n = 7.
which can be done in 3P3 ways. The total number of 7. The 4 odd digits 1, 3, 3, 1 can be arranged in the 4
ways = 3P3 × 3P3 = 36. 4!
odd places, in = 6 ways and 3 even digits 2, 4,
2 !2 !
3. After fixing 1 at one position out of 4 places, 3 places 3!
2 can be arranged in the three even places =3
can be filled by 7P3 ways. But some numbers whose 2!
fourth digit is zero, so such type of ways = 6P2. ways. Hence the required number of ways = 6 × 3 =
\ Total ways = 4.7P3 – 3.6P2 = 750.
18.
4. First arrange m men, in a row in m ! ways. Since n
< m and no two women can sit together, in any one 1
of the m ! arrangement, there are (m + 1) places in 8. A garland can be made from 10 flowers in (9 !)
2
which n women can be arranged in m+1Pn ways. 1
\ By the fundamental theorem, the required number ways [Q n flower’s garland can be made in (n - 1)!
ways] 2
m +1 m !(m + 1)!
of arrangement = m ! Pn = .
(m − n + 1)!
9. Since total number of ways in which boys can
5. Words starting from A are 5 ! = 120;
occupy any place is (5 – 1)! = 4! and the 5 girls

Words starting from I are 5 ! = 120
can be sit accordingly in 5! ways. Hence required

Words starting from KA are 4 ! = 24;
number of ways are 4 ! × 5 !.

Words starting from KI are 4 ! = 24
10. Fix up a male and the remaining 4 male can be

Words starting from KN are 4 ! = 24;

Words starting from KRA are 3 ! = 6 seated in 4! ways. Now no two female are to sit

Words starting from KRIA are 2 ! = 2; together and as such the 2 female are to be arranged

Words starting from KRIN are 2 ! = 2 in five empty seats between two consecutive male

Words starting from KRIS are 1 ! = 1 and number of arrangement will be 5P2. Hence by

Words starting from KRISNA are 1 ! = 1 fundamental theorem the total number of ways is =

Hence rank of the word KRISNA is 324. 4! × 5 P2 = 24 × 20 = 480 ways.

INTEXT EXERCISE: 3
1. 15
C3r = 15Cr + 3 3. n+ 1
C3 = 2.n C2
⇒ 15 C15 − 3r = 15Cr + 3
(n + 1)! n!

⇒ = 2.
3!(n − 2)! 2!(n − 2)!

⇒ 15 – 3r = r + 3 ⇒ r = 3.
n n +1 2
Cr n!
⇒ = ⇒ n + 1 = 6 ⇒ n = 5.
2. = 3.2! 2!
n
Cr − 1 r !(n − r )!
n! n
Cr − 1 36
n
Cr 84
4. Here = and =
(r − 1)!(n − r + 1)! n
84
n
Cr + 1 126
Cr
n! (r − 1)!(n − r + 1)!
3n – 10r = – 3 and 4n – 10r = 6; on solving we get

⇒ ×
r !(n − r )! n! n = 9 and r = 3.
(n − r + 1)(r − 1)!(n − r )! (n − r + 1) 5. Total number of shake hands when each person

= = . shake hands with the other once only = 8C2 = 28
r (r − 1)!(n − r )! r
ways.
 Permutations and Combinations 11.3
7
6 5
6. Required number of words = C4 × C3 × 7! = 8. Required number of ways = 2 - 1 = 127.
{Since the case that no friend be invited i.e., 7C0 is
756000 [Selection can be made in 6 C4 × 5C3 while
excluded}.
the 7 letters can be arranged in 7!]
9. It is obvious.
7. The selection can be made in 5 C3 × 22C9 [since 3
10. C2 = n - nC10 & n - nCn - n - 2 = n - nC10
2 2 2
n2 - n
vacancies filled from 5 candidates in 5C3 ways and 2

now remaining candidates are 22 and remaining & n 2 - n - 2 = 10 or n = 4, - 3.

seats are 9, then remaining vacancies filled by 22C9
ways. Hence total number of ways 5C3 × 22C9.
INTEXT EXERCISE: 4
1. The number of ways can be given as follows: 2 6. Required number of friend = 210 – 1(Since the case
bowlers and 9 other players = 4C2 × 9C9; 3 bowlers that no friend be invited i.e., 10C0 is excluded).
and 8 other players = 4C3 × 9C8. 4 bowlers and 7
7. Numbers greater than 1000 and less than or equal
other players = 4C4 × 9C7. Hence required number of
ways = 6 × 1 + 4 × 9 + 1 × 36 = 78. to 4000 will be of 4 digits and will have either 1
(except 1000) or 2 or 3 in the first place with 0 in
2. 6 particular players are always to be included and 4
each of remaining places. After fixing 1st place, the
are always excluded, so total number of selection,
second place can be filled by any of the 5 numbers.
now 4 players out of 12. Hence number of ways
Similarly third place can be filled up in 5 ways and
= 12C4.
4th place can be filled up in 5 ways. Thus there will
3. Required number of ways
be 5 × 5 × 5 = 125 ways in which 1 will be in first
= 4 C1 × 8C5 + 4C2 × 8C4 + 4C3 × 8C3 + 4C4 × 8C2
place but this include 1000 also hence there will be

= 4 × 56 + 6 × 70 + 4 × 56 + 1 × 28 = 896. 124 numbers having 1 in the first place. Similarly
4. Number of ways are = 210 – 1 = 1023 [– 1 corresponds 125 for each 2 or 3. One number will be in which 4
to none of the lamps is being switched on.] in the first place and i.e., 4000. Hence the required

5. Number of triangles = 12 C3 - ^1 + 4 C3 + 5 C3h

numbers are 124 + 125 + 125 +1 = 375 ways.

220
= - 15 = 205 8. Number of diagonals = 8C2 – 8 = 28 – 8 = 20.

9. Number of straight line = 8C2 = 28.

10. Required number of ways = 12C3 – 7C3

= 220 – 35 = 185.

INTEXT EXERCISE: 5
4. The number of ways that the candidate may select
1. The required number of ways = 45 = 1024 5
2 questions from A and 4 from B = C2 × 5 C4

[since each prize can be distributed by 4 ways] 5 5
; 3 questions form A and 3 from B = C3 × C3 ; 4
5 5
9! 9#8#7#6#5#4 questions from A and 2 from B = C4 × C2 .
]3!g4 3 # 2 # 3 # 2 # 3 # 2
2. Total ways = = = 280.

Hence total number of ways are 200.
3. Required number of ways
52 39 26 13 5. Since 9600 = 27 × 31 × 52
= C13 × C13 × C13 × C13

52! 39! 26! 13! 52!
Hence number of divisors = (7 + 1) (1 + 1) (2 + 1) =

= × × × = .
39!13! 26!13! 13!13! 13! (13!) 4 48.
11.4 Mathematics
6. Since 38808 = 8 × 4851 = 8 × 9 × 539 = 8 × 9 × 7
⇒ 1 + 2(T) + 1 = 22n + 1
× 7 × 11 = 23 × 32 × 72 × 11. So, number of divisors 22 n+1

⇒1 + T = = 22 n
= (3 + 1) (2 + 1) (2 + 1) (1 + 2) – 2 = 72 – 2 = 70. 2

⇒ 1 + 63 = 22n ⇒ 26 = 22n ⇒ n = 3.
7. Since the student is allowed to select utmost n
8. 6
C0 + 6 C1 + 6 C2 + 6 C3 = 42
books out of (2n + 1) books. Therefore in order to
select one book he has the choice to select atleast 9. Number of derangement are
one, two, three,..., n books. Thus, if T is the total
1 1 1
number of ways of selecting one book then T = = 4!  − +  = 12 − 4 + 1 = 9.

 2 ! 3! 4 !
2 n +1
C1 + 2 n+1C2 + ... + 2 n+1Cn = 63 .

Again the sum of binomial coefficients
(Since number of derangements in such a problem is
 1 1 1 1 1
2 n +1
C0 + 2 n +1 C1 + 2 n +1C2 + ... + 2 n +1Cn given by n!1 − + − + ... + (−1) n  . Ans.
 1! 2 ! 3! 4 ! n !
+ 2 n +1Cn +1 + 2 n +1
Cn + 2 + ...
2 n +1 10. Given n C12 = n C6
+
C2 n +1 = (1 + 1) 2 n +1 = 22 n +1
2 n +1
` 12 + 6 = n & n = 18

or, C0 + 2( 2 n −1C1 + 2 n +1C2 + ... + 2 n +1Cn )
18 # 17
+ 2 n +1 C2 n +1 = 22 n +1 ` 18 C2 =
2 = 9 # 17 = 153

EXERCISE - 1
Addition and multiplication principle, Permutations 6. Sum of the digits in the unit place is 6 (2 + 4 +
1. Required number of ways are 2 = 1024, because 10 6 + 8) = 120 units. Similarly, sum of digits in
ten place is 120 tens and in hundredth place is
every question may be answered in 2 ways.
120 hundreds etc. Sum of all the 24 numbers is
2. 7 Letters 120 (1 + 10 + 10 2 + 103) = 120 # 1111 = 133320 .
P$1 7. The man can go in 5 ways and he can return in 5
E$2 ways. Hence, total number of ways are 5 # 5 = 25.
R$1
8. First prize can be given in 5 ways. Then second
F$1 prize can be given in 4 ways and the third prize in
C$1 3 ways.(Since a competitior cannot get two prizes)
and hence the no. of ways = 5 # 4 # 3 = 60 ways.
T$1
9. Extreme left place can be filled in 6 ways, the middle
2 alike + 2diff. = 1 # 5 C2 = 10

place can be filled in 6 ways and extreme right place
All 4 different = 6 C4 = 15 & 25
in only 3 ways. ( a number to be formed is odd)
3. Required number of ways = 5 P3 = 60.
` Required number of numbers = 6 × 6 × 3 = 108.
6! 720 10. The first place can be filled in 9 ways. Each
4. Required number of ways = 3!3! = 6 # 6 = 20.
subsequent digit can be filled in 9 ways.
[No. of heads = 3, no. of tails = 3 and coins are = 9 n ways
identical] 11. : A : I : U :
10!
The pointed places to be filled by MXMM.
5. A gets 2, B gets 8; 2!8! = 45
4!
10!
Hence required number of ways 3! # 3! = 4!

A gets 8, B gets 2; 8!2! = 45

{Since three vowels can be arranged in 3! ways

` 45 + 45 = 90. also}.
 Permutations and Combinations 11.5
12. Since L is fixed now 4 letter can be arranged in Combinations, division into groups
4! = 24 ways.
23. Required number of ways 11
C8 = 165.
5!
13. Required number of ways are 2! = 60.
{Since, captain already be chosen, so now from 11
14. Three letters can be posted in 4 letter boxes in players 8 are to be chosen}.
43 = 64 ways but it consists the 4 ways that all 24. Required number of ways = 15C1 # 8 C1 = 15 # 8
letters may be posted in same box. Hence required
n-r+1
ways = 60. 25. On simplifying you will get r .
]2ng ! # ]n - 2g ! 44
15. In forming even numbers, the position on the 26. ] # 2 ! n!
2n - 3g!.3!
= 3
right can be filled either 0 or 2. When 0 is filled,
the remaining positions can be filled in 3! ways ]2ng]2n - 1g]2n - 2g 44
3n ]n - 1g
& = 3
and when 2 is filled, the position on the left can be
filled in 2 ways (0 cannot be used) and the middle & 4 ]2n - 1g = 44 & 2n = 12 & n = 6
two positions in 2! ways (0 can be used). Therefore Now 6 Cr = 15 & 6 Cr = 6 C2 or 6 C4 & r = 2, 4.

n ]n - 1g
the number of even numbers formed = 3! + 2(2!) =
10. 27. n
C2 = 153 & 2 = 153 & n = 18.
16. Required number of arrangements 28. 2. 20 C2 {Since two students can exchange cards

= (Total number of arrangements) with each other in two ways}.

– (Number of arrangements in which N’s are 29. We have 32 places for teeth. For each place we have
together) two choices either there is a tooth or there is no
6! 5! tooth. Therefore the number of ways to fill up these
= 2!# 3! - 3! = 60 - 20 = 40
places is 232 . As there is no person without a tooth,
17. First, we seat 5 boys, which can be done in 5! ways the maximum population is 232 - 1.
B × B × B × B × B. Three girls can be seated in
places marked ‘×’ in 4P3 ways. 30. n
C3 + n C4 > n + 1 C3

` Total ways = 5!.4P3 = 2880. & n + 1 C4 > n + 1 C3 ^a n Cr + n Cr + 1 = n + 1 Cr + 1h

C4n+1
n-2
18. Tie up the president and secretary, now 10 objects
& n+1 > 1 & 4 > 1 & n > 6.
C3
are placed in a circle in 9! ways. The president and 31. Required number of ways
secretary can be arranged in 2! ways & 9! # 2! .
= 8 C1 + 8 C2 + 8 C3 + 8 C4 + 8 C5

19. Required number of ways = 2 ]5 - 1g! = 2 .
1 4!

= 8 + 28 + 56 + 70 + 56 = 218
{Since clockwise and anticlockwise are same in
case of ring}.
{Since voter may vote to one, two, three, four or all
candidates}.
20. Tie up the three gentlemen, now 10 objects are
placed in a circle in 9! ways. The three gentlemen 32. The letters can be select in 5 C3 # 4 C2 ways.
can be arranged in 3! ways & 9! # 3!.
Therefore the number of arrangements are
^5 C3 # 4 C2h 5!.
21. Fix up 1 man and the remaining 6 men can be
seated in 6! ways. Now no two women are to sit 33. Since 5 are always to be excluded and 6 always to be
included, therefore 5 players to be chosen from 14.
together and as such the 7 women are to be arranged
Hence required number of ways are 14 C5 = 2002.
in seven empty seats between seven consecutive
34. Required number of ways
men & number of arrangement will be 7!. Hence
by fundamental theorem the total number of ways = 52 C13 # 39 C13 # 26 C13 # 13 C13

= 7! # 6!. 52 ! # 39 ! # 26 ! # 13 ! 52 !
= 39 ! # 13 ! 26! # 13 ! 13 ! # 13 ! 13 ! = (13 !) 4
22. 8 different beads can be arranged in circular 35. Required number of words
form in (8 - 1) ! = 7! ways. Since there is no
distinction between the clockwise and anticlockwise = 6 C4 # 5 C3 # 7! = 756000

arrangement. So the required number of arrangements {Selection can be made in 6 C4 # 5 C3 while the 7

7!
= 2 = 2520. letters can be arranged in 7!}.
11.6 Mathematics
36. The arrangement can be make as .+.+.+.+.+.+. ie.,
0 # r # n-1
the (-) signs can be put in 7 vacant (pointed) place. r+1 1 r+1
Hence required number of ways = 7 C4 = 35. & k2 =
n + 3, n # n # 1
& k 2 ! : n + 3, 4D, n $ 2
37. The required number of words is 1

^2 C1 # 4 C2 + 2 C2 # 4 C1h 3! = 96.
k ! :- 2, - 1n + 3 D , : 1n + 3 , 2D; n $ 2.


& k ! 7- 2, 3 h , ^ 3 , 2@
38. Four letters can be selected in the following ways


(i) All different ie., C, O, R, G.
44. Number of ways = coefficient of x15 in the expansion

(ii) 2 like and 2 different. ]1 + x + x 2 + x3 + x 4 + x5g

(iii) 3 like and 1 different i.e., three O and 1 from R, ]1 + x + x 2 + ... + x10g

G and C.
]1 + x + x 2 + ... + x15g

& ]1 + x + x 2 + x3 + x 4 + x5g ]1 + x + x 2 + ... + x10g

The number of ways in (i) is 4 C4 = 1

]1 + x + x 2 + ... + x15g = ]1 - x6 - x11 + ....g
3

The number of ways in (ii) is 1. C2 = 3


The number of ways in (iii) is 1 # C1 = 3 3
(1 + 3 C1 x + 4 C2 x 2

Therefore, required number of ways = 1 + 3 + 3 = 7. + ... + 6 C4 x 4 + 11 C9 x9 + 17 C15 x15 + ........)

39. Since the total number of selections of r things from = + ... + x15 ^-11 C9 - 6 C4 + 17 C15h
...
= + ... + x15 ]- 55 - 15 + 136g = x15 # 66
n things where each thing can be repeated as many
...
times as one can, is n + r - 1 Cn . Therefore the required
number = 3 + 6 - 1 C6 = 28. ` Coefficient of x15 = 66.
40. The required number = 3 + 35 - 1 C3 - 1 = 37 C2 = 666 Geometrical problems, No of divisors, Multinomial
theorem, Miscellaneous

Aliter : The required number = coefficient of x35 in
]1 + x + x 2 + ... + x35g3 . 45. The required number of ways = 8 C3 - 5 C3 - 3 C3 .

41. Since the person is allowed to select at most n coins

{Since total points are 8, but 5 are collinear and
out of (2n + 1) coins, therefore in order to select other three are also collinear}.
one, two, three, …., n coins. Thus, if T is the total 46. Required number of ways are 8 C2 - 8 = 20.
number of ways of selecting one coin, then
47. Since n C2 - n = 44 & n = 11.
2n + 1 2n + 1 2n + 1
T= C1 + C2 +...... + Cn = 255 …..(i)
48. Required number of ways = 4 C3 = 4.

Again the sum of binomial coefficients
49. Required number of ways 8 C2 = 28.
2n + 1 2n + 1 2n + 1 2n + 1 2n + 1

= C0 + C1 + C2 + ..... + Cn + Cn + 1
50. Required number of triangles
+ 2n + 1 Cn + 2 + ..... + 2n + 1C2n + 1 = (1 + 1) 2n + 1= 2 2n + 1
= 10 C3 - 4 C3 = 120 - 4 = 116.


& 2n + 1
C0 + 2 ^2n + 1C1 + 2n + 1
C2 + ... + 2n + 1
Cnh 51. Required number of ways = 4 C2 # 3 C2 = 18.
2n + 1 2n + 1

+ C2n + 1 = 2 52. Case I : When A is excluded.
2n + 1
2
& 1 + 2 (T ) + 1 = 2 2 n + 1 & 1 + T =
2 = 2 2n
Number of triangles = selection of 2 points from AB
2n 2n 8 and one point from AC + selection of one point from

& 1 + 255 = 2 & 2 = 2 & n = 4.
AB and two points from AC
42. As for given question two cases are possible.
= m C2n C1 + m C1n C2 = 2 ]m + n - 2gmn …..(i)
1


(i) Selecting 4 out of first 5 questions and 6 out of
remaining 8 questions = 5 C4 # 8 C6 = 140 choices. Case II : When A is included.

(ii) Selecting 5 out of first 5 questions and 5 out of
The triangles with one vertex at A = selection of one
remaining 8 questions = 5 C5 # 8 C5 = 56 choices. point from AB and one point from AC = mn.

` Number of triangles

= mn + 2 mn (m + n - 2) = 2 mn ]m + ng …..(ii)
` Total no. of choices = 140 + 56 = 196. 1 1

]n - 1g! ]k 2 - 3gn!
43. We have ] ]m + n - 2g
n - r - 1g!r! ]n - r - 1g! ]r + 1g !
= ,

` Required ratio = ]m + ng .
 Permutations and Combinations 11.7
53. The number of sub-sets of the set which contain at 10
57. x1 + x2 + x3 + x4 + x5 = 6 ; 5 + 6 - 1 C5 - 1 = C4
most n elements is
58. Total ways

2n + 1
C0 + 2n + 1 C1 + ..... + 2n + 1 Cn = S (Say)
Then 2S = 2 (2n + 1 C0 + 2n + 1 C1 + ..... + 2n + 1 Cn) = 11 C2 - ^5 C1 + 4 C1 + 3 C1 + 2 C1 + 1 C1h = 40

= 2n + 1 C0 + 2n + 1 C2n + 1) + (2n + 1C1 + 2n + 1 C2n) + ....

( 59. If zero is included it will be at z & 9 C2
]Z] x, y, z all diff & 9 C3 # 2!

.... + (2n + 1 Cn + 2n + 1 Cn + 1) ]]
If zero is excluded [] x = z < y & 9 C2
"a n Cr = n Cn - r ,
]]
]x < y = z & 9 C2
= 2n + 1 C0 + 2n + 1 C1 + ....... + 2n + 1 C2n + 1 = 2 2n + 1
\
The total number of ways is 276.
& S = 2 2n .


Alternate method: y can be from 2 to 9; so total
54. Since 9600 = 2 7 # 3 # 5 2 . Hence, number of
/ ]r2 - 1g = 276
9

divisors = ]7 + 1g]1 + 1g]2 + 1g = 48.

number of ways is
r=2

55. The number of triplets of positive integers which are 60. If n is odd, 3 n = 4λ1 - 1, 5 n = 4λ 2 + 1
solutions of x + y + z = 100. & n + 3 n + 5 n is divisible by 4 if n $ 2
2

= coefficient of x 100
in ] x + x + x + ...g
2 3 3

Thus, n = 3, 5, 7, 9, ..., 99, i.e., n can take 49 different

= coefficient of x 100
in x ]1 - xg
3 -3 values.
= coefficient of x100 in
If n is even, 3 n = 4λ1 + 1, 5 n = 4λ 2 + 1

x3 a1 + 3x + 6x 2 + .... + x + ..... k
(n + 1) (n + 2) n & n + 3 n + 5 n is not divisible by 4 as 2 n + 3 n + 5 n
2
2 will be in the form of 4λ + 2.
(97 + 1) (97 + 2)

= 2 = 49 # 99 = 4851
Thus, the total number of ways of selecting ‘n’ is
equal to 49.
56. 3600 = 24 × 32 × 52
so number of odd divisors = (2 + 1) (2 + 1) = 9.

EXERCISE - 2
Addition and multiplication principle, Permutations 6. Required number of ways = 5! - 4! - 3!
120 - 24 - 6 = 90.
1. There are 10 digits in all viz. 0, 1, 2, 3, 4, 5, 6, 7, 8, 9.
The required 9 digit numbers = (Total number of 9
[Number will be less than 56000 only if either 4
digit numbers including those numbers which have occurs on the first place or 5, 4 occurs on the first
0 at the first place) – (Total number of those 9 digit two places].
numbers which have 0 at the first place) 7. Total arrangements of 5 papers are = 5! = 120. When
10 10! 9!
9 physics and chemistry come together = 4! # 2! = 48

= P9 - P8 = 1! - 1! = 10! - 9!
Hence required number of ways are 120 - 48 = 72.
(
= 10 - 1)9! = 9.9!
8. Numbers are 2, 0, 4, 3, 8
2. The number of possible outcomes with 2 on at least

Numbers can be formed
one die = (The total number of outcomes) – (The
number of outcomes in which 2 does not appear on = (Total) – (those beginning with 0)
any die) 6 4 - 5 4 = 1296 - 625 = 671.
= 5! – 4! = 120 – 24 = 96.
4
3. Required number of ways are 5 . 9. Total number of arrangements of n books = n!

{Since each parcel can be registered in 5 ways}.
If two specified books always together then number
of ways = ]n - 1g! # 2
4. It a fundamental concept.
Hence required number of ways = n! - ]n - 1g! # 2
5. Required sum = 3! ]3 + 4 + 5 + 6g = 6 # 18 = 108.


= n (n - 1) ! - (n - 1) ! # 2 = (n - 1) ! (n - 2)

[If we fix 3 of the unit place, other three digits can be
arranged in 3! ways similarly for 4, 5, 6.]
11.8 Mathematics
10. Divisible by 5 19. Given set of numbers is {1, 2,....11} in which 5 are
even six are odd, which demands that in the given

(a) 5! = 120
product it is not possible to arrange to subtract only

+ even number from odd numbers. There must be

(b) 5! - 4! = 96 at least one factor involving subtraction of an odd
number form another odd number. So at least one of

a + b = 216 the factors is even. Hence product is always even.
11. Using the digits 0, 1, 2, ......, 9 the number of five 20. Total number of ways to distribute one Rs.100 note
digit telephone numbers which can be formed is 105 and five other notes = 36.
(since repetition is allowed) The number of five digit
21. Tie up the Secretary (S), Chairman (C) and Deputy
telephone, numbers which have none of the digits secretary (D) to form one object. Now 13 objects
repeated = 10 P5 = 30240. ` The required number can be place around a circle in 12! ways. And C, D
of telephone numbers = 105 - 30240 = 69760. and S can be made to set in 2 ways
12. At first we have to accommodate those 5 animals in
& Total = 2 # 12! ways
cages which can not enter in 4 small cages, therefore
22.
number of ways are 6 P5 . Now after accommodating
5 animals we left with 5 cages and 5 animals,
therefore number of ways are 5!. Hence required
number of ways = 6 P5 # 5! = 86400.
13. 3 must be at thousand place and since the number
should be divisible by 5, so 5 must be at unit place.
Now we have to filled two place (ten and hundred)
i.e., 4 P2 = 12.
14. Without any restriction the 10 persons can be ranked
among themselves in 10! ways; but the number of 23. There are 20 + 1 = 21 persons in all. The two
ways in which A1 is above A10 and the number of particular persons and the host be taken as one unit
ways in which A10 is above A1 make up 10!. Also so that these remain 21 – 3 + 1 = 19 persons to be
the number of ways in which A1 is above A10 is arranged in 18 ! ways. But the two person on either
exactly same as the number of ways in which A10 side of the host can themselves be arranged in 2!
is above A1 . Therefore the required number of ways ways. Hence there are 2 ! 18 ! ways or 2.18! ways.
= 2 ]10!g .
1
24. It is a fundamental concept.
15. Possible ways = 5!.4!.3!.2!. 25. Fix up a male and the remaining 4 male can be seated
16. Out of 7 places, 4 places are odd and 3 even. in 4! ways. Now no two female are to sit together
Therefore 3 vowels can be arranged in 3 even places and as such the 2 female are to be arranged in five
in 3 P3 ways and remaining 4 consonants can be empty seats & number of arrangement will be 5 P2 .
arranged in 4 odd places in 4 P4 ways. Hence by fundamental theorem the total number of
ways is = 4! # 5 P2 = 24 × 20 = 480 ways.

Hence required no. of ways = 3 P3 × 4 P4 = 144.
26. No. of ways in which 6 men can be arranged at a
17. There are five seats in a bus are vacant. A man sit on round table = (6 – 1)!
any one of 5 seats in 5 ways. After the man is seated, Now women can be arranged in 6C5.5! ways.
his wife can be seated in any of 4 remaining seats in Total Number of ways = 6! × 5!
4 ways. Hence total number of ways of seating them Combinations, division into groups
5 # 4 = 20.
5

18. Words starting with A, C, H, I, N are each equals to 27. 47

C4 + / 52 - r C3 = 51C3 + 50C3 + 49C3 + 48C3
r=1
5!
+ C3 + 47C4
47

` Total words = 5×5! =600
= 51C3 + 50C3 + 49C3 + 48C3 + 48C4


The first word starting with S is SACHIN.
= 51C3 + 50C3 + 49C3 + 49C4


` SACHIN appears in dictionary at serial number
601. = 51 C3 + 50 C3 + 50 C4 = 51 C3 + 51 C4 = 52 C4 .

 Permutations and Combinations 11.9
n n n n n n
28. n
Cr + 2 Cr - 1 + Cr - 2 = Cr + Cr - 1 + Cr - 1 + Cr - 2 3
red can be select in 2 = 8 ways. Hence required
= n + 1 Cr + n + 1 Cr - 1 = n + 2 Cr
number of ways = 31 # 15 # 8 = 3720.

29. 10
Cx - 1 > 2.10 Cx 40. The selection can be made in 5 C3 # 22 C9 . {Since
3 vacancies filled from 5 candidates in 5 C3 ways
10! 2.10!
] x - 1g! ]11 - xg! > x! ]10 - xg!
and now remaining candidates are 22 and remaining
& x > 22 - 2x seats are 9}.
x

& 11 - x > 2 22
&x> 3 41. A voter can vote in 5 C1 + 5 C2 + 5 C3 = 25 ways.

& x = "8, 9, 10 ,
42. First omit two particular persons, remaining 8
m m persons may be 4 in each boat. This can be done
30. / n + r Cn = / n + r Cr in 8 C4 ways. The two particular persons may be
r=0 r=0 placed in two ways: one in each boat. Therefore total
= n C0 + n + 1 C1 + n + 2 C2 + ... n + m Cm
number of ways are = 2 # 8 C4 .
= n + 1 C0 + n + 1 C1 + n + 2 C2 + ... n + m Cm
43. Required number of ways = 30 C3 - 15 C3 = 3605.
= n + 2 C1 + n + 2 C2 + ... n + m Cm
44. The total number of two factor products = 200 C2 .
= n + m + 1 Cm = n + m + 1 Cn + 1
The number of numbers from 1 to 200 which are
not multiples of 5 is 160. Therefore total number
31. Each question can be answered in 4 ways and all of two factor products which are not multiple of
questions can be answered correctly in only one 5 is 160 C2 . Hence the required number of products
way, so required number of ways = 43 - 1 = 63. = 200 C2 - 160 C2 = 7180.
m (m - 1) 45. The number of times he will go to the garden is
32. α = mC2 & α = 2 same as the number of selecting 3 children from 8.
1 m (m - 1) & m (m - 1)
- 10
Therefore the required number = 8 C3 = 56.

α
C2 = m (m - 1)/2C2 = 2 . 2 2
46. Word ‘MATHEMATICS’ has 2M, 2T, 2A, H, E, I, C,
1 S. Therefore 4 letters can be chosen in the following

= 8 m (m - 1) (m - 2) (m + 1)
ways.
1
= 8 (m + 1) m (m - 1) (m - 2) = 3 . m + 1 C4

Case I : 2 alike of one kind and 2 alike of second
33. Required number of ways 4!
kind ie., 3 C2 & No. of words = 3 C2 2!2! = 18
= 12C1 + 2C2 + 12C3 + ....... + 12C12 = 212 - 1

Case II : 2 alike of one kind and 2 different

= 4096 - 1 = 4095. i.e., 3 C1 # 7 C2 & No.of words

34. The required number of ways are 4!
= 3 C1 # 7 C2 # 2! = 756


(10 + 1) (9 + 1) (7 + 1) - 1 = 11 # 10 # 8 - 1 = 879
Case III : All are different
35. 26 cards can be chosen out of 52 cards, in 52 C26 ie., 8 C4 & No. of words = 8 C4 # 4! = 1680.

ways. There are two ways in which each card can be
dealt, because a card can be either from the first pack
Hence total number of words are 2454.
or from the second. Hence the total number of ways 47. A number is divisible by four, if the last two digit are
= 52 C26 .2 26 . divisible by four. In this case last two digits can be
36. Required number of ways 12, 16, 28, 32, 36, 68, 92 or 96.
= 5 C3 # 2C1 # 9C7 = 10 # 2 # 36 = 720
Total number of such numbers = 8 ]4 C3 .3!g = 192.

37. Required number of ways = 6 C1 + 6 C2 + 6 C3 + 6 C4 n-1 n-1 n-1
/ n Cr +Cn rCr + 1 = / 1 1
n

Cr + 1 = r/
48.
r=0 1 + n
n
=0 1 +
n-r
+ 6 C5 + 6 C6 = 26 - 1 = 63.
r=0
Cr r+1
38. It is a fundamental concept. n-1
r+1 1 /
n-1
=/ = (r + 1 )
39. At least one green ball can be selected out of 5 r = 0 n + 1 n + 1 r = 0
green balls in 25 - 1 i.e., in 31 ways. Similarly at 1 n
least one blue ball can be selected from 4 blue balls
= (n + 1) [1 + 2 + ... + n] = 2
in 2 4 - 1 = 15 ways. And at least one red or not
11.10 Mathematics
Geometrical problems, No of divisors, Multinomial 57. xyz = 21 # 3 2 # 51
theorem, Miscellaneous
Let x = 2 α 3β 5 γ , α1, β1, γ1 ! W
1 1 1

m
49. Required number of diagonals = C2 - m
y = 2 α 3 β 5 γ , α 2, β 2 , γ 2 ! W

m ]m - 1g
2 2 2

- m = 2! ]m - 3g.
m

= 2! z = 2 α 3 β 5 γ , α 3 , β 3, γ 3 ! W
3 3 3

50. Required number of ways = 12 C3 - 7 C3

` α1 + α 2 + α3 = 1

= 220 - 35 = 185.
β1 + β 2 + β3 = 2
51. The number of lines are
γ1 + γ 2 + γ3 = 1

16
C2 - 6 C2 + 1 = 120 - 15 + 1 = 106 ` Total solutions 3 C2 # 4 C2 # 3 C2 = 54

52. Since no two lines are parallel and no three are 58. Total elements (with repetition) in
concurrent, therefore n straight lines intersect at 24
n
C2 = N (say) points. Since two points are required ' Xr = 5 # 24 = 120
r=1
to determine a straight line, therefore the total
number of lines obtained by joining N points N C2 .
but each element lie in 10Xr 's
But in this each old line has been counted n - 1 C2 120

& Total different elements = 10 = 12 .....(1)
times, since on each old line there will be n - 1
points of intersection made by the remaining ]n - 1g
n

Similarly from ' Yr
lines. Hence the required number of fresh lines is r=1
N (N - 1) n (n - 1) (n - 2) 4n
we get total different elements = 6 .....(2)
N
C2 - n . n - 1 C2 = 2 - 2
4n
n n
C2 ( C2 - 1) n (n - 1) (n - 2) from (i) and (ii), 12 = 6 & n = 18
= 2 - 2
59. Possible solutions are
n (n - 1) (n - 2) (n - 3)
= 8 .
1, 2, 3, 4, 10
53. Clearly, n C3 = Tn .
1, 2, 3, 5, 9

So, n+1
C3 - n C3 = 21 & ( n C3 + n C2 ) - n C3 = 21
1,2,3,6,8
n

` C2 = 21 or ` n (n - 1) = 42 = 7.6 ` n = 7
1,2,4,5,8
54. The numbers of divisors
1,2,4,6,7
(
= 1 + 1) (2 + 1) (2 + 1) (1 + 1) (1 + 1) - 1 = 71.
1,3,4,5,7
55. Since, 38808 = 8 # 4851
2,3,4,5,6
3 2 2
8
= # 9 # 539 = 8 # 9 # 7 # 7 # 11 = 2 # 3 # 7
Hence, 7 solutions are there.

# 11 60. x + y + z = 47
So, number of divisors & The problem is similar to put 47 identical things

= (3 + 1) (2 + 1) (2 + 1) (1 + 1) = 72. in 3 diff. boxes, Let x' = x - 1

This includes two divisors 1 and 38808. Hence, the & x' + y + z = 2 ]23g

required number of divisors = 72 – 2 = 70.
& 23 + 3 - 1 C3 - 1 = 25 C2 = 300

56. Given number is 960, we know that 960 = 26 # 31 # 51 . 4!
61. Number of way from H to P = 2!2! = 6
Therefore bases are p1 = 2, p2 = 3 and p3 = 5. and Number of ways from P to Q = 1 (obvious)
powers a1 = 6, a2 = 1 and a3 = 1. Thus sum of all 4!

Number of ways from Q to S = 1!3! = 4
the positive divisors of 960

d p1a + 1 - 1 nd p2a + 1 - 1 nd p3a + 1 - 1 n

1 2 3

=
p1 - 1 p2 - 1 p3 - 1

= a 2 - 1 ka 3 - 1 ka 5 - 1 k= (127) (4) (6)

26 + 1 - 1 31 + 1 - 1 51 + 1 - 1

3048
=
` Total ways = 6 # 4 = 24
 Permutations and Combinations 11.11
62. Given numbers can be rearranged as 66. Three elements from set A can be selected in 7 C3

1 4 7...88 " 30 ways. Their image has to be y2 . Remaining 2 images
can be assigned to remaining 4 pre-images in 24

2 5 8...89 " 30 ways. But the function is onto, hence the number of

3 6 9...90 " 30 ways is 2 4 - 2. Then the total number of functions
is 7 C3 # 14 = 490.

That means we must take two numbers from last
row or one number each from first and second row. 67. The two common elements can be selected in n C2
ways. Remaining n - 2 elements, each can be chosen
Total ways = 30 C2 + 30 C1 $ 30 C1 = 435 + 900 = 1335

in three ways, ie., a ! P and a Y ! Q or a ! Q and
63. One pair of 2 and 5 makes 10 (i.e., 2 # 5 = 10) aY! P or a is neither in P nor in Q. Therefore, the
which gives one zero at the end. Now 56, 1011, 1516, total number of ways is n C2 # 3 n - 2 .
2021, 2526, 3031 contains 6, 11, 16, 21, 52, 31 fives.
Therefore total number of fives = 6 + 11 + 16 + 21 + 68. Since the number of students giving wrong answers
( 2 # 26 ) + 31 = 137 to at least i questions (i = 1, 2, ...,n) is 2 n - i . T h e
Also, number of 2’s are greater than number of 5’s. number of students answering exactly i ]1 # i # ng
Thus, number of zero at the end 137. questions wrongly ={the number of students
64. 15 < x1 + x2 + x3 # 20 answering at students least i questions wrongly, i
= 1, 2, ...)} - { the number of students answering

& x1 + x2 + x3 = 16 + r, r = 0, 1, 2, 3, 4
at least (i + 1) questions wrongly (2 # i + 1 # n)}

Now, the number of positive integral solution of = 2 n - i - 2 n - ]i + 1g ]1 # i # n - 1g. Now, the number
x1 + x2 + x3 = 16 + r is 13 + r + 3 - 1 C13 + r, ie., of students answering all the n questions wrongly is

15 + r
C13 + r = 15 + r C2 2 n - 2 = 2 0 . Thus, the total number of wrong answer is
1 ]2 n - 1 - 2 n - 2g + 2 ]2 n - 2 - 2 n - 3g + 3 (2 n - 3 - 2 n - 4) +

Thus, the total number of solutions is
4
... + ]n - 1g]21 - 20g + n ]20g
/ 15 + r C2 = 15 C2 + 16 C2 + 17 C2 + 18 C2 + 19 C2
= 2 n - 1 + 2 n - 2 + 2 n - 3 + ... + 20 = 2 n - 1
r=0

= 2 ]15 # 14 + 16 # 15 + 17 # 16 + 18 # 17 + 19 # 18g
1 (a it is a G.P.) Therefore, as given

= 685 2 n - 1 = 2047 or 2 n = 2048 = 211 or n = 11

k / xi 75 69. f ^2n, nh must be equal to the number of positive
65. / 1xi =
1
x1
+
1
x2
+ ... +
1
xk
= n = n
i=1 integer solutions of x1 + x2 + ... + xn = 2n, which

(as L.C.M. of x1, x2, ..., xn is n)
must be equal to 2n - 1
Cn - 1 = 2n - 1 Cn .

EXERCISE - 3
Numerical Type 2. Let the number starts with 635 then two cases arise

Case 1: If 9 occurs at units place then the number of
1. Total number of triangle = Two points taken from numbers = 9 × 9 × 9 = 729.
AB and one point either BC or CA + similarly BC +
similarly CA + one point on each side.
Case-2: If 9 does not come at units place then

= 3C2 [4C1 + 5C1] + 4C2 [5C1 + 3C1] + 5C2 [3C1 + 4C1] number of ways for 9 to occur at either of the rest
three places = 3C1 = 3
+ 3C14C15C1 = 205

\ the number of numbers = 3 × 9 × 9 × 4 = 972
total numbers starting with 635 = 729 + 972
\ 
= 1701 Similarly total number starting with 674
= 1701.

\ Maximum number of trials = 1701 × 2 = 3402

Alternate: Total – Collinear points used

= 12C3 – (3C3 + 4C3 + 5C3) = 220 – 15 = 205.
11.12 Mathematics
3. Coin dividing in only one way is possible i.e. 1, 2, 4 8. Case I: If all are different then no. of ways is = 6C3 =
20

so the number of ways is

Case II: If three each of two colours, then

7
C1 . 6C2 . 4C4 . 3! = 7 × 15 × 6 = 630 combination is
4. Ten digits can be partitioned into four parts as
3 0 → 2!
1 + 1 + 3 + 5; 1 + 1 + 1 + 7 ; 1 + 3 + 3 + 3 (each
2 1 → 2! = 2! + 2! = 4 ways
partitioning has odd number of digits)

Case III: If two each of three colours, then
The number of ways in which these can be placed in
combination is
4! 4! 4!
the four spaces = + + = 20 ways
2 ! 3! 3!
2 1 0 → 3!

also numbers of arrangements of vowels = 5 !
1 1 1 → 1! = 3! + 1! = 7 ways

Number of arrangements of digits = 10 !
Hence required no. is = 20 + 7 + 4 = 31

total ways = 20 (10 !) (5 !) 9. First we select one married couple out of 6 married
couples i.e., 6C1 ways.
5. Let number be x1 x2 x3 x4 x5 x6

Then we select two more people which are not a

But, Here x1 + x2 + ... x6 = 12 10
C1 # 8 C1
couple in 2 ways.

so coefficient of x12 in expansion (1 + x + x2 + ... + 6
C1 # 10 C1 # 8 C1

Total = 2 = 240
x ) = (1 – x ) . (1 – x)
9 6 10 6 –6

⇒ 17C12 – 6C1 . 7C2 = 6188 – 126 = 6062 10. For Pn
First, line up the n - 3 people not selected and then
6. 8 - non identical
choose 3 of the n - 2 gaps they create
B1
number of ways = B2 B3
1 3 4 P & n = n - 2 C3



2 3 3 For Qn

2 2 4 First, assume that the n people are in a row

Here required number of ways Then there are n - 2 C3 ways to select 3 people so that
 8
C .6 C .3 C 8
C .6 C .4 C  no two are consecutive.
= 3! 8 C1 . 7 C3 . 4C4 + 2 3 3 + 2 2 4 
Now we must subtract the n-4 possiblities where the
 2! 2! 
two people gaps at the end were choosen
 8!
= 6 +
8!
×
6!
+
8!
×
6!  Q & n = n - 2 C3 - ]n - 4g
 3!. 4 ! 2 !. 6 ! 3!. 2 !. 2 ! 2 !. 6 ! 2 !. 4!.2!
Now

= 6[280 + 280 + 210] = 6 × 770 = 4620. Pn - Qn = n - 2 C3 - ^n - 2 C3 - ]n - 4gh
7. SERIES n = -4 & n - 4 = 6 & n = 10

S – 2, E – 2, R, Ι 11. Using multinomial theorem total number of required
selection is 8+3C8 = 11C8 = 11C3 = 165.

Case I When all letter distinct is

4
C3 × 3! = 4 × 6 = 24
12. x = number of red balls, y = number of blue balls,

Case II When 2 letters are same

z = number of white balls
3!
C1 . C1 .
2
= 2 . 3 . 3 = 18
3

x + y + z = 100
2!

Total number is 24 + 18 = 42, P/7 = 6 ` Number of ways = 102 C2 = 5151


(Using Begger’s method)

& a = 5; b = 1; c = 5; d = 1
& ]a + c - b - d g = 5 + 5 - 1 - 1 = 8

 Permutations and Combinations 11.13
13. Distinct letters are arranged in a circle by 4! ways. 19. Total tickets C2 # 4 = 28 # 4 = 112
8

Let number of alike letters to inserted between

N = 112 C4 = 2 # 7 # 37 # 5 # 11 # 109

distinct letters are
P
Numbers of divisors divisible by

220 = 2 # 2 # 2 = 8
T
20. 6! = :1 - 1! + 2! - 3! + 4! - 5! + 6! D = 265
1 1 1 1 1 1
Q
[using dearrangement]
21. A's " 4
S

L's " 2
R

2l + 1, 2m + 1, 2n + 1, 2p + 1, 2q + 1
E's " 1
where l, m, n, p, q ! N , !0 +

K's " 1

` 2l + 1 + 2m + 1 + 2n + 1 + 2p + 1 + 2q + 1 = 15
'
Hs " 1
` + m + n + p + q = 5 & 9 C4
l

Number of ways ( A's must be separated)

Hence, total number of ways
5!
= 2! # 6 C4

= 4! # 9 C4 = 24 # 9 C4 = 12 $ 10 C5

22. a/c question ‘CAR’ consider to be one letter
14. N = 11 C2 = 11 # 5

` Number of divisors = (1 + 1) (1 + 1) = 4
C"2 CAR C S S N N
6!
15. A
A " 2 = 2!2! # 7 C3 # 3!

S"2

N"2

B C
O"1

Number of triangle = 12 C3 - _1 + C3 + C3 i
E"1
4 5

220
= - 15 = 205
R"1

16. OO * L * D * 23. In 201! number of

{ a Have two O’s are considered as one letter}
2’s = 100 + 50 + 25 +12 + 6 + 3 + 1 = 197

` number of 8’s = : 3 D = 65
3! # 4 C2
197

17. A + B + C = 19
number of 3’s = 67 + 22 + 7 + 2 = 98
Case I: If A = 0 then number of ways = 20C1
` number of 24’s = 65

Case II: If A = 2 then number of ways = C1
18
24. Required number of ways

Case III: If A = 4 then number of ways = C1
16

= Total - number of ways in which no two stopping

: : : : stations are consecutive.

: : : : = 10 C4 - 7 C3


Case X : If A = 18 then number of ways = C1 2
25. For each elements of set A, there are 3 possibilities

` total number of ways
i.e.,

= 20C1 + 18C1 + 16C1 + ... + 2C1 = 110
(i) element of B but not element of C
18. No. of ways when Apples are together + no. of ways
(ii) element of C but not element of B
when mangoes are together - No. of ways when
Apples are also and Mangoes are also together
(iii) neither element of B nor element of C
8! 7 !
So, number of ways = 34
5! + 4! - 4! & k = 522 & 9
11.14 Mathematics

EXERCISE - 4
Single Option Correct
⇒ 1000 ! = 7164 . P

1. We know that m Cm = m+1Cm+1 and nCr + nCr – 1 = n+1Cr

\ 1000 7164. P P
= C500 =82 2
.
\ n Cm + n - 1 Cm + n - 2 Cm + ... + m + 1 Cm + m Cm = n + 1 Cm + 1
(7 . q ) q2

 ...(1) 6. Since P1 ∩ P2 ∩ ... ∩ Pm contains exactly r elements

n − m +1 of A, which can be select out of n elements in nCr

Now, ∑ r. n −( r −1)
Cm ways and all these r elements have only one choice.
r =1 For remaining (n – r) elements, the no. of choices is
= 1. n Cm + 2. n - 1 Cm + 3. n - 2 Cm + ... + ]n - m + 1gm Cm
m
C0 + mC1 + mC2 + ... + mCm−1 i.e. 2m − 1

∴ required no. of ways = nCr(2m – 1)n–r.

n −1
( mn
= Cm + Cm + .... + Cm ) 7. The required no. of ways = no. of solution of the
+ ( n −1
Cm + n−2 m
Cm + .... + Cm + ... ) equation (x1 + x2 + x3 + x4 + x5 + x6 = K)

where 0 ≤ xi ≤ 9, i = 1, 2,.... 6, where 0 < K < 18
 + ( m +1
)
Cm + m C m + m C m

= Coefficient of xK in (1 + x + x2 +...+ x9)6
= n+1Cm+1 + nCm+1 + ... + m+ 2Cm+1 + m+1Cm+1 = n+2Cm+2  1 − x10 
6

= Coefficient of xK in  
 [Using the result (1)]  1− x 
2. There are 9 letters: 3A , 1B, 2D, 1M, 1O, 1R
= Coefficient of xK in (1−6x10 + 15x20 −...) (1 + 6C1x+

therefore the required no. of ways = coefficient of x5
7
C2x2 + ... + 7−K – 10 – 1CK–10xK–10 +....+ 7 + K − 1CKxK)
 x x2   x x 2 x3 
= K+6CK − 6. K– 4CK–10
in (5!) 1 + +  1 + + +  (1 + x) 4
 1! 2!   1! 2! 3! 
  
= K+ 6C6 − 6 . K– 4C6.
= Coefficient of x5 in 8. There are 13 letters: 3A, 4S, 2I, 2N, 1T, 1O
 7 x3 5 x 4 1x5 
(5!) 1 + 2 x + 2 x 2 + + + 
∴ required number of ways = coefficient of x4 in
 6 12 12 

(1 + x + x2 + x3) (1 + x + x2 + x3 + x4) (1 + x + x2)2.(1

(1 + 4x + 6x2 + 4x3 + x4) + x)2
 5 1  7
= Coefficient of x4 in b 11 -- xx lb 11 -- xx lb 11 -- xx l ]1 + xg2
4 5 3 2
= 120  2 + 8 + 7 + +  = 120 17 + 

 3 12   4

= 2040 + 210 = 2250.

= Coefficient of x4 in (1 – x4) (1 – x5)(1 – x3)2 (1+ x)2
3. The number of divisors (excluding 1 and the no.  (1 – x)–4
itself) = (m1 + 1) (m2 + 1) (m3 + 1)... (mn + 1) − 2
4. The total number of possible outcomes is 6n. The
= Coefficient of x4 in (1 + 2x +x2 – 2x3 – 5x4).
number of possible outcomes in which 6 does not
(1 +4C1x + 5C2x2 + 6C3x3 + ... 7C4x4 + ...)
appear on any die is 5n . Thus, the number of possible
outcomes in which at least one die shows a 6 is 6n −
= 35 + 40 + 10 − 8 − 5 = 72.
5n. m m m m
9. The sum of the divisors of a 1 .b 2 .c 3 ....K n is
1000!
5. 1000
C500 = . The exponent of 7 in (500!) = (1 + a + a 2 + a 3 + ... + a m1 )

(500!) 2
 500   500   500  (1 + b + b 2 + b3 + ... + a m2 )


=  + + + 71 + 10 + 1 = 82
 7   7 2   73  ...(1 + K + K 2 + ... + K mn )


⇒ 500 ! = 782 . q. The exponent of 7 in (1000 !)
= b1 - lb 1 - b lb 1 - c l b1 - K l
m1 + 1 m2 + 1 m3 + 1 mn + 1
a
1000  1000  1000  1-a 1-b 1 - c ... 1 - K

=  + +
 7   7 2   73 

= 142 + 20 + 2 = 164
 Permutations and Combinations 11.15
10. The number of required solutions 14. The required number of arrangements

= Coefficient of y25 in 4(48 - 1)

= 4 + 42 + 43 +....+ 48 = = 87380.
( y 2 + y 4 + y 6 + ...)( y 3 + y 6 + y 9 + ...)
4 -1
15. The required number of ways
( y 4 + y8 + y12 + ...) ( y 5 + y10 + y15 + ...)

1 1 1 1 1

= Coefficient of y25 in y14 = 5!1 − + − + − 

 1! 2! 3! 4! 5! 
(1 + y 2 + y 4 + y 6 + y8 )(1 + y 3 + y 6 + y 9 ) 

 5! 5! 5!
= 5! − 5! +
− + −1
2 ! 3! 4 !
(1 + y 4 + y8 + ...) (1 + y 5 + y10 + ...) 


= 60 − 20 + 5 − 1 = 44.

= Coefficient of y in 11 16. Q The sum of the numbers formed by n non-zero
digits

(1 + y2 + y3 + y4 + y5 + y6 + y7 + 2y8 + 2y9
 10n − 1 
+ 2y10 + 2y11 + ...) = (sum of the digits) [ (n − 1)!] 

 10 − 1 

(1 + y4 + y5 + y9 + y10 + y13 + ...) = 5.
∴ The required sum
11. The exponent of 2 in  105 − 1 

= (1 + 3 + 5 + 7 + 9) (4!)  
1000  1000  1000  1000  1000   10 − 1 
1000! =  + + + +
 2   22   23   24   25 
= 25 × 24 × (104 + 103 + 102 + 10 + 1)

= 600 (10000 + 1000 + 100 + 10 + 1)
1000  1000  1000  1000 
+ 6 + 7 + 8 + 9 
 2   2   2   2 
= 6666600.

= 500 + 250 + 125 + 62 + 31 +15 + 7 + 3 + 1 17. There are 11 letters of which S repeating 4 times, I

= 994. The exponent of 5 in is repeating 4 times, P is repeating 2 times and M is
11!
single. The required number of ways = ] g] g] g
1000  1000  1000  1000 
4! 4! 2!

1000! =  + + + = 34650
 5   52   53   54 
18. A parallelogram is formed by choosing two straight
= 200 + 40 + 8 + 1= 249
lines from the set of m parallel lines and two straight

∴ 1000! = 2994 . 5294 P (P → not a multiple of 2 or 5)
lines from the set of n parallel lines .
=2 745
. (10) 249
. P.

∴ the required no. of ways = mC2 × nC2.
12. Alphabetical order : A, I, N, R, W, Z
19. We have x1 + x2 + x3 + x4 + x5 = 20 and x1 + x2 + x3 =

Words starting with A = 5! 5

with I = 5!
or x1 + x2 + x3 = 5 ...(1)

with N = 5! x4 + x5 =15 ...(2)

with RA = 4!
The required no. of solutions

with RIA = 3!

= No. of solutions of (1) × No. of solutions of (2)

with RIN = 3!

with RIW = 3!
= 7C2 × 16C1 = 336.

with RIZA = 2! 20. We may take 0, 1, 2, ..... P copies of each book.

with RIZN = 2!
RIZWAN = 1 Thus there are (P + 1) ways for each type of book.

Rank = 3(5!) + (4!) + 3(3!) + 2(2!) + 1 Therefore total ways of selections are (P + 1)n .
= 407 But this includes the case where all the books are
rejected and no selection is made.
1 1
13. No . of necklace = [(10 − 1)!] = (9!)
So, the required no. of ways = (P + 1)n − 1.
2 2
11.16 Mathematics
21. S 's = 3; U 's = 3; R's = 2 26. Since there are 9 elements in 3rd order determinant
8! 8 5
and each element has 3 choices.
3! $ 3! $ 2! = C3 $ C3
22. Since each bulb has two choices , either switched on
∴ required no. of determinant = 39
or off, therefore required number = 210 − 1 = 1023
Multiple options correct
23. Suppose there were n participants in the beginning .
27. Number of ways he can fail is either one or two,
Then the number of games played by (n 2) players
three or four subject then total of ways.

= n–2C2

4
C1 +4C2 + 4C3 +4C4 = 24 – 1.
\ n-2C2 + 6 = 84 (Two players played 3 games each)

28. Total no. of visits that a teacher goes is = 25C5

\ (n-2)
C2 = 78 ⇒ (n − 2) (n − 3) = 156

(selection of 5 different kids each time and teacher

⇒ n2 − 5n − 150 = 0 ⇒ n = 15 goes every time)
24. There are two cases.
Number of visits of a boy = select one particular boy
First Case: DOT cannot be spelt if all the coupons and 4 from rest 24 = 24C4
bear the same letter, therefore the number of ways
of choosing one letter out of three = nC1 = 3. So extra visits of a teacher from a boy is = 25C5 – 24C4
= 24C5.

Second Case: DOT cannot also be spelt if the
coupons are of two type only. The number of ways 29. Total number of required possibilities
of choosing two letters out of three is = 3C2 = 3 and
5
C3 . 8C7 + 5C4 . 8C6 + 5C5 . 8C5
there are 2 choices for the first draw, 2 for second
draw and so on, i.e. 2m (for m coupons) . But these
= 5C3 . 8C7 + 5C4 . 8C6 + 8C5 = 13C10 – 5C3 = 276.
include two choices in which all the coupons have 30. Here given no. be 1, 2, 3, ... n
the same letter. So the number of ways when the
Let common difference = r
coupons are of two types only is 3 (2m − 2).

Total way of selection = (1, 1 + r, 1+2r),(2, 2 + r,

Then total no. of ways = 3 + 3 (2m − 2) = 3 (2m − 1). 2 + 2r), ... (n – 2r, n – r, n)
25. Let x0 denote the number of empty seats to left of
Total numbers are = (n – 2r)
the first person and xi (1 ≤ i ≤ 14) the number of
empty seats between the ith and (i + 1)th persons
Here rmin. = 1 and rmax. = (n – 1)/2 (for odd n)
and x15 the number of empty seats to the right of
Case I When n is odd
the 15th person. Then x0, x15 ≥ 0 and xi ≥ 1 for and
1 ≤ i ≤ 14. ]n - 1g

rmax = 2 and total no. of selection is

x0 + x1 + x2 + ... + x15 = 40 – 15 = 25
 n −1  n +1 
2  

∴ The required no. of ways = no. of solution of ( n −1)/2 n ( n − 1) 2  2 

= ∑ ( n − 2r ) = − 
equation (1) × (15!) 2 2
r =1

= Coefficient of y25 in (1 + y + y2 + ...)2 2
 n −1
(y + y2 + y3 + ...)14 × (15!) = 
 2 
 1   1 
2 14 n−2

Case II: When n is even ; rmax = so total no.

= Coefficient of y in y  25
 
14
 × (15!) 2
1− y  1− y  selection is

= Coefficient of y in (1 − y)
11 –16
× (15 !) n−2n
( n − 2 ) /2 2 
n ( n − 2) 2 2

= Coefficient of y11 in
= ∑ ( n − 2r ) = − 
r =1 2 2

(1 + 16C1y + 17C2y2 + ... + 16 + 11 – 1C11y11 + ...)
× (15!) n−2 n n ( n - 2)
=  n −  = .
 2  2 4
= 26 C11 # ]15!g = ] g] g ]15!g = 11! = 26 P15
26! 26!

11! 15!
 Permutations and Combinations 11.17
31. For arrangement to be symmetrical there will be 37. x1 + x2 + x3 + x4 ≤ n ⇒ x1 + x2 + x3 + x4 + y = (where
‘m’ white coins and ‘n’ red coins on each side of the y is known as pseudo variable)
central mark. Also, the arrangement on both sides

Total no. of required solution is = n + 5 –1Cn = n+4Cn or
will be exactly same & Arranging (m + n) coins on n+4
C4.
one side out of which ‘m’ are identical and ‘n’ others
are identical is m+ nCm. 38. First, arrange the empty seats = 1 way
32. Total required number of teams is
Now, there are 7 gaps amongst the 6 empty seats.
1
Arrange 4 people in the 7 gaps

= 10C4. 6C3. 3C3. = 2100 = 10C4 . 5C2 = 2100.
2!
33. Words starting with A = 4! = 24 = 7 C4 .4! = 4.7 P3 = 7 C3 .4! = 840

4! 50!  50   50 

with G = 2! = 12 & 36 words in total 39. exp of 19 in 50 ! =   +  2  = 2
14!36!  19  19 
4!  36   36 

with I = 2! = 12 & 48 words in total
Exp. of 19 in 36 ! =   +  2  = 1

 19  19 

(d) INAGA is one word before
INGAA
⇒ 50C36 is divisible by 19 but not by 192

(b) 49th word is NAAGI  50   50 
Exp. of 5 in 50 ! =   +   = 12;

 5   25 

(a) 50th word is NAAIG (c) 51st word is NAGAI
14 
34. Required number of possible is
Exp. of 5 in 14 ! =   = 2
5

8 ! – 2. 7 ! = 7 ! (8 – 2) = 6 . 7! ⇒ 2 . 6 ! . 7C2.
 36   36 
35. (a) Without changing the order of the vowels of Exp. of 5 in 36 ! =   +   = 8Ans. (a) and (b)
 5   25 
MULTIPLE 2n!
40. Value of pn is
2n

So we choose the first three place in 8C3 ways and n!
the rest are arranged is
(a)(n + 1) (n + 2) ... (2n) = (d) n! . 2nCn
8! 5! 8! 1.2.3.4.5.6.7.8.9.10.11...(2n - 2) (2n - 1).2n

= × = = 3360. =
3!5! 2! 3!2! 1.2.3........n

Hence required no. is 3360 – 1 = 3359. [1.3.5.7...(2n - 1)].(2.4.6.8...2n)

=

(b) Keeping the position of each vowel fixed M_LT_ 1.2.3...n
5!
PL_ Number of ways = = 60 other ways = 60 – 1 [1.3.5.7...(2n - 1)]. 2n (1.2.3.4...n)
2
=
= 59. (1.2.3.4...n)
(c) without changing the relative order/position
= 2n [1.3.5.7. ... (2n – 1)] = [2. 6. 10. 14 ... (4n – 2)].
of vowels and consonants so number of ways is
200
5! C2 . 198C2 . 196C2 ...2 C2 200!
= × 3! = 60 × 6 = 360. 41. = 100
2! 100! 2 .100!
Hence required number is = 360–1 = 359.
101.102.103...200
= b 2 l . b 2 l . b 2 l ... b 2 l
8! 10 102 103 200
(d) Total = 2 = 4.7!
=
2100
36. Number of ways to Arrange all the letter except
‘CCC’ is 1.2.3.4.5.6.7.8...200

and =
2100 .100!
12!
Now there are 13 places where ‘C’ can be
5! 3! 2! (1.3.5.7...199) (2. 4. 6.8...200)
=
13
placed & C3 2100 .100!
12! 13
Hence required number of ways is = . C3 (1.3.5...199). 2100 .100!
5! 3! 2!
= = 1.3.5.199.
13! 2100 .100!
= 11.
.
6!
11.18 Mathematics

42. 46. Let A = " a1, a2, ..., an , . For each ai ]1 # i # ng, we
have either ai ! Pj or a j Y ! Pj ^1 # j # m h . That
5! 5! is, there are 2 choices in which ai ]1 # i # ng
m

= 0! $ 1! $ 4! # 3! + 0! $ 2! $ 3! $ 3! = 30 + 60
may belong to the Pj 's. One of these, there is only

=90 ways one choice, in which ai ! Pj for all j = 1, 2, ..., m
43. Let the number of regions for n circles be f(n). ! P1 + P2 + ... + Pm in 2 m - 1 ways.
ai Y
Clearly, f(1) = 2.
Since there are n elements in set A, the total number
Now, f ]ng = f ]n - 1g + 2 ]n - 1g, 6n $ 2
of choices is ]2 m - 1gn .

& ]ng - f ]n - 1g = 2 ]n - 1g
f
Also, there is exactly one choice, in which, ai Y
! Pj

Putting n = 2, 3, ..., n, we get for all j = 1, 2, ..., m which is not favourable for
f ]ng - f ]1 g = 2 ]1 + 2 + 3 + ...n - 1g = ]n - 1gn P1 , P2 , ... , Pm to be equal to A.

& ]ng = n ]n - 1g + 2 = ]n 2 - n + 2g
f Thus, ai can belong to P1 , P2 , ... , Pm in ]2 m - 1g

ways. Since there are n elements in set A, the number

(which is always even)
of ways in which P1 , P2 , ... , Pm can be equal to A
& ]20g = 20 2 - 20 + 2 = 382
f is ]2 m - 1gn .
Also, n 2 - n + 2 = 92 or n 2 - n - 90 = 0 or n = 10
Comprehension type
Passage - 1 (Question. 47 - 49)
44. When n = 3k, there are exactly n/3 integers of each
type 3p, 3p + 1, 3p + 2. 47. 3 official out of 8 can be selected by 8C3 = 56 ways

2 non-official out of 4 can be selected in 4C2 = 6

Now, sum of three selected integers is divisible ways
by 3. Then either all the integers are of the
∴ required number of committees are 56 × 6 = 336.
same type 3p, 3p + 1, or 3p + 2 or one- 48. Two non-officials and 3 officials i.e.
one integer from each type. Then number
4C2 × 8C3 = 6 × 56 = 336.
of selection ways is n/3
C3 + n/3 C3 + n/3 C3 +
Three non-official and 2 officials

]n/3 C1g]n/3 C1g]n/3 C1g = 3 ]n/3 C3g +]n/3g3 .

4C3 × 8C2 = 4 × 28 = 112.

Four non-officials and 1 official
If n = 3k + 1, then there are ]n - 1g/3 integers of
4
C4 × 8C1 = 1 × 8 = 8
the type 3p, 3p + 2 , and ]n + 2g /3 integers of the
Total 336 + 112 + 8 = 456.
type 3p + 1. Then number of selection ways is 49. Required no. of ways
2 ]]n - 1g/3 C3g + ]]n + 2g/3 C3g + ((n - 1) /3) 2 ]n + 2g.
= 12 – 1C5 = 11C5 = 462.
Passage - 2 (Question. 50 - 51)

When n = 3k + 2, the number of selection ways are
same as in the case of n = 3k + 1. 50. In the word RESONANCE there are 9 letters.

45. Total number of units to be covered is 3 + 7 + 11

Consonants (5), 1R, 1S, 1C and 2N
= 21. A person can choose 3 units in 21
C3 ways. A
Vowels (4), 2E, 1O, 1A
person can choose 7 units in 18
C7 ways. The rest
total even places 4;
4!
11 units can be chosen in 1 way. Therefore, total
No. of ways arranging vowels in even places is
2!
number of ways is 21 C3 # 18 C7 # 1 = 21!/ ]3!7!11!g . = 12.

No. of ways arranging consonants in remaining odd

For correct answers (a) and (d), see the respective 5!
theory. For correct answer (b) see the theory of places is = 60.
2!
multinomial expansion in the binomial theorem.
required number of arrangement = 12 × 60 = 720 =
n.
 Permutations and Combinations 11.19
51. First, we fix places for R, S, Q & A Matching Column Type

This can be fixed in 9C4 ways Then, the remaining 59. (a) 7C4 + 7C3 × 5C1 + 7C2 × 5C2 = 420
5!
letters can be arranged in 2!2! ways (b) The number of ways of selecting 3 points out
5! of 12 points is 12C3. Three points out of 7 collinear
& Total = 9 C4 . 2!2! = 3780

points can be selected in 7C3 ways.
Passage - 3 (Question. 52 - 53)
Let n lines divides the pizza into Sn pieces. Let us
Hence, the number of triangles formed is 12C3 – 7C3
add new (n + 1)th line, L which cuts the previous n = 185.
lines by assumption. Now line L will cut the original
pieces into 2 pieces further and we are passing
(c) mC2 × nC2
trough (n + 1) such pieces, hence

(d) Two circles intersect in 2 points.
Sn + 1 = Sn + (n + 1)

∴ Maximum number of points of intersection of
n(n + 1)
Sn = +1 two circles = 2 × number of selections of two circles
2
when Sn ≥ 60 where n ∈ N from 8 circles.
n(n + 1) + 2 ≥ 60

= 2 × 8C2 = 2 × 28 = 56
n + n – 11 ≥ 0
2

n = 10, is not satisfy

∴ Maximum number of points of intersection of

n = 11 is satisfying two straight line = 1 × number of selections of two

straight line from 4 straight line = 4C2 = 6.
⇒ n = 11.
Passage - 4 (Question. 54 - 56)
∴ Maximum number of points of intersection of

2 24 - 1 = ]212 + 1g]212 - 1g = ]212 + 1g]26 + 1g

one straight line and one circle = 2 × number of

]26 - 1g
selections of one straight line from 4 straight line
4097
= $ 65 $ 63 = 241 $ 17 $ 5 $ 13 $ 7 $ 3 2 $ and number of selections of one circles from 8

Number of primes = 6 circles = 4C1.8C1.2 = 64

(1) Total divisors = 2 $ 2 $ 2 $ 2 $ 2 $ 3 = 96. 4! 4!
60. (a) 2! = 144

(2) Number of two digit divisor 13 ; 17 ; 21 ; 39 ; 2 ! 2 !2 !

15 ; 51 ; 63 ; 45 ; 91 ; 35 ; 65 ; 85 " 12 divisors. 4!

(b) 8C4 = 840

(3) ` Required number = 2 6-1
= 32 2!
(c) Case I: 2-alike + 2-alike = 3C2
Passage - 5 (Question. 57 - 58)
3. n P4 = n - 1 P5 On solving, n = 10

Case II: 2-alike + 2 diff. = 3C1 4C2

57. First arrange the 7 non stopping stations in 1 way Case III: All diff. = 5C4
Now, there are 8 gaps in these 7 stations, choose any
= 3 + 18 + 5 = 26
3 gaps out of these 8 gaps for the stopping stations =

8
C3 5! 6

(d) C = 900
2! 2
58. Two adjacent sides are common
& 3 consecutive vertices are common
& choose 3 consecutive vertices in 10 ways and
choose one out of the remaining 5 vertices in 5 ways
Total = 10 # 5 = 50 ways
11.20 Mathematics
61. (a) Each box (say B1, B2, B3) will have at least one
Case 2: Division can also be 3 in one box and 1 each
ball.Now the ways for placing other 2 identical balls in remaining 2 boxes (3, 1, 1) ways:
in 3 different boxes are:
5!2 = 10. Hence total ways = 10 + 15 = 25.
]n + r - 1g! 3! × (1!) × 2!
=6 c ] - g m
(2 + 3 − 1)!

2! (3 − 1)! n! r 1 !
(c) Only 2 arrangements are possible.
1. 2 balls each in 2 boxes and remaining ball in

(b) Case 1: 5 balls can be divided in 3 groups having
other box (2, 2, 1)
2 balls each in 2 boxes and 1 ball for in third box (2,
5! 2. 3 balls in 1 box and 1 ball each in other boxes
2, 1) ways: = 15. (3, 1, 1)
(1!)(2!) 2 × 2!
(d) Same cases as that of in part (b) with
arrangements.

Numerical Type Finally total number of ways of forming group is

10
C2 (28 - 2)
1. Since each group has atleast 1 student and group C
can have at most 3 student mean it can either have Case 3: Group C has 3 student
1 or 2 or 3 students. Then the remaining 7 students will be distributed
among the group B and C

Case 1: Group C has 1 student Now the 3 students for group C can be selected in
Then then remaining 9 students will be distributed 10
C3 ways
among the group B and C And each of the remaining 7 student has two choices
Now the one student for group C can be selected in either to go in group B or group C
10
C1 ways. Hence the remaining 7 students can be distributed
And each of the remaining 9 student has two choices among B and C in 27 ways.
either to go in group B or group C But there occurs two cases where all the 7 students
Hence the remaining 9 student can be distributed will either go into group B or all will go into group C.
among B and C in 29 ways. Thus the number of ways to distribute 7 student into
two groups i.e B and C such that each has atleast one
But there occurs two cases where all the 9 student
student will be 27 - 2
will either go into group B or all will go into group C.
Finally total number of ways of forming group is
Thus the number of ways to distribute 9 student into 10
C3 (27 - 2)
two group i.e B and C such that each has atleast one
student will be 29 - 2 Therefore total groups
Finally total number of ways of forming group is = 10 C1 (29 - 2) + 10 C2 (28 - 2) + 10 C3 (27 - 2)

10
C1 ^29 - 2h 5100
= + 11430 + 15120

Case 2: Group C has 2 student 31650
=
Then the remaining 8 students will be distributed 2. EXAMINATION
among the group B and C

2N, 2A, 2I, E, X, M, T, O
Now the 2 students for group C can be selected in
10
C2 ways Case I All are different so
And each of the remaining 8 student has two choices 8!
8 P4 = = 8.7.6.5 = 1680
either to go in group B or group C 4!
Hence the remaining 8 students can be distributed Case II 2 same and 2 different so
among B and C in 28 ways. 4!
3 C1 . 7 C2 . = 3.21.12 = 756
But there occurs two cases where all the 8 student 2!
Case III 2 same and 2 same so
will either go into group B or all will go into group C.
4!
Thus the number of ways to distribute 8 student into 3 C2 . = 3.6 = 18
two groups i.e B and C such that each has atleast one 2!.2!
student will be 28 - 2 ` Total = 1680 + 756 + 18 = 2454
 Permutations and Combinations 11.21
Single Options Correct 7. Let A(a, 0) and B(0, b) be the vertices of the given
triangle AOB.
3. Given that 1
∴ 2 | αβ |= 50
xyz = 24
⇒ |ab| = 100
& xyz = 23 # 31


Let x = 2a # 3 b , y = 2a # 3 b & z = 2a # 2 b
1 1 2 2 3 3

& (2a # 3 b ) (2a # 3 b ) (2a # 3 b ) = 23 # 31

1 1 2 2 3 3

3 1

&2 a1 + a 2 + a 3
#3 b1 + b 2 + b 3
= 2 #3

Thus by comparison

a1 + a 2 + a3 = 3

Number of non-negative integral solutions
= 3 + 3 - 1 C3 - 1 = 5 C2 = 10

Now, 100 can be factorised as

And b1 + b 2 + b3 = 1
1 × 100, 2 × 50, 4 × 25, 5 × 20, 10 × 10.

Number of non-negative integral solutions
∴Number of triangles having area 50 sq. units
= 1 + 3 - 1 C3 - 1 = 3 C2 = 3

= 4 × 9 = 36.

Therefore total number of ways = 10 # 3 = 30
8. To select and arrange
4. 1, 3, 5, 7, 9 6 $ novels
3 $ ^4 novels + 1 dictionary h

For digit to repeat we have C1 choice 5
3 $ dictonaries
6
6
C4 .3 C1 # 4! = 15 # 3 # 24 = 1080

And six digits can be arrange in ways.
2
9.
56

Hence total such numbers =
2

Total number of ways
5. Required number of ways
4
C0 $ 3 C3 $ 3 C3 $ 4 C0 + 4 C1 $ 3 C2 $ 3 C2 $ 4 C1
= Total number of ways + 4 C2 $ 3 C1 $ 3 C1 $ 4 C2 + 4 C3 $ 3 C0 $ 3 C0 $ 4 C3

–When A and B are included already
= 485
= C2 × C3 – C1 × C2 = 350 – 50 = 300
5 7 5 5
10. Total number of words which can be formed using all
6. Let n be any natural number less than 7000 which the letters of the word ‘SMALL’
can be formed from 0, 1, 3, 7, 9. 5!

= 2! = 60
So, following cases arise:
Case I : One digit numbers
Now, 60th word is $ SMLLA
∴Number of ways for n = 4
59th word is $ SMLAL
Case II : Two digit numbers

58th word is $ SMALL
∴ Number of ways for n = 4 × 5 = 20
11. Case-I
Case III : Three digit numbers
∴ Number of ways for n = 4 × 52 = 100 when number is of 4 digits
Case IV : Four digit numbers
∴ Number of ways for n = 2 × 53 = 250

3 # 4 # 3 # 2 = 72

Total number of ways for n = 4 + 20 + 100+ 250
(6,7,8)

= 374.

Case-II

when number is of 5 digit = 5! = 120

Total = 120 + 72 = 192
11.22 Mathematics
12. Tn = nC3 15. Statement - 1 :

Tn + 1 = n + 1C3
B1 + B2 + B3 + B4 = 10 = coefficient of x10 in

(x1 + x2 + .....+ x7)4

Tn + 1 – Tn = n + 1C3 – nC3 ⇒ nC2 = 10 ⇒ n = 5.

= coefficient of x6 in (1 – x7)4 (1 – x)–4 = 4+6–1C6 = 9C3
13. (10 + 1) (9 + 1) (7 + 1) – 1 = 11.10.8 – 1 = 879.
Statement 2: Obviously 9C3
10 × 9 × 8 6 × 5 × 4
14. 10
C3 – 6C3 = − = 120 – 20 = 100
6 6

Single Option Correct 5. S = {1, 2, 3, 4}

1. There are only 4 even numbers in S
Each element can be put in 3 ways a either in the
subsets or we don’t put in any subset.

` Any subset of 5 elements of S will have at least
1 odd number.
& Number of ordered pairs = 34

& N1 + N2 + N3 + N4 + N5 = 9C5 = 126 Out of these one pair is "z, z ,

& Total number of unordered pairs
2. If a boy is selected then number of ways = 4 C1 .6 C3
34 - 1

If a boy is not selected then number of ways = 6C4
= 2 + 1 = 41

Captain can be selected in 4C1 ways 6. There are two possible cases

Required number of ways
Case 1: Five 1’s, one 2’s, one 3’s
= 4 C1 $ 6 C3 $ 4 C1 + 6 C4 $ 4 C1 = 380
7!

Number of numbers = = 42
5!
3. Cards Envelopes

Case 2: Four 1’s, three 2’s

1 1
7!

2 2
Number of numbers = = 35
4! 3!

3 3
Total number of numbers = 42 + 35 = 77.

4 4 Multiple Options Correct

5 5 7. Number of elements in S1 = 10 # 10 # 10 = 1000

6 6
Number of elements in

If ‘2’ goes in ‘1’ then it is dearrangement of 4 things
S2 = 9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 = 44
1 1 1 Number of elements in S3 = 10C 4 = 210

which can be done in 4! =  − +  9 ways.
 2! 3! 4!  Number of elements in S4 = 10P4 = 2104! = 5040
Comprehension Type

If ‘2’ dosen’t go in 1, it is dearrangement of 5 things
which can be done in 44 ways. Hence total 53 ways. 8. 1----------------- 1 # an–1 = bn

4. B1 B2 B3
----------------- 1 0 # an–2 = cn
So an = an–1 + an–2 as an = bn + cn

Case 1: 1 1 3

So (a) choice is correct

Case 2: 2 2 1

consider (b) choice c17 ≠ c16 + c15

Ways of distribution

& a15 ≠ a14 + a13 is not true
5! 5!
consider (C) choice b17 ≠ b16 + c16

= . 3! + .3! = 150.
1 ! 1 ! 3! 2! 2 ! 2 ! 1! 2!

a16 ≠ a15 + a14 is not true

consider (d) choice a17 = c17 + b16

a17 = a15 + a15 which is not true
 Permutations and Combinations 11.23
14. n(X) = 5 n(Y) = 7
α → Number of one-one function = 7C5 × 5! = 21
× 120 = 2520
β → Number of onto function Y to X

Aliter:

using the Recursion formula an = an–1 + an–2

Similarly bn = bn–1 + bn– 2 and cn = cn–1 + cn– 2 ∀ n ≥ 3
and an = bn + cn ∀ n ≥ 1


so a1 = 1 , a2 = 2 , a3 = 3, a4 = 5, a5 = 8...
7! ×5! + 7!3 ×5! = (7 C3 + 3.7 C3) 5!

b1 = 1 , b2 = 1 , b3 = 2, b4 = 3, b5 = 5, b6 = 8... 3!4! ]2!g 3!
= 4× C3 ×5!
7

c1 = 0, c2 = 1, c3 = 1, c4 = 2, c5 = 3, c6 = 5...
b-a

using this bn–1 = cn ∀ n ≥ 2 5! = 4×7 C3 - 7 C5 = 4×35 - 21 = 119
9. b6 = a5 15. x = 10!

a5 = 1 - - - 1 or 1 - - - 0 & a5 = 8 10!
y = 10 C1 # 9 C8 # 2!

3C0 + 3C1 + 1 + 2C1 + 1 y 10
C # 9C 10 # 9
& 9x = 91# 2! 8 = 9 # 2 = 5 & 5
Numerical Type
16. n = 5! × 6!
10. Selection of 4 days out of 15 days such that no two
of them are consecutive
m = 5! × 6C2 × 5C4 .2! .4!.
= 15 - 4 + 1 C4 = 12 C4 m 5! # 15 # 2 # 5!
n = 6! # 5! =5
12 # 11 # 10 # 9
= 4#3#2 = 11 # 5 # 9 = 495 17. Number of adjacent lines = n
6!
11. Required ways = 2!2!1!2!2! # 4! = 1080
12. Maximum number of hats of
same colour are 2 and minimum
colour required are 3. So, the
selection of hats will have to be
of the type AABBC.
& 3C1 ways to select colour
having single hat. Then
Number of line segment joining non-adjacent points
distribute that single hat in 5C1 is nC2 – n.
ways. 2C1 ways to distribute hat to adjacent person, n(n - 1)

Now, n = (nC2 – n) ⇒ 2n = ⇒ n = 0, 5
after that alternate coloured hat will be given so 3 × 2

But n ≥ 2. so, n = 5.
5 × 2 = 30
18. C C H I N O
13. Last two digits are 12, 32, 24, 52, 44
C C 4!

Number of numbers = 5 × 5 × 5 × 5 = 625
C H 4!

C I 4!

C N 4!
C O C H I N


4 × 4 ! = 4 × 24 = 96
11.24 Mathematics
Matching Column Type 20. (a) Consider ‘ENDEA’ as one letter so there are five
things which are ENDEA , N, O, E, L
19. 6 Boys & 5 girls

∴ number of permutations = 5!

α1 → number of ways of selecting 3 boys & 2 girls
6
C3 × 5C2 = 200 Hint: Number of arrangements of n objects in a
line in which r objects always remain together in a

α2 → Boys & girls are equal & members ≥ 2
particular order are (n – r + 1)!

6
C1 . 5C1 + 6C2 . 5C2 + 6C3 . 5C3 + 6C4 . 5C4 + 6C5 . 5C5
= 11C5 – 1 = 461
(b) E N D E A N O L E (first and last letters are
fixed)

α3 → number of ways of selecting 5 having at least 7!

Number of permutations = = 21 × 5!.
2 girls C5 – C5 – C4 . C1 = C5 – 81 = 381
11 6 6 5 11 2!
Hint : Number of permutations of n objects in which

α4 → G1 is included → 4C1 . 5C2 + 4C2 . 5C1 + 4C3
n!
r are alike = .

= 40 + 30 + 4 = 74 r!

(c) N, N, D, L will come at first four places and E, E,
M1 is included → 4C2 . 5C1 + 4C3 = 34 E, O, A will come at last five places

G1 & M1 both are excluded → 4C4 + 4C3 . 5C1 + 4C2 . 4 ! 5!

∴ number of permutations = × × = 2 × 5!.
5
C2 = 81 2 ! 3!
Hint: Number of permutations of n objects in which

Total = 74 + 34 + 81 = 189 n!
r are alike =
r!

(d) A, E, E, E, O, occur at odd positions and N, N, D,
5 ! 4!
L at even positions = × × = 2 × 5!.
3 ! 2!
Hint: Number of permutations of n objects in which
n!
r are alike = .
r!
Subjective Type
21. Total number of ways of distributing n2 objects into
n groups, each containing n objects
(n 2 )! (n 2 )!
= .n ! = = integer
(n!) n n! (n!) n
(Since number of ways are always integer)