Solution

CH. PERMUTATIONS AND COMBINATIONS

Class 11 - Mathematics
Section A

1. (a) 210
Explanation: You can either choose true or false, therefore for 10 questions you will have 210 possibilities.
2. (a) 3
Explanation: The number of ways of seating 4 persons at a round table = (4 - 1)! = 3!
But in clockwise and anticlockwise arrangements the same persons are neighbours and hence these two arrangements will be
same.
3! 6
Therefore the required number of arrangements = 2
=
2
=3
3. (c) 2m = n(n - 1)
Explanation: m
C1 =
n
C2

⇒
m!
= n!

1!(m−1)! 2!(n−2)!

m(m−1)! n(n−1)(n−2)!
⇒
(m−1)!
= 2(n−2)!

⇒ 2m = n(n - 1).
4. (c) 1080
Explanation: Since we have to form a four-digit number using the digits 0, 2, 3, 5, 8, 9, we can fill the first place by any of the
five digits given other than zero.
Now since the digits can be repeated the second, third and fourth places can be filled by any of the six given digits.
Hence the four places can be filled together in 5 × 6 × 6 × 6 = 1080 different ways
Therefore the number of four-digit numbers which can be formed using the given digits = 1080
5. (c) 27
Explanation: Given xyz = 30
We have the possible values of x, y, z are the following triads
1, 1, 30
1, 2, 15
1, 3, 10
1, 5, 6
2, 3, 5
First one can have 3!

2!
= 3 ways and the remaining four triads can have 3! combinations
Hence total combinations = 3 + 4 × 3! = 27
Section B
6. (c) A is true but R is false.
Explanation: nPn = n!

Assertion: true, but the no. of functions from A to B is nn.

7. (a) Both A and R are true and R is the correct explanation of A.
Explanation: Given: x + y + z + w = 20
20 is divided in four groups.
Now if include zero values for all the integers here, then the total number of solutions
= 20+4-1C4-1

8. (a) Both A and R are true and R is the correct explanation of A.

Explanation: Since clockwise and anticlockwise arrangements are not different so, required no of arrangement is 80!

2
.
9. (a) Both A and R are true and R is the correct explanation of A.
100

Explanation: ∑
500−r
C3 + 400C4
r=0

1 / 12
 = 500C3 + 499C3 +...+ 401C3 + 400C3 + 400C4

= 500C3 + 499C3 +...401C3 + 401C4

= 500C3 + 499C3 + ... + 402C4

Similarly,
500C + 500C
3 4
501C = RHS
4

10. (d) A is false but R is true.

Explanation: Civilization: Letter ⇒ 12
i repeats 4 times
Total no. of rearrangement = 12!

4!

= 19958400
Section C
11. Given: We have 9 letters
To Find: Number of words formed with Letter of the word ‘ALLAHABAD.’
The formula used: The number of permutations of n objects, where p1 objects are of one kind, p2 are of the second kind, ..., pk is
of a kth kind and the rest if any, are of a different kind is = n!

p1 ! p2 !... pk !

ALLAHABAD’ consist of 9 letters out of which we have 4 A’s and 2 L’s.

Using the above formula
Where,
n=9
p1 = 4
p2 = 2
9!

4!2!
= 7560
7560 different words can be formed.
12. Total number of letters in word EQUATION = 8
Number of letters used (all different) = 8
∴ Number of permutation = 8P8
= 8!

0!
= 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 = 40320
13. There are 8 letters in the word TRIANGLE
∴ Number of 8 letter words = Number of arrangements of 8 letters, taken 8 at a time = 8P8 = 8!
14. If we fix the first letter as E, the remaining 5 letters can be arranged in 5! ways to form the words.
Therefore the number of words starting with the E = 5! = 120
15. nCr + 2nCr - 1 + nCr - 2

= (nCr + nCr - 1) + (nCr - 1 + nCr - 2)

= n + 1Cr + n + 1Cr - 1 = n + 2Cr [∵ nCr + nCr - 1 = n + 1Cr]

