Permutations & Combinations: Some Useful Points
Permutations & Combinations: Some Useful Points
= K c3 . 2k 1 , if n=2k+1,
functions
b) Total number of 1-1 Each one gets,a maximum of one ball n( A) Cn( B) .n( A)! if n( A) n(B)
functions (or)
Permutation of “n” different objects, 0, if n(B) n( A)
Taken from “r” objects.
c) Total number of At least one person gets more than one ball rn r Cn.n! if r n
many-one (or) n
functions Total functions – number of 1-1 functions r , if r n
d) Total number of Each one gets at least one ball rn r c1. r 1 n1 r c2. r 2n2
onto functions (that is no box is empty) r n3
(or) c3. r 3 ....., if r n.
Coefficientof xn( A) in n( A)!.(ex 1)n( B) Or
(or) selection and arrangement of n items from r ! if r n
“r” categories of identical items of unlimited
0 if r n
numbers, selecting atleast one item from each
NISHITH Multimedia India (Pvt.) Ltd.,
category.
e) Total number of Total functions - number of
into functions functions
f) Total number of r ! if r n
bijective(invertible)
functions o if r n
g) Number of All the balls are received by any one person n(B)
constant functions
h) Number of 1
identityfunctions
from f : A A is
cannot enter into them. In how many ways (A) 2 (B) 4 (C) 8 (D) 16
will it be possible to accommodate ten 2 3 3 5
49. Number of divisors of 2 .3 .5 .7 of the form
animals in these ten cages
(A) 66400 (B) 86400 4n + 1, n N is
(C) 96400 (D) 88400 (A) 46 (B) 47 (C) 96 (D) 48
40. Three dice are rolled. The number of 50. The total number of shortest ways on which
possible outcomes in which atleast one die a person can move from the point (1, 2, 3) to
shows 5 is the point (4, 5, 4) in space where the
(A) 215 (B) 36 (C) 125 (D) 91 movement is possible only along the x-axis,
41. The number of positive integers satisfying y-axis and z-axis or parallel to them and
the inequality n + 1 Cn – 2 – n + 1 Cn – 1 100 is change of axes is permitted only at integral
(A) 9 (B) 8 (C) 5 (D) 7 points.
42. The number of ways in which a mixed doubles 7! 7! 7! 7!
(A) (B) 1!6! (C) 2! 2! 3! (D) 3 ! 3 !
1! 2 ! 4 !
tennis game can be arranged from amongst
9 married couple if no husband and wife 51. There are four different boxes A, B, C and
plays in the sam game is D and four different balls , , and . The
number of ways of filling the balls in the
(A) 756 (B) 3024 (C) 1512 (D) 6048 boxes such that each box contains one ball,
ball can not go to the box A and ball
43. An 8 digit number divisible by 9 is to be can not go to the box B, is
formed by using 8 digits out of the digits 0, 1, (A) 44-2 (B) 24 (C) 22 (D) 14
52. Let x1, x2, x3, ... , xk be the all distinct
2, 3, 4 , 5, 6, 7, 8, 9 without replacement. The k
(A) 34 7! (B) 35 7! k
1 93
and
x i 50 , then the value of k is
(C) 36 7! (D) 37 7! i 1
(B) 3 C1 C2 2 2
6 3 3 6 COMPREHENSION QUESTIONS
A B D C B
which are prime to one another. A
E
1 k k
(A) 2k 1 (B) 2k Cr
2 r 0
(C) 2k 1 (D)
C
E
E B C B D
16. The smallest number with 16 divisors is D
D C B E
3
(A)15 sum of the coefficients in 1 x If n persons are arranged in a straight line, there
(B) 27 3 (C) 23 33 (D) 23 31 51 are n! different ways in which this can be done.
When n persons sit round a circular table, each
17. Number of three digit numbers of the form circular arrangement will be equivalent to n
xyz with x > 1 and digits are not repeated, arrangements in a line, so there are (n-1)! different
is arrangements of n persons round a circle.
(A)640 (B)576 (C)800 (D)476 Alternatively, we can regard any one person as
18. Let N denote the greatest number of ‘head’ and place the other (n-1) person in (n-1)!
points in which m straight lines and different ways.
n circles intersect. Then 1. A round robin conference of prime ministers
(A) n / N C2 m of 40 countries, including India and Pakistan
is to be held. The number of ways in which
prime ministers can be seated so that prime
(B) m / N P2
n
ministers of India and Pakistan are never
together, is
(C) N C2 is even
m
(A) 37 ×38! (B) 38 × 38!
(C) 36 × 38! (D) 35 × 38!
(D) N mC2 n P2 is even 2. A round robin conference of prime ministers
of 40 countries is to be held. The number of
19. 1000
C500 is ways in which they can be seated such that
(A)divisible by 7 prime ministers of America and Britain are
(B)divisible by 13 always together and those of Russia and
(C)divisible by 13 but not by 7 India are always together, is
(D)divisible by 7 but not by 13. (A) 2 × 37! (B) 4 × 37!
(C) 2 × 38! (D) 4 × 38!
8 NISHITH Multimedia India (Pvt.) Ltd.,
JEE ADVANCED
JEE MAINS - CW - VOL VOL -- IVI PERMUTATIONS & COMBINATIONS
3. In the above question, if prime ministers of 11. if balls and boxes are all different is
India and Pakistan do not sit together, (A) 50 (B) 100 (C) 125 (D) 150
then number of ways is 12. if balls are identical but boxes are different is
(A) 36 × 36! (B) 72 × 36! (A) 2 (B) 6 (C) 4 (D) 8
(C) 144 × 36! (D) 288 × 36! 13. If balls are different but boxes are identical is
4. A round robin conference of prime ministers (A) 25 (B) 15 (C) 10 (D) 35
of 40 countries is to be held. The number of 14. if balls as well as boxes are identical is
ways in which they can be seated so that (A) 1 (B) 2 (C) 25 (D) 150
prime minister of India neither sits with
Pakistani counterpart nor with Chinese Passage-V
counterpart, is
(A) 111 × 37! (B) 333 × 37! When m equally spaced parallel lines are intersected by n
(C) 666 × 37! (D) 1332 × 37!
equally spaced parallel lines a network of rectangles or
Passage - II
Let x1 x2 x3 x4 x5 x6 be a six digit number find squares is formed. The no.of rectangles must be
the number of such numbers
m n
5. x1 < x2 < x3 < x4 < x5 < x6 is C 2 C 2 . The squares have several dimensions. The
(A) 9C3 (B) 10C3 (C) 10C6 (D) 9C5 smallest square is of dimension, the no.of such squares are
6. x1 < x2 < x3 = x4 < x5 < x6 is
(A)9C3 (B) 9C4 (C) 10C3 (D) 10C4 m 1 n 1 .
7. x1 < x2 < x3 x4 < x5 < x6 is 15. If m<n the dimension of a largest possible
NISHITH Multimedia India (Pvt.) Ltd.,
(A) 9C4 (B) 9C3 (C) 10C4 (D) 10C3 square must be
Passage - III (A) m (B) n (C) m-1 (D) n-1
A coaching institute for IIT has 4 batches. 16. The no. of squares on a chess board must be
Number of boys and girls in each batch is given (A) 64 (B) 204 (C) 285 (D) 244
below 17. Total no.of squares, when m such lines
Batch No. of No. of
Boys Girls (as described in comprehension) are
A 25 14
B 20 15 intersected by n such lines must be (m<n)
C 28 18
m m 1 n n 1
D 35 25 (A) mn (B)
8. In how many ways a prize can be given to 4
one student of batch A 1
(A) 25 (B) 14 (C) 350 (D) 39 (C) n n 1 3m n 1
6
9. In how many ways two disitinct prizes can
be given to two students of different gender 1
(D) m m 1 3n m 1
in batch B 6
(A) 35 (B) 300 (C) 600 (D) 45 Passage-VI
10. In how many ways three disitinct prizes can
be given if atleast one prize is given to a Let A, B, C, D, E be the smallest positive
girl ?
integers having 10, 12, 15, 16, 20 positive
(A) 3 180
C3 108C3 (B) 180
C3 108C3 divisors respectively. Then
(C) 180C3 72C3 (D) 451024
18. A+ B =
Passage - IV
Five balls are to be placed in three boxes. Each A) 108 B) 110 C) 126 D) 130
can hold all the five balls. The no. of ways of 19. C+D =
placing the balls so that no box remains
empty A) 350 B) 354 C) 380 D) 420
NISHITH Multimedia India (Pvt.) Ltd., 9
PERMUTATIONS & COMBINATIONS JEE ADVANCED - VOL - VI
PASSAGE – VIII
20. A+E= Define a function : N N as follows
A) 288 B) 320 C) 350 D) 380 n n 1
Passage-VII : 1 1, P P P 1 if P is
Statement: A family group consisting of two men, prime and n N and
three women and four children have front- mn m n if m & n are
row seats for a broad way show, where they
relatively prime natural numers.
will all sit next to one another in seats 101
through 109. The decision as to who sits in 26. 8n 4 where is equal to
which seats must confirm to the following two A) 4n 2 B) 2n 1
conditions:
C) 2 2n 1 D) 4 2n 1
(i) The four children must sit next to one
27. The number of natural numbers ‘n’
another in four consecutive seats.
such that n is odd is
(ii) The two men must sit next to each other. A) 1 B) 2 C) 3 D) 4
21. If a man is sitting in seat 107 and a woman
is sitting in seat 108, which of the following
28.
n
If 7 2058 where n N then the
NISHITH Multimedia India (Pvt.) Ltd.,
X Y 720
1 k 9. Thus required number =
i 1
pi .
31. Consider exactly three persons between the (1 + x + ... + x7) (1 + x + ... + x8)
brothers. Taken first brother as reference now (1 x 7 ) 1 x 8 1 x 9
second brother can be placed in two ways (left = coefficient of x in10
or right), rest 18 in 18! ways. 1 x 1 x 1 x
Simimarly we have 2 × 18! arrangements for = coefficient of x10 in (1 - x7) (1 - x8) (1 - x9) (1 - x)-3
exactly 4 persons or 5 persons or 6 persons or 7 = coefficient of x10 in (1 - x7 - x8 - x9) (1 - x)-3
persons or 8 persons in between the brothers. = 10+3-1C2 - 3 + 3-1C2 - 2+3-1C2- 1+3-1C2 = 66 - 10 -
For exaxtly 9 persons in between them we have 6 - 3 = 47
only 18! ways 36. Let the number of green balls be x. Then the
These will also include 10 or 11 or 12 ... 15 number of red balls is 2x. Let the number of blue
persons in between the brothers. balls be y. Then, x + 2x + y = 10 3x + y =
So total number of arrangements 10 y = 10 – 3x
= 6 × 2 × 18! + 18! = 13 × 18! Clearly, x can take values 0, 1, 2, 3. The
Alternate corresponding values of y are 10, 7, 4 and 1.
If one of the brothers is made reference point Thus, the possibilities are (0, 10, 0), (2, 7, 1),
then remaining 18 pesons (excluding the second (4, 4, 2) and (6, 1, 3), where (r, b, g) denotes
brother) can be seated in 18! ways. For the the number of red, blue and green balls.
second brother we have only 19-6 = 13 places 37. 15 < x1+ x2 + x3 20
to sit. x1 + x2 + x3 = 16 + r
r = 0, 1, 2, 3 4
Total number of ways = 13 × 18!
Now number of positive integral solutions of
20! x1 + x2 + x3 = 16 + r is
32. N = 20 × 19 × ... × 11 = 15+r
10! C13+r = 15+rC2
Exponent of 2 in 20! = 4
15 r
20 20 20 20 Thus required number of solutions = C2
2 4 8 16
r 0
240 = 24 . 31 51
61. According to question lcm (p, q) = r2t4s2. For lcm,
Required no. of ways = 1 × 2 × 2 = 4.
(p, q) to contain r2 following are the possible powers
56. Using three digits 2, 5 and 7 with repetition each
of r in p and q. (0, 2); (1, 2); (2, 2). Out of these all
position of the number can be filled in 3 ways.
except (2, 2) can be interchanged for p and q.
So the n positions can be filled in 3 3 .... 3
n
(n times) = 3 ways Total no. of ways for p, q to contain different
powers of r are = 2 × 3 - 1 = 5
According to the question 3n 900
Similarly different powers of t that can be given
3n 2 100 34 to p and q are (0, 4), (1, 4), (2, 4) (3, 4), (4, 4)
n>6 out of which except (4, 4) all others can be
Least value of n = 7. interchanged for p and q.
57. X - X - X - X - X. The four digits 3, 3, 5, 5 can Total no. ofways for p, q to contains different
4! powers of t are = 2 × 5 - 1 = 9
be arranged at (-) places in 2! 2! = 6 ways Similarly total no. of ways for p, q to contains
different powers of s are = 2 × 3 - 1 = 5
The five digits 2, 2, 8, 8, 8 can be arranged at
So total no. of ordered pairs = 5 × 9 × 5 = 225.
5! 62. The letters of word COCHIN in alphabetic order
(X) places in 2! 3! = 10 ways are C, C, H, I, N, O
Total number of arrangements Fixing first letter C and keeping C at second
= 6 × 10 = 60 ways. place, rest 4 can be arranged in 4! ways.
58. Let the eight vectors of set V be divided into two Similarly the words starting with CH, CI, CN
groups as follows are 4! in each case
Group Group Then fixing first two letters as CO next four places
when filled in alphabetic order give the word
i jk i j k COCHIN.
i jk i j k therefore rank of the word COCHIN in the
i jk i j k dictionary = 97.
therefore number of words that apperar before
i jk i j k the word COCHIN is 96.
Total no. of non-coplanar vectors chosen from
V
NISHITH Multimedia India (Pvt.) Ltd., 19
PERMUTATIONS & COMBINATIONS JEE ADVANCED - VOL - VI
63. n(A) = number of divisors of 1010. is 121 of arrangements which contains 2T’s
n(B) = number of divisors of 157 is 64 together are 5 C5 5
n(C) = number of divisors of 1811 is 276 Req. arrangements
n( A B ) 8, n( B C ) 8, 6
7 C5 5 5 6 C5 5 57 5 2
n( A C ) 11 and n( A B C ) 1 2
n( A B C ) 435 m n mn
64. Every square has four isosceles right triangles. 71. Cn m 11, n 7
mn
65. Equivalent to no.of onto functions 72. x1 x2 x3 x4 9 x 0
coefficient of
35 3C1 25 3C2 15 150
66. 9x10x10x10x10x2 ways
x9in xx2 .....x9 1xx2 .....x8
3
5 1 1 1 coefficient of x8 in
67. Required C2 .3!1
1! 2! 3! 3
68.. f x 2 x n , f 4 133 , f 5 255
1 x . x8 841 C8 11 C3
12
C3 × 9C3 × 6C3 =
(3!)4 14. Number of onto function = [36 - 3.26 + 3C2 ]
8. 2.6.10.14..... upto n factors = 2n (1.3.5.7 ... = [729 - 192 + 3]
upto n factors) = [732 - 192] = 540
2n (1.2.3.4.5.6.7....) 15. Let the 1st factor be n1 and the IInd factor be
2n! 2n
= n = = Pn = n2 Pi i may belong to n1 or n2.
2 (1.2.3....upto n factors) n!
2n! P11 P2 2 ... Pk k can occur in n1 or n2 in 2k ways.
= (n + 1) (n + 2) ... (2n)
n! 2k
9. The required number of ways = 15C3 – 3. 10C5 + Þ The required number of ways = 2k 1 .
2
3.5C5 (By inclusion & exclusion principle)
16. Possible factorisations are 16 × 1, 8 × 2, 4 × 4 ,
10. Let n = 2m
2 × 2 × 2 × 2, 4 × 2 × 2
a + c = 2b (Even)
corresponding to 4 × 2 × 2 we will get smallest
The required number of ways = mC2 + mC2
natural number = 23 . 31 . 51 = 120
nn 17. Since x > 1, x can taken any value from 2 to 9. So
m(m 1) 1 2 hundredth place can be filled in 8 ways. Now, no.
= 2 = 2 2 =
2 of ways in which tenth place can be filled is 9 and
2
no. of ways in which unit’s place can be filled is 8.
n(n 2) 2 n(n 2) So, total number of numbers = 8 × 9 × 8 = 576.
=
8 4 18. Maximum number of points
Let n = 2m + 1
The required number of ways = mC2 + m+1C2 = N mC2 2mn 2 nC2
m (m 1) (m 1)m m 1000
= (2m )
2 2 2 19. 1000
C500 = 500 2 =76 + 5 = 81
(n 1) 2
= m2 = 1000 1000
4 E13 1000
11. Use onto function concept. = 76+5=81
13 169
12. Let there be x1 lions before the first tiger and x2
lions between the first and second tiger, x3 500 500
E13 500 = 38+2=40
13 169
NISHITH Multimedia India (Pvt.) Ltd., 21
PERMUTATIONS & COMBINATIONS JEE ADVANCED - VOL - VI
1000
Exponent of 13 in C500 81 2 40 1 37! 39 38 2 38 2 38 2
1000
C500 is divisible by 13. 1332 37!
Now, PASSAGE-II
5. x1 < x2 < x3 < x4 < x5 < x6 9C6 ways
1000 1000 1000 6. For x1 < x2 < x3 = x4 < x5 < x6 = 9C4 ways
E7 1000
7 49 343 7. For x1 < x2 < x3 x4 < x5 < x6 = 9C6 + 9C4
=142 + 20 + 2 = 164 = 9C3 + 9C4 = 10C4 [ nCr-1 + nCr = n+1Cr]
500 500 500 PASSAGE-III
E7 500 = 71 + 8. Number of ways = 39C1 = 39
7 49 343 9. Number of ways = 2C1 (20C1 × 15C1) = 600
10 + 1 = 82 10. Number of ways = (3!) (72C1 × 108C2 + 72C2 ×
1000
Exponent of 7 in C500 164 82 2 0 108
C1 + 72C3 × 108C0)
Clearly 1000 C500 is not divisible by 7. = 4510224
Alternate:
3
20. A) 6 C3 .4 C2 .5!.5! 5! Number of ways = (3!) (180C 3 – 108C3) =
4510224
B) 6C1 .9! PASSAGE-IV
C) 6 1 !4! 11. Number of ways (35 – 3.25 + 3) = 150
12. x1 + x2 + x3 = 5
D) 10 P4 x1, x2, x3 1
NISHITH Multimedia India (Pvt.) Ltd.,
rows or one from row 1 and the other from be choosen in any of the above three ways in
row 4 or one from row 2 and other from row 34 ways. So, total number of ways =
3 desired number is 7
C3 34 =2835
2
5 3 C2 2 3 C1 15 18 33 49. Let P & Q have same number of elements
2 n ! 2
(D) Number of ways in which interviews can
n be arranged
(B) C4 (each quadrilateral gives one point
9 8 C 2 6 C 2 4 C 2 2 C 2 22680
of intersection)
(C) x4 x3 x2 x1 x0 ASSERTION-REASON QUESTIONS
10
C5 (5 distinct digits selection)
0 1/3 2/3
1. 40320 = 27 × 32 × 5 × 7 8!
(D) Terms is involving 3 , 3 , 3 3 51 × 52 × 53 × 54 × 55 × 56 × 57 × 58 is
5. AA, SSS , TT , EE , RR, M , B, L divisible by 40320
Statement 2 is correct explanation of statement 1.
A) Take RAAT as one unit. Therefore
2. Case I, all are different S, M, A, L
11! Number of words = 4C3 × 3!
10 + 1 = 11 units can be arranged in ways. Case II, 2 alike, 1 different
3! 2!
B) After fixing S in first position and R in last 3!
Number of words = 3
position the remaining 12 letters can be 2!
arranged in remaining 12 positions in Statement 2 is correct explanation of statement 1.
3. Total number of integral solutions of x1 + x2 + x3 = 10
12! = 10+3–1C2 = 12C2 = 66
4 ways Statement 2 is true and statement 1 is false.
2! 4. 0 cannot appear in first position.With the given
C) First 7 positions can be filled with condition in the question 0 can not appear in any
position. Now three digit can be selected out of
7! 9 remaining digits in 9C3 ways.
A ' s, E ' s, M , B, L in 2! 2 ways. The Crossponding to each we will get three digit
number with condition a < b < c.
remaining 7 positions can be filled with 5. No. of different ways the child can buy six ice–
7! creams is equal to no. of non–negative integral
solution of the equation
S ' s, T ' s, R ' s in 3! 2! 2 ways.
x1 + x2 +x3 + x4 + x5 = 6
NISHITH Multimedia India (Pvt.) Ltd., 25
PERMUTATIONS & COMBINATIONS JEE ADVANCED - VOL - VI
which is equal to 6+5–1C4 = 10C4 6. No. of required triangles of ‘n’ sided polygon is
Now of arranging 6 A’s and 4 B’s in a row =
10! n n 4 n 5 6 6 4 6 5
6!4!
= 10C4 ;n 6 2
6 6
6. The number of quadrilatral having 7. No. of different garlands = no.of ways by which
exactly 3 sides common with the polygon we can put 5 identical balls in 3 different boxes.=5
= n The number of quadrilatrals having [possibilit ies are (5,0,0) , (4,1,0),
exactly one side common with the (3,2,0),(2,2,1),(3,1,1) ]
polygon = n n 4C n 5 .
2 8. Number of positive integral pairs x, y such that
Total number of quadrilatrals = 1 1 1
is the no. of divisors of 2 .
n n n 4C2 n 5 x y n n
statement – 2 is also correct
Now 2007 2 34 2232
INTEGER QUESTIONS 5 3 1 1 7
So req. no is
2
1. x1 x2 x3 x4 x5 2 3 52 7 we can assign 2, 3 since x y is given
or 7 to any of 5 variables. We can assign 52 9. As f(x)=x we get x=1 or 3, again apply
to just one variable in 5 ways or can assign f f x x we get x=3,1,1,1
52 5 5 to two variables in 5c2 ways . then 5 4!
NISHITH Multimedia India (Pvt.) Ltd.,