Answer with Solutions

Practice Exercise 9. (b) Number of words beginning with E = 4P4 = 24

Number of words beginning with QE = 3P3 = 6
1. (d) Making a 3-digit number is equivalent to filling 3 places.
Places 1 2 3 Number of words beginning with QS = 6
Number of choices 5 4 3 Number of words beginning with QT = 6
Number of ways of filling all the three places So, the next word is ‘QUEST’.
= 5 × 4 × 3 = 60 ∴ Rank = 24 + 6 + 6 + 6 + 1 = 43
Hence, the total possible 3-digit numbers are 60. 10. (c) Since, 2 women can choose the seats from 1 to 4 in
4
P2 = 12 ways and 3 men can choose the remaining 6 seats
2. (d ) The student has 10 choices from the morning courses,
out of which he can select one course in 10 ways. in 6P3 = 120 ways.
For the evening course, he has 7 choices out of which he ∴ Required number = 12 × 120 = 1440
can select one course in 17 ways.
11. (d) Here, 7 boys can be arranged in row in 7! ways. There
∴Total number of ways = 10 + 7 = 17 will be 6 gaps between them and one place before them
3. (b) There are 6 letters in the word BHARAT, 2 of them are and one place after them. The 3 girls can be arranged in a
identical. row in 8P3 = 8 ⋅ 7 ⋅ 6 ways
Hence, total number of words with these letters ∴ Number of ways = 7 ! × 8 ⋅ 7 ⋅ 6 = 42 ⋅ 8 !
6!
= = 360 12. (a) The required numbers are of four digits whose left
2! most digit can be 1, 2, 3.
Also, the number of words in which B and H come
5 !⋅ 2 ! Thus the left most place can be filled in 3 ways.
together = = 120 Since, repetition of digits is allowed, then each of the
2!
remaining place can be filled in 5 ways.
∴ Required number of words = 360 - 120 = 240
Number of ways of filling of the remaining positions
= 5 × 5 × 5 = 125
4. (a)! The consonants in their positions can be arranged in
4! ∴ Total number of required numbers
= 12 ways
2! = 3 × 125 = 375
and the vowels in their positions can be arranged in 13. (a) In the word MATHEMATICS, there are 11 letters out
3! of which 2M’s, 2A’s, 2T’s, 1H, 1E, 1C and 1S.
= 3 ways
2! If we feed T at there starting and end the remaining.
∴Total number of arrangements = 12 × 3 = 36 T T
5. (b) The sum of the digits in unit place of all the numbers
formed A letter, out of which (2A’s, 2T’s) can be arranged by
= 3 !( 3 + 4 + 5 + 6) = 6 × 18 = 108 9! 9 × 8 × 7 × 6 ×5 × 4 × 3 × 2 ×1
=
6. (c) Here, we have 1 M , 4 I , 4 S and 2 P. 2!2! 4
Therefore, total number of selections of one or more letters = 90720
= (1 + 1) ( 4 + 1) ( 4 + 1) ( 2 + 1) - 1= 149 14. (c) When we arrange one thing at a time, then the number
n
Pr - 1 nPr nPr + 1 of possible permutations is n. When we arrange them two
7. (a)! = = at a time, the number of possible permutations are
a b c n × n = n 2 and so on.
b
From first two terms, = n -r + 1 Thus, the total number of permutations are
a
c n ( nr - 1)
From last two terms, = n -r n + n 2 + " + nr = [! n > 1]
b n -1
b c 15. (c) By theory, let us consider 3 beads as one. Hence, we
Hence, = + 1 ⇒ b 2 = a (b + c )
a b have 21 beads, i.e. n = 21.
8. (d) Here, m men can be seated in m ! ways and n women The number of arrangements = (n - 1)! = ( 21- 1)! = 20 !
can be seated in the m + 1gaps between the m men in Also, the number of ways in which 3 beads can be
m+1
Pn ways. arranged between themselves is 3 ! = 3 × 2 × 1 = 6.
m ! (m + 1)!
∴Number of ways = m ! (m + 1) Pn = Thus, the total number of arrangements =
20 ! 3 !
(m - n + 1)! 2
 PERMUTATIONS AND COMBINATIONS 809
