Title: Permutation & Combination

Chapter: Permutation & Combination

Approximate Time to Complete (to be filled by student): ________________________
Total Marks Scored:
Worksheet Compiled By: Prashant Jain (PJ Sir)

 Attempt the worksheet in one go. See answers in one go at the end.
 All questions carry 4 marks for positive and -1 if you leave and -2 if you attempt
incorrectly.
 All proving or show questions (if done correctly) are of 4 marks. There is no negative
marking.
 If you cheat in worksheet then you are only cheating and such sinners do not get
selection in JEE so for your own sake refrain from cheating.
 Maintain the solutions of this worksheet and share the link of solution pdf in the
tracker if you want to be monitored.

EXERCISE – I
PART - I : ONLY ONE OPTION CORRECT TYPE
1. A train is going from London to Cambridge stops at 12 intermediate stations. 75 persons enter the train
after London with 75 different tickets of the same class. Number of different sets of tickets they may be
holding is:
(A) 78C3 (B) 91C75 (C) 84C75 (D) 78C74

2. A family consists of a grandfather, m sons and daughters and 2n grand children. They are to be seated
in a row for dinner. The grand children wish to occupy the n seats at each end and the grandfather refuses
to have a grand children on either side of him. In how many ways can the family be made to sit.
(A) (2n)! m! (m  1) (B) (2n)! m! m (C) (2n)! (m –1)! (m  1) (D) (2n – 1)! m! (m1)

3. A bouquet from 11 different flowers is to be made so that it contains not less than three flowers. Then
then number of different ways of selecting flowers to form the bouquet.
(A) 1972 (B) 1952 (C) 1981 (D) 1947

4. If  = x1 x2 x3 and  = y1 y2 y3 be two three digit numbers, then the number of pairs of  and  that can be
formed so that  can be subtracted from  without borrowing.
(A) 55 . (45)2 (B) 45 . (55)2 (C) 36 . (45)2 (D) 553

5. 'n' digits positive integers formed such that each digit is 1, 2, or 3. How many of these contain all three of
the digits 1, 2 and 3 atleast once?
(A) 3(n –1) (B) 3n – 2.2n + 3 (C) 3n – 3.2n – 3 (D) 3n – 3.2n + 3

6. There are ' n ' straight line in a plane, no two of which are parallel and no three pass through the same
point. Their points of intersection are joined. Then the maximum number of fresh lines thus introduced is
(A) 1 n (n  1)2 (n  3) (B) 1 n (n  1) (n  2) (n  3)
12 8
(C) 1 n (n  1) (n  2) (n  3) (D) 1 n (n  1) (n  2) (n  3)
8 8

7. X = {1, 2, 3, 4, ...... 2017} and A  X ; B  X ; A  B  X here P  Q denotes that P is subset of Q(P 

Q). Then number of ways of selecting unordered pair of sets A and B such that A  B  X.
(42017  32017 )  (22017  1) (42017  32017 )
(A) (B)
2 2
2017 2017 2017
4 3 2
(C) (D) None of these
2

8. The number of ways in which 15 identical apples & 10 identical oranges can be distributed among three
persons, each receiving none, one or more is:

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
 (A) 5670 (B) 7200 (C) 8976 (D) 7296

9. Two variants of a test paper are distributed among 12 students. Number of ways of seating of the students
in two rows so that the students sitting side by side do not have identical papers & those sitting in the
same column have the same paper is:
12! (12)!
(A) (B) 5 (C) (6!)2. 2 (D) 12! × 2
6! 6! 2 . 6!

10. How many ways are there to invite one of three friends for dinner on 6 successive nights such that no
friend is invited more than three times ?

6  6! 6! 6! 6  6! 6! 6!
(A) + 3 + (B) + 6 +
1!2!3! 3!3! 2!2!2! 1!2!3! 3!3! 2!2!2!

6  6! 6! 6! 3  6! 6! 6!
(C) + + (D) + 3 +
1!2!3! 3!3! 2!2!2! 1!2!3! 3!3! 2!2!2!

11. If n identical dice are rolled, then number of possible out comes are.
6n
(A) 6n (B) (C) (n  5) c 5 (D) None of these
n!

12. Number of ways in which a pack of 52 playing cards be distributed equally among four players so that
each have the Ace, King, Queen and Jack of the same suit, is
36 ! . 4 ! 36 ! 52 ! . 4 ! 52 !
(A) (B) (C) (D)
 9 ! 4
 9 ! 4
