www.crackjee.

xyz

Permutations and
Combinations 7
1. Total number of four digit odd numbers that can 8. How many ways are there to arrange the letters
be formed using 0, 1, 2, 3, 5, 7 (using repetition in the word GARDEN with vowels in
allowed) are [2002] alphabetical order [2004]
(a) 216 (b) 375 (a) 480 (b) 240
(c) 400 (d) 720 (c) 360 (d) 120
2. Number greater than 1000 but less than 4000 is
9. The number of ways of distributing 8 identical
formed using the digits 0, 1, 2, 3, 4 (repetition
balls in 3 distinct boxes so that none of the
allowed). Their number is [2002] boxes is empty is [2004]
(a) 125 (b) 105
(c) 375 (d) 625 (a) 8 (b) 21
C3
3. Five digit number divisible by 3 is formed using
0, 1, 2, 3, 4, 6 and 7 without repetition. Total (c) 38 (d) 5
number of such numbers are [2002] 10. If the letters of the word SACHIN are arranged
(a) 312 (b) 3125 in all possible ways and these words are written
(c) 120 (d) 216 out as in dictionary, then the word SACHIN
4. The sum of integers from 1 to 100 that are appears at serial number [2005]
divisible by 2 or 5 is [2002] (a) 601 (b) 600
(a) 3000 (b) 3050 (c) 603 (d) 602
(c) 3600 (d) 3250
11. At an election, a voter may vote for any number
5. n
If Cr denotes the number of combination of n of candidates, not greater than the number to be
things taken r at a time, then the expression elected. There are 10 candidates and 4 are of be
selected, if a voter votes for at least one
n
Cr +1 + nC r -1 + 2´n Cr equals [2003] candidate, then the number of ways in which he
can vote is [2006]
(a) n +1 (b) n+ 2
Cr +1 Cr (a) 5040 (b) 6210
(c) n+2
Cr +1 (d) n +1
Cr . (c) 385 (d) 1110
6. A student is to answer 10 out of 13 questions 12. The set S = {1, 2, 3, ......., 12} is to be partitioned
in an examination such that he must choose at into three sets A, B, C of equal size.
least 4 from the first five questions. The number Thus A È B È C = S,
of choices available to him is [2003] A Ç B = B Ç C = A Ç C = f. The number of
(a) 346 (b) 140 ways to partition S is [2007]
(c) 196 (d) 280
7. The number of ways in which 6 men and 5 women 12! 12!
(a) (b)
can dine at a round table if no two women are (4!) 3
(4!) 4
to sit together is given by [2003]
(a) 6! × 5! (b) 6 × 5 12! 12!
(c) (d)
(c) 30 (d) 5 × 4 3!(4!) 3
3!(4!) 4
 EBD_7764
www.crackjee.xyz
M-24 Mathematics
13. How many different words can be formed by (c) Statement-1 is true, Statement-2 is false
jumbling the letters in the word MISSISSIPPI in (d) Statement-1 is false, Statement-2 is true
which no two S are adjacent? [2008] 18. There are 10 points in a plane, out of these 6 are
(a) 8. 6C4. 7C4 (b) 6.7. 8C4 collinear. If N is the number of triangles formed
(c) 6. 8. 7C4. (d) 7. 6C4. 8C4 by joining these points. Then : [2011RS]
14. From 6 different novels and 3 different (a) N £ 100
dictionaries,4 novels and 1 dictionary are to be
selected and arranged in a row on a shelf so that (b) 100 < N £ 140
the dictionary is always in the middle. Then the (c) 140 < N £ 190
number of such arrangement is: [2009] (d) N > 190
(a) at least 500 but less than 750
(b) at least 750 but less than 1000
(c) at least 1000
{
19. If X = 4n - 3n - 1 : n Î N and}
(d) less than 500 Y = {9 ( n - 1) : n Î N } , where N is the set of
15. There are two urns. Urn A has 3 distinct red natural numbers, then X È Y is equal to:
balls and urn B has 9 distinct blue balls. From [2014]
each urn two balls are taken out at random and (a) X (b) Y
then transferred to the other. The number of ways (c) N (d) Y – X
in which this can be done is [2010] (c) 8 (d) 64
(a) 36 (b) 66 20. Let A and B be two sets containing four and two
(c) 108 (d) 3 elements respectively. Then the number of
16. Statement-1: The number of ways of distributing subsets of the set A × B, each having at least
10 identical balls in 4 distinct boxes such that no three elements is : [2013, 2015]
box is empty is 9C3 . (a) 275 (b) 510
Statement-2: The number of ways of choosing (c) 219 (d) 256
any 3 places from 9 different places is 9C3. 21. The number of integers greater than 6,000 that
[2011] can be formed, using the digits 3, 5, 6, 7 and 8,
(a) Statement-1 is true, Statement-2 is true; without repetition, is : [2015]
Statement-2 is not a correct explanation for (a) 120 (b) 72
Statement-1. (c) 216 (d) 192
(b) Statement-1 is true, Statement-2 is false.
22. If all the words (with or without meaning) having
(c) Statement-1 is false, Statement-2 is true.
five letters, formed using the letters of the word
(d) Statement-1 is true, Statement-2 is true; SMALL and arranged as in a dictionary; then the
Statement-2 is a correct explanation for position of the word SMALL is : [2016]
Statement-1. (a) 52nd (b) 58th
17. Statement - 1 : For each natural number n, (n + 1)7–1 (c) 46th (d) 59th
is divisible by 7. 23. A man X has 7 friends, 4 of them are ladies
Statement - 2 : For each natural number and 3 are men. His wife Y also has 7 friends, 3
of them are ladies and 4 are men. Assume X
n, n 7 - n is divisible by 7. [2011 RS]
and Y have no common friends. Then the
(a) Statement-1 is true, Statement-2 is true; total number of ways in which X and Y
Statement-2 is a correct explanation for together can throw a party inviting 3 ladies and
Statement-1. 3 men, so that 3 friends of each of X and Y are in
(b) Statement-1 is true, Statement-2 is true; this party, is : [2017]
Statement-2 is NOT a correct explanation (a) 484 (b) 485
for Statement-1 (c) 468 (d) 469
 www.crackjee.xyz
