P2

----------------------------------------------------------------------------------------------------------------------------- -------------------------------
41. Let the product of all the divisors of 1440 be P. If P is divisible by 24 x , then the value of x
can be
A) 28 B) 30 C) 32 D) 36
42. The number of functions which are non- bijective between the sets whose cardinal numbers
are same and equal to n is/are

A) n!

− ( − ) + C2 ( n − 2 ) − ......
n n n n n
B) n C1 n 1

C1 ( n − 1) − nC2 ( n − 2 ) + nC3 ( n − 3) − ......

n n n n

C)

nn − n!
D)
43. The number of 4-digit numbers that can be formed by using the digits
1,2,3,4,5,6,7,8 and 9 such that the least digit used is 4, where repetition of digits is
allowed, is
A) 617 B) 671 C) 716 D) 761
44. Two numbers ‘a’ & ‘b’ are to be chosen from the set of 1, 2,3,.....3n with repetition

allowed. The number of ways of selecting integers such that a 2 − b 2 is divisible by

3is
3 3
A) n(n + 1) + n 2 B) n(n − 1) + n 2 C) 3n 2 D) 5n 2
2 2

45. In a polygon no three diagonals are concurrent. If the total number of points of
intersection of diagonals interior to the polygon be 70 then the number of diagonals
of the polygon is
A) 20 B) 28 C) 8 D) 36
46. Consider n  n graph paper where n is a natural number. Consider the right angled
isosceles triangles whose vertices are integer points of this graph and whose sides
forming right angle are parallel to x and y axes. If the number of such triangles is
2
n(n + 1)(2n + 1) , then K is ______.
K
A) 3 B) 5 C) 7 D) 9
47. A student named RAO gave JEE MAIN-2016 paper has attempted only
MATHEMATICS subject in the given 3hr allotted time. One of his friend tried to
guess the marks of RAO. The number of possible guesses that can be done
logically will be
A) 120 B) 150 C) 145 D) None of these
48. Let N be a natural number if its first digit (from the left) is deleted, it gets reduced to
N
. The sum of all the digits of N is …
57
A) 15 B) 18 C) 24 D) 30
SECTION - II
(COMPREHENSION TYPE)
This section contains 4 groups of questions. Each group has 2 multiple choice questions based on a paragraph. Each question
has 4 choices A), B), C) and D) for its answer, out of which ONLY ONE is correct.
Marking scheme: +3 for correct answer, 0 if not attempted and -1 in all other cases.
Paragraph for Questions 49 and 50:
Number of non-negative integral solutions of the equation x1 + x2 + .... + xn = r is
n + r −1
Cr
49. The position vector of a point P is r = xiˆ + yjˆ + zkˆ where x, y, z  N ,
xyz + x + y + z  xy + yz + zx + 1 and a = iˆ + ˆj + kˆ . If r  a = 10, the number of possible position
of P is ___
A) 36 B) 110 C) 21 D) 225

50. The total number of positive integral solutions of the inequality 15  x1 + x2 + x3  20 is

A) 685 B) 785 C) 1125 D) 570

Paragraph for Questions 51 and 52:

Considering the rectangular hyperbola xy = 15! . The number of points (, ) lying on it,
where
51. , I+ and HCF (, ) = 1, is
A) 64 B) 785 C) 4032 D) 94185
52. , I+ and  divides , is
A) 96 B) 511 C) 1344 D) 4032
Paragraph for Questions 53 and 54:
D1,D2,-----,D1000 are 1000 doors and P1, P2,-------P1000 are 1000 persons. Initially all
the doors are closed. P1 opens all the doors. Then, P2 closes D2,D4, D6---- D998,
 D1000. Then P3 changes the status of D3,D6, D9, D12,-----etc.(doors having numbers
which are multiples of 3). Changing the status of a door means closing it if it is
open and opening it if it is closed. Then P4 changes the status of D4,D8, D12, D16,----
-etc (doors having numbers which are multiples of 4). And so on until lastly P1000
changes the status of D1000.
53. Finally, how many doors are open?
A) 30 B) 31 C) 32 D) 33
54. What is the greatest number of consecutive doors that are closed finally?
A) 56 B) 58 C) 60 D) 62
Paragraph for Questions 55 and 56:
If a set A has n elements, then the number of subsets of A containing exactly r elements is
n
C r . The number of all subsets of A is 2 n . Now answer the following questions. A set A