16. Required number of ways = number of arrangements of 6, different things taking all at a time .... that is
6P = 6! = (6 × 5 × 4 × 3 × 2 × 1) = 720
6
17. Let us make the following cases:
Case (i) Boy borrows Mathematics Part II, then he borrows Mathematics Part I also. Therefore, the number of possible choices is
6C = 6.
1
Case (ii) Boy does not borrow Mathematics Part II, then we get the number of possible choices is 7
C3 = 35.
Therefore,the total number of possible choices is 35 + 6 = 41.
18. A man may invite one of them, two of them, three of them,..., all of them and this can be done in 7c1 7c2, 7c3,..., 7c7 ways.
∴ Total number of ways
= 7C1 + 7C2 + 7C3 + 7C4 + 7C5 + 7C6 + 7C7
= 7 + 21 + 35 + 35 + 21 + 7 + 1 = 127

2 / 12
19. Fix the positions of X and Y.
Now, the boys B1, B2 and the girls G1, G2 may have their neighbours X and Y respectively.
The boys B1 and B2 may be arranged among themselves in 2! ways. And, the girls G1 and G2 may be arranged among themselves
in 2! ways.
Hence, the required number of arrangements = (2× 2) = 4.
20. P (15, 3) = 15!
= =
15!
= 2730
15×14×13×12!

(15−3)! 12! 12!

21. Suppose A1, A2, A3, A4, A5 are five persons.

A1 can leave the cabin at any of the seven floors. So, A1 can leave the cabin in 7 ways.
Similarly, each of A2, A3, A4, A5 can leave the cabin in 7 ways.
Thus, the total number of ways in which each of the five persons can leave the cabin at any of the seven floors is 7 × 7 × 7 × 7
× 7 = 75 = 16807
5

22. We have, 47C4 + ∑

52- j C
3
j=1

= 47C4 + 52 - 1C3 + 52 - 2C3 + 52 - 3C3 + 52 - 4C3 + 52 - 5C3

= 47C4 + 51C3 + 50C3 + 49C3 + 48C3 + 47C3

= (47C3 + 47C4) + 48C3 + 49C3 + 50C3 + 51C3

= 48C4 + 48C3 + 49C3 + 50C3 + 51C3 [∵ nCr - 1 + nCr = n + 1Cr]

= 49C4 + 49C3 + 50C3 + 51C3 = 50C4 + 50C3 + 51C3

= 51C4 + 51C3 = 52C4

23. P (11, r) = P (12, r -1)
11! 12!
⇒ =
(11−r)! (13−r)!

(13−r) 12!
⇒ =
(11−r)! 11!

(13−r)(12−r)(11−r)!
12×11!
⇒ =
(11−r)! 11!

⇒ (13 - r) (12 - r) = 12
⇒ (13 - r) (12 - r) = 4 × 3
On comparing the two sides, we get:
13 - r = 4
⇒ r = 9

24. This word consists of T letters that include two Rs, and two As.
The total number of words is the number of arrangements of 7 things, of which 2 are similar to one kind and 2 are similar to the
second kind.
7!
⇒
2!2!
= 1260
25. We have been given seven digits, namely 1, 2, 3, 4, 3, 2, 1.
So, we have to form 7-digit numbers, so that odd digits occupy odd places.
Every 7-digit number has 4 odd places.
Given four odd digits are 1, 3, 3, 1 out of which 1 occurs 2 times and 3 occurs 2 times.
So, the number of ways to fill up 4 odd places = =6 4!

(2!)×(2!)

Given three even digits are 2, 4, 2 in which 2 occurs 2 times and 4 occurs 1 time.
So, the number of ways to fill up 3 even places = =3 3!

2!

Hence, the required number of numbers = (6 × 3) = 18

26. Given: 35Cn+7 = 35C4n–2
Need to find: Value of n
We know, one of the property of combination is: If nCr = nCt, then,
i. r = t
ii. r + t = n
Applying property (i) we get,

3 / 12
 ⇒ n + 7 = 4n – 2 ⇒ 3n = 9 ⇒ n = 3
Applying property (ii) we get,
⇒ n + 7 + 4n - 2 = 35 ⇒ 5n = 30 ⇒ n = 6

∴ , the value of n is either 3 or 6

27. Given: Four-digit number is required which is greater than 8000

Assume four boxes, now in the first box can either be one of the two numbers 8 or 9, so there are two possibilities which is 2C1

In the second box, the numbers can be any of the four digits left, so the possibility is 4C1

Similarly, for the third box, the numbers can be any of the three digits left, so the possibility is 3C1

for the fourth box, the numbers can be any of the two digits left, so the possibility is 2C1

