BINOMIAL THEOREM,

PERMITATIONS & COMBINATIONS AND PROBABILITY

ASSIGNMENT -13 (DATE:- 01.05.2020)
SIGNEL CORRECT
7
 a  b   a 7  b 7  7 and 6 7 c a 7 r br is divisible by 4
1. If a, b are two positive integers such that
ab  a  b   a 2  ab  b 2 
r 1
r 7

where none of a, b, a+b is divisible by 7, then least possible value of a+b is ___
A) 17 B) 18 C) 19 D) 20
3232
2. If 7 divides 32 , the remainder is

A) 1 B) 0 C) 4 D) 6

3. x, y , z are natural numbers, not greater than 6. How many ordered triples  x, y, z  are there such that

the product xyz is divisible by 10 ?

A) 64 B) 72 C) 91 D) 99

4. Let P, Q, R be subsets of X  a1, a2 , a3 ,......an  The probability that

P  Q  R   , P  Q   , Q  R   is

7n  2.6n  2.5n 7n  3.6n  3.5n 7 n  2.6n  5n 7n  3.6n  5n

A) B) C) D)
8n 7n 8n 7n
5. There are two dice one is red and other is white, red die is loaded so that the probability of getting 6 is 1/3,
the remaining outcomes being equally likely among themselves. The white die is fair. Two persons A and B
play the game choosing white die by A and red die by B on the condition who throws highest number will
win and in case of equal result person with white die will win. Then the game is
(Note: The game is in favour of someone indicates their probability of winning is more and fair indicates both
have got equal probability of winning).

A) In favour of A B) In favour of B
C) fair D) In sufficient data to decide the nature of the game
MULTY CORRECT
 6

07. 3  3 matrices are formed using the elements from the set 3,  2,  1, 0, 1, 2,3 then Number of matrices

that are skew symmetric matrices (or) scalar matrices is

A) 349 B) 7 7  7 3 C) 73  6 
D) 7 4 7 3  6 
08. A man has 3 friends. Number of ways in which he can invite one friend every day for dinner on 6 successive
nights so that he invites every friend at least once is N which of the following hold(s) good

A) Number of divisors of N which are divisible by 5 is 12

B) Sum of all the divisors of N is 1680
C) Number of ways in which N can be resolved as product of two divisors which are relatively prime, is 4
D) Number of divisors of the form 4n  2, n  N is 6
09. In a gambling between Mr. A and Mr. B a machine continues tossing a fair coin until the two consecutive
throws either HT or TT are obtained for the first time. If it is HT, Mr. A wins and if it is TT, Mr. B wins. Which
of the following is (are) true ?

3
A) Probability of winning Mr. A is
4
1
B) Probability of Mr. B winning is
4
C) Given first toss is head, probability of Mr. A winning is 1

1
D) Given first toss is tail, probability of Mr. A winning is
2
10. From a deck of 52 cards, two cards are drawn without replacement then probability
that
4
A) both are clubs, given that the first one is a club, is
17
2
B) both are clubs, given that atleast one is club, is
15
4
C) both are clubs, given that one is ace of clubs, is
17
 2
D) One is the ace of clubs, given that both are clubs, is
13
COMPREHENCE TYPE QUESTIONS
Paragraph – 11 to 13
Let (1 + x)m = C0 + C1x + C2x2 + ... + Cmxm
m!
where Cr = mCr =
r!(m  r)!

  f (i, j)  
0  i  j n 0 i  j n
f (n  i, n  j) , if f(i, j) = f(j, i)

11. 
0 i  j m
(i + j) Ci Cj is equal to

(A) m (2m-1) (B) m(22m-1 - 2m-1Cm-1) (C) m(2m-1 - 2m-1Cm-1) (D) none of these

12. 
0  i  j m
i.C j is equal to

(A) m(m - 1) 2m-2 (B) m(m - 1) 2m-3 (C) 22m (D) 22m - 2mCm

13.  C i 2 is equal to
0 i  j m

(A) (2mCm)2 (B) (22m - 2mCm)2 (C) m 2m-1Cm-1 (D) none of these
Paragraph for Questions -9, 10