has 7 elements. A subset P of A is selected. After noting the elements they are placed back
in A. Again subset Q is selected. Then the number of ways of selecting P and Q such that
55. P and Q have exactly 3 elements is common is
A) 2835 B) 128 C) 3432 D) 2187
56. P and Q have equal number of elements is (P and Q may be null sets)
A) 2835 B) 128 C) 3432 D) 2187
SECTION – III
(MATRIX MATCH TYPE)
This section contains 4 multiple choice questions. Each question has matching lists. The codes for the lists have choices (A), (B),
(C), and (D) out of which ONLY ONE is correct.
Marking scheme: +3 for correct answer, 0 if not attempted and -1 in all other cases.
57. Consider all possible permutations of the letters of the word MASTERBLASTERS.

Column – I Column – II
( 7!)
2
A) The number of permutations containing the p)
3!( 2!)
4
word
RAAT is
B) The number of permutations in which S occurs q) 11! 4!
3! ( 2!)
2
in
first place and R occurs in the last place is
C) The number of permutations in which none of r) 11!
3! 2!
the
 letters S, T, R occur in first 7 positions is

D) The number of permutations in which the s) 12!

( 2!)
4
letters A,
S, R occur in even positions is

A) A–S; B–R; C–P; D–Q B) A–R; B–S; C–P; D–P

C) A–P; B–Q; C–R; D–S D) A–Q; B–R; C–P; D–S
58. 20 Identical balls have to be distributed among 4 jugglers. The number of ways in which
these balls can be distributed such that
Column I Column II

A) All the jugglers get at least one ball is p) 885

B) All the jugglers get at least one ball q) 1

and no one gets more than 10 balls

is

C) All the jugglers get odd number of r) 969

balls is

D) All of them get equal number of balls s) 165

is

A) A-Q; B-R; C-S; D-P B) A-S; B-P; C-S; D-R

C) A-P; B-R; C-S; D-Q D) A-R; B-P; C-S; D-Q
59. Four digit natural number is formed using, the digits from the set {0, 1, 2, 3, 4, 5},
repetition of digits is allowed
Column II
Column I (Conditions)
(Number of natural numbers)

(A) Number formed is multiples of 3 (p) 480

(B) number formed contains exactly (q) 540

two different digits
 (C) Numbers formed contains exactly (r) 360
three different digits

(D) Number formed is odd (s) 175

A) (A-p), (B-s), (C-r), (D-q) B) (A-r), (B-s), (C-r), (D-q)
C) (A-r), (B-s), (C-p), (D-q) D) (A-s), (B-p), (C-r), (D-q)
60. Match the Following:
Column I Column II
(A) Number of ways to select n objects from 3n (p) 3
objects of which n are identical and rest are
1 ( kn )!
different is k 2 k −1 + , k is
k ( n !)2

(B) Number of interior point when diagonals of a (q) 2

convex polygon of n side intersect if no
three diagonal pass through the same
n
interior point is C , then  is
(C) Five digit number of different digit can be (r) 4
made in which digit are in descending order
is 10 C then  is

Number of term in expansion of (1 + 31/3 )

6
(D) (s) 5
which are free from radical sign

A) (A -q ), (B -r ), (C -s ), (D -p ) b) (A -r ), (B -q ), (C -s ), (D -p )
C) (A -r ), (B -s ), (C -q ), (D -p ) D) (A -p ), (B -r ), (C -s ), (D -q )

41 AB 42 CD 43 B 44 D 45 A