Hence total number of possible outcomes is 2C1 × 4C1 × 3C1 × 2C1 = 2 × 4 × 3 × 2 = 48

28. Here, number of terms, n = 4
The sum of the digit in unit place of all the numbers formed
= (n - 1)! × (Sum of all the digits)
= 3!× (3 + 4 + 5 + 6)
= 6 × 18 = 108

29. We have (n + 1)! = 90 × (n - 1)!

⇒ (n + 1) × n × (n - 1)! = 90 × (n - 1)!

⇒ (n + 1)n = 90

⇒ (n + 1)n = 10 × 9 ...[writing 90 as product of two consecutive integers]

⇒ n=9
Hence, n = 9
30. Here, we need to find out the number of pairs of the letters that can be formed with the 4 letters.
Required number of ordered pairs = Number of arrangements of four letters, taken two at a time = 4P2
= 4!

(4−2)!

4!
= 2!

= 4×3×2!

2!

= 4 × 3 = 12
31. We know that total number of letters in PERMUTATIONS = 12
Only repeated letter is T; 2 times
No. of vowels in PERMUTATIONS = 5(E, U, A, I, O)
Now, we consider all the vowels together as one.
Number of permutations of vowels = P = 120 5

Now total number of letters = 12 - 5 + 1 = 8

s
p

⇒ No. of permutations = 8

2!
=
8!
=
8!

2
= 20160
2(8−8)!

Thus, total number of permutations = 120 × 20160 = 2419200

32. Given digits are 2, 3, 4, 5, 6 and 0.
Any number between 400 and 1000 will be of three digits.
Now, the number should be greater than 400.
So hundred’s place can be filled up by anyone of the digits 4, 5 and 6 in 3 ways.
∴ k = 3

Remaining two places can be filled up by the remaining five digits in 5P2 ways.
5!
Hence, required numbers 3 × 5
P2 = 3 ×
3!
= 60
33. Let us assume that first seat the 5 girls. This can be done in 5! ways. For each such arrangement, the three boys can be seated only
at the cross marked places. × G × G × G × G × G × . There are 6 cross marked places and the three boys can be seated in 6P3

ways. Therefore, by multiplication principle, the total number of ways = 5! × 6P3 = 5! ×

6!

3!

= 4 × 5 × 2 × 3 × 4 × 5 × 6 = 14400
34. i. two of them, Rajan and Tanvy, are always together
Consider Rajan and Tanvy as a group which can be arranged in 2! = 2 ways.

4 / 12
 The 3 children with this 1 group can be arranged in 4! = 24 ways.
The total number of possibilities in which they both come together is 2 × 24 = 48 ways.
ii. two of them, Rajan and Tanvy, are never together
Two of them are never together = total number of possible ways of sitting - total number of ways in which they sit together.
A total number of possible way of arrangement of 5 students is 5! = 120 ways.
Therefore, the total number of the arrangement when they both don’t sit together is = 120 – 48 = 72

35. Given: nC14 = nC16

To find: nC28 = ?
We know that:
nC = nC
r n-r
nC = nC
⇒ 14 n-14
nC n
⇒ n-14 = C16
⇒ n - 14 = 16
⇒ n = 16 + 14 = 30
⇒ n = 30

So,
nC = 30C
28 28
30C = 30!
⇒ 28 (30−28)!×28!

= 30!

2!×28!

= 30×29×28!

2!×28!

= 30×29

2!
30×29
= 2×1

30C = 435
∴ 28
36. There are 8 letters in the word DAUGHTER including 3 vowels and 5 consonants. We have to select 2 vowels out of 3 vowels and
3 consonants of 5 consonants.
∴ Number of ways of selection =
3 5
C × C = 3 × 10 = 30
2 3