13 ! 4
13 !4
13. Find total number of positive integral solutions of 15 < x1 + x2 + x3  20.
(A) 685 (B) 1140 (C) 455 (D) 1595

14. Seven person P1, P2, ........., P7 initially seated at chairs C1, C2 ........ ,C7 respectively. They all left their
chairs symultaneously for hand wash. Now in how many ways they can again take seats such that no
one sits on his own seat and P1 sits on C2 and P2 sits on C3 ?
(A) 52 (B) 53 (C) 54 (D) 55

15. Given six line segments of length 2, 3, 4, 5, 6, 7 units, the number of triangles that can be formed by
these segments is
(A) 6C3 – 7 (B) 6C3 – 6 (C) 6C3 – 5 (D) 6C3 – 4

16. There are m apples and n oranges to be placed in a line such that the two extreme fruits being both
oranges. Let P denotes the number of arrangements if the fruits of the same species are different and Q
the corresponding figure when the fruits of the same species are alike, then the ratio P/Q has the value
equal to :
(A) nP2. mPm. (n  2) ! (B) mP2. nPn. (n  2) ! (C) nP2. nPn. (m  2) ! (D) none

17. The number of intersection points of diagonals of 2009 sides regular polygon, which lie inside the polygon.
(A) 2009C4 (B) 2009C2 (C) 2008C4 (D) 2008C2

18. A rectangle with sides 2m – 1 and 2n – 1 is divided into squares of unit length by drawing parallel lines
as shown in the diagram, then the number of rectangles possible with odd side lengths is

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
 (A) (m + n – 1)2 (B) 4m+n–1 (C) m2 n2 (D) m(m + 1)n(n + 1)

m
19. Find the number of all rational number such that
n

m
(i) 0 < < 1, (ii) m and n are relatively prime (iii) m n = 25!
n
(A) 256 (B) 128 (C) 512 (D) None of these

PART - II : SINGLE AND DOUBLE VALUE INTEGER TYPE

1. Number of five digits numbers divisible by 3 that can be formed using the digits 0, 1, 2, 3, 4, 7 and 8 if,
N
each digit is to be used atmost one is N then   is equal to
8

2. The sides AB, BC & CA of a triangle ABC have 3, 4 & 5 interior points respectively on them. If the number
k 
of triangles that can be constructed using these interior points as vertices is k, then   is equal to
5

3. Shubham has to make a telephone call to his friend Nisheeth, Unfortunately he does not remember the
7 digit phone number. But he remembers that the first three digits are 635 or 674, the number is odd and
there is exactly one 9 in the number. The maximum number of trials that Shubham has to make to be
successful is N then (N–3400) is equal to

4. Seven different coins are to be divided amongst three persons. If no two of the persons receive the same
number of coins but each receives atleast one coin & none is left over, then the number of ways in which
 k 
the division may be made is k, then   is equal to.
 10 

5. Number of ways in which five vowels of English alphabets and ten decimal digits can be placed
in a row such that between any two vowels odd number of digits are placed and both end
places are occupied by vowels is 20(b!)(5!) then b equals to

6. The number of integers which lie between 1 and 106 and which have the sum of the digits equal to 12 is
N then (N–6000) is equal to

7. The number of ways in which 8 non-identical apples can be distributed among 3 boys such that every
 N 
boy should get atleast 1 apple & atmost 4 apples is N then   is equal to
 60 

8. In a hockey series between team X and Y, they decide to play till a team wins ‘10’ match. Then the
20
Cm
number of ways in which team X wins is then m is equal to
2

9. Three ladies have brought one chlid each for admission to a school. The principal wants to
interview the six persons one by one subject to the condition that no mother is interviewed
before her chlid. Then find the number of ways in which interviews can be arranged

10. In a shooting competition a man can score 0, 2 or 4 points for each shot. Then the number of different
ways in which he can score 14 points in 5 shots is

11. Six persons A, B, C, D, E and F are to be seated at a circular table. The number of ways this can be done
if A must have either B or C on his right and B must have either C or D on his right is

12. The number of permutations which can be formed out of the letters of the word "SERIES" taking three
letters together is

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
13. A box contains 6 balls which may be all of different colours or three each of two colours or two each of
three different colours. The number of ways of selecting 3 balls from the box (if ball of same colour are
identical) is

14. Five friends F1, F2, F3, F4, F5 book five seats C1, C2 , C3 ,C4 , C5 respectively of movie KABIL independently
(i.e. F1 books C1, F2 books C2 and so on). In how many different ways can they sit on these seats if no
one wants to sit on his booked seat, more over F1 and F2 want to sit adjacent to each other.

