Exponent Sheet

FIITJEE Permutation & Combinations

101. The number of positive integral solutions of abc = 45 is

(A) 19 (B) 20 (C) 18 (D) None of these

102. There are three groups of identical red, blue and green balls and each group contains atleast 10 balls. Then
the number of ways of selecting 10 balls if twice as many red balls as green balls are to be selected is
(A) 3 (B) 4 (C) 5 (D) None of these

103. There are 100 copies of each of the physics, chemistry and maths books in FIITJEE library. then the
number of ways in which one or more than one book can be selected is
(A) 1030300 (B) 1030301 (C) 1030330 (D) None of these
m
104. If x, y, z, ……… are (m + 3) distinct prime numbers, then the number of factors of (xy) z is
2 m+1 2 m-1 m+1
(A) (m + 1) . 2 (B) (m + 1) . 2 (C) (m + 1). 2 (D) None of these
m m+1
105. If C2 = n, then the value of C4 is
1 n 1 n 1 n
(A)  C2 (B)  C2 (C)  C2 (D) None of these
2 4 3

106. If n objects are arranged in a row, then the number of ways of selecting two of these objects such that they
are not next to each other is
n1 n n+1
(A) C2 (B) C2 (C) C2 (D) None of these

107. There are 20 white and 20 black balls. If balls of each colour are marked as 1, 2, 3, ………,20, then the
number of ways in which we can arrange these balls in a row, so that neighboring balls are of different
colours is
2
(A) 2 (20!) (B) 2 (20!) (C) 2 (20!) (D) None of these
108 From the above problem, If balls of each colour are identical.
(A) 2 (B) 1 (C) 3 (D) None of these

109. A person goes in for an examination in which there are three papers with maximum of m marks from each
paper,then the number of ways in which one can get 2m marks is
(m  1)(m  2) (m  1)(m  2) m(m  1)
(A) (B) (C) (D) None of these
2 3 2
p p q p q q
110. If p, q and r are positive integers, then the value of Cr + Cr1. C1 + Cr2 C2+ ……. Cr is
p+q p+q p+q+1
(A) Cr (B) Cr (C) Cr (D) None of these
111. The total number of 5 digit numbers of different digits in which the digit in the middle is the least is
9 9 9
(A) 
r 4
r
P4 (B) 
r 4
r
P5 (C) 
r 5
r
P4 (D) None of these

112. The number of 3 digit numbers in which the sum of the digits is divisible by 5 is
(A) 150 (B) 130 (C) 180 (D) None of these