Now each word contains 5 letters which can be arranged among themselves in 5! Ways.
So total number of words = 5! × 30 = 120 × 30 = 3600
37. According to the question, we can write,
Arranging the permutations of the letters of the word MOTHER in a dictionary:
We need to find: Rank of word MOTHER in dictionary.
First comes, words starting from letter E = 5! (5 letters no repetation) = 120
words starting from letter H = 5! (5 letters no repetation) = 120
words starting from ME = 4! (4 letters no repetation) = 24
words starting from MH = 4! (4 letters no repetation) = 24
words starting from MOE = 3! (3 letters no repetation) = 6
words starting from MOH = 3! (3 letters no repetation) = 6
words starting from MOR = 3! (3 letters no repetation) = 6
words starting from MOTE = 2! (2 letters no repetation) = 2
words starting from MOTH:
MOTHER = 1
Rank of the word MOTHER = 120 + 120 + 24 + 24 + 6 + 6 + 6 + 2 + 1 = 309
Hence the rank of the word MOTHER in arranging the letters of MOTHER in a dictionary among its permutations is 309
38. We have, 5. 4Pr = 6 . (5Pr - 1)
4! 5!
⇒ 5 ⋅ = 6 ×
(4−r)! [5−(r−1)]!

5⋅4! 6×5×4!
⇒ =
(4−r)! (6−r)!

1 6
⇒ =
(4−r)! (6−r)(5−r)(4−r)!

⇒ (6 - r) (5 - r) = 6

5 / 12
 ⇒ 30 - 11r + r2 = 6
⇒ r2 - 11r + 24 = 0
⇒ (r - 3) (r - 8) = 0

⇒ r = 3, 8
But r ≠ 8, because in 4Pr, r cannot be greater than 4.
Hence, r = 3
39. LHS = C 2n
n +
2n
Cn−1

(2n)! (2n)!
= n!n!
+
(n−1)!(2n−n+1)!

(2n)! (2n)!
= n!n!
+
(n−1)!(n+1)!

(2n)!
= [
1

n
+
n+1
1
]
n!(n−1)!

(2n)! 2n+1
= n!(n−1)!
[
n(n+1)
]

(2n+1)!
= n!(n+1)!

RHS = 1 2n+2

2
Cn+1

(2n+2)!
= 1

2
[ ]
(n+1)!(2n+2−n−1)!

(2n+2)!
= 1

2
[ ]
(n+1)!(n+1)!

(2n+2)(2n+1)!
= 1

2
[ ]
(n+1)n!(n+1)!

2(n+1)(2n+1)!
= 1

2
[ ]
(n+1)n!(n+1)!

(2n+1)!
=
n!(n+1)!

∴ LHS = RHS
40. Case (i): When the repetition of the letters is not allowed:
In this case, the total number of words is the same as the number of ways of filling 4 places □□□□ by 4 different letters chosen
from N, O, S, E.
The first place can be filled by any of the 4 letters. Thus, there are 4 ways of filling the first place. Since the repetition of letters is
not allowed, so the second place can be filled by any of the remaining 3 letters in 3 different ways.
Following it, the third place can be filled by any of the two remaining letters in 2 different ways. And, the fourth-place can be
filled by the remaining one letter in 1 way.
So, by the fundamental principle of multiplication, the required number of 4-letter words = (4 × 3 × 2 × 1) = 24.
Hence, the required number of words = 24.
Case (ii): When the repetition of the letters is allowed:
In this case, each of the four different places can be filled in succession in 4 different ways.
So, the required number of 4-letter words = (4 × 4 × 4 × 4) = 256
41. Here total number of digits = 10
Number of digits used (no digit is repeated) = 4
Since 0 cannot be filled in the fourth place, so number of permutations for fourth place = 9
Now the remaining three places can be filled with 9 digits.
∴ Number of permutations = P
9
3

9! 9×8×7×6!
= = = 504
6! 6!

Hence total number of permutations = 9 × 504 = 4536

42. Since each number is less than 1000, the required numbers are the 1-digit, 2-digit and 3-digit numbers.
One-digit numbers: Clearly, there are two one-digit odd numbers, namely 5 and 7, formed of the given digits.
Two-digit numbers: Since we are to form 2-digit odd numbers, we may put 5 or 7 at the unit's place. So, there are 2 ways of
filling the unit's place.
Now, we cannot use 0 at the ten's place and the repetition of digits is allowed. So, we may fill up the ten's place by any of the
digits 2,5, 7. Thus, there are 3 ways of filling the ten's place.
Hence, the required type of 2-digit numbers = (2 × 3) = 6
Three-digit numbers: To have an odd 3-digit number, we may put 5 or 7 at the unit's place. So, there are 2 ways of filling the
unit's place.
We may fill up the ten's place by any of the digits 0,2,5,7. So, there are 4 ways of filling the ten's place.