15. The number of ways in which 5 X's can be placed in the squares of the figure so that no row remains
empty is:
C

 N 
16. Sum of all the numbers that can be formed using all the digits 2, 3, 3, 4, 4, 4, is N then   is
 1111110 
equal to

17. Six married couple are sitting in a room. Number of ways in which 4 people can be selected so that there
is exactly one married couple among the four is N then (N–225) is equal to

18. Let Pn denotes the number of ways of selecting 3 people out of ' n ' sitting in a row, if no two of them are
consecutive and Qn is the corresponding figure when they are in a circle. If Pn  Qn = 6, then ' n ' is equal
to:

19. The number of ways selecting 8 books from a library which has 10 books each of Mathematics, Physics,
Chemistry and English, if books of the same subject are alike, is (N 2 – 4) then N is equal to

20. The number of three digit numbers of the form xyz such that x < y and z  y is N then (N–225) is equal to

PART - III : ONE OR MORE THAN ONE OPTIONS CORRECT TYPE

1. In an examination, a candidate is required to pass in all the four subjects he is studying. The number of
ways in which he can fail is
(A) 4P1 + 4P2 + 4P3 + 4P4 (B) 44 – 1
(C) 2 – 1
4
(D) 4C1 + 4C2 + 4C3 + 4C4

2. The kindergarten teacher has 25 kids in her class. She takes 5 of them at a time, to zoological garden as
often as she can, without taking the same 5 kids more than once. Then the number of visits, the teacher
makes to the garden exceeds that of a kid by:
(A) 25C5  24C4 (B) 24C5 (C) 25C5  24C5 (D) 24C4

3. A student has to answer 10 out of 13 questions in an examination. The number of ways in which he can
answer if he must answer atleast 3 of the first five questions is:
(A) 276 (B) 267
(C) 13C10 – 5C3 (D) 5C3 . 8C7 + 5C4 . 8C6 + 8C5

4. Number of ways in which 3 different numbers in A.P. can be selected from 1, 2, 3,...... n is:
(n  2)(n  4) n2  4n  5
(A) if n is even (B) if n is odd
4 2
n  12 n n  2
(C) if n is odd (D) if n is even
4 4

5. 2m white identical coins and 2n red identical coins are arranged in a straight line with (m + n) identical
coins on each side of a central mark. The number of ways of arranging the identical coins , so that the
arrangements are symmetrical with respect to the central mark.

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
 (A) m+nCm (B) m+nCn (C) m+nC|m–n| (D) m+nC|n–m|

6. The number of ways in which 10 students can be divided into three teams, one containing 4 and others
3 each, is
10 ! 10 ! 1
(A) (B) 2100 (C) 10C4 . 5C3 (D) .
4 ! 3 ! 3 ! 6 ! 3 ! 3 ! 2

7. If all the letters of the word 'AGAIN' are arranged in all possible ways & put in dictionary order, then
(A) The 50th word is NAAIG (B) The 49th word is NAAGI
(C) The 51 word is NAGAI
st
(D) The 47th word is INAGA

8. You are given 8 balls of different colour (black, white,...). The number of ways in which these balls can
be arranged in a row so that the two balls of particular colour (say red & white) may never come together
is:
(A) 8 !  2.7 ! (B) 6. 7 ! (C) 2. 6 !. 7C2 (D) none

9. Consider the word 'MULTIPLE' then in how many other ways can the letters of the word 'MULTIPLE' be
arranged ;
(A) without changing the order of the vowels equals 3359
(B) keeping the position of each vowel fixed equals 59
(C) without changing the relative order/position of vowels & consonants is 359
(D) using all the letters equals 47! – 1

10. The number of ways of arranging the letters AAAAA, BBB, CCC, D, EE & F in a row if the letter C are
separated from one another is:
12! 13! 14! 13!
(A) 13C3. (B) (C) (D) 11.
5! 3! 2! 5 ! 3! 3 ! 2 ! 3 ! 3! 2 ! 6!

11. The number of non-negative integral solutions of x1 + x2 + x3 + x4  n (where n is a positive integer) is

(A) n+3C3 (B) n+4C4 (C) n+5C5 (D) n+4Cn

12. There are 10 seats in the first row of a theatre of which 4 are to be occupied. The number of ways of
arranging 4 persons so that no two persons sit side by side is:
(A) 7C4 (B) 4. 7P3 (C) 7C3. 4 ! (D) 840

