Exponent Sheet

FIITJEE Permutation & Combinations

51. Total number of ways in which n2 number of identical balls can be put in n numbered boxes
1,2,3,........,n  such that ith box contains at least i number of balls is :
2 2
1 
(A) n Cn1 (B) n Cn1 (C) 0  x  (D) none of these
2

52. STATEMENT-1: Number of onto functions from Set A to Set B, where n(A) = m, n(B) = n (nm) is equal to

 
n
coefficient of xm in m! e x  1 
 
STATEMENT-2: If there are n1 objects of one kind, n2 objects of second,…….. nk objects of k th kind, then
the number of ways of arrangements of these objects, taken “r” at a time such that each selection
contains at least one object of each kind is
coefficient of xk in
 x x2 x3 xn1  x x 2 x 3 x n2   x x 2 x3 xnk 
r!     ..........      ..........   .......     ..........  
 1! 2! 3! n1!  n2 !   1! 2! 3! nk ! 
  1! 2! 3! 
53. Total number of even divisors of 189000 that are divisible by 15, are
(A) 128 (B) 54 (C) 27 (D) 72

54. A factor P of 10000000099. lies between 9000 and 10,000. The sum of its digits is
(A) 11 (B) 13 (C) 17 (D) 19

55. Match the following: These are three pots and four coins. All these coins are to be distributed into these
pots where any pot can contain any number of coins.
Column I Column II
The number of ways in which all these coins can be distributed if all coins
(A) (P) 3
are identical but all pots are different
The number of ways in which all these coins can be distributed if all coins
(B) are different but all pots are identical (Q) 6
The number of ways all these coins can be distributed such that no pot is
(C) (R) 15
empty if all coins are different but all pots are identical
The number of ways all these coins can be distributed such that no pot is
(D) (S) 14
empty is all coins are identical but all pots are different
56. The number of ways in which we can make a garland with five flowers of one kind and three flowers of
another kind must be
11!
(A). 5 (B). 7 (C)
5!7!
(D) number of non negative integer solutions of the equation x  y  z  5 where x  y  z

57. Thirteen persons are sitting in a row. Number of ways in which four persons can be selected so that no two
of them are consecutive is equal to ____
(A) number of ways in which all the letters of the word “M A R R I A G E” are permutated if no two vowels
are never together.
(B) number of numbers lying between 100 and 1000 using only the digits 1,2,3,4,5,6,7 without repetition.
(C) number of ways in which 4 alike chocolates can be distributed among 10 children so that each child
getting at most one chocolate.
(D) number of triangles can be formed by joining 12 points in a plane, of which 5 are collinear.

58 Number of pairs of positive integers (p,q) whose LCM (Least common multiple) is 8100, is “K”. Then
number of ways of expressing K as a product of two co-prime numbers is ____
8
59. The sum of all the coefficient of those terms in the expansion of (a + b + c + d) which contains b but not c
8
(A) 6305 (B) 6561 (C) 256 (D) 4
.

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

60. Four digit natural number is formed using, the digits from the set {0, 1, 2, 3, 4, 5}, repetition of digits is
allowed
Column I (Conditions) Column II (Number of natural numbers)
(A) Number formed is multiples of 3 (p) 480
(B) number formed contains exactly two (q) 540
different digits
(C) Numbers formed contains exactly three (r) 360
different digits
(D) Number formed is odd (s) 175

61. The number of times the digit 3 will be written when listing the integers from 1 to 1000, is
(A) 269 (B) 300 (C) 271 (D) 302

62. There are 2 Indian couples, 2 American couples and one unmarried person
Column I Column II
(A) The total number of ways in which they can sit in a row such that an Indian wife (p) 22680
and an American wife are always on either side of the unmarried person, is

(B) The total number of ways in which they can sit in a row such that the unmarried (q) 5760
person always occupy the middle position, is

(C) The total number of ways in which they can sit around a circular table such that an (r) 40320
Indian wife and an American wife are always on either side of the unmarried
person, is