46 A 47 C 48 A 49 D 50 A

51 A 52 A 53 B 54 C 55 A

56 C 57 B 58 D 59 B 60 A
41. 1440 = 25.32 .51
No. of divisors = (5+1).(2+1).(1+1) = 36
Product of divisors = 1.2.3……. 480.720.1440. Here all the 36 divisors are written in the
increasing order. They can be clubbed into 18 pairs, as shown below.
(1.1440). (2.720).(3.480) -----etc.
42. Conceptual
43. Least digit used = 4

 We can use 4,5,6,7,8,9. But remember that at least one 4 must be used.
----- (4 blanks)
51st blank can be filled in 6 ways.
2nd blank can be filled in 6 ways.
3rd blank can be filled in 6 ways.
4th blank can be filled in 6 ways.
 4 blanks can be filled in 64 ways. But out of these, some may contain no 4 at all.
Let us find them.
----- (4 blanks)Each blank can be filled in 5 ways (by 5, 6, 7, 8, or 9)
 54 ways (no 4 at all)
Ans = 64 - 54 (at least one 4)= 671.
44. G1 :3,6,9.......3n ; G2 :1, 4,7....... ( 3n − 2) ; G3 :2,5,8....... (3n −1)

a2 − b2 = ( a − b )( a + b )

Either a-b is divisible by 3 (or) a + b is divisible by 3 (or) both

3n2 + 2 ( n C1 ) = 5n2
2

n
C4 = 70  n = 8
45.
n( n − 3)
Number of diagonals=
2
2
Required no.of triangles = 4  n 2 + (n − 1)2 + ... + 12  = n(n + 1)(2n + 1)
46. 3

K = 3

47. The marks that are not possible will be 119,118,117,114,113,109

48. N = an an−1 an−2 ...a2 a1 a0
 N
= an −1.an − 2 ...a2 a1 a0
57

an10n = 56 ( a0 + 10a1 + 100a2 .... + 10n −1 an −1 )

 56 divides an10n  an = 7, n  3

 53 = a0 + 10a1 + 102 a2

 The required N= 7125 (or) 71250 (or) 712500 etc

 sum of digits = 15
49. SOL: xyz + x + y + z  xy + yz + zx + 1  ( x − 1)( y − 1)( z − 1)  0
r  a = 10  x + y + z = 10
3+ 4 −1
No. of solutions = C4 =6 C4 = 15

x1 + x2 + x3 = 16 + r , r = 0,1, 2,3, 4
50.
15+ r
Number of positive integral solutions= C2
4

Required number of solutions= 

r =0
15 + r
C2

51. HCF (, ) = 1. and will not have common factor other than 1 so, identical prime
numbers should not be separated. e.g. 211 will completely go with either or .
So the number of solutions = 2 × 2 ×2 × 2 × 2 × 2 = 64.
52. The largest number whose perfect square can be made with 15! is 25 33 51 71
So that number of ways of selecting x will be
(1 + 5) (1 + 3) (1 + 1) (1 + 1) = 96
53. Consider any door, for example, D72. It is operated by P1,P2,P3,P4,P6,P8,P9,P12,P18,P24,P36,P72,
(Remember that Dm is operated by Pn if m is a multiple of n)
Here 1,2,3,4,6,8,9,12,18,24,36,72 are all the factors of 72. Initially all the doors are
closed. Therefore, if odd numbers of persons operate it, it will be finally open.
Otherwise it will be closed finally.
Dm will be finally open, if m has an odd number of factors. And, we know that m
has an odd number of factors if and only if m is a perfect square.
 1 ,2 ,3 ,4 ,------, 31 are the numbers of the doors that are open finally.
2 2 2 2 2

 No. of doors finally open = 31.

54. D1,D4,D9,D16,D25,-----,D900,D961 are the 31doors that are open finally.
 D901,D902,D903, -----,D960 are the 60 consecutive doors that are closed and 60 is clearly