13. 50
C36 is divisible by
(A) 19 (B) 52 (C) 192 (D) 53

14. 2n
Pn is equal to
(A) (n + 1) ( n + 2) ..... (2n) (B) 2n [1 . 3 . 5 .....(2n – 1)]
(C) (2) . (6) . (10) .... (4n – 2) (D) n! (2nCn)

15. The number of ways in which 200 different things can be divided into groups of 100 pairs, is:
200 !  101   102   103   200 
(A) 100
(B)    2   2  ....  2 
2  2       
200 !
(C) 100
(D) (1. 3. 5...... 199)
2 (100) !

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
PART - IV : COMPREHENSION
Comprehension # 1
There are 8 official and 4 non-official members, out of these 12 members a committee of 5 members is
to be formed, then answer the following questions.
1. Number of committees consisting of at least two non-official members, are
(A) 456 (B) 546 (C) 654 (D) 466

2. Number of committees in which a particular official member is never included, are

(A) 264 (B) 642 (C) 266 (D) 462

Comprehenssion # 2
Let n be the number of ways in which the letters of the word "RESONANCE" can be arranged so that
vowels appear at the even places and m be the number of ways in which "RESONANCE" can be arrange
so that letters R, S, O, A, appear in the order same as in the word RESONANCE, then answer the
following questions.
3. The value of n is
(A) 360 (B) 720 (C) 240 (D) 840

4. The value of m is
(A) 3780 (B) 3870 (C) 3670 (D) 3760

Comprehension # 3
A mega pizza is to be sliced n times, and Sn denotes maximum possible number of pieces.
5. Relation between Sn & Sn– 1
(A) Sn = Sn–1 + n + 3 (B) Sn = Sn–1 + n + 2 (C) Sn = Sn–1 + n + 2 (D) Sn = Sn–1 + n

6. If the mega pizza is to be distributed among 60 person, each one of them get atleast one piece then
minimum number of ways of slicing the mega pizza is :
(A) 10 (B) 9 (C) 8 (D) 11

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
 ANSWER KEY
PART - I : ONLY ONE OPTION CORRECT TYPE
1. (A) 2. (A) 3. (C) 4. (B) 5. (D)
6. (C) 7. (A) 8. (C) 9. (D) 10. (A)
11. (C) 12. (A) 13. (A) 14. (B) 15. (A)
16. (A) 17. (A) 18. (C) 19. (A)

PART - II : SINGLE AND DOUBLE VALUE INTEGER TYPE

1. 93 2. 41 3. 2 4. 63 5. 10
6. 62 7. 77 8. 10 9. 90 10. 30
11. 18 12. 42 13. 31 14. 21 15. 98
16. 20 17. 15 18. 10 19. 13 20. 51

PART - III : ONE OR MORE THAN ONE OPTIONS CORRECT TYPE

1. (C), (D) 2. (A), (B) 3. (A), (C), (D) 4. (C), (D) 5. (A), (B)
6. (B), (C) 7. (A), (B), (C), (D) 8. (A), (B), (C) 9. (A), (B), (C), (D) 10. (A), (D)
11. (B), (D) 12. (B), (C), (D) 13. (A), (B) 14. (A), (B), (C), (D)
15. (B), (C), (D)

PART - IV : COMPREHENSION
1. (A) 2. (D) 3. (B) 4. (A) 5. (D)
6. (D)

SOLUTION
PART - I : ONLY ONE OPTION CORRECT TYPE
1. Total no. of different tickets is 13 + 12 + 11 + 10 + ......+ 1 = 91
Hence required no. = 91C75 = 91C88

2. First we select n grand children from 2n grand children is 2nCn

Now arrangement of both group is n! × n!
Now Rest all (m + 1) place where we occupy the grandfather and m sons but grandfather refuse the
sit to either side of grand children so the out of m – 1 seat one seat can be selected
Now required number of sitting in 2nCn × n ! × n ! × (m –1)C1 . m !
12n
= × n ! × n ! × (m –1)C1 . m ! = 2n ! . m ! . (m –1)
n! n!

3. 11
C3 + 11C4 + ....... + 11C11 = 211 – 11C0 – 11C1 – 11C2 = 1981

4. – 
= y1 y2 y3
– x1 x2 x3
__________
Number of pairs = (10 + 9 + 8 + + 1)2 . (9 + 8 + + 1) = (55)2 .45

5. Total n-digit numbers using 1, 2 or 3 = 3n