(D) If all the nine persons are to be interviewed one by one then the total number of (s) 24320
ways of arranging their interviews such that no wife gives interview before her
husband, is
63. The number of isosceles triangles with integer sides if no side exceeds 2008 is
(A) 1004  if equal sides do not exceed 1004
2

(B) 2 1004  if equal sides exceed 1004

2

(C) 3 1004  if equal sides have any length  2008

2

(D)  2008  if equal sides have any length  2008

2

64. The number of ordered pairs of positive integers (a,b) such that LCM of a&b is 23571113 is
(A) 2385 (B) 2835 (C) 3825 (D) 8325

65. How many combinations can be made up of 3 hens, 4 ducks and 2 geese so that each combination has
hens, ducks and geese? ( birds of same kind all different)
(A) 305 (B) 315 (C) 320 (D) 325

66. Match the following

Column-I Column-II
a) If, x,y,z  N , then the number of ordered triplets  x,y,z  satisfying xyz  243 is p) 19
b) The number of terms in the expansion of  x  y  z  is
6 q) 20

c) If x  N then the no of solutions of x 2  x  400  0 is r) 28

d) If x,y,z  N , then the no. of solutions of x  y  z  10 s) 21
t) 36

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

67. Match the following:

Consider all possible permutations of the letters of the word M A S T E R B L A S T E R S
Column – I Column – II
A) The number of permutations containing the word RAAT is p)
 7!
2

3!  2!
4

B) The number of permutations in which S occurs in first place and R occurs in q) 11! 4!
the last place is
3!  2!
2

C) The number of permutations in which none of the letters S, T, R occur in first r) 11!
7 positions is 3! 2!
D) The number of permutations in which the letters A, S, R occur in even s) 12!
positions is
 2!
4

68. The number of ways of forming an arrangement of 5 letters from the letters of the word “IITJEE” is
(A) 60 (B) 96 (C) 120 (D) 180
 n  1  2n1  n  2 
69. A cricket player played n (n > 1) matches during his career and made a total of runs.
4
If the player made k .2 n  k 1 runs in the k th match 1  k  n  ,find n.
70. Let A1, A2, A3, …, A40 are 40 sets each with 7 elements and B1, B2, …, Bn are n sets each with 7 elements. If
40 n

 A  B
i 1
i
j 1
j  S and each element of S belongs to exactly ten of Ai's and exactly 9 of Bj's, then n equals

(A) 42 (B) 35
(C) 28 (D) 36

71. Eight straight lines are drawn in the plane such that no two lines are parallel and no three lines are
concurrent. The number of parts in to which these lines divide the plane is
(A) 29 (B) 32 (C) 36 (D) 37

72. The number of three digit numbers with three distinct digits such that one of the digits is the arithmetic mean
of the other two is
A) 120 B) 180 C) 112 D) 104

73. Match the Following:

Column I Column II
(A) Number of ways to select n objects from 3n objects of which n are identical and rest are (p) 3
1  kn  !
different is k 2 k 1  , k is
k  n !2

(B) Number of interior point when diagonals of a convex polygon of n side intersect if no (q) 2
three diagonal pass through the same interior point is
n
C , then  is
(C) Five digit number of different digit can be made in which digit are in descending order is (r) 4
10
C then  is
(D)
Number of term in expansion of 1  3 
1/3 6
which are free from radical sign
(s) 5

(t) 1

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

74. 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 and (q) 1
no one gets more than 10 balls is
(C) All the jugglers get odd number of balls (r) 969
is
(D) All of them get equal number of balls is (s) 165

75. Matching
Column I Column II
A Number of divisor of N  23 32 55 7 4 which leaves remainder 1 when divided by 4 is p 16
B 99
a a q 48
If a1, a2,…… a100 are in H.P. then the value of  i i1 is
i 1 a1 a100
33
C The remainder when 3 is divided by 75 is r 126
D The number of four digit number in which every digits exceeds the immediate s 36
preceding digit
t 99