Permutations and Combinations M-25

Answer Key
1 2 3 4 5 6 7 8 9 10 11 12 13
(d) (c) (d) (b) (c) (c) (a) (c) (b) (a) (c) (a) (d)
14 15 16 17 18 19 20 21 22 23
(c) (c) (a) (a) (a) (b) (c) (d) (b) (b)

1. (d) Required number of numbers (i) Selecting 4 out of first five question and
= 5 ´ 6 ´ 6 ´ 4 = 36 ´ 20 = 720. 6 out of remaining question
2. (c) Required number of numbers
= 5C4 ´8 C6 = 140 choices.
= 3 ´ 5 ´ 5 ´ 5 = 375
3. (d) We know that a number is divisible by 3 (ii) Selecting 5 out of first five question and
only when the sum of the digits is divisible 5 out of remaining 8 questions
by 3. The given digits are 0, 1, 2, 3, 4, 5. = 5C5 ´8 C5 = 56 choices.
Here the possible number of combinations
Therefore, total number of choices
of 5 digitsout of 6 are5C4 = 5, which are as
=140 + 56 = 196.
follows–
7. (a) No. of ways in which 6 men can be arranged
1 + 2 + 3 + 4 + 5 = 15 = 3 × 5
at a round table = (6 - 1)! = 5!
0 + 2 + 3 + 4 + 5 = 14 (not divisible by 3)
0 + 1 + 3 + 4 + 5 = 13 (not divisible by 3) Now women can be arranged in 6 P5
0 + 1 + 2 + 4 + 5 = 12 = 3 × 4 = 6! Ways.
0 + 1 + 2 + 3 + 5 = 11 (not divisible by 3) Total Number of ways = 6! × 5!
0 + 1 + 2 + 3 + 4 = 10 ( not divisible by 3)
8. (c) Total number of arrangements of letters in
Thus the number should contain the digits
the word GARDEN = 6 ! = 720 there are
1, 2, 3, 4, 5 or the digits 0, 1, 2, 4, 5. two vowels A and E, in half of the
Taking 1, 2, 3, 4, 5, the 5 digit numbers are
arrangements A preceeds E and other half
= 5! = 120 A follows E.
Taking 0, 1, 2, 4, 5, the 5 digit numbers are So, vowels in alphabetical order in
= 5! – 4! = 96
\ Total number of numbers = 120 + 96 1
´ 720 = 360
= 216 2
4. (b) Required sum 9. (b) We know that the number of ways of
= (2 + 4 + 6 + ... + 100) distributing n identical items among r
+ (5 + 10 + 15 + ... + 100) persons, when each one of them receives
– (10 + 20 + ... + 100) at least one item is n -1
Cr -1
= 2550 + 1050 – 530 = 3050.
\ The required number of ways
5. (c) n
Cr +1 + n Cr -1 + 2 n Cr
8 -1 7! 7´ 6
n n n n = C3-1 = 7C2 == = 21
= Cr -1 + Cr + Cr + Cr +1 2!5! 2 ´1
10. (a) Alphabetical order is
= n +1Cr + n +1Cr +1 = n + 2 Cr +1 A, C, H, I, N, S
6. (c) As for given question two cases are No. of words starting with A – 5!
possible. No. of words starting with C – 5!
 EBD_7764