113. The number of ways to give 20 different things to three persons A, B and C so that B gets 2 more than A
and C gets 1 more than B is
20! 20! 20!
(A) (B)  3! (C)  2! (D) None of these
5! 7! 8! 5! 7! 8! 5! 7! 8!
114. The number of 6 digit numbers that can be made with the digits 1, 2, 3 and 4 having exactly two pairs of
digits is
(A) 1081 (B) 1088 (C) 1080 (D0 None of these

115. If 6n different things can be equally distributed among 6 persons in k ways then the number of ways to
divide the 6n things in 6 equal groups is
k k k 1
(A) (B) (C) (D) none of these
5! 6! 6!
116. In an examination there are 3 multiple choice questions and each question has 4 choices. Number of
sequences in which a student can fail to get all answers correct is
(A) 11 (B) 15 (C) 80 (D) 63

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

117. Let A be the set of 4-digit numbers a1a2a3a4 where a1> a2> a3> a4, then n(A) is equal to
(A) 126 (B) 84 (C) 210 (D) none of these

118. The number of five digits telephone numbers having atleast one of their digits repeated is
(A) 90,000 (B) 100000 (C) 30240 (D) 69760

119. Let p be a prime number such that p  3. Let n = p! + 1. The number of primes in the list n + 1, n + 2, n
+ 3, ......., n + p –1 is
(A) p –1 (B) 2
(C) 1 (D) none of these

120. Let A be the set of 4-digit numbers a1a2a3a4 where a1> a2> a3> a4, then n(A) is equal to
(A) 126 (B) 84
(C) 210 (D) none of these

121. Set A has 3 elements and set B has 4 elements. The number of injections that can be defined from A to B is
(A) 144 (B) 12
(C) 24 (D) 64

122 The number of integers between 1 and 1000000 whose sum of their digits equal to 18 is
(A) 25926 (B) 25925 (C) 25927 (D) 25929

123. There are 5 mangoes and 4 apples. Then the number of different ways can a selection of fruits be made if
fruit of same kind are different is
9 9 3
(A) 2 – 1 (B) 2 (C) 2 – 1 (D) None of these

124 From the above problem, if fruit of same kind are identical
(A) 29 (B) 20 (C) 39 (D) None of these

125. The number of ways can 13 identical coins be given to three beggars such that each one gets at least one
coin and no two beggars get equal number of coins is
(A) 42 (B) 40 (C) 48 (D) None of these

126. The sum of integers from 1 to 100 which are divisible by 2 or 5 is

(A) 3050 (B) 4050 (C) 4850 (D) None of these

127. Four digit numbers are to be formed by using the digits 0, 1, 2, 3, 4, 5. Then the the number of such
numbers if at least one digit is repeated
(A) 770 (B) 780 (C) 1080 (D) None of these

128. The number of ways can 10 different prizes be given to 5 students, so that one boy get exactly 4 prizes and
the rest of the students can get any number of prizes is
5 10 6 5 5 6 5 10 5
(A) C1  C4  4 (B) C1  C4  4 (C) C1  C4  4 (D) None of these

129. There are 5 different subjects to be alloted to 6 different periods. Then the number of ways can this
be done if no period can go unalloted?
(A) 1800 (B) 1900 (C) 2000 (D) None of these

130. Two integers are selected from the integers 1, 2, 3, …., 100. Then the number of ways these can be
selected so that their sum is divisible by 5 is

(A) 900 (B) 990 (C) 890 (D) None of these

131. The number of ways of selecting 5 coins from coins, three each of Rs. 1, Rs. 2
and Rs. 5 is
(A) 13 (B) 14 (C) 11 (D) 12

132. The number of 5-digit numbers, the sum of whose digits leaves a remainder of 2, when divided by 4 is
(A) 22500 (B) 22400 (C) 222000 (D) None of these

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

133. There are four bags containing identical balls. The first bag contains 10 red balls, the second contains 4
black balls, the third contains 2 green balls and the last contain 6 blue balls. Then the number of ways 6
balls can be selected if there is no restriction is
(A) 60 (B) 40 (C) 70 (D) None of these

134 from the above problem, Atleast one ball of each colour is selected is
(A) 8 (B) 9 (C) 7 (D) None of these
5 4 3 5
135. The number of positive divisors of the number N = 2  3  5  7 of the form
4m + 1  m is any integer is
(A) 60 (B) 70 (C) 80 (D) None of these
136. A colour box has 3 reds, 2 whites and 7 greens. Then the number of ways can 3 colours be taken from the
box if at least one of them is red is
3 9 3 9 3 9 3 9 3 9 3 9
(A) C1 x C2 + C2 x C1 + C3 x C0 (B) C1 x C2 + C2 x C1 + C3 x C3
3 9 3 9 3 9
(C) C1 x C1 + C2 x C2 + C3 x C0 (D) None of these

137. If r (where r > n) different prizes are to be given to n students. Then the total number of ways it can be done
if each student must get at least one prize is
r r–n r r–n r r+n
(A) Pn (n) (B) Pn (r) (C) Pn (n) (D) None of these

138. The number of ways can a committee of 10 be selected with at least 4 women and 4 men from 9 women
and 8 men if Ms X refuses to work with Mr Y is
(A) 16466 (B) 16464 (C) 1647 (D) None of these

139 from the above problem, Ms X and Mr Y insist to work together is

(A) 10877 (B) 10878 (C) 10647 (D) None of these

140. In an examination, there are 4 papers with a maximum of ‘n’ marks for each paper. Then the number of
ways in which can one get 50 % marks is

(A)
1
3

n  1 2n 2  4n  3  (B)
1
3

 n  1 2n 2  4n  3 
1
(C)
3

 n  1 2n2  4n  3  (D) None of these
10
141. The number of numbers between 1 and 10 containing digit 1 is
10 10 10 10 10 10
(A) 10  9 (B) 10  9 + 1. (C) 10  9  1. (D) None of these

142. 5 different lecturers are to be deliver in five periods of a class on a particular day. A, B and C are three of
the lecturers. then the number of ways in which a routine for the day can be made such that A delivers his
lecture before B and B before C is
(A) 30 (B) 20 (C) 10 (D) None of these.

143. 6 different letters of an alphabet are given. Words with 4 letters are formed with these letters. Then the
number of words which have at least one letter repeated is
(A) 993 (B) 936 (C) 946 (D) None of these.

144 A train going from New Delhi to Bombay stops at 7 intermediate stations. Five persons enter the train during
the journey with five different tickets of the same class. Then the number of different sets of tickets they
could have
(A) 30 (B) 28 (C) 40 (D) None of these

145. In How many shortest ways can we reach from the point (0,0,0) to point (3,7,11) in space where the
movement is possible only along the x-axis, y-axis and z-axis or parallel to them and change of axes is
permitted only at integral points. (An integral point is one which has its co-ordinate as integers)

146. A dictionary is to be composed which will contain only those words, which are made of the letters of the
word “HOCKEY”. If all the words are six-lettered words and repetition is not allowed what would be the
rank of the word “HOCKEY” in such a dictionary.

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

147. The number of 5 letter words that can be formed using letters of words CORPORATION is
(A) 11530 (B) 12530 (C) 13530 (d) None of these
86
148. The last six digits of the number (1749) is
(A) 537009 (B) 537007 (C) 537003 (D) None of these

149 Between two junction stations there are 12 intermediate stations. Then the number of ways can a train be
made to stop at 4 of these if no two of these halting stations consecutive is
(A) 127 (B) 126 (C) 125 (D) None of these

150 There are p intermediate stations on a railway line form Delhi to Amritsar. In how many way can a super-
fast train stop at three of these intermediate stations if no two of them are to be consecutive?

151 The number of ways can 25 identical things be distributed among five persons if each gets odd number
of things is
14 14 14 10
(A) C4 (B) C10 (C) C1 (D) C4

152 The number of ways can 25 identical things be distributed among five persons if each gets at least one
thing but not more than eleven.
24 13 24 13 24 13
(A) C4 – 5. C4 (B) C4 – 11. C4 (C) 3. C4 – 5. C4 (D) None of these 152 A
5 6 4 3
153. Let n = 2 . 3 .5 .7 . Find the number of divisors of ‘n’ of the form 4 + 1, where  N.

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

KEY & SOLUTIONS

101 C
2
We have 45 = 3  5, So two 3’s can be assigned to two out of three places in 6 ways. Similarly one 5 can
be assigned to one out of three places in 3 ways.
Hence the number of solutions is 6  3 = 18.
102 B
Let the number of green balls be x, then the Red Blue Green
number of red balls is 2x. Let the number of blue 0 10 0
balls be y, then x + 2x + y = 10. 2 7 1
 3x + y = 10  y = 10  3x 4 4 2
Clearly x can take values 0, 1, 2, 3, the 6 1 3
corresponding values of y are 10, 7, 4 and 1 Total = 4 ways
Thus the possibilities are as follows
Hence total number of required ways = 4.
103 A
There is 100 + 1 = 101 choices for each of physics, chemistry and maths books. So the total number of
3
choices = (101)
this includes one choice in which we do not select any book.
3
Hence, the required number of ways is = (101)  1
= 1030300.
104 A
m
The total number of factors of (xy) z ……… is equal to the number of ways of selecting any number of x’s
out of midentical x’s and similarly out of m identical y’s and remaining (m + 1) distinct quantities.
m+1 2 m+1
Hence, the required number of factors = (m + 1) (m + 1). 2 = (m + 1) . 2 .
105 C
m(m  1)
 n  m (m  1) = 2n … (1)
2
m(m  1)
Now, 1 n 1
2
2
 m  m  2 = 2 (n  1)
 (m  2) (m + 1) = 2 (n  1) … (2)
m+1(m  2)(m  1)(m)(m  1)
Now, C4 =
24
2n  2(n  1)
= (From (1) and (2))
24
1 n
=  C2 .
3
106 A
Required number of ways = number of selecting 2 objects out of n objects  number of ways in which they
are always next to each other
n n1
= C2  (n  1) = C2.
107 A
If balls of each colour are marked then required number of ways
= Number of arrangements of 20 white and 20 black balls alternatively
2
= 20!  20!  2! = 2 (20!) .
108 A
If balls of each colour are identical then arrangements will start from white ball or black ball as
WBWB ……… or BWBW ……….
Hence required number of ways = 2.
109 A
Let x1, x2 and x3 are the marks obtained in each paper
 x1 + x2 + x3 = 2m
and m  x1, x2, x3  0
m 3
 Required number of ways = Coefficient of 2m in (1 + x + ……… x )
2m m+1 3 3
= coefficient of x in (1  x ) (1  x)
………) (1  x)3
2m m+1 2m+2
= coefficient of x in (1  3x + 3x
3+2m1 3+m11
= C2m  3  Cm1
2m+2 m+1
= C2  3. C2
FIITJEE (Hyderabad Classes) Limited.
 Exponent Sheet
FIITJEE Permutation & Combinations

(2m  2)(2m  1) 3  (m  1)m

= 
2! 2!
(m  1)(m  2)
= .
2
110 A
p p p p 2 p r p p
Since (1 + x) = C0 + C1. x + C2x + ……… + Crx + ………+ Cpx … (1)
q q q q 2 q r q q
and (1 + x) = C0 + C1x + C2x + ……… Crx + ………+ Cqx … (2)
p p q p q q r p q
 Cr + Cr1 C1 + Cr2 C2 + ……… + Cr = coefficient of x in (1 + x)  (1 + x)
r p+q p+q
= coefficient of x in (1 + x) = Cr.
111 A
9
The number of numbers with 0 in the middle = P4
(Since the other four places can be filled by 1, 2, 3, 4, 5, 6, 7, 8, 9
8
Similarly number of numbers with 1 in the middle = P4
9
9 8
Hence total number of required numbers = P4 + P4 + ……… + P4 =
4
r 4
r
P4 .

112 C
0 can’t go in the hundred’s place. In other 2 places any digits can
go. 9 10 2
After filling the firs two places, last place can be filled by 0 or 5, 1
or 6, 2 or 7, 3 or 8, 4 or 9 depending upon whether the sum of first
two digits filled is of the form 5m, 5m + 4, 5m + 3, 5m + 2 or 5m +
1 respectively
Hence the required number of numbers = 9  10  2 = 180.
113 B
Let A gets x items
 B gets (x + 2) items and C gets (x + 3) items
 3x + 5 = 20  x = 5
So, A will get 5 B will get 7 and C will get 8 items.
 Problem is equivalent to distribute 20 items into groups of 5, 7 and 8.
20!
Hence required number of ways =  3! .
5! 7! 8!
114 C
The number will have two pairs and 2 different digits.
4 2
The number of selections = C2  C2 and for each selection,
6!
numbers of arrangements = . Therefore the required number of numbers
2! 2!
4 2 6!
= C2  C2  . = 1080.
2! 2!
115 B
(The number of ways of dividing in 6 equal groups)  6!
= the number of ways to distribute equally among 6 persons.
k
 the number of ways of dividing in 6 equal groups = .
6!
116. D
3
Required number = 4 –1 = 64 –1 = 63.
117 C
Any selection of four digits from the ten digits 0, 1, 2, 3, . . . , 9 gives one such number. So, the required
10
number of numbers = C4 = 210 .
118. D
Number of all five digits sequences (telephone numbers) is 1010101010=100000
When no digit is repeated, this numbers = 109876
 Required numbers = 100000 –30240 = 69760
119. D
For 1  k  p –1, n + k = p! + k + 1, is clearly divisible by k + 1. Therefore there is no prime number in the
given list.
120. C

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

Any selection of four digits from the ten digits 0, 1, 2, 3, . . . , 9 gives one such number. So, the required
10
number of numbers = C4 = 210 .
121. C
nd
A has 3 elements and B has 4 elements for injective mapping first element of A can go to any of 4 of B, 2
rd
to 3 of B and 3 to 2 of B.
 4.3.2 = 24
122 C
Number of solution of
x1 + x2 + ….+ x6 = 18 0  xi  9, i = 1, 2, …., 6
18 2 9 6
 coefficient of x in (1 + x + x + ….+x )
18 10 -6
coefficient of x in (1 – 6x + …) (1 – x)
18 -6 8 -6
 [Coefficient x in (1 – x) ] – 6[coefficient of x in (1 – x) ]
23 13
C5 − 6. C5 = 25927.
123 A
Number of ways of selecting any numbers of mangoes
5 5 5 5
C0 + C1 + ….+ C5 = 2
Number of ways to select any number of apples
4 4 4 4
C0 + C1 + ….+ C4 = 2
5 4 9
Required number of ways to select 2  2 – 1 = 2 – 1
124 A
Required number of ways
(5 + 1) (4 + 1) – 1 = 29.
125 C
Let the first beggar get x1 coins, the second beggar x2 coins and the third beggar x3 coins.
Further let x1 < x2< x3
 x1 + x2 + x3 = 13 …….(1)
Again; if x1 = p; x2 – x1 = q; and x3 – x2 = r
Equation (1) becomes,
p + q + p + r + q + p = 13  3p + 2q + r = 13
where p  1; q  1; r  1
Number of solutions of (1)
13 3 6 2 4 6 2 3
= coefficient of x in (x + x + …..)(x + x + x + …..) (x + x + x + ……)
7 3 6 2 4 6 2 3
= coefficient of x in (1 + x + x + …..)(1 + x + x + x + …..) (1 + x + x + x + ……)
2 4 6 3 5 7 6 2
i.e. in (1 + x + x + x + x + x + x + x ) (1 + x + x + …….)
= 1 + 1 + 1+ 1+ 1+ 1+ 1+ 1 = 8
Again each solution can be permuted in the three places in 3! ways.
 Required number of ways = 8  3! = 48.

126 A
50
Divisible by 2  2, 4, 6, …., 100. Sum = [2  2 + 49  2] = 2550
2
20
Divisible by 5  5, 10, 15, ………, 100. Sum = [2  5 + 19  5] = 25  21 = 1050.
2
10
Divisible by 10  10, 20, 30, ………, 100. Sum = [2  10 + 9  10] = 550
2
Required sum = 2550 + 1050 – 550 = 3050.
127 B
at least one repeated = total with repetition – no repetition
= 1080 – 300 = 780.
128 A
5
One boy can be selected in C1 ways
10
Four prizes can be selected in C4 ways.
6
Remaining 6 prizes can be given to remaining four boys in 4 ways

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

5 10 6
 Required number of ways = C1  C4  4 ways
129 A
If the five subjects S1, S2, S3, S4, and S5 are to be alloted in six different periods P1, P2, P3, P4, P5, and P6,
then exactly one subject must be alloted twice.
6!
 Number of ways in which 2 S1’s and one each of S2, S3, S4, S5, and S6 can be permuted in 6 places is
2!
= 360
Similarly that for having 2 S2’s or S3’sor S4’s or S5’s
 Required number of ways = 5  360 = 1800
130 B
The integers are
1, 6, 11, ….., 96  5m + 1 type
2, 7, 12,……, 97  5m + 2 type
3, 8, 13, ….., 98  5m + 3 type
4, 9, 14, ….., 99  5m + 4 type
5, 10, 15,…., 100  5m type
We can select in following ways No. of ways
th 20
(i) Both from 20 integers of 5 row C2
20 20
(ii) One from fourth and first row row each C1  C1
nd rd 20 20
(iii) One each from 2 and 3 row C1  C1
20 20 20
 Total ways = C2 + 2 ( C1  C1) = 190 + 800 = 990 .
131 D
Let x1, x2 and x3 be respectively the number of coins of Rs. 1, Rs.2 and Rs. 5. Then required number of
ways is the number of integral solutions of
x1 + x2 +x3 = 5, where 0x1, x2, x3  3. Now number of solutions
5 2 3 3 5 3 2 3
= coefficient of x in (1+x+x +x ) = coefficient of x in (1+x) (1+x )
5 2 3 2 4 6
= coefficient of x in (1+3x+3x +x ) (1+3x +3x +x )= 12
132 A
2 9 2 9 4 2 45
Let (t + t + … + t ) ( 1 + t + t + …….+ t ) = b1t + b2t + … b45t (1)
Here bk, (1  k  45) denotes the number of 5 digit numbers whose sum of digits is k.
The number of required numbers is
b2 + b6 + b10 + … + b42
Putting t = 1 and 1 respectively is (1), we get
4
b1 + b2 + b3 + … b45 = 9  10
b1 + b2  b3 + …  b45 = 0
3
Adding we get b2 + b4 + … + b44 = 45  10 (2)
Now putting t = i in (1) and equating real parts, we get
b2 + b4  b6 + … + b44 = 0
 b2 + b6 + b10 + … + b42 = b4 + b8 + b12 + … + b44 (3)
Form (2) & (3) we get
1 3 2
b2 + b6 + b10 + … + b42 = (45  10 ) = 225  10
2
Thus required number of numbers is 22500
133 A
Let the bags be B1, B2, B3 and B4. Further assume that xi denotes the number of balls taken from bag Bi.
B1 B2 B3 B4
10 R 4B 2G 6B

x1 x2 x3 x4
We have, x1 + x2 + x3 + x4 = 6
6 2 6 4 2 6
(a). x | (1 + x + x + …..x ) (1 + x + …..x ) (1 + x + x ) (1 + x + …..x )
6 7 5 3 7 -4
= x | (1  x ) (1  x ) (1  x ) (1  x ) (1  x)
6 3 5 -4 9 6 4
= x | (1  x  x ) (1  x) = C6 – C3 – C1 = 60
Thus there are 60 ways.
134 B
6 2 3 2 3 2 2 3
x | (x + x + x ) (x + x + x ) (x + x ) (x + x + x )
2 3 2 -4 2 2 -4 5
= x | (1  x ) (1  x ) (1  x) = x | (1  x ) (1  x) = C2 –1 = 9

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

Thus there are 9 ways.

135 A
5 4 3 5
N=2 3 5 7
Since we want a divisor of the form 4m + 1, we should not take any 2 as 4m + 1 is an odd number. Let us
take 1 numbers of 3's; 2 numbers of 5's and 3 number of 7's to get a factor of the form 4m + 1 and let M
be one such factor.
= 4  1 1 .4  1 2 .4  2  1
  3   3
 M = 3 1. 5 2 .7

 Remainder obtained when M is divided by 4 is  1  1   1   1

1 2 3 1 3
which has to be equal
to 1 [  M = 4m + 1]
 Both 1 and 3 should be odd or both should be even.
Case I: Even numbers of 3's; any number of 5's; even number of 7's  Number of numbers = (3  4  3) =
36.
Case II: Odd numbers of 3's; any number of 5's; odd number of 7's  Number of numbers = (2  4  3) =
24.
The starting positive proper divisor of the form 4m + 1  m is any integer is 1 and 1 has been included in
0 0 0
the form of 3  5  7 (case I)
Hence the required number of divisors of the form 4m + 1 is 36 + 24 = 60.
136 A
. We have got 3 reds, 2 whites and 7 greens.
There are 3 ways to take 3 colours from the box.
(1) 1red 2 other
(1) 2red 1 other
(1) 3red 0 other
3
(1) number of ways to choose 1red = C1
9
Number. of ways to choose 2 others = C2
3
(2) No. of ways to choose 2red = C2
9
No. of ways to choose 1 others = C1
3
(3) No. of ways to choose 3red = C3
9
No. of ways to choose 0 others = C0
Hence, the total number of ways we have is
3 9 3 9 3 9
C1 x C2 + C2 x C1 + C3 x C0
137 A
First select n prizes out of r prizes and distribute them among all the students.
r r
Number of ways = Cn . n! = Pn.
Now remaining (r – n) prizes can be given to any student.
For each prize number of ways = n
r–n
Total ways = n
r r–n
Here total number of ways of distribution = Pn (n) .
138 B
The number of committees of 10 with at least 4 women and 4 men.
Possibilities Combinations
9! 8!
4w, 6m
9 8
C4  C6 =  = 3528
4 ! 5! 6 ! 2!
9! 8!
5w, 5m
9 8
C5  C5 =  = 7056
5 ! 4! 5 ! 3!
9! 8!
6w, 4m
9 8
C6  C4 =  = 5880
6 ! 3! 4 ! 4!
 total number of committees of 10 with at least 4 women and 4 men
= 3528 + 7056 + 5880 = 16464.
The number of such committees in which Ms X and Mr Y are present .
139 B
In this case we have to find the number of committees of 8 with at least 3 women & men
from 8 women and 7 men respectively. As above, the number of committees in which Ms X
and Mr Y work together
8 7 8 7 8 7
= C3  C5 + C4  C4 + C4  C3 = 56  21 + 70  35 + 56  35 = 5586.
The number of committees in which Ms X and Mr Y are not together
= 16464 – 5586 = 10878.
FIITJEE (Hyderabad Classes) Limited.
 Exponent Sheet
FIITJEE Permutation & Combinations

140 A
50% of marks = 2n
2n n 4
Number of ways = coefficient of x in (1 + x + …+x )
4
 1  x n1 
Now   4
n+1 4
 1  x  = (1  x ) (1  x)
 
= (1  4x + ….)(1  x)4
n+1
2n 2n+3 n+2
Coefficient of x = C2n  4. Cn1
2n+3 n+2
= C3  4. C3

=
1
3

n  1 2n 2  4n  3 
141 C
10 10
Number of numbers between 1 and 10 = 10  2
10
Number of numbers between 1 and 10 , not containing 1
10
=9 1
10 10
The required number of numbers =(10  2)  (9  1)
10 10
= 10  9  1.
142 B
As the order of A, B, C is not to change, so they are to be treated identical in arrangement, so required
5!
number of ways =  20
3!
143 B
4
Total number of words when repetition is allowed = 6 = 1296
Total number of words having all distinct letters = 6.5.4.3 = 360
 Number of words having at least one letter repeated = 1296  360 = 936.
144 D

Let the intermediate stations between New Delhi to Bombay be S 1, S2, S3, .., S7
        
Delhi Bombay
S1 S2 S3 S4 S5 S6 S7
The person taking the train from the station Si (1  i  7) can get down at any of next (8  i) stations.
7
87
Total number of possible tickets =  8  i  7  6  5  ....1 
i 1 2
 28

The five different tickets must be out of these 28 tickets.

28
Therefore, the required number of ways = C5 = 98280.
21 18
145 C3  C7  1ways
Total no of units to be covered = 3. + 7 + 11= 21
21
A person can choose 3 units in C3 ways
18
A person can choose 7 units in C7 ways
The rest 11 units can be chosen in 1 way
21 18
Total no of ways = C3  C7  1
146 315
. Keeping C fixed in the first place there are 5! words.
Keeping E fixed in the first place there are 5! words
Keeping (H, C) fixed at first there are 4! words
Keeping (H, E) fixed at first there are 4! words
Keeping (H, K) fixed at first there are 4! words
Keeping (H, O, C, E) fixed at first there are 2! Words
Keeping (H, O, C, K) fixed at first there are 2! words out of which “HOCKEY” comes first.
 Rank of the word “HOCKEY” is
5! + 5! + 4! + 4! + 4! + 2! + 1 = 315
147 A
O R P T I N C A
3 2 1 1 1 1 1 1
8
Case I Distinct letters P5 = 6720

FIITJEE (Hyderabad Classes) Limited.

 Exponent Sheet
FIITJEE Permutation & Combinations

2
C 2 . 7 C3 5 !
Case II Two letters same and 3 distinct  2100
2!
1
C1  7 C2  5 !
Case III Three letters same and 2 distinct  420
3!
1.1. 6C1 5 !
Case IV 2 of one kind and 2 of another and 1 distinct  180
2 ! 2!
5!
Case V 3 of one kind 2 of one kind = 10.
3 ! 2!
Total = 6720 + 4200 + 420 + 180 + 10 = 11530.
148 D
86 2 43 43 43
(1749) = [(1749) ] = [3059001] = [3059000 + 1]
Expanding by binomial theorem
43 2 43
= 1 + 3059000 . 43 + C2 (3059000) + …. + (3059000) .
Last six digits are determined by the first two terms of above expansion i.e. 131537001
So last six digits are 537001.

149 B
Out of 12 stations, 4 are halting stations and 8 are non- * * * * * * * * * Halting
halting stations. Since the halting stations are not to be
1 2 3 4 5 6 7 8 Non-Stopping
consecutive therefore these four stations

must be no places marked by * which are 7 in between non-stoping stations two on either side just as in the
gap method. We have to choose 4 stations out of these 9.
(i.e., 7 + 2 or 8 + 1)
9876
9
 C4 =  126 .
1 2  3  4
p –2
150 C3 ways
(p –3) non stopping. There will be (p –3) + 1 = p –2 gaps where three stopping stations could be located.
p –2
 C3 ways.
151 A,B
Let person Pi gets xi number of things such that
x1 + x2 + x3 + x4 + x5 = 25
(i) Let xi = 2i + 1 , where i  0
 2( i + 2 + 3 + 4 + 5 ) + 5 = 25
 1 + 2 + 3 + 4 + 5 = 10.
We have to simply obtain the number of non–negative integral solutions of this equation, which is
equal to;
10 –5
x | (1 – x)
(coefficient of x in (1  x)5)
10
14 14
= C10 = C4 .
152 In this case 1  xi  11
25 2 11 5
Required number of ways is equal to coefficient of x in (x + x + … x )
20 2 10 5
 x | ( 1+ x + x + …. + x )
20 11 5 –5
 x | (1 – x ) (1 – x)
20 11 –5 24 13 24 13
 x |(1 –5x ) ( 1 – x) = C4 – 5. C9 = C4 – 5. C4 .
153 69
5 6 4 3
n = 2 .3 .5 .7
Now 4  + 1 is clearly a odd number  5 .
3  1  4  1  M4    1
1 1

7  2  8  1  M4    1
2 2

Hence to get a divisor of the form 4 +1, powers of 3 and 7 should be either both odd or both
even.
 Total divisors of the form 4 +1 = 5.{ 4.2 + 3.2 } − 1= 69.

FIITJEE (Hyderabad Classes) Limited.