2
Let n be the number of ordered 4-tuples  a, b, c, d  in which  2019  is LCM of positive integers a,b,c,d

14. The digit in the units places of n is

15. Let n1 be the number of ordered 4-tuples  a1 , b1 , c1 , d1  in which n is LCM of positive integers a1 , b1 , c1 , d1

and nr be the number of ordered 4-tuples  ar , br , cr , d r  in which nr 1 is LCM of positive integers

ar , br , cr , d r for r  2,3...... .The digit in the 1000’s place of n10 is…..

INTEGERS

n
16. 
If R  7  48  , n  N then  R  2 3  R   R  R   ___________

(Where [ ] denotes step function)

15 th th th
17. In the expansion  x  a  if the 11 term is the geometric mean of the 8 and12 terms. Which term in the

expansion is the greatest?

18. A fair coin is tossed n times let an denotes the number of cases in which no two heads occurs consecutively
then the value of a5  a2  a1 is

19. If the number of ordered triplets (a, b, c) such that L.C.M (a, b) = 1000, L.C.M (b, c) = 2000 and L. C. M (c, a) =
2000 be N then sum of digits of N is/are ___________
20. A bag contains 6 fair six face dice D1 ,D2 ....D6 . Di has i white faces and  6  i  black faces. A dice is selected

at random and rolled, ( assuming only the top face is visible) shows white. The probability that all faces
p
adjacent to the white face are black is (p,q are coprimes), the unit's digit of q is ...............
q

21. A bag has 10 red and 15 white balls. Out of the 10 red balls, 3 have only "1" on them, 3 have only "2" on
them and 4 have both "1" & "2" marked on them. All the 15 white balls have number 4 on them, If a ball is
picked at random and an even number can be seen on it, what is the probability that it is a red ball?

MATRIX MATCHING TYPE

Answer Q.No:22, Q.No:23, Q.No:24 by appropriately matching the information given in the three columns
of the following table.

Column 1, 2 & 3 consists of different words, number of selection of 3 letters from the word and number of
arrangements of 3 letters from the word respectively.

Column – 1 Column – 2 Column – 3

(I) DREAM (i) 70 (P) 60

(II) DEDICATION (ii) 10 (Q) 399

(III) POWERFUL (iii) 77 (R) 336

(IV) COMBINATION (iv) 56 (S) 378

22. Which of the following is a correct combination?

A) (I) (i) (P) B) (III) (iv) (R) C) (II) (ii) (S) D) (IV) (ii) (Q)

23. Which of the following is a correct combination?

A) (III) (iv) (S) B) (III) (i) (R) C) (IV) (iii) (Q) D) (I) (ii) (R)

24. Which of the following is correct combination?

A) (I) (ii) (S) B) (III) (i) (Q) C) (II) (i) (S) D) (IV) (iii) (R)

Selection Arrangement
 Dream
5
C3 5
C3  3!

3! 8
Dedication
2
C1 7 C1  8C3 2
C1 7 C1   C3  3!
2!

Powerful
8
C3 8
C3  3!

3! 8
Combination
3
C1 7 C1  8C3 3
C1 7 C1   C3  3!
2!
25

KEY&SOLUTIONS
Q.NO 1 2 3 4 5 6 7 8 9 10
KEY C C B B C AB AC ABC ABCD ABCD
Q.NO 11 12 13 14 15 16 17 18 19 20
KEY B B C 5 4 7 9 8 7 5
Q.NO 21 22 23 24 25
KEY 0.31 or B C C
0.32 A) QR
B) PR
C) QT
D) QS

1. a 2  ab  b 2 is divisible by 73
a2  ab  b2  343  a  1, b  18
32 32
2. 32  25   32    25 
 160
 2160   3  1  3m  1, m  N

3232 3 m 1
2
5 3 m 1
  32    32 

2
3 5 m 1
22  4.85 m 1

5 m 1
4  7  1  4  7 n  1 , n  N  28n  4

3232
 When 7 divides  32  remainder =4

3. Total 63  216

53  125 product do not have 5 as a factor (1,2,3,4,6)

33  27 product do not have 2 as a factor ( 1, 3, 5)
23  8 product do not have 2 & 5 as factors (1, 3)
 216 - 125 - 27 + 8 = 72