76. The no. of words formed with or without meaning, each of 3 vowels and 2 consonants from the letters of the
word INVOLUTE is written in the form of 2a.3b.5c.7 d then
(A) a  6 (B) b  2 (C) c  1 (D) d=0

77. The number of n-digit numbers, no two consecutive digits being the same, is
n 9
(A) n! (B) 9! (C) 9 (D) n

78. The number of divisors of 3630, which have a remainder of 1 when divided by 4, is
(A) 12 (B) 6 (C) 4 (D) none of these.
10 10
79. The number of solutions of the inequation Cx-1 > 3 . Cx is
(A) 0 (B) 1 (C) 2 (D) 9

80. Triplet (x, y , z) is chosen from the set { 1, 2, 3, . . . . n }, such that x  y < z. The number of such
triplets is
3 n n
(A) n (B) C3 (C) C2 (D) none of these

81. If m and n are positive integers more than or equal to 2, m > n, then (mn)! is divisible by
n m
(A) (m!) (B) (n!) (C) ( m+n)! (D) (m - n) !

82. Let S be the set of 6-digit numbers a1a2a3a4a5a6 (all digits distinct)
where a1 > a2 > a3 > a4 < a5 < a6 . Then n(S) is equal to
(A) 210 (B) 2100 (C) 4200 (D) 420

83. The number of positive integral solutions of the equation x1 x2 x3 = 60 is

(A) 54 (B) 27 (C) 81 (D) None of these.

84. For the series 21, 22, 23, . . . . , k –1, k ; the A.M. and G.M. of the first and last number exist in
the given series. If ‘k’ is a three digit number, then ‘k’ can attain
(A) 5 values (B) 6 values (C) 2 values (D) 4 values

85. Consider a set {1, 2, 3, . . . ., 100 } . The number of ways in which a number can be selected from the
y
set so that it is of the form x , where x, y,  N and  2 , is
(A) 12 (B) 16 (C) 5 (D) 11

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations
4
86. Number of natural numbers < 2 .10 which can be formed with the digits 1, 2, 3 only is equal to
3 6  2 .3 4  3 3 6  2 .3 4  3 37  1
(A) (B) (C) (D) none of these
2 2 2
87. The sum of the factors of 7!, which are odd and are of the form 3t + 1 where t is a whole number, is
(A) 10 (B) 8 (C) 9 (D) 15

88. Number of positive integers n less than 15, for which n! + (n+1)! + (n+2)! is an integral multiple of
49, is
(A) 3 (B) 4 (C) 5 (D) 6

89. Let n be a positive integer with f(n) = 1! + 2! + 3! + . . . + n! and P(x), Q(x) be polynomials in x such
that f(n+2) = P(n)f(n+1) + Q(n)f(n) for all n 1. Then
(A) P(x) = x + 3 (B) Q(x) = -x –2 (C) P(x) = -x –2 (D) Q(x) = x + 3

90. The number of ordered pairs (m, n) ( m, n  { 1, 2, . . ., 20} )

m n
such that 3 +7 is a multiple of 10, is
(A) 100 (B) 200 (C) 4!  4! (D) none of these

91. The number of four-digit natural numbers in which odd digits occur at even places and even digits
occur at odd places and digits are in increasing order from left to right,
(A) is less than 36 (B) is greater than 100 (C) lies between 60 and 100 (D) none of these.

92. The number of permutations of the letters of the word HINDUSTAN such that neither the pattern
‘HIN’ nor ‘DUS’ nor ‘TAN’ appears, are
(A) 166674 (B) 169194 (C) 166680 (D) 181434

93. Nine hundred distinct N-digit numbers are to be formed by using 6, 8 and 9 only. The smallest value of
N for which this is possible, is
(A) 6 (B) 7 (C) 8 (D) 9

94. y = x + r and y = - x + r where r takes all decimal digits. Then the number of squares in xy plane formed
by these lines with diagonals of 2 units length are
(A) 81 (B) 100 (C) 64 (D) 49