greatest.
55. As in both sets 3 elements are common, so 3 elements can be chosen in 7 C3 ways. And rest
of the elements can be chosen in any of the above three ways is 34 ways.
 So, total number of ways = 7 C3  34 = 2835
7

56. Total number of ways = 

r =0
7
Cr  7Cr = 3432

57. AA, SSS , TT , EE, RR, M , B, L

11!
A) Take RAAT as one unit. Therefore 10 + 1 = 11 units can be arranged in
3! 2!
ways.
B) After fixing S in first position and R in last position the remaining 12 letters can
12!
be arranged in remaining 12 positions in ways
( 2!)
4

7!
C) First 7 positions can be filled with A' s, E ' s, M , B, L in ways. The remaining
( 2!)
2

7!
7 positions can be filled with S ' s, T ' s, R ' s in ways.
3! ( 2!)
2

7!
D) 7 even positions can be filled with A ' s, S ' s, R ' s in ways. 7 odd positions
( 2!)  3!
2

7!
can be filled with T ' s, E ' s, M , B, L in
( 2!)
2

4
20 2 3 4
58. A)Coefficient of a (
in a + a + a + ...... ) =a (1 - a )
16 - 4 19 19
Or coefficient of x in (1 - a ) = C16 = C3 = 969

B) If one variable exceed 10. Let x>10 then

3 £ y + z + w £ 9(excluded zero)

Þ the number of positive integral solution

= The(If one variable exceed 10)sum of coefficient of
3
3 4 5 6 7 8 9 2 3
a ,a ,a ,a ,a ,a ,a (
in a + a + a + ..... )
3
0 2 3 4 5 6 2
= The sum of coefficient of a , a , a a , a , a , a in 1 + a + a + ..... ( )
3 4 5 6 7 8
= 1 + C1 + C2 + C3 + C4 + C5 + C6

= 1 + 3 + 6 + 10 + 15 + 21 + 28 = 84
Hence the number of positive integral solutions i.e., no variable may exceed 10;
zero value excluded = 969 - 84 = 885
4
20 3 5
C) The coefficient of a (
in a + a + a + ...... )
4
16 2 4
Or the coefficient of a (
in 1 + a + a + ....... )
 - 4
16 2 11 11
Þ The coefficient of a (
in 1 - a ) = C8 = C3 = 165

D) All of them get 5 balls

Total number of ways =1
59. For A → 5 × 6 × 6 × 2 = 360
 4! 4!    3!
For B → 5C2  +  2 + 5C1   2 + 1 = 175
 2!2! 3!   2! 
4!
For C → 5C3 × + 5C2 [9 × 2 + 6] = 360
2!
1 ( 2n ) !
60. (A) Required number of selection = 2 nC0 + 2 nC1 + ... + 2 nCn = 22 n −1 +
2 ( n !)2

(B) n C 4 (each quadrilateral gives one point of intersection)

(C) x4  x3  x2  x1  x0
10
C5 (5 distinct digits selection)

(D) Terms is involving 30 , 31/3 , 32/3 → 3

----------------------------------------------------------------------------------------------------------------------
-----------------------------------------------------------------------------------------------------

P1
----------------------------------------------------------------------------------------------------------------------
41. Let A = x1 , x2 ,...x7 . Let ‘f’ be bijective mapping from A to A. Let ‘ n1 ’ be number of

functions ‘f’ such that f ( xi ) = xi holds for at least one ‘ i ’ and ‘ n2 ’ be number of

functions ‘f’ such that f ( xi )  xi for i = 1, 2,3 and no restriction on remaining

elements. Then, which of the following is true?

A) n1 − n2 = 40 B) n2 − n1 = 30 C) n2 − n1 = 362 D) n1 − n2 = 2871
42. When an ordinary dice is rolled four times, the number of ways such that the
largest number appearing on the dice is not 4, is
A) 625 B) 175 C) 1121 D) 1040
43. Let there be three sketch pens of different colours. A regular pentagon with unit
side length is to be drawn using 3 pens. Exactly one of the colours is to be used to
 draw a side of the pentagon and at least two colours are to be used to make the
