DPP Permutation Combination

Answer Keys and Solutions BITSAT Crash Course

ANSWER KEYS
1. (3) 2. (1) 3. (3) 4. (3) 5. (3) 6. (1) 7. (3) 8. (2)
9. (4) 10. (4) 11. (2) 12. (4) 13. (1) 14. (1) 15. (2) 16. (2)
17. (2) 18. (4) 19. (2) 20. (2) 21. (3) 22. (2) 23. (2) 24. (3)
25. (3) 26. (1) 27. (1) 28. (2) 29. (1) 30. (1) 31. (3) 32. (2)
33. (2) 34. (2) 35. (1) 36. (4) 37. (2) 38. (3) 39. (2) 40. (1)

1. (3)
Number of ways to answer questions with 3 possible answers = 3 4

Number of ways to answer questions with 2 possible answers = 2 3

Number of ways to answer questions with 5 possible answers = 5

Therefore, total number of ways to answer the question paper is = 3 4
× 2
3
× 5 = 3240 .
2. (1)
For making integers greater than 6000 you should not use the values less than 6 at ten thousand's place.
Therefore, four digit numbers greater than 6000
= 3 × 4 × 3 × 2 as thousand place can be filled by 6, 7 & 8
Five digit numbers = 5 × 4 × 3 × 2 × 1 = 5!
The number of integers greater than 6000 = 5! +(3 × 4 × 3 × 2)= 192.
3. (3) Out of 6 novels, 4 novels can be selected in 6
C4 ways.
Also out of 3 dictionaries, 1 dictionary can be selected in 3
C1

ways.
Since the dictionary is fixed in the middle, we only have to arrange 4 novels which can be done in 4! ways. Then the number of ways 6
C4 ⋅
3
C1 ⋅ 4!

6⋅5
= ⋅ 3 ⋅ 24 = 1080
2

4. (3) Let number of digits formed x

∴ 1000 < x < 4000, which means left extreme digit will be either 2 or 3.
∴ Required numbers = 2
C1 × H T U Where H = Hundred place, T = Ten's place, U = Unit place
2
= C1 × 4 × 4 × 4

= 128

5. (3) 6 particular players are always to be included and 4 are always excluded so total no. of selection, now, 4 players out of 12, hence number of ways = 12
C4 .
6. (1)
Given word is JAIPUR.
After leaving A and I , we are remained with 4 different letters which are to be used for forming 3-letter words.
As we can arrange r objects out of n objects in n
Pr ways.
Hence, the required number
4
= P = 4 ⋅ 3 ⋅ 2 = 24
3

7. (3)

Fixing T at the first place and N at the last place, other letters R, E, A, S, O can arrange themselves in 5! ways. Hence,
Number of words starting with T and ending with N is 5! = 120.
8. (2) Since, telephone number start with 67, so two digits is already fixed.
Now, we have to arrangement of three digits from remaining eight digits (i.e., 0, 1, 2, 3, 4, 5, 8, 9)
8 !
= 8P ways =
3
5 !

= 8 × 7 × 6

= 336 ways

#MathBoleTohMathonGo
www.mathongo.com
DPP Permutation Combination
Answer Keys and Solutions BITSAT Crash Course

9. (4)
Total number of words formed with the 6 letters of the word GENIUS = 6!
Now,
Total number of words starting with G = 5!
Total number of words ending with S = 5!
Total number of words beginning with G and ending with S = 4!
Thus,
Total number of words starting with G or ending with S =Total number of words starting with G+Total number of words ending with S−Total number of words
starting with G and ending with S.
= 5! + 5! − 4! (Because the words starting with G and ending with S has been considered twice with the words that starts with G or ends with S)
∴ Total number of words that neither begin with G nor ends with S = 6! −(5! + 5! − 4!)= 504.
10. (4)
Explanation: At first we have to arrange the given aletters in alphabetical order
E, H , M , O, R, T

5! words will begin with E

5! words will begin with H .
Then M series will begin.(Remember we should not count all the words in M series, as we would leave behind word M OT H ER)

4! words will begin with ME

4! words will begin with MH

N ext series beginning with M OE has 3!

N ext series beginning with M OH has 3!

N ext series beginning with M OR has 3!

⇒ Total before MOT = 120 + 120 + 4! + 4! + 3! + 3! + 3! = 306

N ow let us consider the series beginning with M OT

If we write all words of the series MOT , we get

MOTEHR,
MOTERH,
MOTHER.
⇒ The rank of MOTHER Is 309