95. Let y be an element of the set A = {1, 2, 3, 5, 6, 10, 15, 30} and x1, x2, x3 be positive integers such that
x1x2x3 = y, then the number of positive integral solutions of x1x2x3 = y is
(A) 64 (B) 27 (C) 81 (D) None of these

96. The number of ways in which we can choose 2 distinct integers from 1 to 100 such that difference
between them is at most 10 is
100 90 100 90 100 90
(A) C2 – C2 (B) C98 – C88 (C) C2 – C88 (D) None of these

97. How many three digit numbers can be formed without using the digits 2, 3, 4 and 5 (repetition of digits
is allowed).
(A) 180 (B) 192 (C) 200 (D) None of these
9 5 4 2
98. The number of factors (excluding 1 and the expression itself) of the product of a . b . c . d . e. f, when a, b,
c, d, e, f are all prime numbers are
(A) 3599 (B) 3598 (C) 3790 (D) None of these

99. How many four letter words containing 2 vowels and 2 consonants can be formed using the letters of the
word SAURABH.
(A) 210 (B) 216 (C) 215 (D) None of these

100. How many 3 letter words can be formed using the letters of the word ‘LOVELENA’.
(A) 120 (B) 130 (C) 150 (D) None of these

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

KEY
52 A 53 B 54. D
55. A  R, B  S, C  Q , D  P 56. A 57. B,C,D
58. 2 59. A 60. (A-r), (B-s), (C-r), (D-q)
61. (B) 62 A-r,B-r,C-q,D-P 63.A,B,C 64. B
65. B 66 a  s,b  r,c  p,d  t 67. A-q,B-S,C-p,D-r
68 D 69 7 70. D 71. A
73. A-q,B-r,C-s,D-p 74. A-r,B-p,C-s,D-q 75. A-q,B-t,C-q,D-P 76. A,B,C
77. C 78 B 79. C 80. D
81. A , B, C ,D 82. B 83. A 84. C
85 A 86. A 87. B 88. A
89. A, B 90. A 91. A 92. B
93. B 94. C 95. A 96. A, B, C
97. A 98 B 99 B 100 C

SOLUTIONS
n  n  1
51. If we put minimum number of balls required in each box. Balls left are which can be put in
2
n2  n  2
2
Cn 1 ways without restriction.
53 189000  23  33  53  7
For the divisors to be even and divisible by 15; 2,3 and 5 must occur at least once.
Therefore total number of required divisors are 3  3  3  2  54
54 10000000099  x5  x  1 where x  100
x5  x  1   x 2  x  1 x 3  x 2  1  9901 is a factor of P
6
55. (A) Required number of ways= C2
(B) Since pots are identical, there will be 4 cases (4,0,0), (3,1,0), (2,2,0); (2,1,1) but all the
Coins are different hence selection of coins matters
For the first case No of selections = 4c4  1
For the second case No of selections = 4c3  1c1  4
4c2  2c2
For the third case No of selections = 3
2!
4c2  2c1 1c1
For the fourth case No of selections = 6
2!
(C) Since no box is empty and all pots are identical so the possible case is (1,1,2). But since all the Coins are
2c1 1c1
different, the 2 balls can be selected in 4c2 ways and rest can be put in
2!
4c2  2c1  1c1
Required number of distributions = 6
2!
(D) Since no pot is empty and all coins are identical the possible case is (1,1,2). But since all three pots are
different hence, a pot (which contains 2 coins together) can be selected in 3c1 [Link], the required
number of distributions = 3c1  1  3
56 The garland will look different if number of flowers of the first kind vary in the three indistinguishable empty
spaces between the flowers of second kind. Therefore number of garlands which can be made must be
number of non-negative integer solutions of x+y+z = 5 x  y  z .
Which have solution 0 0 5
0 1 4
0 2 3
1 1 3
1 2 2
 only 5 garlands can be [Link] (b) and (c) are ruled out.