6 / 12
 We cannot put 0 at the hundred's place. So, the hundred's place can be filled by any of the digits 2, 5, 7 and so it can be done in 3
ways.
∴ the required number of 3-digit numbers = (2 × 4 × 3) = 24

Hence, the total number of required type of numbers = (2 + 6 + 24) = 32

43. Here,we have C : C = 12 : 1 2n
3
n
3

2n
C3 12
⇒ =
n 1
C3

2n!

3!(2n−3)! 12
⇒ =
n! 1

3!(n−3)!

2n×(2n−1)×(2n−2)×(2n−3)!

3!(2n−3)! 12
⇒ =
n×(n−1)×(n−2)×(n−3)! 1

3!(n−3)!

2n×(2n−1)×(2n−2)

3! 12
⇒ =
n×(n−1)×(n−2) 1

3!

2n×(2n−1)×(2n−2) 12
⇒ =
n×(n−1)×(n−2) 1

2n×(2n−1)×2×(n−1) 12
⇒ =
n×(n−1)×(n−2) 1

4×n×(2n−1) 12
⇒ =
n×(n−2) 1

4×(2n−1)
12
⇒ =
(n−2) 1

⇒ 4 × (2n − 1) = 12 × (n − 2)

⇒ 8n - 4 = 12n - 24
⇒ 12n - 8n = 24 - 4

⇒ 4n = 20
∴ n=5
44. The total number of numbers formed with the digits 2, 3, 4, 5 taken all at a time = Number of the arrangement of 4 digits, taken all
at a time = 4P4 = 4! = 24.
To find the sum of these 24 numbers, we will find the sum of digits at unit's, ten's, hundred's and thousand's places in all these
numbers.
Consider the digits in the unit's places in all these numbers. Each of the digits 2, 3, 4, 5 occurs in 3! (= 6) times in the unit's place.
So, total for the digits in the unit's place in all the numbers = (2 + 3 + 4 + 5) × 3! = 84
Since each of the digits 2, 3, 4, 5 occurs 3! times in any one of the remaining places.
So, the sum of the digits in the ten's, hundred's and thousand's places in all the numbers = (2 + 3 + 4 + 5) × 3! = 84.
Hence, the sum of all the numbers = 84 (10° + 101 + 102 +103) = 93324
45. In a word ‘HONESTY’, there are 7 letters and these letters can be arranged is 7P7 ways.
= 7! = 7 × 6 × 5 × 4 × 3 × 2 × 1

= 5040
I do not like jumbled words.
Honesty plays very important role in our life and people respect us for it.
46. The number of 4-digit numbers formed by the digits 2, 3, 4 and 6
4! 4! n!
= P(4, 4) = (4−4)!
=
0!
[∵
n
Pr =
(n−r)!
]

=
4!

1
[∴ 0! = 1]
= 4 × 3 × 2 × 1 = 24
i. In this case, ‘4’ is fixed at the unit’s place. Thus, the remaining 3-digits can be 2, 3 and 6. So, the required number of 4-digits
number = P (3,3)
3! n n!
= [∵ Pr = ]
(3−3)! (n−r)!

3!
=
0!
= 3 × 2 × 1 = 6 ...(i)
ii. In this case, ‘3’ is fixed at units place. Thus, remaining 3-digits can be 2, 4 and 6. So, the required number of 4-digits numbers
= P (3, 3)
P = P(3, 3) = 6 ...(ii)
iii. The number of 4-digit numbers ending with either 3 or 4.
P = 6 + 6 = 12 [from Eqs. (i) and (ii)]

7 / 12
47. i. Given that, the total number of player is 17.
We have to select 11 players including exactly 4 bowlers.
Hence, 4 bowlers will be selected from 5 bowlers and the remaining 7 players will be selected from 12 batsmen.
Now, 4 bowlers out of 5 bowlers can be selected in 5C4 ways.

7 players out of 12 players can be selected in 12C7 ways.

∴ Total number of ways selecting the 11 players
=
5
C4 ×
12
C7 =
5
C1 ×
12
C5 [∵ nCr = nCn - r]
12! 12×11×10×9×8
= 5 × = 5 ×
5!7! 5×4×3×2×1