complete pentagon. The number of ways of doing it, is
A) 80 B) 48 C) 81 D) 240
44. There are 20 boys seated around a circle. The number of ways to select 4 boys
such that there must be odd number of boys left over between any two
consecutively selected boys, is equal to
A) 360 B) 420 C) 840 D) 1680
45. The number of ways in which 4 married couples can be seated such that four
persons are on left side and four are on right side of a long table and no wife is
infront of her husband and same gender persons do not sit opposite to each other,
is
A) 144 4 B) 9 4 C) 70 4 D) None of these
46. Let A = 1, 2,3,....20. B is a subset of A containing exactly 10 elements. The sum of
the elements of all possible subsets B is
A) 190. 20 c10 B) 190. 19c10 C) 210. 20c10 D) 105. 20 c10
47. A person has 3 sons. He owns 101shares of a company. He wants to distribute
these shares to his sons so that no son should have more shares than the
combined total of the other two. The number of ways in which he can do so, is
A) 1275 B) 1328 C) 5253 D) none of these
48. Nine chairs in a row are to be occupied by six students and professors Alpha, Beta,
and Gamma. These three professors arrive before six students and decide to
choose their chairs so that each professor will be between two students. In how
many ways can professors Alpha, Beta, Gamma choose their seats before students
arrived
A) 84 B) 60 C) 252 D) 35
49. A class contains 3 girls & 4 boys. Every Saturday five students go on a picnic, a
different group being sent each week. During the picnic, each girl in the group is
given a doll by the accompanying teacher. After all possible groups of five have
gone once, the total number of dolls the girls have got is
A) 21 B) 27 C) 45 D) none of these
50. If ‘x’ be the number of ways in which 7 walls in a row can be coloured using
5different given colours (no wall is supposed to be coloured with more than one
 colour and all 5 colours are to be used ) and ‘y’ be the number of ways that 7
students may group themselves into 5 groups to use 5 copies of the same book in

a college library, then x is equal to

y

A) 24 B) 30 C) 60 D) 120

SECTION – II
(MULTIPLE CORRECT ANSWER TYPE)
This section contains 5 multiple choice questions. Each question has 4 options (A), (B), (C) and (D) for its answer, out of which
ONE OR MORE than ONE option can be correct.
Marking scheme: +4 for correct answer, 0 if not attempted and -1 in all other cases.
51. Let m, n be positive integers. The number of ways to put ‘n’ different objects into
‘m’ identical boxes so that no box is empty be denoted by S ( n, m ) . Then which of

the following is/are true?

A) S ( n, 2) = 2n−1 −1
n ( n − 1)
B) S ( n, n − 1) =
2

C) The number of ways to put ‘n’ distinct objects into r identical boxes (there being
r

no restriction regarding any of the boxes being empty) is the sum  S ( n, m )

m =1

D) The number of ways to put ‘n’ distinct objects into ‘m’ distinct boxes so that no
box is empty is m .S ( n, m) ( n  m)

52. Let S = 1, 2,3,....,7 .A subset P of S is chosen, after replacing the elements of
‘P’ back in ‘S’, again a subset ‘Q’ is selected from ‘S’. Then, which of the
following is /are true ?
A) The number of ways in which P  Q = S & P  Q =  is 128
B) the number of ways in which n ( P  Q ) = 2 , n ( P  Q ) = 4 is 840.

C) The number of ways in which P  Q = S is 1

D) the number of ways in which P  Q   is 14197
53. The number ways of distributing ‘n’ distinct games among ‘n’ children so that
exactly one child does not get any game, is
n n −1
A) cn −1 n
n
B) c2 n
 n
C)  n −1
2 ( 1)
n−2
n−2