57
FIITJEE (Hyderabad Classes) Limited.
 Exponent Sheet
FIITJEE Permutation & Combinations

x1  x 2  x 3  x 4  x 5  9, x1 , x 5  0
x 2 ,x 3 ,x 4  1, number of solutions are 210
(A) 5  12 12 =720 (B) 7 P3 =210 (C) 10C 4 =210 (D)12 C3 5C3 =210
58
8100  223452
k  5  9  5  225  3252
 2 ways
8 8
59 Sum of the coefficients of the terms not containing c is 3 and of the term not containing b and c both is 2 ,
8 8
so required sum = 3 - 2
60. For A  5 × 6 × 6 × 2 = 360
 4! 4!  5  3! 
 2!2!  3!  2   C1  2!  2  1 = 175
5
For B  C2
   
5 4! 5
For C  C3 × + C2 [9 × 2 + 6] = 360
2!
61 Since 3 does not occur in 1000, we have to count the number of times 3 occurs when we list the integers
from 1 to 999. Any number between 1 and 999 is of the form xyz where 0  x, y, z  9. Let us first count
3 3
the number in which 3 occurs exactly once. Since 3 can occur at one place in C1 ways, there are C1 (9 
2 3
9) = 3  9 such numbers. Next, 3 can occur in exactly two places in ( C2)(9) = 3  9 such numbers. Lastly,
3 can occur in all three digits in one number only.
Hence, the number of times 3 occurs is
2
1  (3  9 ) + 2  (3  9) + 3  1 = 300.
62 (A) One Indian wife and one American wife can be selected in 2 C1  2 C1 ways and keeping an unmarried
person in between these two wives the total number of linear arrangements are 2
C1  2 C1  7  2
 40320
(B) Required number of ways  8  40320
(C) Required number of ways   7  1  2 2 C1 2 C1  5760
(D) Number of ways in which interviews can be arranged
 9 8 C2 6 C2 4 C2 2 C2  22680
63 If the sides are a,a,b then the triangle forms only when 2a>b .So for any a  N, b can change from 1 to 2a-1
,where a  1004  no. Of triangles =1+2+3+---+(2(1004)-1)= 1004 
2

And if 1005  a  2008 , b can take any value from 1 to 2008

But a has 1004 possibilities hence
No . Of triangles = 1004  2008
= 2 1004 
2

 Total no. Of isosceles triangles = 3 1004 2

64 a,b are factors of the form 2a1 5b111c1 , 2a2 5b2 11c2 ,where a1,b1,c1,a2 ,b2 ,c 2 are non negative [Link]
LCM of a,b is 23 571113 , max a1,a2   3, max b1,b2   7 and
max c1,c 2   13 .Hence  a1,a2  can be (0,3), (1,3), (2,3), (3,3), (3,2), (3,1), (3,0) (one of the number is 3 and
other number can be any where from 0 to 3 ) giving us 7 [Link]  b1,b2  has 15 choices &
 c1,c 2  has 27 choices .
Hence total number of choices = 7  15  27  2835 .
65 2 3
 
 1 2 4  1 22  1 
67 AA, SSS, TT, EE, RR, M,B,L
11!
A) Take RAAT as one unit. Therefore 10 + 1 = 11 units can be arranged in ways.
3! 2!

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

B) After fixing S in first position and R in last position the remaining 12 letters can be arranged in
12!
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 7 positions can be
 2!
2

7!
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 can be filled with
 2!
2
 3!
7!
T 's, E ' s, M,B,L in
 2!
2

68. Number of arrangements in which 2 are identical of one kind, two identical of another kind and one letter
5!
different from the remaining two letters is 2C1   60. Number of arrangements in which 2 are
 2!
2

5!
identical of one kind and the rest are different is 2C1   120
2!
 n  1  n 1 n
69. 
 4 
  2  n  2    k .2 n 1 k  S where
k 1

S  1.2n  2.2n 1  3.2n  2  ....  n.2