11. (2) Given word is H AV AN A (3A, 1H , 1N , 1V ) .

Total number of ways arranging the given word
6!
= = 120
3!

Total number of words in which N & V are together

5!
= × 2! = 40
3!

∴ Required number of ways= 120 − 40 = 80

12. (4) Total number of ways in which boys and girls can seat alternatively = 4! × 4! × 2 = 1152.
When particular boy and particular girl are always together, then number of ways = 3! × 3! × 7 × 2 = 504.
∴ Required number of ways = 1152 − 504 = 648.

13. (1)
+ + + + + +

First we write six '+' signs at alternate places i.e., by leaving one place vacant between two successive "+" signs. Now there are 5 places vacant between these
signs and these are two places vacant at the ends. If we write 4 '−' signs at these 7 places then no two '−' will come together.
We can arrange ' + ' signs in ways. Similarly for ' − ' signs.
6!

6!

Hence, total number of ways 7

C
4
×
4!

4!
×
6!

6!
= 35 .
14. (1) The word 'JUDGE' has 5 different letters.
When the vowels UE are always together, they can be supposed to form one letter.
Then, we have to arrange the letters JDG (UE).
Now, 4 letters can be arrange in 4! = 24 ways.
The vowels (UE) can be arranged among themselves in 2! = 2 ways.
∴ Required number of ways =(24 × 2)= 48 .

#MathBoleTohMathonGo
www.mathongo.com
DPP Permutation Combination
Answer Keys and Solutions BITSAT Crash Course

15. (2)
Consider the people of the same nationality as a group.
So, we have total 4 groups.
The number of circular arrangement of these groups is (4 − 1)! = 3!.
Now, we need to arrange the people in each group.
Arrangement of the Indians in 2! ways,
Arrangement of Americans in 3! ways,
Arrangement of Italians in 3! ways,
Arrangement of Frenchmen in 4! ways.
Hence, total number of ways=(4 − 1)! ⋅ 2! ⋅ 3! ⋅ 3! ⋅ 4! = 2 ⋅ (3!) 3
⋅ 4!.

16. (2)
Ten pearls of one colour can be arranged in
1

2
⋅(10 − 1)! ways because clockwise and anticlockwise permutations are identical. The number of arrangements of 10 pearls of the other colour in 10 gaps
between the pearls of the first colour= 10!
The required number of arrangements = 1 2
∴ × 9! × 10! = 5(9!)
2

17. (2) Total number of ways= 5

C4 ×
8
C6 +
5
C5 ×
8
C5

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

= 140 + 56 = 196

18. (4)
The order of these 3 speakers will be either S 1
, S 3 , S2 or S3 , S 1 , S2

Case-1:-
If the order of the 3 speakers is S 1
, S3 , S 2 , then
10
C × 1 × 7!
3
 

only one way to arrange Remaing 7 can speak in any order
From 10 slots, select any 3 for S1 , S3 , S2

Where 10 slots represent 10 tiimings for speaking in the conference.

Case-2:-
If the order of the 3 speakers is S 3, S1 , S 2 , then
10
C × 1 × 7!
3
 

only one way to arrange Remaing 7 can speak in any order
From 10 slots, select any 3 for S3 , S1 , S2

So required ways= 2 10
C
3
× 7! = 2 ×
10!

3!7!
× 7! = 2 ×
10 !

3×2
=
10 !

19. (2)
Number of ways in which one or more balls can be selected from 10 white, 9 green, 7 black balls is
= (10 + 1) (9 + 1) (7 + 1) − 1

= 880 − 1

= 879 ways

#MathBoleTohMathonGo
www.mathongo.com
DPP Permutation Combination
Answer Keys and Solutions BITSAT Crash Course

20. (2)
We have 3 identical maths books and 3 identical physics books to be distributed among 3 students.
No. of ways to distribute Maths books
3+3−1
= C3−1

Using multinomial theorem n+r−1

Cr−1

5
= C2 = 10

Similarly, no. of ways to distribute Physics books= 10

Total number of ways to distribute all books = 10 × 10 = 100
Now, each student should get at least one book.
So, we have to remove those cases in which any student gets no book.
Case I : All books distributed among exactly two students.
= (Number of ways to distribute Maths books among 2 students)×(Number of ways to distribute Physics books among 2 students ) - Number of ways in which
all books goes to one student
3+2−1 3+2−1
= C2−1 × C2−1 − 2