n
(
D) c1 ( n − 1) − c1 ( n − 2) + c2 ( n − 3) − ... + ( −1)
n −1 n n −1 n n n − 2 n −1
cn−2 )
54. Which of the following statements is/are false?
A) 109 −10 c1.99 +10 c2 .89 − +... −10 c9 .19 is a positive integer.
B) the number of surjective mappings from ‘5’ element set to 4 element set is
coefficient of x 5 in 5 ( e x − 1) .
4

C) when two identical ordinary dice are rolled simultaneously the number of
possible outcomes is 21
D) the number of ways of painting 6 faces of a cube with 6 different colours is 6
55. The number of shortest paths in which one can reach from the point (0, 0, 0) to the
point (3, 7, 11) in 3-dimentional space where the movement is possible only
along the +ve x-axis, +ve y-axis and +ve z-axis or parallel to them and
change of axes is permitted only at integral points (An integral point is one which
has its coordinates as integers) is
A) 21 c3 18
c7

B) 21 c11 10
c3

14
C) if the travel is through (1, 2, 4)
( 2)
2
45

D) same as the number of ways of arranging 3 mangoes, 7 guavas, 11 apples in a

row (fruits of same kind are considered as identical)
SECTION – III
INTEGER TYPE
(This section contains 5 questions. The answer to each question is a single digit integer ranging from 0 to 9. The correct digit
below the question number in the ORS is to be bubbled ).
Marking scheme +4 for correct answer , 0 if not attempted and -1 in all other cases.
56. The number of ways in which we can make a garland with 5 flowers of one kind
and 3 flowers of another kind, is
57. Given 5 different red balls, 5 different green balls. If the number of arranging them
in a row so that all green balls are together is ‘p’ and the number of ways of
arranging them in a row so that exactly 4 green balls come together is ‘q’, then
q
= _____
p
58. 14 identical black balls & 14 identical white balls are to be arranged in a row. The
number of ways to arrange them such that on picking any 7 consecutive balls we
k
get atleast one black ball is 28
c14 − k . 21
c7 +15 c2 where is equal to_______
3

59. The number of monotonically increasing functions from the set 1, 2,3,.....6 to itself

with the property that f ( x )  x x 1, 2,3,....6 is equal to

2
. 11
c5 where k is equal to
k
_____
60. ‘A’ & ‘B’ are two students among 100 students appearing for a competitive exam.
If all 100 students are given ranks the number of ways in which
k
‘A’ will be better ranked than B is 50 k where is equal to _______
11
41) B 42) C 43) B 44) B 45) A

46) D 47) A 48) B 49) C 50) D

51) ABCD 52) ABD 53) BD 54) AD 55) ABCD

56) 5 57) 5 58) 5 59) 7 60) 9

41. n1 = 7 − D7 = 3186

n2 = 7 −3 c1 6 + 3 c2 5 −3 c3 4 = 3216

n2 − n1 = 30

42. Required number of ways = 64 − ( 44 − 34 ) = 1121

35 − 3
43. Required number of ways = = 48
5

20 ( x1 + x2 + x3 + x4 = 16, xi ( i = 1, 2,3, 4 ) is odd + ve integer )

44. Required number of ways =
4
20 ( 2 ( k + l + m + n ) − 4 = 16 )
=
4
20 ( k + l + m + n = 10, k , l , w, n  N )
=
4

20 ( 9 c3 )
= = 420
4

Required number of ways = ( 2 c1 ) 4.D4 = 144 4

4
45.

46. Each of 1, 2, 3…..,20 will occur in 19 c9 ways in subjets B.

So, required sum = 19c9 (1 + 2 + 3 + ..... + 20) = 19c9 .210 = 105 20c10
47. Total number of ways of distributing 101 shares without any restriction is number of
non-ve integral solutions of x + y + z = 101 i.e 103
c2

Suppose x = 51, then y + z = 50  51 solution

x = 52, y + z = 49  50 solutions

……………………………………………...
x = 100, y + z =1  2 solutions