16. (d) x = 6 ! × 6 ! + 6 ! × 6 ! = 2( 6 !)2 24. (c) As there are three letters alike, out of six letters and
y = 5! × 6! the three others are different.
x Selection can be done in the following manner:
∴ = 2 × 6 ⇒ x = 12y (i) All different = 4C1 = 1
y
(ii) 2 alike, 2 different = 1C1⋅ 3C2 = 3
17. (c) nCr + 2 nCr -1 + nCr - 2 = n Cr + n Cr -1 + n Cr -1 + n Cr - 2
(iii) 3 alike and 1 different = 1C1⋅ 3C1 = 3
= n+ 1 Cr + n+ 1 Cr -1 = n+ 2 Cr
Therefore,
18. (c) Given, nCr -1 = 36, nCr = 84, nCr +1 = 126 total number of ways = 1 + 3 + 3 = 7
n! 25. (d) Required number of points
⇒ = 36 …(i)
(r - 1)! (n - r + 1)! = 8C2 × 1 + 4C2 × 2 + ( 8C1 × 4C1) × 2
n!
⇒ = 84 …(ii) = 28 + 12 + 32 × 2 = 104
r !(n - r )!
26. (b) First stall can be filled in 3 ways, second stall can be
n! filled in 3 ways and so on.
⇒ = 126 …(iii)
(r + 1)! (n - r - 1)! ∴Number of ways of loading steamer
Dividing Eq. (ii) by Eq. (i), we get = 3C1 × 3C1 × ... × 3C1 ( 12 times )
(r - 1)! (n - r + 1)! 84
= = 3 × 3 × ... × 3 (12 times) = 312
r ! (n - r )! 36
n -r + 1 7 27. (b) Since the candidate is unsuccessful, if he fails in 9 or
⇒ = 8 or 7 or 6 or 5 papers.
r 3
∴ Numbers of ways to be unsuccessful
⇒ 3n - 10r = - 3 …(iv)
= 9C9 + 9C8 + 9C7 + 9C6 + 9C5
Dividing Eq. (iii) by Eq. (ii), we get
r ! (n - r )! 126 n -r 3 = 9C0 + 9C1 + 9C2 + 9C3 + 9C4
= ⇒ =
(r + 1)! (n - r - 1)! 84 r +1 2 1
= ( 9C0 + 9C1 + ... + 9C9 )
⇒ 2n - 5r = 3 …(v) 2
1
Now, solving Eqs. (iv) and (v), we get n = 9, r = 3. = ( 29 ) = 28 = 256
2
19. (a) Hint ( 47C4 + 47
C3 ) + 48
C3 + 49
C3 + 50
C3 + 51
C3
48 48 49 50 51
28. (d) The number of ways of drawing 1 black and
= C4 + C3 + C3 + C3 + C3 2 non-black balls
20. (b) There are two cases arises. = 3C1 ⋅ 6C2 = 3 ⋅ 15 = 45
Case I Choose six from Class XI and five from class XII The number of ways of drawing 2 black and 1 non-black ball
∴ Number of ways = 20C6 × 20C5
= 3C2 ⋅ 6C1 = 3 ⋅ 6 = 18
Case II Choose five from Class XI and six from Class XII
The number of ways of drawing 3 black balls is 3C3 = 1
∴ Number of ways = 20C5 × 20C6
∴ Number of ways = 45 + 18 + 1 = 64
∴ Required number of ways = 2 ( 20C5 × 20
C6 )
29. (b) Let the men be M1, M 2, ! , M10 and women be
21. (b) We have, M, IIII, SSSS, PP
W1, W2, ! , W7.
Number of ways of selecting 4 different letters = 4C4 = 1
LetW1 andW2 do not want to be in the same group.
Number of ways of selecting 2 alike letters = 3C2 = 3 The six members group can contain 4 men and 2 women
Number of ways of selecting 3 alike and 1 different letter or 3 men and 3 women.
= 2C1 × 3C1 = 6 The number of ways of forming 4M, 2W group
Number of ways of selecting 4 alike letters = 2C1 = 2 = 10C4 ( 5C2 + 2 5C1) = 4200
Number of ways of selecting 2 alike and 2 different letters where, 5C2 is the number of ways withoutW1 andW2 and
= 3C1 × 3C2 = 9 5
C1 is the number of ways withW1 and withoutW2 or with
∴Total number of ways = 1 + 3 + 6 + 2 + 9 = 21 W2 and withoutW1.
22. (d) Since, the voter can cast one or two or three votes. The number of ways of forming 3 M , 3 W group
So, total number of ways in which he can cast his vote = 10C3 ( 5C3 + 2 5C2 ) = 3600
= 5C1 + 5C2 + 5C3 = 5 + 10 + 10 = 25
where, 5C3 is the number of ways withoutW1 andW2 and
23. (c) Required number of ways 5
C2 is the number of ways withW1 orW2 but not both.
= 4C1 × 8C5 + 4C2 × 8C4 + 4C3 × 8C3 + 4C4 × 8C2
∴ Number of ways = 4200 + 3600
= 4 × 56 + 6 × 70 + 4 × 56 + 1 × 28 = 896 = 7800
810 SELF STUDY GUIDE BITSAT