1
S 2n 1  2.2 n  2  ....   n  1 .2  n
2
1
Subtracting , S   2  2  .....  2   n  2  2  1  n
n n 1 n

2
 S  2  2  2   2n  2  2n 1  n  2 
n 1

n 1
Hence,  2 (i.e) n  7
4
70 n(S) × 10 = 40 × 7
n(S) = 28
28 × 9 = n × 7 n = 36
n(n  1)
71. Find tn in 2,4,7,11……. t n  1 
2
72. If the number is 100a  10b  c where 1  a  9
bc ac ab
0  b, c  9 then a  or b  or c  , where a, b, c are distinct
2 2 2
2 n 1 1  2n  !
(A) Required number of selection  C0  C1  ...  Cn  2 
2n 2n 2n
73
2  n !2
n
(B) C4 (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

 
4
 a 1  a
20 2 3 4
74 A) Coefficient of a in a  a  a  ......
4
in 1  a
16 19 19
Or coefficient of x  C16  C3  969
B) If one variable exceed 10. Let x>10 then
FIITJEE (Hyderabad Classes) Limited.
 Exponent Sheet
FIITJEE Permutation & Combinations

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  .......

in 1  a 
4
16 2 11 11
 The coefficient of a  C8  C3  165
D) All of them get 5 balls
Total number of ways =1
0 a b c a b c
75 (A) Let X = 2 . 3 . 5 . 7 is a divisor = (4 – 1) (4 + 1) (8 – 1)
0a2 0b5 0c4
4I   1 1b  1
a c

a, c both odd, b takes any value OR a, c both even, b take any value
 If a  0,b any,c  0,2,4  6  3  18
if a  1, b any,c  1,3  6  2  12
if a  2,b any,c  0,2,4  6  3  18

48
(B)
a2  a1  a1a 2 d
a 3  a 2  a 2 a3 d
. .
. .
a100  a99  a99 a100 d

99
a100  a1  d ai ai1  99a1a100 d
i 1
(C)
3.332  3 10  1
16
 3 100I  16C 15 .10  1
 3 100I  160  1  3 100I1  41  
 300I1  123  75I11  48
(D)
Let four digits no is x1 x2 x3 x4
x1 > x2 > x3 > x4
0 can not use at any place
Required no. = no. of ways of selecting 4 digit out of 9  9C4  16

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

Number of ways selecting 3 vowels and 2 consonants and arranging them is C3 . C2 .5!  2 .3 .5
4 4 6 2 1
76

77 The first digit can be chosen in 9 ways( other than zero), the second can be chosen in 9 ways (
any digit other then the first digit), the third digit can be chosen in 9 ways( any digit other then
n
the second digit ) and so on. Hence required number of numbers is 9  9  . . . .  9 ( n times) = 9 .
2
78 3630 = 2  3  5  11 .
Now a divisor will be of the form (4n+1) if divisor is form the help of (4n+1) type number or by (4n+3)
types number taken even times.
2 2
Hence divisors are 1, 5, 3  11, 11 , 5  11 , 5 3 11, i.e., 6.
10 10 1 3
79 Cx –1 > 3 . Cx  >  4x > 33  x  9 , but x 10.
11  x x
So x = 9, 10. Hence there are two solutions
n
80 Any three numbers x, y, z from {1, 2, 3, . . . .} can be chosen in C3 ways and we get unique triplet (
n
x, y, z) , x< y < z . Again any two numbers x, z can be chosen from {1, 2, 3, . . . , n } in C2 ways and
we get the triplet
n n
( x, x, z) , x< z . Hence total number of required triplets is C2+ C3 .

81
mn! is the number of ways of distributing mn distinct objects in n persons equally. Hence
mn!
m!n m!n
n m
is an integer  ( m!) | ( mn)! . Similarly (n!) |(mn)!.Further m+n < 2 m  mn  ( m+n)! | (mn)! and
m –n < m < mn
 ( m -n)! | (mn)!