total n-digit numbers using any two digits out of 1, 2 or 3 = 3C2 × 2n – 6 = 3 × 2n – 6
total n-digit numbers using only one digit of 1, 2 or 3 = 3
 the numbers containing all three of the digits
1, 2 and 3 at least once = 3n – (3 × 2n – 6) – 3 = 3n – 3 . 2 n + 3
= 3n – 3 . 2n + 3

6. If 'n' straight line intersect each other then total

n(n  1)
number of intersection point is nC2 =
2

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
 n(n 1)
Now, from these nC2 points we can make 2 C
2
n1
lines. (total old + new lines) and number of old lines are C2 × n
n(n 1)
So fresh lines are 2 C
2 – n 1
C2 × n = 1 n (n  1) (n  2) (n  3)
8

7. Ordered pair = total – (A  B = X) = 4n – 3n

Subsets of X = 2n will not repeat in both but here the whole set X has not been taken
So subsets of x which are not repeated (2n – 1)
(4n  3n )  (2n  1)
Hence unordered pair = + (2n – 1)
2

8. Using multinomial theorem

17  16 12  11
Total no. of ways = 15 + 3 – 1C15 × 10 + 3 – 1C10 = 17
C15 × 12C10 =  = 8976
2 2

9. = total number of required possible is

12C 12!
6 × 6 ! × 6! × 2! = × 6 ! × 6 ! × 2! = 2 × 12!
6! 6!

10. Let friend 1 invites 'a' times, friend 2 invites 'b' times, friend 3 invites 'c' times

then unordered (a, b, c) can be (1, 2, 3), (0, 3, 3), (2, 2, 2)

6  6! 6! 6!
 total number of ways equal to + 3 +
1!2!3! 3!3! 2!2!2!

11. Let i appears on ai dice i = 1, 2, 3, 4, 5, 6

so no. of out comes is equal to no. of solution of a1 + a2 + a3 + a4 + a5 + a6 = n = (n  5) c 5

36!
12. Required number of ways 36C9 . 27C9 . 18C9 . 9C9 . 4 ! = ×4!
(9!)4

13. x1 + x2 + x3 = 20 – t
t = 0, 1, 2, 3, 4
4
Required value = 
t 0
19–t
C2 = 20C3 – 15C3 = 1140 – 455 = 685

14. If P3 sits on C1
 1 1 1 1
4!  1–  –  
 1! 2! 3! 4! 
= 4.3 – 4 +1 = 9
If P3 does not sit on C1
 1 1 1 1 1
= 5!  1–  –  –  = 44
 1! 2! 3! 4! 5! 
total number of ways = 44 + 9 = 53

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
  P1 C1
P C2  P1
 2
P3 C3  P2

P4 C4
P C5
 5
P6 C6

P7 C7

15. First we select 3 length from the given 6 length so the no. of ways = 6c3
But these some pair i.e. (2, 3, 7), (2, 3, 6), (2, 3, 5) (2, 4, 6), (2, 4, 7), (2, 5, 7), (3, 4, 7) are not form a
triangle so that total no. of ways is
6
C3 – 7 ways

16. For P  If same species are different

Total number of arragements is nP2 . (m + n – 2) !
(m  n  2)!
For Q  If same species are alike then number of arrangement is
m! .(n  2)!
P n
Hence = P2 . m! . (n – 2)! = nP2 . mPm . (n – 2)!
Q

17. We know that in odd sides polygon no two or more then two diagonals are parallel, so if we take any 4
vertices, we get one point of intersection of diagonals,
Hence required no of points will be 2009C4.

18.

No. of ways of choosing horizontal side of rectangle of one unit length = 2m – 1

No. of ways of choosing horizontal side of rectangle of 3 unit length = 2m – 3
Total no. of ways of choosing horizontal side of rectangle of odd length= (2m–1)+ (2m–3)+... +1 = m 2
similarly no. of ways of choosing the vertical side of rectangle of odd length = n2.
 Total no. of ways of choosing the rectangle = n2 m2

19. m, n both product of element of one of the subset of {2 22, 310, 56, 73, 112, 13, 17, 19, 23} such that

mn = 25! number of ways of selecting 'm' is 29 ways (here n is automatically fixed according to m)

29
 Total number of required ways = = 256
2

m m
{because in half of the ways > 1 and in half of the ways 0 < <1}
n n

PART - II : SINGLE AND DOUBLE VALUE INTEGER TYPE