30. (c) Total number of ways Number of words start with H = 5 !

= (Attempt 3 from group I and 4 from group II) Number of words start with I = 5 !
+ (Attempt 4 from group I and 3 from group II ) Number of words start with N = 5 !
+ (Attempt 5 from group I and 2 from group II) Total number of words
+ (Attempt 2 from group I and 5 from group II ) = 5 ! + 5 ! + 5 ! + 5 ! + 5 ! = 5 (5 !) = 600
= 6C3 × 6C4 + 6C4 × 6C3 + 6C5 × 6C2 + 6C2 × 6C5 Now, add the rank of SACHIN.
= 2 ( 6C3 × 6C4 ) + 2 ( 6C5 × 6C2 ) ∴Required rank of SACHIN = 600 + 1= 601
= 2( 20 × 15) + 2 ( 6 × 15) = 600 + 180 = 780 37. (a)! Number of letters = 6
31. (b) Ladies = 2, old men = 2, young men = 4 Number of vowels = 2 namely A, E
Case I 1 lady, 1 old man, 2 young men These alphabets can arrange themselves by 2! ways.
6!
= 2C2 ⋅ 2C1 ⋅ 4C2 = 2 ⋅ 2 ⋅ 6 = 24 ∴ Number of words = = 360
2!
Case II 2 ladies, 1 old man, 1 young man 38. (b) Since, 3 men and 2 women equal to 5 and a group of
= 2C2 ⋅ 2C1 ⋅ 4C1 = 1⋅ 2 ⋅ 4 = 8
5 members make 5! permutations with each other.
Case III 1 lady, 2 old men, 1 young man ∴Number of ways to sit 5 members = 5 !
= 2C1 ⋅ 2C2 ⋅ 4C1 = 2 ⋅ 1⋅ 4 = 8 6 places are filled by 5 members by 6C5 ways.
Case IV 2 ladies, 2 old men, 0 young man ∴Total number of ways to sit 5 members on 6 seats of a
2 2 4
= C2 ⋅ C1 ⋅ C0 = 1⋅ 1⋅ 1 = 1 bus = 6C5 × 5 !
∴Required number of ways = 24 + 8 + 8 + 1 = 41 39. (b) Here, 4 guests G1, G2, G3, G4 can be seated on a
32. (b) ! 1350 = 2 × 3 × 5 3 2 particular side in 9P4 ways.
∴ Number of divisors = (1 + 1) ( 3 + 1) ( 2 + 1) = 24 G1G2G3G4…
and sum of divisors = (1+ 2) (1+ 3 + 32 + 33 ) (1+ 5 + 52 )
= 3720 G5G6G7…
33. (c) Any number between 1 to 999 is of the form abc when Also, 3 guests G5, G6, G7 can be seated on the opposite
0 ≤ a, b, c ≤ 9. Let us first count the number in which 5
side in 9P3 ways.
occurs exactly once.
Since 5 can occur at one place in 1 × 3C1 × 9 × 9 = 243 The other 11 guests can be seated in the remaining 11 seats
in 11! ways.
ways, next 5 can occur in exactly two places in
3
C2 × 9 = 27. Lastly, 5 can occur in all three digits in only ∴ Number of sitting arrangements = 9P4 ⋅ 9P3 ⋅ 11!
one way. (9 !)2 ⋅ 11! 11
= = C5(9 !)2
Hence, the number of times 5 occurs 5 !⋅ 6 !
= 1 × 243 + 27 × 2 + 1 × 3 40. (a) Make a group of both M’s and another of T’s. Then,
= 243 + 54 + 3 = 300 except A’s, we have S letters remaining. So ‘M’s, T’s and
the letters except A’s can be arranged in 7! ways.
34. (b) The number of students answering exactly
i (1 ≤ i ≤ n - 1 ) questions wrongly is 2n - i - 2n - i -1
. ∴Total number of arrangements = 7 ! × 8C2