= 4 × 4 − 2

= 14

For all three boys not getting any book, the total no. of ways are,= 14 × 3 = 42
Case II: When all books goes to one student.
Total no of ways when all books goes to one student= 3
C
1
= 3

Hence, total no. of ways = 100 − 42 − 3 = 55

21. (3)
Express the given number in term of prime number
∵ The factors of 9600 = 2
7
× 3
1
× 5
2
now 2 can be selected in (7+1)ways simmilarly 3 in (2 ) ways and 5 in (3) ways
∴ The number of divisors
=(7 + 1)(1 + 1)(2 + 1)

= 8 × 2 × 3 = 48

22. (2) ∵ 720 = 2 4

× 3
2
× 5
1

∴ Sum of all odd divisors = (1) (1 + 3 + 3 2 1

) (1 + 5 )

= 13 × 6 = 78

23. (2) The exponent of 7 in 100! can be found by dividing 100 by exponents of 7 and adding the quotients.
The required exponent =
100 100 100
[ ] + [ ]+[ ] . . . = 14 + 2 + 0 = 16
7 49 343

where, [.] is the greatest integer function.

24. (3)
Let the number of men participating in tournament = m.
Number of women participating in tournament = 2.
Each player will play 2 games with every other player and two women will play 2 games with each man.
Total numbers of games played by women = 2 × 2m = 4m
Total number of games played by men = 2 ⋅ m
C2

From given data

m
2 ⋅ C2 − 4m = 66

m ( m−1 )
⇒ 2 − 4m = 66
2

2
⇒ m − 5m − 66 = 0

⇒(m − 11)(m + 6)= 0

⇒ m = 11 or −6 but m ∈ N , m ≠ −6

⇒ m ∈[10, 12).

25. (3)
As we can select p alike objects any number of times in p + 1 ways. And we can select an object in two ways, i.e., either rejection or acceptance.
Therefore, total number of ways of selecting any number of fruits = 11 × 6 × 3 × 2 × 2 × 2 = 1584
Number of ways in which no fruit is selected= 1
Number of ways in which only one fruit is selected = 6
Number of ways in which two fruit are selected (there are two cases, i.e., both are identical and both are different)= 6
C
2
+
3
C
2
= 18

∴ Number of ways in which at least three fruits are selected = 1584 −(1 + 6 + 18)= 1559

#MathBoleTohMathonGo
www.mathongo.com
DPP Permutation Combination
Answer Keys and Solutions BITSAT Crash Course

26. (1)
We have to take at least one of the four blue and five green dyes, and we are allowed to select none, one or more of the red dyes
Total number of combinations of making such selections =(2 5
− 1)×(2
4
− 1)×2
3

= 3720

27. (1)
If we fix 1 at one's place then number of words formed is 3!.
Similarly, if we fix 2 at one's place then the number of words formed is 3! and so on.
Required sum = 3!(1 + 2 + 3 + 4)= 6(10)= 60.
28. (2)
Letters of the word PARKAR written in alphabetical order are AAKPRR.
Number of words starting with A=
5!
= 60
2!

Number of words starting with K=

5!
= 30
2!2!

Number of words starting with PAA= 3!

2!
= 3

Number of words starting with PAK= 3!

2!
= 3

Number of words starting with PARA= 2! = 2

Number of words starting with PARKAR= 1
∴ Rank of word PARKAR is 99.
29. (1)
V : If vowel is f illed .
C : If consonant is f illed .
2P, 1R, 1S, 1L, 2(O), 1A

Case I: V V V
Number of ways = 3!

2!
= 3

Case II : V V C
Number of ways= 4 × 1 + 4 × 2! = 12
Case III: CV V
Number of ways = 4 × 1 + 4 × 2! = 12
Case IV: CV C
Number of ways = 4 × 1 + 4 × 2! = 1 × 2 + 6 ×(2!)×(2!)= 26
Total number of ways = 3 + 12 + 12 + 26 = 53
30. (1)
The given word is ' STATICS '
From every arrangement of 7 letters, we get a pair by putting a sign (,)
Using Permutation of n Objects When p Objects are Alike is n!

p!

The required number of pairs = .

7!
∴ = 1260
2!2!

31. (3) Coefficient of x in 4!(1 + x +

2
4 x 6
)(1 + x)
2

= 4![
7
C4 +
1

2
6
C2 ]= 840 + 180 = 1020 .

32. (2) Required number of ways

4
=coefficient of x in (x 16 3
+ x
4 5
+ x +. … . . +x
16
)