= 5 × 11 × 9 × 8 = 55 × 72 = 3960 ways
Hence, he can select a team of 11 players in 3960 ways.
ii. A group of people who works together with energy and passion together with energy and passion to achieve their goals form a
team spirit.
48. First women can take any of the chairs marked 1 to 4 in 4 different way.
Second women can take any of the remaining 3 chairs from those marked 1 to 4 in 3 different ways.
Therefore, total no of ways in which women can take seat =
⇒ 4P2
4!
4P2 =
(4−2)!

4×3×2×1
=
2×1

= 12
After two women are seated 6 chairs remains
First man take seat in any of the 6 chairs in 6 different ways, second man can take seat in any of the remaining 5 chairs
in 5 different ways
Third man can take seat in any of the remaining 4 chairs in 4 different ways.
Therefore, total no of ways in which men can take seat =
⇒ 6P3
6!
6P3 =
(6−3)!

6×5×4×3×2×1
⇒
3×2×1

⇒ 120
Therefore, total number of ways in which men and women can be seated = 120 × 12
⇒ 1440

49. There are 9 women and 8 men in all. In order to form a committee
consisting of at least 5 women, we may choose
i. 5 women and 7 men
ii. 6 women and 6 men
iii. 7 women and 5 men
iv. 8 women and 4 men
v. 9 women and 3 men.
Hence, the total number of ways of forming the committee
9 8 9 8 9 8 9 8 9 8
= ( C5 × C7 ) + ( C6 × C6 ) + ( C7 × C5 ) + ( C8 × C4 ) + ( C9 × C3 )

9 8 9 8 9 8 9 8 8
= ( C4 × C1 ) + ( C3 × C2 ) + ( C2 × C3 ) + ( C1 × C4 ) + (1 × C3 )

= {
9×8×7×6

4×3×2×1
× 8} + {
9×8×7

3×2×1
×
8×7

2×1
} + {
9×8

2×1
×
8×7×6

3×2×1
} +{9 × 8×7×6×5

4×3×2×1
} + (1 ×
8×7×6

3×2×1
)

= (1008 + 2352 + 2016 + 630 + 56) = 6062

Clearly, the women are in majority in (iii), (iv) and (v) cases. So, the number of committees in which the women are in majority
9 8 9 8 9 8
= ( C7 × C5 ) + ( C8 × C4 ) + ( C9 × C3 )

9 8 9 8 8
= ( C2 × C3 ) + ( C1 × C4 ) + (1 + C3 )

= (2016+ 630+ 56) = 2702

50. According to the question, we can write,
There are 11 letters in the word 'INEFFECTIVE', viz. EEE, FF, II, C, T, N, V.
The four-letter words may consist of:

8 / 12
 i. 3 alike letters and 1 distinct letter: There is one set of three alike letters viz. EEE. So, three alike letters can be selected in
one way. Out of the 6 different letters F, I, T, N, V, C one letter can be selected in ways. Thus, three alike and one different
letter can be selected in 1 × 6C1 = 6C1 ways. Hence ,there are 6C1 groups each of which contains 3 alike letters and one
different letter. These 4 letters can be arranged in 4!

3!1!
ways.
Hence, the total number of words consisting of three alike and one distinct letters =
6
C × 1
= C × 4 = 24.
4! 6
1
3!1!

ii. 2 alike letters of one kind and 2 alike letters of second kind: There are three sets of two alike letters viz EE, FF, II. Out of
these three sets two can be selected in 3C2 ways. So, there are 3C2 groups each of which contains 4 letters out of which 2 are
alike of one type and two are alike of second type. Now, 4 letters in each group can be arranged 4!
in ways.
2!2!

Hence, the total number of words consisting of two alike letters of one type and 2 alike letters of second type = 3
C2 ×
4!

2!2!
=
18.
iii. 2 alike and 2 different letters: Out of 3 sets of two alike letters one set can be chosen in 3C1 ways. Now, from the remaining

6 distinct letters, 2 letters can be chosen in 6C2 ways. Thus, 2 alike letters and 2 distinct letters can be selected in ( 3C1 × 6C2)

ways. So, there are ( 3C1 × 6C2) 4! groups of 4 letters each. Now, letters of each group can be arranged among themselves in
4!

2!
ways.
Hence, the total number of words consisting of two alike letters and 2 distinct = 3 6
C1 × C2 ×
4!