The number of students answering all n questions 41. (c) A triangle can be constructed in two ways:
wrongly is 20. (i) By taking two points on AB and one point on AC.
Hence, the total number of wrong answers (ii) By taking two points on AC and one point on AB.
n -1
If point A is included, then total number of triangles
= ∑ i ( 2n - 1 - 2n - i - 1) + n ( 2)0 = 2047 mn
i =1 = m + 1C2 × nC1 + mC1 × nC2 = (m + n )
2
⇒ 2n - 1 + 2n - 2 + 2n - 3 + ... + 20 = 2047
42. (c) Required number is the coefficient of x 15 in the product
⇒ 2n - 1 = 2047 ⇒ 2n = 2048 ⇒ 2n = 211 ⇒ n = 11 (1+ x + x 2 + ...+ x 5 ) (1+ x + x 2 + ...+ x 10 ) (1+ x + x 2 + ...+ x 15 )
35. (c) Required number of ways = (1 - x 6 ) (1 - x 11) (1 - x 16 ) (1 - x )-3
= 10C1 + 10
C2 + 10
C3 + 10
C4   3  4 
= (1 - x 6 - x 11+ ... ) 1 +   x +   x 2 +...
= 10 + 45 + 120 + 210 = 385   1  2 
36. (d) Given, word = SACHIN 17 11  6 17 11  6
which is   -   -   =   -   -  
Number of words start with A = 5 ! 15  9   4  2   2   2
Number of words start with C = 5 ! = 136 - 55 - 15 = 66
 PERMUTATIONS AND COMBINATIONS 811
43. (b) Identical bananas may be divided among 4 persons Hence, the required number of ways
in 20 + 4 - 1C4 - 1 = 23C3 = 1771 ways = 60 + 90 = 150

If each person is to be given atleast one banana, then 45. (b) The required number of ways
number of ways will be 20 - 1C4-1 = 19C3 = 969 ways  1 1 1
= 3! 1- + -
 1! 2 ! 3 ! 
44. (c) Possibilities Selections Arrangements
 2
One triplet, two different 3 2
C1 × C 2 = 3 5! = 3!  
3× = 60  6
3!
Two pairs, one different 3
C 2 × 1C1 = 3 5! 1
3× = 90 = 3×2× = 2
2! × 3! 3