4. Use Inclusion exclusion ( Total no. of ways in which the subsets can be prepared is 8n ) as there are 8 disjoint
regions
1 2 1
5. p  Ri    , i  1, 2,3, 4,5, p  R6  
5 3 3
1
p  wi   , i  1, 2,.....6
6
p  A   P  Ri  p  w j  , j  i, i  1, 2,......6
2  6 5 4 3 2   1 1  1
     
15  6  3 6 2
6.

08. 1,1, 4, 1, 2,32, 2, 2

w  90  360  90  540  2 2  33  51
10. a) P(both clubs/the first ne is club)
12 4
= O( second is club /first is club) = 
51 17
b) P( both clubs /one is club )
= P ( ee /ec or ec or c c
  1  2 
   2
  4  51  
 1   12   1  39   3  13  15
           
 4   51   4  51   4  51 
c) P( both club / one is Ace of club )
1.12  12.1 4
 
1.51  51.1 17
d) P( one is ace of club / both are clubs )
P  one is Ace of c lub & both are c lub s 

P  both are c lub s 
 1  12  12   1 
     
52 51 52  51  2
    
13 12 13
,
52 51
11.


0  i  j m
(i  j) Ci C j = n 
0  i  j m
Ci C j

Now (Ci)2 = Ci2 + 2(CiCj   (i  j) Ci C j  m [22m-1 - 2m-1Cm-1]

0  i  j m

12.   iC
0  i  j m
j
= (C2 + C3 + ... + Cm) + 2. [C3 + C4 + ... + Cm)

+ 3(C4 + C5 + ... + Cm) + (m-1) Cm

m
r(r  1)
=  Cr = m(m-1) 2m-3
r 2 2
m
13.   Ci 2   (m  r)Cr 2
0  i  j m r 0

m
  r.C r 2 = m 2m-1Cm-1
r 0

2 2
15.  2019   32   673  is L.C.M of a,b,c,d

4 2

In 3  2
4
  4225  52  132 ways

n=4225 is L.C.M of  a1 , b1 , c1 , d1  in 4225 ways

n1  n2  n3 ...........n10  n  4225

n
16. 
If a  a  1
2
  x, n  N then x  x 2  x  x   1

17. T101  15C10 x 5a10

T71  15C7 x8 .a 7

T111  15C11 x 4 .a11

 2
Given T11  T8 .T12

2
 x  15C10 .15C10 77
   
a 15C7 .15C11 75

x
 n  1 16  1.01
a
  8.03 N .G.T  T 81  T9
x 2.01
1
a

18. Cases for a1 {H,T} i.e. a1  2

Cases for a2{HT , TH , TT }, a2  3

For n  3 . If the first out come is H and next just T and then an 2

If the first out come is T then an 1 should follow

an  an 2  an 1

a3  a1  a2  5

a4  a3  a2  8 , a5  a3  a4  13

19. 1000  23.53 ,2000  24.53

So, a  2 A.5 R , b  2 B.5S , c  2C .5T ,

max  A, B   3, max  R, T   max  B , C   4

max  R, S   max  R, T   max S , T   3
There are 10 ways of choosing R, S, T.

1 with all 3, 3 with one 2, 3 with one 1, 3 with one 0, C must be 4. There are 7 ways of choosing A, B; 1 with
both 3, 3 with A = 3, B not, 3 with B = 3 and A not. Thus7 ways of choosing A, B, C hence 7.10 = 70 ways.

1 1 1 2 1 1 3
. 1  . .  . .0  0  .....
20. 6 6 6 6 5 6 6
1 1 1 2 1 3 16
. 1  . .   .....
6 6 6 6 6 6 66

2 7
1
5 7 1
  5  
1  2  3  4  5  6 21 105 15

22,23,24

Selection Arrangement
 Dream
5
C3 5
C3  3!

3! 8
Dedication
2
C1 7 C1  8C3 2
C1 7 C1   C3  3!
2!

Powerful
8
C3 8
C3  3!

3! 8
Combination
3
C1 7 C1  8C3 3
C1 7 C1   C3  3!
2!
25.