2!
= 540.
iv. All different letters: There are 7 distinct letters E, F, I, T, N, V, C out of which 4 can be selected in 7C4 ways. So, there are
7C groups of 4 letters each. The letters in each of 7C4 groups can be arranged in 4! ways.
4

So, the total number of 4 letter words in which all letters are distinct = 7C4 × 4! = 840.
Hence, the total number of 4-letter words = 24 +18 + 540 + 840 = 1422.
Hence , all the cases for the given question are calculated.

51. Given that nCr-1 = 36 ...(i)

nCr = 84 ...(ii)
nC
r+1 = 126 ...(iii)
Dividing eq. (i) by eq. (ii) we obtain
n
Cr−1 36

n
=
Cr 84

n!

(r−1)!(n−r+1)! 3 n!
n
⇒ = [∵ Cr = ]
n! 7 r!(n−r)!

r!(n−r)!

r!(n−r)!
n! 3
⇒ × =
(r−1)!(n−r+1)! n! 7

r⋅(r−1)!(n−r)! 3 3
r
⇒ = ⇒ =
(r−1)!(n−r+1)(n−r)! 7 n−r+1 7

⇒ 3n - 3r + 3 = 7r ⇒ 3n - 10r = -3 ...(iv)
Now dividing eq. (ii) by eq. (iii), we obtain
n!
n
Cr 84 r!(n−r)! 2

n
= ⇒ =
Cr+1 126 n! 3

(r+1)!(n−r−1)!

(r+1)!(n−r−1)!
n! 2
⇒ × =
r!(n−r)! n! 3

(r+1)⋅r!(n−r−1)! r+1
2 2
⇒ = ⇒ =
r!(n−r)(n−r−1)! 3 n−r 3

⇒ 2n - 2r = 3r + 3 ⇒ 2n - 5r = 3 ...(v)
Solving eq. (iv) and (v) we get
3n - 10r = -3
2n - 5r = 3 or 4n -10r = 6
Solving these two equations, we get,
n=9
∴ 2 × 9 - 5r = 3 ⇒ 18 - 5r = 3
15
⇒ r = = 3
5

9 / 12
 Thus, r 3
C2 = C2 =
3!
= 3
2!(3−2)!

Therefore, the value of rC2 = 3

52. Let the two classes be C1 and C2 and the four rows be R1 R2 R3, R4. There are 16 students in each class. So, there are 32 students.
According to the given conditions there are two different ways in which 32 students can be seated:
R1 R2 R3 R4

I C1 C2 C1 C2

II C2 C1 C2 C1

Since the seating arrangement can be completed by using any one of these two ways. So, by the fundamental principle of addition,
Total number of seating arrangements = No. of arrangement in I case + No. of arrangements in II case.
In case 1, 16 students of class C1 can be seated in R1 and R3 in 16P8 × 8! = 16! ways. And 16 students of class C2 can be seated

in R2 and R4 in 16P8 × 8! = 16! ways

∴ Number of seating arrangements in case I = 16! × 16!
Similarly, Number of seating arrangements in case II = 16! × 16!
Hence, Total number of seating arrangements = (16! × 16!) + (16! × 16!) = 2 (16! × 16!)
53. i. There are 11 letters in the word 'MATHEMATICS'. Out of these letters, M occurs twice, A occurs twice, T occurs twice and
the rest are all different.
Hence, the total number of arrangements of the given letters = = 4989600.
11!

(2!)×(2!)×(2!)

ii. The given word contains 4 vowels, namely A, E, A, I. Treating these 4 vowels AEAl as one letter, we have to arrange 8 letters
MTHMTCS + AEAI, out of which M occurs twice, T occurs twice and the rest are all different.
So, the number of all such arrangements = 8!
= 10080
(2!)×(2!)

Now, out of 4 vowels, A occurs twice and the rest are all distinct.
So, the number of arrangements of these vowels = = 12
4!

2!