4
=coefficient of x in x 16 12
(1 + x + x +. … . . . +x
2 12
)

4
=coefficient of x in (1 − x 4 13
) (1 − x)
−4

= coefficient of x in (1 − 4x 4 13
+. …) × (1 − x)
−4

4+4−1 7 7×6×5
= 1 × C = C = = 35
4 4 3!

33. (2)
We know that if x 1
+ x2 + x3 +. . . . . +xr = n (x1 , x2 , . . . . . ≥ 0)

Then the number of integral solutions = n+r−1

Cr−1

Let u = x + 5, v = y + 5, w = z + 5

Then u, v, w ≥ 0

and x + y + z = 0 ⇒ u + v + w = 15

​The number of integral solutions of this equations is 15 + 3 − 1 C3−1 = 17C

2
= 136

#MathBoleTohMathonGo
www.mathongo.com
DPP Permutation Combination
Answer Keys and Solutions BITSAT Crash Course

34. a = a
α1
3
β1
5
γ1

α2 β2 γ2
b = 2 3 5

α3 β3 γ3
c = 2 3 5
(2)
α1 + α2 + α3 = 1

β1 + β2 + β3 = 1

γ1 + γ2 + γ3 = 1

Total number of solution = 3 × 3 × 3 = 27

35. (1)
Positive integral solution of the equation
x1 + x2 + x3 +. . . . . . +xr = n is n−1
C
r−1
.
Given, 6 ≤ a + b + c ≤ 10
∴ a + b + c = 6, 7, 8, 9, 10 .
Since a, b, c are natural numbers, we need to find the positive integral solutions for a, b, c .
Number of positive integral solutions of the equation
a + b + c = 6 is 6−1
C
3−1
=
5
C
2

For a + b + c = 7 is 7−1
C
3−1
=
6
C
2

This will be continued upto positive integral solution of a + b + c = 10 is 9

C
2

∴ Required number of ways

5 6 7 8 9
= C2 + C2 + C2 + C2 + C2

= 110

36. (4)
We have to form 5 digit numbers with digits 1, 2, 3, 4, 5 and then we will find the sum of the numbers formed.
Total numbers can be formed = 5! = 120
If we fix 1 at unit place, then rest of 4 digits can be placed in remaining four places in 4! = 24 ways
⇒ Each digit in unit repeated 24 times
Thus sum of the digits in unit place in all 120 numbers = 24 ((1 + 2 + 3 + 4 + 5))= 360.
For ten's place it is 10 × 24 ×(1 + 2 + 3 + 4 + 5)= 3600.
Similarly each of the digits repeated 24 times in rest of the places too.
so sum of all the numbers = (10000 + 1000 + 100 + 10 + 1)×24 × 15 = 3999960
37. (2)
Case 1 : If first three digits are identical= 9 × 9 = 81
Case 2 : If last three digits are identical= 9 + 9 × 8 = 81
Total number of such numbers= 81 + 81 = 162.
38. (3)
Given, number of straight lines is n.
11 ( n−1 )
n+5
P
n+1
=
2
×
n+3
Pn ,
( n+5 ) ! 11 ( n−1 ) ( n+3 ) !
= ×
(4)! 2 3!

( n+5 ) ( n+4 ) 11 ( n−1 ) 1

= ×
4.3.2.1 2 3.2

(n + 5)(n + 4)= 11 × 2(n − 1)

2
n + 9n + 20 = 22n − 22

2
n − 13n + 42 = 0

On solving above quadratic equation, we get

n = 6 or n = 7.
If n = 6 , then number of points of intersection is 6
C
2
× 1 = 15.

If n = 7, then number of points of intersection is 7

C
2
× 1 = 21.

Now, we are getting number of points of intersection is 15 or 21. But we are having only 21 in option.
39. (2)
n+1 n
C3 − C3 = 21 ⇒ n = 7.

40. (1) For triangle to be formed we required 3 lines. Hence 3 line can be selected out of 6 given lines in 6
C3 ways. Another condition for three lines to form a
triangle is 'sum of any two sides must greater than third side'.But in some cases sum of two sides are less than or equal to the third side. Those case are:
7, 2, 3; 7, 2, 4; 7, 3, 4; 7, 2, 5; 6, 2, 3; 6, 2, 4; 5, 2, 3

∴ Required number of triangles formed = 6

C3 − 7.

#MathBoleTohMathonGo
www.mathongo.com