1. Number divisible by 3 if sum of digits divisible
case-I If 1 + 2 + 3 + 4 + 8 = 18 Number of ways = 120
case-II If 1 + 2 + 3 + 7 + 8 = 21 Number of ways = 120
case-III If 2 + 3 + 4 + 7 + 8 = 24 Number of ways = 120
case-IV If 1 + 2 + 0 + 4 + 8 = 15 Number of ways = 96
case-V If 1 + 2 + 0 + 7 + 8 = 18 Number of ways = 96
For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
 case-VI If 2 + 0 + 4 + 7 + 8 = 21 Number of ways = 96
case-VII If 0 + 1 + 3 + 4 + 7 = 15 Number of ways = 96
___________________
total number 744

2. Total number of triangle = Two points taken from AB and one point either BC or CA + similarly BC +
similarly A + one point each sides.
= 3C2 [4C1 + 5C1] + 4C2 [5C1 + 3C1] + 5C2 [3C1 + 4C1] + 3C14C15C1 = 205
Total – (collinear points used)
= 12C3 – (3C3 + 4C3 + 5C3) = 220 – 15 = 205

Alternate
Total – Collinear points used = 12C – (3C3 + 4C3 + 5C3) = 220 – 15 = 205
3

3. Let the number starts with 635 then two cases arise
Case-1 If 9 occurs at units place then the number of numbers = 9 × 9 × 9 = 729
Case-2 If 9 does not come at units place then number of ways for 9 to occur at either of the rest three
places = 3C1 = 3
the number of numbers = 3 × 9 × 9 × 4 = 972
total numbers starting with 635 = 729 + 972 = 1701
Similarly total number starting with 674 = 1701
Maximum number of trials = 1701 × 2 = 3402

4. Coin dividing in any are possible i.e.

1, 2, 4
so the number of ways is
7C . 6C . 4C . 3! = 7 × 15 × 6 = 630
1 2 4

5. Ten digits can be partitioned into four parts as

1+1+3+5; 1+1+1+7;1+3+3+3 (each partitioning has odd number of digits)
The number of ways in which these can be placed in the four spaces =
4! 4! 4!
+ + = 20 ways
2! 3! 3!
also numbers of arrangements of vowels = 5 !
Number of arrangements of digits = 10 !
total ways = 20 (10 !) (5 !)

6. Let number be x1 x2 x3 x4 x5 x6
But Here x1 + x2 + .... x6 = 12
so coefficient of x12 in expansion (1 + x + x2 + .... + x9)6 = (1 – x10)6 . (1 – x)–6
 17C 6 7
12 – C1 . C2 = 6188 – 126 = 6062

7. 8 - non identical
number of ways = B1 B2 B3
1 3 4
2 3 3
2 2 4
8
C2 .6 C3 .3 C3 8 C2 .6 C2 .4 C 4
Here required number of ways = 3! {8C1. 7C3 .4C4 + + }
2 ! 2 !
 8! 8! 6! 8! 6! 
=6       = 6[280 + 280 + 210] = 6 × 770 = 4620
 3!.4! 2!.6! 3!.2!.2! 2!.6! 2!.4!.2! 

8. Let team X wins 'm' matches, if it wins (m + r)th match and wins m – 1 match from the first m + r – 1
matchs ,

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
 m 20
Cm
so total no. of ways = 
r 0
m  r 1
C m 1 =
2
hence m = 10

9. Each lady and her child can be arranged in a fixed order only.
6 !
 The total no. of ways in which interview can be held = = 90
2 ! 2 ! 2 !

10. Find the coefficient of x14 in the expansion of

5
 1  x6 
(x + x + x ) = (1 + x + x ) = 
0 2 4 5 2 4 5
 = (1 – x6)5 (1 – x2)–5
 1  x2
 
= (1 – 5x6 + 10x12............) 1  5
C1x 2  6
C2 x 4  7

C3 x 6  ........ = C7 – 5 . 8C4 + 10.5
11

11 10  9  8 8765
=  5. + 50 = 330 – 350 + 50 = 30
1 2  3  4 1 2  3  4

11. Case- If B is right on A Subcase - C is right on B

then no. of ways = (4 –1)! = 6 Subcase-  If D is right on B then no. of ways = (4 –1)! = 6
Case- If C is right on A  D must be right on B = (4 – 1)! = 3! = 6
Hence total no. of ways is 6 + 6 + 6 = 18

12. SERIES
S - 2, E - 2 , R, 
case-I when all letter distinct is
4C × 3! = 4 × 6 = 24
3
case-II when 2 letters are same the
2C . 3C × 3! = 2 . 3 . 3 = 18
1 1
2!
total number is 24 + 18 = 42