BITSAT Archives
1. (c) Hint Number of ways 9. (b) Given that, nPr = 30240 and nCr = 252
= 2n + 1
C0 + 2n + 1
C1 + 2n + 1
C2 + ...+ 2n + 1
Cn n! n!
⇒ = 30240 and = 252
1 (n - r )! (n - r )! r !
= ( 22n + 1) = 22n 30240 n!
2 ⇒ r!= = 120 ⇒ r = 5 ∴ = 30240
252 (n - 5)!
2. (a) Case I Taking 2 points from collinear points and one ⇒ n(n - 1)(n - 2)(n - 3)(n - 4) = 30240
from non-collinear. ⇒ n(n - 1)(n - 2)(n - 3)(n - 4)
i.e. Number of triangles so formed = 6C2 × 4C1 = 10(10 - 1)(10 - 2) (10 - 3)(10 - 4)
6 ⋅5 4 ⇒ n = 10
= × = 60
1⋅ 2 1 Hence, required ordered pair is(10, 5).
Case II Taking 1 point from collinear and two from 10. (b) First, we fix the alternate position G
non-collinear points.
of the girls. Five girls can be seated
i.e. Number of triangles so formed = 6C1 × 4C2 around the circle in (5 - 1)! = 4 !. 5 boys
6 4⋅ 3 G G
can be seated in five vacant places
= × = 36
1 1⋅ 2 by 5!.
Case III All the three points from non-collinear points. ∴ Required number of ways = 4 ! × 5 ! G G
i.e. Number of triangles so formed 11. (c) In all, we have 8 squares in which six X have to be
4 placed and it can be done in 8C6 = 28 ways. But this
= 4C3 = 4C1 = = 4
1 includes the possibility that either the top or horizontal
∴Total number of triangles = 60 + 36 + 4 = 100 row does not have any X.
8
C0 8 Since we want each row must have atleast one X, these
3. (d) - C1 + 8C2 ⋅ 6 - 8C3 ⋅ 62 + 8C4 ⋅ 63 + ... + 8C8 ⋅ 67 two possibilities are to be excluded.
6
1 Hence, required number of ways = 28 - 2 = 26
= [ 8C0 - 8C1 ⋅ 61 + 8C2 ⋅ 62 - 8C3 ⋅ 63 + ... + 8C8 ⋅ 68]
6 12. (b) Given, nC12 = nC6 or nCn - 12 = nC6
1 1 58 ⇒ n - 12 = 6 ⇒ n = 18
= [1 - 6] 8 = × ( -5)8 =
6 6 6 n 18 × 17
∴ C2 = 18C2 = = 153
4. (a) Required number of ways = 4 ! = 24 2 ×1
5. (c) Required number of ways 13. (a) Since, (1 + x )2n + 1 = C0 + C1x + ... + Cnx n
= 22 - 4 - 2C11 - 2 = 16C9 + Cn + 1x n + 1 + ... + x 2n + 1Cn
6. (a) Hint nC2 = 36 = 2 (C0 + C1 + ... + Cnx n )
7. (b) n - 2Cr + 2 n - 2Cr -1 + n-2
Cr -2 Put x = 1
=( n-2
Cr + 2 n-2
Cr n-2 n-2 (1 + 1)2n - 1 = 2 (C0 + C1 + ... + Cn )
- 1) +( Cr -1 + Cr - 2)
⇒ 22n = (C0 + C1 + ... + Cn )
= n - 1Cr + n -1
Cr -1 =
n
Cr [! nCr -1 + nCr = n + 1Cr ]
⇒ 22n - 1 = C1 + C2 + ... + Cn ⇒ 22n - 1 = 63
8. (c) Required number of arrangements
= 6P5 × 4 ! = 720 × 24 = 17280 ⇒ 22n = 64 ⇒ 22n = 26 ⇒ 2n = 6 ⇒ n = 3