x = 101, y+z =0  1 solutions

_______________
51

r =
r =1
52
c2

 Required number of ways = 103c2 − 3. 52c2 .

48. Imagine the six students standing in a row before they are seated. There are 5
gaps between them (excluding 1st & last), each of which may be occupied by
atmost one of the 3 professors.
 Required number of ways = 5c3 . 3 = 60
49. Each girl will go to picnic in 6 c4 ways
 number of dolls the girls have got =6 c4 .3 = 45
7 7
50. x=  5+  5 = 16800
3 ( 1) 4 ( 2 ) ( 1)
4 2 3
23

7 7
y= 1 +  1 = 140
3 ( 1) 4 ( 2 ) ( 1) 2 3
4 2 3

x
 = 120
y

2n − 2
51. 1) Sn,2 = = 2n −1 − 1
2
2) Clearly one of the n-1 identical boxes is to contain 2 balls & remaining are to
contain one ball each. So, choose 2 balls out of n and put in one of the boxes
remaining balls can be put in remaining boxes in one way.
 required number of ways = n c2 .1.1
52. Consider the propositions 1) xi  P, xi 
2) xi  P, xi 
3) xi  P, xi 
 4) xi  P, xi 
Now for 1st option: required number of ways = 27 (propositions 2, 3 are favourable)
In case of 2nd option:
Select 4 elements of ‘s’, now 2elts of those selected 4 elts are to satisfy 2nd or
3rd propositions and remaining two selected elts are to satisfy propositions 1.
Required number of ways = 7 c4 .4 c2 .22.12 = 1680 .
3) P  Q = S will have happens in 37 ways. So, 3rd option is wrong.
4) P  Q =  will happens in 37 ways. So, P  Q   will happen in 47 − 37 = 14197
ways
n
53. Required number of ways = n
c1. n − 1 is n c2 . n
2 ( 1)
n−2
n−2

(or) choose one child for not giving any game, and then for each of remaining
children give atleast one game.
 it is n c1 (number of onto funtions from ‘n’ elt set to ‘n-1’ elt set)
54. 1) 109 − 10c1.99 + 10c2 .89 − +..... − 10c9 .19 = 0 as onto function cannot be formed from 9 elt
set to 10 elt set.
3) x1 + x2 + .... + x6 = 2 ( xi  1, 6)  2+6−1C6−1 =7 C5 = 21

4) number of ways of painting 6 faces of a cube = 5c1. 3 = 30 ways

55. Required number ways = 21c3 .18 c7 .11 c11 or = 21c11.10 c3 .7 c7 .
7
Option 3: number of ways of reaching point (1,2,4) from origin is .
124

14
& from (1, 2, 4) to (3, 7, 11) there are shortest ways.
257

14
So, required number of ways =
( 2)
2
45

21
Option 4: required number of arrangements =
3 7 11

56. Required number of ways =5 as follows

First arrange 2nd kind of 3 flowers around circle and in gaps arrange first kind of 5
flowers as 005, 014, 023, 113, 122 which are 3 partitions of 5
(or) number of solutions of x + y + z = 5, x  y  z x, y, z   .
57. p = 5. 6
 q = 5c4 4 . 5 p2 5 + 2 ( 5 c4 . 4. 5 p1 5 )

q =5
p

58. First arrange 14 identical black balls which can be done in one way. Now there are
15 gaps between them.
i.e G1 + G2 + G3 + ..... + G15 = 14
0  Gi  6 Gi W i.e fill each gap by atmost 6 white balls

Coefficient of x14 in (1 + x + x 2 + .... + x6 )

15

= coefficient of x14 in (1 − x7 ) (1 − x )
−1515

= 1. 28c14 − 15. 21c7 +15 c2 .1

k = 15

1 12 2
59. using catalan number, required number of ways = c6 = . 11c5
7 7
100
60. Required number of ways = 100c2 .1. 98 = = 50 99
2