13. Case -I If all are different then no. of ways is = 6

C3 = 20
Case-II If three each of two colours, then combination is
3 0  2!
2 1 2! = 2! + 2! = 4 ways

Case-III If two each of three colours, then

combination is
2 1 0  3!
1 1 1  1! = 3! + 1! = 7ways

Hence required no.is = 20 + 7 + 4 = 31

 F1 F2 F3 F4 F5
14. 
C1 C2 C3 C4 C5
 1 1 1
 – F1 F2 – –  1  3!  1–  –   1  2  3
  1! 2! 3! 

F2 F1 – – –  1 1 1
 3!  1–  –   2

 1! 2! 3! 
– – F1 F2 –  2.2!  4
– – – F1 F2  2.2!  4

– – F2 F1 –  2.2!  4
For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
 – – – F2 F1  2.2!  4
Total number of ways = 3 + 2 + 4 × 4 = 16 + 5 = 21

15. A B C
1 1 3 2
C1 . 3C1 . 4C3 = 24
1 2 2 2
C1 . 3C2 . 4C2 = 26
1 3 1 2
C1 . 3C3 . 4C1 = 8
2 1 2 2
C2 .3C1 . 4C2 = 18
2 2 1 2
C2 .3C2 . 4C1 = 12
______________
98

5!
16. = = 10
2!3!
5!
= = 20
3!
5!
= = 30
2!2!
Hence sum of unit places is
2 × 10 + 3 × 20 + 4 × 30 = 200
Hence required sum is
= 200 × (105 + 104 + 103 + 102 + 101 + 100) = 200 × (111111) = 22222200

17. First we select one married couple out of 6 married couple i.e. 6C1 ways
total number of required case 6C1 × 5C1 × 4C1 × 2 = 6 × 5 × 4 × 2 = 240
N = 240

18. Here Pn =
 x1 + x2 + x3 + x4 = n – 3  x1 , x4  0
  x1 + y2 + y3 + x4  n – 5 x2 , x3  1
pn = n – 5 + 4 – 1c3 = n – 2c3 y2 , y3  0

Qn =

 x1 + x2 + x3 = n – 3  y1 + y2 + y3 = n – 6
Now Pn – Q n = 6
(n – 2) (n – 3) (n – 4) n(n – 4) (n – 5)
– = 6   n = 10
1.2.3 1.2.3

19. Using multinomial theorem total number of required selection is 8+3C8 = 11C8 = 11C3 = 165

20. x < y and z  y

= 3, =8

= 15, = 24, = 35, = 48

= 63, = 80, Total = 276

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
PART - III : ONE OR MORE THAN ONE OPTIONS CORRECT TYPE
1. Number of ways he can fail is either one or two, three or four subject then total of ways.
4C +4C + 4C +4C = 24 – 1
1 2 3 4

2. Total no. of visits that a teacher goes is = 25C5

(selection of 5 different kids each time & teacher goes every time)
Number of visits of a boy = select one particular boy & 4 from rest 24 = 24C4
So extra visits of a teacher from a boy is = 25C5 – 24C4 = 24C5

3. Total number of required possibilities

5C . 8C + 5C . 8C + 5C . 8C 5 8 5 8 8 13C 5
3 7 4 6 5 5 = C3 . C7 + C4 . C6 + C5 = 10 – C3 = 276

4. Here given no. be 1,2,3,.........n

Let common difference = r
Total way of selection = (1, 1 + r, 1+2r),(2, 2 + r, 2 + 2r), ..(n – 2r, n – r, n)
Total numbers are = (n – 2r)
Here rmin. = 1 and rmax. = (n – 1)/2
Case- I When n is odd
 n  1  n  1 
2
2  
(n 1) / 2 2
(n  1) n(n  1)  2  =  n  1 
 rmax = & total no. of selection is =  (n  2r) = –   2 
2 r 1
2 2  
n2
Case - II when n is even = rmax = so total no. selection is
2
n2n
2
2  2  n  2  
(n  2) / 2
n(n  2) n  n(n  2)
=  (n  2r) = –  =   n  =
r 1
2 2  2   2 4

5. S2 : Arrangements will be one side

 m+n
Cm

6. Total required number of teams is

1
= 10 C4 . 6C3 . 3 C3 . 2100 = 10C4 . 5C2 = 2100
2!

7. = 24 ways

= 12 ways