www.crackjee.xyz
M-26 Mathematics
No. of words starting with H – 5!
= 10 -1 C4 -1 = 9 C3
No. of words starting with I – 5!
No. of words starting with N – 5! 17. (a) Statement 2 :
SACHIN – 1 P ( n ) : n 7 - n is divisible by 7
\ sachin appears at serial no 601
Put n = 1, 1 – 1 = 0 is divisible by7, which is true
10 10 10 10
11. (c) C1 + C2 + C3 + C4 Let n = k, P (k) : k7 – k is divisible by 7, true
= 10 + 45 + 120 + 210 = 385 Put n = k + 1
12. (a) Set S = {1, 2, 3, ...... 12} \ P (k + 1) : (k + 1) – ( k + 1) is div. by 7
7

AÈ B È C = S, AÇ B = B ÇC = A ÇC = f P(k + 1) : k7 + 7C1k6 + 7C2k2 +......+ 7C6k

\ The number of ways to partition + 1 – k – 1, is div. by 7.
= 12C4 × 8C4 × 4C4 P(k + 1) : (k7 – k) + (7C1k6 + 7C2k5 +........+
7C k) is div. by 7.
12! 8! 4! 12! 6
= ´ ´ = Since 7 is coprime with 1, 2, 3, 4, 5, 6.
4!8! 4!4! 4!0! (4!)3
13. (d) First let us arrange M, I, I, I, I, P, P So 7 C1 , 7 C 2 , ......7 C 6are all divisible by 7

7! \ P(k + 1) is divisible by 7
Which can be done in ways Hence P(n) : n7 – n is divisible by 7
4!2!
Ö MÖ IÖIÖ IÖIÖ PÖPÖ Statement 1 : n7 - n is divisible by 7
Now 4 S can be kept at any of the ticked
places in 8C4 ways so that no two S are Þ ( n + 1) 7 - ( n + 1) is divisible by 7
adjacent.
Total required ways Þ ( n + 1) 7 - n7 - 1 + ( n7 - n)
7! 8 7! 8 is divisible by 7
= C4 = C4 = 7 ´ 6C4 ´ 8C4
4!2! 4!2! Þ ( n + 1) 7 - n7 - 1 is divisible by 7
14. (c) 4 novels, out of 6 novels and 1 dictionary
Hence both Statements 1 and 2 are correct
out of 3 can be selected in 6 C4 ´3C1 ways and Statement 2 is the correct explanation
Then 4 novels with one dictionary in the of Statement -1.
middle can be arranged in 4! ways. 18. (a) Number of required triangles = 10 C3 -6 C3
\ Total ways of arrangement
10 ´ 9 ´ 8 6 ´ 5 ´ 4
= 6 C4 ´3C1 ´ 4! = 1080 = - = 120 - 20 = 100
6 6
15. (c) Total number of ways = 3 C2 ´ 9C2 19. (b) 4n – 3n – 1 = (1 + 3)n – 3n –1
9´8 = [nC0 + nC1.3 + nC2.32 +......+ nCn3n] – 3n – 1
=3× = 3 ´ 36 = 108 = 9 [nC2 +nC3.3+....+nCn.3n–2]
2
16. (a) The number of ways of distributing 10 \ 4n – 3n – 1 is a multiple of 9 for all n.
identical balls in 4 distinct boxes such that \ X = {x : x is a multiple of 9}
no box empty is same as the number of Also, Y = {9 (n – 1) : n ÎN}
ways of selecting (r – 1) places out of = {All multiples of 9}
(n – 1) different places, that is n -1
Cr -1 . Clearly X Ì Y. \ X È Y = Y
20. (c) Given
Hence require number of ways
n(A) = 2, n(B) = 4, n(A × B) = 8
 www.crackjee.xyz
Permutations and Combinations M-27
Required number of subsets =
8C + 8C +.... + 8C = 28 – 8C – 8C – 8C SMALL ® 58 th word
3 4 8 0 1 2
= 256 – 1 – 8 – 28 = 219
21. (d) Four digits number can be arranged in 3 × 4 ladies 3 ladies
4! ways. 23. (b) X Y
Five digits number can be arranged in 5!
ways. 3 men 4 men
Number of integers = 3 × 4! + 5! = 192. Possible cases for X are
22. (b) ALLMS (1) 3 ladies, 0 man
No. of words starting with (2) 2 ladies, 1 man
(3) 1 lady, 2 men
4!
A: A
_____ = 12 (4) 0 ladies, 3 men
2!
Possible cases for Y are
L : L
_ _ _ _ _ 4! = 24 (1) 0 ladies, 3 men
4! (2) 1 lady, 2 men
M: M
_____ = 12 (3) 2 ladies, 1 man
2!
(4) 3 ladies, 0 man
3! No. of ways = 4C3 . 4C3 + (4C2 . 3C1)2 +
S : S
_A_____ =3
2! (4C1 . 3C2)2 + (3C3)2
: S_ L_ _ _ _ 3! = 6 = 16 + 324 + 144 + 1 = 485