10
82 First, 6 distinct digits can be selected in C6 ways. Now the position of smallest digit in them is fixed
5
i.e. position 4. Of the remaining 5 digits, two digits can be selected in C2 ways. These two digits can be
th th
placed to the right of 4 position in one way only. The remaining three digits to the left of 4
position are in the required order automatically.
10 5
So n(S) = C6  C2 = 210  10 = 2100 .
2
83 Here x1x2 x3 = 2  3  [Link] number of two’s given to each of x1 , x2 , x3 be a, b, c . Then a+b+c = 2, a,
b, c  0
2 -3 4
The number of integral solutions of this equations is equal to coefficient of x in (1-x) i.e. C2 i.e.
4
the available 2 two’s can be distributed among x1, x2 and x3 in C2 = 6 [Link], the available
3 -3
1 three can be distributed among x1 , x2 , x3 in C2 = 3 ways( = coefficient of x in (1 – x) )
4 3 3
 Total number of ways = C2  C2  C2 = 6  3  3 = 54 ways.

84 21, 22, 23, . . . . k –1, k

21  k
A.M. = , G.M  21.k
2
2
 k = 21.  ,   I also 100  k  999 and k should be odd
100 999
  2  2
 4. 76    47. 57  = 3, 4, 5, 6 but  should be odd  odd  = 3,5 
21 21
‘k’ can assume 2 different values .

85 Perfect square =  100  – 1 = 9( excluding one )

Perfect cubes = 100   1  3
1/ 3

powers = 100   1  3
th 1/ 4
Perfect 4
powers = 100   1  1
th 1/ 5
Perfect 5
powers = 100   1  1
th 1/ 6
Perfect 6
th th
Now, perfect 4 powers have already been counted in perfect squares and perfect 6 powers have
been counted with perfect squares as well as with perfect cubes. Hence the total ways = 9+ 3+ 1 – 1
= 12 .

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

86 Total number of numbers will be equal to the sum of numbers of all possible 1–digit, 2-digit, 3-digit,
2 3 4 4
4-diigit and 5-digit numbers. Total number of numbers =3 + 3 + 3 +3 + 3 =

3 35  1 
 34 
3 6  2 .3 4  3
.
2 2
4 2
87 7! = 2  3  5  7
Since the factor should be odd as well as of the form 3t + 1, the factor cannot be a multiple of either 2
or 3. So the factors may be 1, 5, 7and 35 of which only 1 and 7 are of the from 3t +1, whose sum is 8.
2
88 n! + ( n+1)! + (n+2)! = n! { 1+n +1 + ( n + 2)(n+1) } = n!( n+2)
 Either 7 divides n + 2 or 49 divides n!  n = 5, 12, 14 .

89 f(n) = 1! + 2! + 3! + . . . . . + n!
f(n+1) = 1! + 2! + 3! + . . . . . + (n+1)!
f(n+2) = 1! + 2! + 3! + . . . . . + (n+2)!
f(n+2) – f(n+1) = ( n +2)! = ( n+2 )( n + 1)! = (n +2)[ f( n+1) – f(n) ]
 f( n+2) = (n+3)f( n+1) – (n+2)f(n)  P(x) = x +3, Q(x) = – x –2

90 The last digit of powers of 3 will be 3, 9, 7, 1 and it repeats in the same order. The last digit of powers
m n
of 7 will be 7, 9, 3,1 and it repeats in same order. Now 3 + 7 will be a multiple of 10 as 3+7, 9+1,
7+3, 1+9.
 (m, n) will be of the form(4t+1, 4k+1), ( 4t +2, 4k), ( 4t+3, 4k+3) and (4t , 4k+2).