= 12 ways

and
here 50th NAAIG

8. Required number of possible is

8 ! – 2. 7 ! = 7 ! (8 – 2) = 6. 7!  2. 6!. 7C2

9. (A)Without changing the order of the vowels of MULTIPLE

So we choose the first three place in 8C3 ways and the rest are arranged is
8 ! 5! 8 !
 = = 3360
3! 5! 2! 3! 2!
Hence required no. is 3360 – 1 = 3359
(B) Keeping the position of each vowel fixed M_LT_PL_
5!
Number of ways = = 60 other ways = 60–1 = 59
2
(C) without changing the relative order/position of vowels & consonants

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
 5!
so number of ways is =  3! = 60 × 6 = 360
2!
Hence required number is = 360–1 = 359
(D) Total 8!

10. We have arrange all the letter except ‘CCC’ is

12!
now there are 13 place where ‘C’ can be placed 13C3
5!.3!.2!
12! 13C = 11 . 13!
Hence required number of ways is = 3
5! 3! 2! 6!

11. x1 + x2 + x3 + x4  n  x1 + x2 + x3 + x4 + y = n (where y is known as pseudo variable)

Total no. of required solution is = n + 5 –1Cn = n+4Cn or n+4C4

12.

x1 + x2 + x3 + x4 + x5 = 6  x1 + y1 + y2 + y3 + x5 = 3
but x1, x5  0
x2, x3, x4  1  y1, y2, y3  0
3 + 5 – 1C . 4 ! = 7C . 4 ! = 7p . 4 = 840
3 3 3

50!  50   50 
13. exp of 19 in 50 ! =   +  2  = 2
14! 36!  19   19 
 36   36 
Exp. of 19 in 36 ! =     2  = 1 50C36 is divisible by 19 but not by 192
 19   19 
 50   50   14 
Exp. of 5 in 50 ! =      = 12; Exp. of 5 in 14! =   = 2
 5 25
  5 
 36   36 
Exp. of 5 in 36 ! =      = 8 Ans. A & B
5   25 

2n!
14. Value of 2npn is
n!
(i) (n + 1) (n + 2) ----- (2n) and n ! . 2nCn
1.2.3.4.5.6.7.8.9.10.11.....(2n–2) (2n–1) . 2n (1.3.5.7....(2n–1)) . (2.4.6.8.......2n)
=
1.2.3........n 1.2.3........n
(1.3.5.7....(2n–1)).2n (1.2.3.4.......n)
= = 2n (1.3.5.7. .....(2n – 1)) = (2. 6. 10. 14 ..... (4n – 2))
(1.2.3.4......n)

200 198
C2 . C2 . 196 C2 ......2 C2 200 !
15. = 100
100 ! 2 . 100 !
101.102. 103 .....200  100   102   103   200 
= 100
=   .  .  .....  
2  2  2  2   2 
1.2.3.4.5.6.7.8.....200 (1.3.5.7.....199) (2. 4. 6. 8......200)
And =
2100 . 100 ! 2100 . 100 !
(1.3.5......199) . 2100 . 100 !
= = 1.3.5 .199
2100 . 100 !

PART - IV : COMPREHENSION
1. Two non-officials and 3 officials i.e.
4
C2 × 8C3 = 6 × 56 = 336.
Three non-official and 2 officials
4
C3 × 8C2 = 4 × 28 = 112.
Four non-officials and 1 official

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
 4
C4 × 8C1 = 1 × 8 = 8
Total 336 + 112 + 8 = 456.

2. Required no. of ways

= 12 – 1C5 = 11C5 = 462

3. In the word RESONANCE there are 9 letters.

Consonants (5), 1R, 1S, 1C and 2N
Vowels (4), 2E, 1O, 1A
total even places 4 ;
4!
No. of ways arranging vowels in even places is = 12
2!
5!
No. of ways arranging consonants in remaining odd places is = 60
2!
required number of arrangement = 12 × 60 = 720 = n

9!
4. Required number of arrangements are = 3780
2!2!4!

6. Let n lines divides the pizza into Sn pieces. Let us add new (n + 1)th line, L which cuts the previous n lines
by assumption. Now line L will cut the original pieces into 2 pieces further & we are passing trough (n +
1) such pieces, hence
Sn + 1 = Sn + (n + 1)
n  n  1
Sn = +1
2
when Sn  60 where n N
n(n + 1) + 2  60
n2 + n – 11  0
n = 10, is not satisfy
n = 11 is satisfying
 n = 11

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222