Hence, the number of arrangements in which 4 vowels are together = (10080 × 12) = 120960
54. Given the word ZENITH. It has 6 letters.
To find: Total number of words that can be generated by relative arranging the letters of the word ZENITH.
Since it has 6 letters with no repetition, therefore the number of ways of arranging 6 letters on 6 positions is 6! = 720
To find: Rank of word ZENITH when all its permutations are arranged in alphabetical order, i.e. in a dictionary.
First comes, the words starting from the letter E = 5! = 120
words starting from the letter H = 5! = 120
words starting from the letter I = 5! = 120
words starting from the letter N = 5! = 120
words starting from the letter T = 5! = 120
words starting from letter Z:
words starting from ZE:
words starting from ZEH = 3! = 6
words starting from ZEI = 3! = 6
words starting from ZEN:
words starting from ZENH = 2! = 2
words starting from ZENI:
words starting from ZENIHT = 1
ZENITH = 1
The rank of word ZENITH = 120 + 120 + 120 + 120 + 120 + 6 + 6 + 2 + 1 + 1 = 616
Hence, the rank of the word ZENITH when arranged in the dictionary is 616
55. We have to find the possible number of ways in which we can give four prizes among five students when no student gets all the
prizes.
We will use the concept of multiplication because there are four sub jobs dependent on each other and are performed one after the
other.
The thing that is distributed is considered to have choices, not the things to which we have to give them; it means that in this
problem the prizes have choices more precisely five choices are there for each prize and students won’t choose any because prizes

10 / 12
 have the right to choose.
The number of ways in which we can give four prizes among five students when no student gets all the prices
= number of ways in which any student can get any number of prices – the number of ways in which one student gets all the
prizes.
= 64 - 5 = 59
There are five students, so any one student will get all the prizes hence there are five choices to give all the prizes to any one
student
Section D
56. Number of ways for awarding a scholarship for classical language = 3
Number of ways for awarding a scholarship for Mathematics = 5
Number of ways for awarding a scholarship for Natural Science = 4
∴ Number of ways of awarding these scholarships

= 3 × 5 × 4 = 60
And a number of ways of awarding one of these scholarships
= 3 + 5 + 4 = 12
57. Total letters in the word PERMUTATIONS = 12.
Here T = 2
(i) Now first letter is P and last letter is S which are fixed.
So the remaining 10 letters are to be arranged between P and S.
∴ Number of Permutations
=
10!

2!
=
10×9×8×7×6×5×4×3×2!

2!
= 1814400
(ii) There are 5 vowels in the word PERMUTATIONS. All vowels can be put together.
∴ Number of permutations of all vowels together = 5
P5
5!
= = 5 × 4 × 3 × 2 × 1 = 120
0!

Now consider the 5 vowels together as one letter. So the number of letters in the word when all vowels are together = 8.
∴ Number of Permutations = 8!

2!
=
8×7×6×5×4×3×2!

2!
= 20160

Hence the total number of permutations = 120 × 20160 = 2419200

58. Here, we have to choose 4 cards out of 52 playing cards at a time. So,
Required number of ways = 52C4
52!
=
4!(52−4)!

52!
=
4!48!
52×51×50×49×48!
=
4×3×2×1×48!

= 270725
There are four suits diamond, club, spade, heart in a pack of 52 playing cards and each suit have 13 cards.
So from each suit, 4 cards can be choosed in 13C4 ways separately.
∴ Required number of ways
= 13C4 + 13C4 + 13C4 + 13C4
13!
= 4 ×
4!(13−4)!

13!
= 4 ×
4!9!

= 2860
59. Clearly, ALGEBRA has seven letters, where two A’s, one L, one G, one E, one B, one R.
i. Since, two A’s are always together. We take both the A’s as one letter.
If p is the number of arrangements, then
p = 6! = 6 × 5 × 4 × 3 × 2 × 1 = 720
ii. Total number of arrangements of given word
7! 7×6×5×4×3×2!
q= 2!
=
2!

= 7 × 6 × 5 × 4 × 3 = 2520
In these arrangements, some arrangements have two A’s are together while in the rest they are not together.
Hence, the number of arrangements in which two A’s are not together is q - p = 2520 - 720 = 1800

11 / 12
60. i. The first prize can be given in 4 ways. The 2nd prize can be given in 3 ways because the boy who got the first prize cannot
receive the second prize.
The 3rd prize can be given to any one of the remaining 2 boys in 2 ways.
∴ Total number of ways in which all the prizes can be given
=4×3×2
= 24
ii. The first prize can be given in 4 ways as it may be given to any one of the 4 boys.
The 2nd prize can also be given in 4 ways, since it may be obtained by the boy who has already received a prize. Similarly, the
3rd prize can be given in 4 ways.
Hence, the number of ways in which all the prizes can be given
=4×3×2
= 43 = 64

12 / 12