So total number of ways = 5  5 + 5  5 + 5  5 + 5  5 =100
I II III IV
91
4
Two distinct odd digits for the second and fourth places can be selected in C2 = 6 ways (since we
cannot take 1, as first digit will be at least 2). Now these can be arranged in increasing order in one
4
way only. Similarly two distinct even digits for the first and third places can be selected in C2 = 6 ways
(since we cannot take 0). Now these can be arranged in increasing order in one way only.
Now total number of ways of filling the four places is 6  6 = 36.
But this contains the numbers of the type 6385 which are not needed. So number of such numbers will
be less than 36.
9!
92 Total number of permutations =
2!
Number of those containing ‘HIN’ = 7!
7!
Number of those containing ‘DUS’ =
2!
Number of those containing ‘TAN’ = 7!
Number of those containing ‘HIN’ and ‘DUS’ = 5!
Number of those containing ‘HIN’ and ‘TAN’ = 5!
Number of those containing ‘TAN’ and ‘DUS’ = 5!
Number of those containing ‘HIN’, ‘DUS’ and ‘TAN’ = 3!
9!  7! 
Required number =   7!7!   3  5! – 3! = 169194.
2!  2
6 7
93 (3) = 729 < 900 and (3) = 2187 > 900
2
94 Draw all ten lines y = x + r and other ten lines y = -x + r. We can observe that required squares are 8 =
64

95 The number of solutions of the given equation is the same as the number of solution of the equation
x1x2 x3 x4 = 30 = 2  3  5 ( here x4 is dummy variable )
3
Hence number of solutions is 4 = 64.

96 Let the chosen integers be x1 and x2 .

Let there be a integer before x1, b integer between x1 and x2 and c integer after x2
 a+b +c = 98. Where a  0 , b  10 , c  0
88 + 3 –1
Now if we consider the choices where difference is at least 11, then the number of solution is C3
90
–1 = C2

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

100 90
 Number of ways in which b is less than 10 is C2 – C2 which is equal to (A), (B) and (C)
option.

97 We have to find the total number of three digit numbers formed by using the digits 0, 1, 6,
7, 8, 9. A three digit number has three places. Unit’s place can be filled by any of the digits 0, 1, 6, 7, 8, 9.
So unit place can be filled in 6 ways. Similarly, ten’s place can be filled in 6 ways, but hundred’s place can
be filled by any of the digits 1, 6, 7, 8, 9 in 5 ways.
Hence required number of numbers = 6  6  5 = 180.
9 5 4 2
98. The total number of factors of the product a . b . c . d . e. f is equal to the number of ways of selecting
atleast one from 9a’s, 5b’s, 4c’s, 2d’s, 1e and 1 f. The number of such ways is (9 + 1) (5 + 1) (4 + 1) (2 + 1)
(1 + 1) (1 + 1)  1 = 3600  1 = 3599
But this includes the given product, hence the required number of factors is 3599  1 = 3598.

99. There are 4 consonants and 3 vowels in the word ‘SAURABH’

Case I: Using 2 consonants out of 4 constants and 2 different vowels out of 3 vowels
4 2
C2  C2  4!
Case II: Using 2 consonants out of 4 consonants and 2 same vowels
4 4!
C2  1  .
2!
4!
Hence total number of words = 6  4! + 6  = 9  4! = 216.
2
100. There are 8 letters, 2  L, 1  O, 1  V, 2  E, 1  N, 1  A
Case I: All the 3 letters are distinct :
6
There are 6 distinct letters i.e. L, O, V, E, N, A out of which 3 letters can be selected in C3 ways, each such
group has 3 letters, which can be arranged 3! ways.
6
Hence the total number words = C3  3! = 120.
Case II: Two alike and one distinct letters :
2
There are two pairs of alike letters i.e. LL, EE, out of which one pair can be chosen in C1 ways. Now, we
5
have to choose one letter out of the remaining 5 different letters, which can be done in C1 ways. So, total
2 5 3!
number of groups of such type = C1  C1 each group can be arranged in ways.
2!
2 5 3!
 total number of such words = C1  C1  = 30
2!
Hence from Case (I) and Case (II), the total number of 3 letter words = 120 + 30 = 150.

FIITJEE (Hyderabad Classes) Limited.