Permutations & Combinations: A) Multiplication Principle

PERMUTATIONS & COMBINATIONS
I INTRODUCTION
In a broad range of fields of Mathematics and other subjects, one needs to deal with problems that involve
combinations made up of letters, numbers or any other objects. e.g. an investigating chemist analyzes rela-
tions involving atoms and molecules, a linguist examines the meanings of the words formed by various
combinations of letters.
Historical Note
This branch of mathematics has its origin in the 16th century, in the gambling games. It is quite natural that
the first combinatorial problems had to do mainly with gambling, such as, in how many ways can a certain
sum, in throws of two or three dice, be scored, or in how many ways is it possible to get two kings in a card
game. One of the first to enumerate the various combinations achieved in games of dice was the italian
mathematician . In the 17th century, French scholars, and , made a theoretical inves-
tigation into the problems of combinatorics. Further advances in the theory of combinations were connected
with the names of
and . During recent years, combinatorial mathematics has seen
extensive developments associated with greater interest in problems of Discrete Mathematics.
II BASIC COUNTING PRINCIPLES
Let A={ 1
, 2
, ... , }
and B={ 1
, 2
, ... , } be sets.
a) Multiplication Principle
An ordered pair ( , ), where A,  B, can be formed in  ways.
It can further be extended as

Let a set A have elements , = 1, 2, ... , .
An ordered -tuple ( 1 , 2 , ... , ) where  A for each , can be formed in
1
. 2 . 3 . ... . ways.
b) Addition Principle
Let A  B =  (the empty set).

An element of A or an element of B can be chosen in + ways.
It can be extended as
Let a set A have elements and any two sets A ’s be disjoint, = 1, 2, ... , .
Then any element of A1 or A2 or ... or A can be chosen in 1 + 2 + ... +
ways.
Website: www.iitianspace.com | online.digitalpace.in 1

c) The Bijection Principle
Let A = { 1 , 2 , ... , } and B = { 1 , 2 , ... , }.

If : A  B is an injective function then  .
If : A  B is a surjective function then  .
If : A  B is injective and surjective then is known to be a bijective function.
For a bijective function, = .
Total number of possible functions ( : A  B) is mn and ( : B  A) is nm
III FACTORIAL
It is denoted as ! or .
i) n!  n   n  1 ! ii)
0!  1
For a positive integer , it is defined as
! = ( – 1) ( – 2). ... . 3. 2. 1
e.g. i) 8 ! – 6! = 6! (8  7 –1) = 55  720 = 3960
12 ! 9!  10  11  12
ii) = = 1320
9! 9!
(2 ) ! 2 (2  1) (2  2) (2  3)  3 . 2 . 1
iii) 
! (  1) (  2)  3. 2. 1
2 ( .(  1) (  2).  . 1) ((2  1) (2  3)  3. 1)
=
(  1) (  2).  . 1
= 2 (1. 3. 5 . .. (2 – 1))
iv) ! ,  5 , ends in 0.
(Number of 5’S in ! ,  5, is always less than the number of 2’ S. Therefore for
every 5, there is a 2. Hence ! ,  5, ends in 0).
v) = 1! + 2! + 3! + ... + ! is not a square, for  4.

(Can you verify ?)
IV PERMUTATIONS (Arrangements)
A permutation of given objects is an arrangement of the objects in a line, unless
specified otherwise.
Every possible relative order between the objects is taken into account.
e.g. (2, 1, 3, 4, 5) , (5, 2, 1, 4, 3) , (1, 2, 5, 4, 3) etc. are permutations of 1, 2, 3, 4, 5.
Theorem 1
The total number of permutations of distinct objects = !

Theorem 2
!
The total numbers of permutations of objects, out of distinct objects , is ,
(  )!
1  .
This number is denoted as P .
Theorem 3
(On permutations of objects not all distinct)
Let there be 1
A1S , 2
A2S , ... , Ak’S. Then the number of permutations
( 1  2  ...  )!
=
1! 2 ! ... !
(This number is known as a .)
1. For some natural N , the number of positive integral ' x ' satisfying the equation ,
1 ! + 2 ! + 3 ! + ...... + (x !) = (N)2 is ______.
2. Number of 9 digits numbers divisible by nine using the digits from 0 to 9 if each digit is used atmost once
is K . 8 ! , then K has the value equal to ______ .
3. Number of natural numbers less than 1000 and divisible by 5 can be formed with the ten digits, each digit
not occuring more than once in each number is ______ .
4. Three men have 6 different trousers, 5 different shirts and 4 different caps . Number of different ways in
which they can wear them is ______.
5. Find the number of ways in which letters of the word VALEDICTORY be arranged so that the vowels may
never be separated.
6. If 20Pr = 13× 20Pr–1 , then the value of r is ___________.
7. There are 720 permutations of the digits 1, 2, 3, 4, 5, 6. Suppose these permutations are arranged from
smallest to largest numerical values, beginning from 1 2 3 4 5 6 and ending with 6 5 4 3 2 1.
(a) What number falls on the 124th position?
(b) What is the position of the number 321546?
8. The tamer of wild animals has to bring one by one 5 lions & 4 tigers to the circus arena . The number of
ways this can be done if no two tigers immediately follow each other is ______ .
9. In how many different ways a grandfather along with two of his grandsons and four grand daughters can
be seated in a line for a photograph so that he is always in the middle and the two grandsons are never
adjacent to each other.
10. If as many more words as possible be formed out of the letters of the word "DOGMATIC"
then the number of words in which the relative position of vowels and consonants remain
unchanged is ______ .

1. 2 2.17 3.154 4. 6P3  5P3  4P3
5.967680 or 8! 4! 6.8 7. (a)213564 (b)267th
8. 43200 9.528 10. 719
Theorem 4
The number of of distinct objects is ( – 1)!
Proof : Consider a linear permutation of distinct objects 1, 2, 3

,..., .
Number of linear permutations of distinct objects = !
(e.g. think of a thread having beads) 1
Consider a corresponding circular permutation as 2
shown in the adjacent figure. 3
Consider 1
2
In fact, both the circular arrangements are same.

Not only that , there are more similar looking 1 2 3
circular permutations. There are linear

permutations as shown below, which give the 1 2 3 -1
same circular permutation.
-1
So while counting the number of circular 1 2 -2
permutations from the number of linear

permutations, one circular permutation is
counted times.
2 3 1
!
 Number of circular permutations = = ( – 1)!
Aliter
Let P denote the number of circular permutations of distinct objects.
Note that P1 = 1.
1
2
Let ( – 1) objects (out of these objects) be placed on a circle. -1 3
This can be done in P – 1 ways.
These – 1 objects break the circle into – 1 arcs. Now the th object is to be kept some
where on these ( – 1) arcs. This can be done in ( – 1) ways.
 P = ( –1) P – 1 (recurrence relation)
= ( – 1) ( – 2) P – 2
= ( – 1) ( – 2) ( – 3) P – 3


= ( – 1) ( – 2) ( – 3) . . . 3. 2. 1. P1
= ( – 1)!
V COMBINATIONS
A combination of objects is merely a selection (suppress order) from a given lot of objects.
e.g. { , , }, { , , }, { , , }, { , , } are the selections of 3 objects from , , , . So we say that
the number of ways of selecting 3 objects out of given 4 objects is 4 or the number of combinations of 3
objects out of given 4 objects is 4. A combination is just a set, elements of which, are not ar-
ranged in a particular way.
Theorem
!
The number of selections of objects out of distinct , at a time is .
! (  )!
This number is denoted as C
Proof : C – 1 represents the number of selections of – 1 objects out of distinct objects.

Number of ways to select th object from remaining – (r – 1) objects is – ( – 1).
By multiplication principle, the number of ways to select objects out of distinct objects is
apparently C –1
. ( – + 1).
However, each selection is counted times. Note that we are aiming at counting the unordered
selections.
e.g. { , , } or { , , } or { , , } are to considered as one selection (not 3 selections)
Therefore
C= C .  1 (recurrence relation)
–1
 (  1)  1  2
C = C . = C .
–1 –2
1 –2
1
 3
C = C . etc.
–2 –3
2
(  1)(  2) ... (   1)
 C = C1 .
(  1) ... 2.1
(  1) (  2) .  . (   1)
= (Note that C1 = )
(  1).  2.1
(  1) ... (   1) (  ) (   1) ... 2 .1
=
( (  1) ... 2.1) ((  ) (   1) ... 2.1)
!
 C =
!(  ) !

VI PROPERTIES OF C
1. C = C –
2. i) C0 + C1 + . . . + C = 2
ii) C0 – C1 + C2 – C3 + . . . + (–1) . C = 0
3. C + Cr – 1 = +1
C
4. . C = . C
–1
–1
5. C C0 + C –1
C1 + C –2
C2 + . . . + C0 C = +
Ck
Corr. ( C0)2 + ( C1)2 + . . . +( Cn)2 = 2 C

( To get this result put = = in equation no. 5 )
Combinatorial proof of (4)

Consider a group of people. A committee of people is to be selected, out of these people & the commit-
tee has one chairperson.
This can be done as follows :
Select people from people and select one person from selected people.
This can be done in C . C1 ways.
Another alternative is to select one person as the chairperson from people and select remaining
( – 1) people from ( – 1) people.
This can be done in C1 . – 1C – 1ways.
 . C = . –1C – 1
Students are advised to develop the combinatorial proofs of the remaining properties.
1. How many numbers between 400 and 1000 (both exclusive) can be made with the digits 2,3,4,5,6,0 if
(a) repetition of digits not allowed. (b) repetition of digits is allowed.
2. Mary typed a six-digit number, but the two 1's she typed didn't show. What appeared was 2006. Find the
number of different six-digit numbers she would have typed.
3. In how many ways can 5 colours be selected out of 8 different colours including red, blue, and green
(a) if blue and green are always to be included,
(b) if red is always excluded,
(c) if red and blue are always included but green excluded?
4. Number of six digit numbers which have 3 digits even & 3 digits odd, if each digit is to be used atmost once
is ______.
5. 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 . Find the number of visits, the teacher
makes to the garden and also the number of of visits every kid makes.
6. A forecast is to be made of the results of five cricket matches, each of which can be win, a draw or a loss
for Indian team. Find
(i) the number of different possible forecasts
(ii) the number of forecasts containing 0, 1, 2, 3, 4 and 5 errors respectively
7. A women has 11 close friends. Find the number of ways in which she can invite 5 of them to dinner, if two
particular of them are not on speaking terms & will not attend together.
8. In a certain algebraical exercise book there are 4 examples on arithmetical progressions, 5 examples on
permutation  combination and 6 examples on binomial theorem . Number of ways a teacher can select
for his pupils atleast one but not more than 2 examples from each of these sets, is ______ .
9. There are 10 seats in a double decker bus, 6 in the lower deck and 4 on the upper deck. Ten passengers
board the bus, of them 3 refuse to go to the upper deck and 2 insist on going up. The number of ways in
which the passengers can be accommodated is _____. (Assume all seats to be duly numbered)
10. Find the number of permutations of the word "AUROBIND" in which vowels appear in an alphabetical order.
11. Prove that the number of ways in which 8 different flowers can be strung to form a garland so that 4
particular flowers are never separated is (1/ 2)  4! 4! .
12. A round table conference is to be held between 20 delegates of 2 countries. In how many ways can they be
seated if two particular delegates
(a) always sit together (b) never sit together.
13. There are 20 persons including two brothers. In how many ways can they be arranged on a round table if :
(a) There is exactly one person between the two brothers.
(b) The two brothers are always separated.
(c) What will be the corresponding answers if the two brothers were twins
(alike in all respects) ?
14. 20 persons were invited for a party. In how many ways can they and the host be seated at a circular table ?
In how many of these ways will two particular persons be seated on either side of the host ?
15. 2 chairs are arranged symmetrically around a table. There are 2 people , including A and B, who wish
to occupy the chairs. Find the number of seating arrangements , if :-
i) A and B are next to each other;
ii) A and B are diametrically opposite.
1.(a)60(b)107 2. 15 3.(a)20(b)21(c)10 4.64800 5. 25C5 , 24C4

6.(i)243 (ii)1,10,40,80,80,32 7.378 8.3150 9.4C2. 2! 6C3.3! 5! or 172800
10. C4 · 4 ! 12. (a) 2 18! (b) 19! 2 18!
8
13.(a) 2 18! (b) 19! 2 18! (c) 18! , (1/ 2){19! 2 18!} 14. 20! , 2 18!
15. (i) ( 2 – 2 ) !  2 (ii) (2 – 2 )!

VII a) Number of non-negative integral solutions of a linear equation
Let the given equation be
1
+ 2
+ 3
+...+ =
Let A be the set of all non-negative integral solutions of the given equation and B be the set of all ( + – 1) term
binary sequences containing 1’S and ( – 1) 0’S.
For every non-negative integral solution of the equation there is a binary sequence of 1’S and( – 1) 0’S .
And for every binary sequence of 1’S and ( – 1) 0’S , we can write a non-negative integral solution.
Therefore there is bijection between the sets A and B.
 number of non negative integral solutions of the equation is same as the number of binary sequences.
(   1) !
Number of non-negative integral solutions = = + –1
C
! (r  1) ! –1
b) Number of non-negative integral solutions of a linear inequation :

Consider the given inequation as
1
+ 2 + 3 + . . . +  ——— (1)
Add a non-negative integer +1
to get
1
+ 2+ 3+...+ + +1
= . ——— (2)
Number of solutions of (2)
(  )!
= ( +
C =
! !
c) Number of integral solutions of a linear equation in 1

, 2
, . . . , when S
are
constrained
Consider
1
+ 2 + 3 + ...+ = ——— (1)
where 1  1 , 2  2 , ... ,  , all ’S are integers.
Take = 1 + 1
1
2
= 2 + 2 etc. ,
where 1
  0, 2  0, ... ,   0
 (1) reduces to
( 1 + 2 + . . . ) + 1 + 2 + ...  =
 +
1 2
 + ... +  = – ( 1
+ 2
+ ...+ ) ——— (2)
For every solution of (1), we can write a corresponding solution of (2) and for every solution of
(2), we can write a corresponding solution of (1). Therefore there is bijection between the sets of
solutions of (1) & (2).
Number of solutions of (1) = Number of non-negative integer solutions of (2)
(  1 ( 1  2  ...  ) )!
=
(  1)! (  ( 1  2  ...  ) )!

1. The number of non negative integral solution of the inequation x + y + z + w  7 is ____ .
2. Find the number of integral solutions of = 22, subject to – 3 , 1, , ,  0.
3. Given (1+ + ) =
2 20
0
+ 1
+ 2
2
+...+ 40
40
, for all . Find 2
.
4. Use a combinatorial argument to show that C –1

+ –1
C –1
+ –2
C –1
+...+ –1
C –1
= +1
C
5. Find the number of non-negative integer solutions of  23.
6. Find the number of non-negative integer solutions of ( )( ) = 21.
7. How many integers > 100 and < 106 have the digital sum = 5 ?
8. A man has 3 sons. He wants to bequeth his fortune of 101 identical gold coins to them such that no son gets
more share than the combined share of the other two. The number of ways of accomplishing this task is __.
9. In how many ways can 14 be scored by tossing a fair die thrice ?
10. In how many ways, 16 identical coins can be distributed to 4 beggers when
(i) any begger may get any number of coins ?
(ii) every begger gets atleast one coin ?
(iii) every begger gets atleast two coins ?
(iv) every begger gets atleast three coins ?
1. 330 2. 28
C4 3. 210 5.27C4
6.5C2 .10C3 + 9C2 .6C3 + 23C2 .4C1+ 24C3 .3C1 7. 246
8. 103C2 – 3.52C2 or 100C2 – 3.50C2
9. 15 10. (i ) 19C3 (ii ) 15C3 (iii) 11C3 (iv) 7C3
VIII The inclusion - exclusion principle

Consider properties P1 , P2 , ... , P . Let be the number of objects satisfying the property
P , = 1, 2, ... , . A commonly asked question is “ how many elements satisfy atleast one of the
properties P1 , P2 , ... , P ” ?
This question is answered by the inclusion-exclusion principle which is stated below :
Let A1 , A2 , ... , A be finite sets, their cardinalities being denoted by
|A |, = 1, 2, ... , . Then
|U A |   |A | –  |A A | +  |A  A  A | – ..... + (–1) 1
| A |
i
IX Derangements
A derangement of 1, 2, ... , is a permutation of the numbers such that no number occupies its natural
postion.
Thus (2, 3,1) and (3, 1, 4, 2) are derangements. On the other hand , (2, 4, 3, 5, 1) is not a derangement. The
total number of derangements of 1, 2, ... , will be denoted by D .
It is easy to realise that D1 = 0 , D2 = 1 and D3 = 2. etc.

D is given by
 1 1 1 (1) 
D = !  1    ...  
 1! 2! 3! ! 
1 1 1 (1)
Note that lim D = 1 –    ...  + ... 
 1! 2! 3! !
= e –1.
1. Find the number of numbers, from amongst 1, 2, 3, ... , 500, which are divisible by none of 2, 3, 5.
2. Find the number of non-negative integer solutions of 1

+ 2
+ 3
=15, subject to 1
 5, 2
 6 , and 3
 7.
3. How many positive integers divide 1040 or 2030 ?
4. According to the Gregorian calendar, a leap year is defined as a year such that
(i) divides 4 but not 100 ;
or (ii) divides 400.
Find the number of leap years from the year 1000 to the year 3000, inclusive.
5. Let D be the th derangement number. Prove that

(i) D = ( –1) (D – 1 + D – 2 ) , > 2 ;
D 1
(ii) Lim 
 !
6. Five pairs of hand gloves of different colours are to be distributed to each of five people. Each person must
get a left glove and a right glove.
Find the number of distributions so that, exactly one person gets a proper pair.
7. Find the number of 3 element subsets of the set { 1 , 2 , . . . , 10 } , in which the least element is 3 or the
greatest element is 7.
8. Use a combinatorial argument to prove that :-

(i) 2
C2 = 2. C2 + 2 (ii) . C = –1
C –1
9. Prove (combinatorially) that

C + +1C + +2 C + ... + C = +1
C +1
,  .
10. Prove (combinatorially) that  !  (  1)!  1

1
(Hint : Divide all the permutations of 1, 2 , ... , + 1 according to the smallest integer not in its natural
place.)
1. 134 2. 10 3. 2301
4. 485 6. 5400 7. 33

X CLASSICAL OCCUPANCY PROBLEMS
The problems of the number of distributions of balls into cells are called occupancy
problems. We distinguish several cases as described below :-
1. Distinguishable balls and distinguishable cells
, , ... , balls
1 2
Cells , , ... ,
1 2
2
If an empty cell is allowed, the number of distributions = .

If no cell is empty, then the number is determined by the inclusion / exclusion principle.
2. Identical balls and distinguishable cells
identical
balls
Cells , , ... ,
1 2 2
If an empty cell is allowed, then the number of distributions is +

C (use binary sequences).
–1
If no cell is allowed to remain empty, then the number is –1C – .
1. Number of different ways in which 8 different books can be distributed among 3 students, if each student
receives atleast 2 books is ______.
2. Number of ways in which n distinct objects can be kept into two identical boxes so that no box remains
empty, is ______.
3. The number of ways in which 14 men be partitioned into 6 committees where two of the committees
contain 3 men & the others contain 2 men each is ______.
4. 10 identical balls are to be distributed in 5 different boxes kept in a row and labled A, B, C, D and E. The number
of ways in which the balls can be distributed in the boxes if no two adjacent boxes remain empty is ______.
5. The number of distributions of 6 distinguishable objects in three distinguishable boxes such that each box
contains an object is ______.

6. Prove that the number of digit quaternary sequences (whose digits are 0, 1, 2, and 3) , in which each of the
digits 2 and 3 appear atleast once, is 4 – 2.3 + 2 .
7. Tom has 15 ping-pong balls each uniquely numbered from 1 to 15. He also has a red box, a blue box, and
a green box.
(a) How many ways can Tom place the 15 distinct balls into the three boxes so that no box is empty?
(b) Suppose now that Tom has placed 5 ping-pong balls in each box. How many ways can he choose
5 balls from the three boxes so that he chooses at least one from each box?
8. Number of ways in which 12 identical coins can be distributed in 6 different purses, if not more than 3 & not
less than 1 coin goes in each purse is ______ .
9. In how many ways can 3 blue, 4 red and 2 green balls be distributed in 4 distinct boxes ? (Balls of the
same colour are identical)
10. How many different ways can 15 Candy bars be distributed to Ram, Shyam, Ghanshyam and Balram, if
Ram can not have more than 5 candy bars and Shyam must have at least two. Assume all Candy bars to be
alike.
14 !
1. 2940 2. 2n1  1 3. 4. 771
(2!) . (3!)2 . 4!
5
5. 540 7. (a) 315 – 3 · 215 + 3, (b) 2250 8. 141
9. 7000 10. 440

Permutations & Combinations Math. XI
 Properties of nCr & n Pr

1. If 5 Pr  120 , then the value of r is
(A) 2 (B) 3+ (C) 5 (D) 4
2. How many numbers can be formed from the digits1, 2, 3, 4 when the repetition is not allowed?
(A) 4 P4 (B) 4 P3 (C) 4 P1  4 P2  4 P3 (D) 4 P1  4 P2  4 P3  4 P4
3. If n is even and the value of n Cr is maximum, then r =

n n 1 n 1
(A) (B) (C) (D) None of these
2 2 2
5
4. 47
C4   52r C3 
r 1
47 52 52
(A) C6 (B) C5 (C) C4 (D) None of these
5. If 20 Cn2  nC16 , then the value of n is

(A) 7 (B) 10 (C) 13 (D) No value
 Permutations
6. How many words can be formed from the letters of the word BHOPAL?
(A) 124 (B) 240 (C) 360 (D) 720
7. How many numbers lying between 500 and 600 can be formed with the help of the digits 1, 2, 3, 4, 5,
6 when the digits are not to be repeated?
(A) 20 (B) 40 (C) 60 (D) 80
8. 4 buses runs between Bhopal and Gwalior. If a man goes from Gwalior to Bhopal by a bus and comes
back to Gwalior by another bus, then the total possible ways are
(A) 12 (B) 16 (C) 4 (D) 8
9. The number of ways in which first, second and third prizes can be given to 5 competitors is
(A) 10 (B) 60 (C) 15 (D) 125
10. In a railway compartment there are 6 seats. The number of ways in which 6 passengers can occupy
these 6 seats is
(A) 36 (B) 30 (C) 720 (D) 120
11. How many numbers consisting of 5 digits can be formed in which the digits 3, 4 and 7 are used only
once and the digit 5 is used twice
(A) 30 (B) 60 (C) 45 (D) 90

12. The number of different arrangements which can be made from the letters of the word SERIES taken
all together is
6! 6!
(A) (B) (C) 6 ! (D) None of these
2!2! 4!
13. How many words can be formed with the letters of the word MATHEMATICS by rearranging them
11! 11! 11!
(A) (B) (C) (D) 11 !
2!2! 2! 2!2!2!
14. How many words can be made out from the letters of the word INDEPENDENCE, in which vowels
always come together
(A) 16800 (B) 16630 (C) 1663200 (D) None of these
15. Using 5 conveyances, the number of ways of making 3 journeys is

(A) 3 × 5 (B) 35 (C) 53 (D) 53  1
16. The number of 7 digit numbers which can be formed using the digits 1, 2, 3, 2, 3, 3, 4 is
(A) 420 (B) 840 (C) 2520 (D) 5040
17. The number of 3 digit odd numbers, that can be formed by using the digits 1, 2, 3, 4, 5, 6 when the
repetition is allowed, is
(A) 60 (B) 108 (C) 36 (D) 30
18. Using all digits 2, 3, 4, 5, 6 how many even numbers can be formed
(A) 24 (B) 48 (C) 72 (D) 120
19. In how many ways can 5 boys and 5 girls stand in a row so that no two girls may be together
(A) (5!)2 (B) 5!  4! (C) 5!  6! (D) 6  5!
20. The number of ways in which 5 boys and 3 girls can be seated in a row so that each girl in between
two boys
(A) 2880 (B) 1880 (C) 3800 (D) 2800
21. The number of arrangements which can be made using all the letters of the word LAUGH if the vowels
are adjacent is
(A) 10 (B) 24 (C) 48 (D) 120
22. The number of six digit numbers that can be formed from the digits 1, 2, 3, 4, 5, 6 & 7 so that digits
do not repeat and the terminal digits are even is :
(A) 144 (B) 72 (C) 288 (D) 720
23. A 5 digit number divisible by 3 is to be formed using the numerals 0, 1, 2, 3, 4 & 5 without repetition.
The total number of ways this can be done is :
(A) 3125 (B) 600 (C) 240 (D) 216

24. The number of 6-digit numbers that can be made with the digits 0, 1, 2, 3, 4, and 5 so that even digits
occupy odd places, is
(A) 24 (B) 36 (C) 48 (D) none
25. The number of ways in which 6 men can be arranged in a row so that three particulars men are
consecutive, is
(A) 4 P4 (B) 4 P4  3P3 (C) 3P3  3P3 (D) none
26. The total number of words that can be made by writing the letters of the word PARAMETER so that
no vowel is between the consonants is
(A) 1440 (B) 1800 (C) 2160 (D) none
27. The number of numbers of four different digits that can be formed from the digits of the number 12
356 such that the numbers are divisible by 4, is
(A) 36 (B) 48 (C) 12 (D) 24
28. The number of 5 - digit numbers in which no two consecutive digits are identical is
(A) 92  83 (B) 9  84 (C) 95 (D) none
29. In the decimal system of numeration the number of 6-digit numbers in which the sum of the digits is
divisible by 5 is
(A) 180000 (B) 540000 (C) 5 105 (D) none
30. Total number of 6-digit numbers in which all the odd digits and only odd digits appear, is
5 1
(A)  6! (B) 6 ! (C)  6! (D) none
2 2
31. The number of 5 digit numbers such that the sum of their digits is even is :
(A) 50000 (B) 45000 (C) 60000 (D) none
32. Number of different words that can be formed using all the letters of the word "DEEPMALA" if two
vowels are together and the other two are also together but separated from the first two is
(A) 960 (B) 1200 (C) 2160 (D) 1440
 Circular Permutations
33. In how many ways can 12 gentlemen sit around a round table so that three specified gentlemen are
always together
(A) 9 ! (B) 10 ! (C) 3 ! 10 ! (D) 3 ! 9 !
34. In how many ways 7 men and 7 women can be seated around a round table such that no two women
can sit together
(A) (7!)2 (B) 7! 6! (C) (6!)2 (D) 7 !
35. The number of ways in which 10 boys can take positions about a round table if two particular boys
must not be seated side by side is :
(A) 10 (9) ! (B) 9 (8) ! (C) 7 (8) ! (D) none
36. There are 12 guests at a dinner party. Supposing that the master and mistress of the house have fixed
seats opposite one another, and that there are two specified guests who must always, be placed next to
one another ; the number of ways in which the company can be placed, is:
(A) 20 . 10 ! (B) 22 . 10 ! (C) 44 . 10 ! (D) none
37. Eight people, including A and B, are to be seated around two identical tables, each having a capacity
of 4. The number of seating arrangements, so that A and B are not at the same table, is
(A) 360 (B) 1440 (C) 720 (D) 2880
38. Eight people are to be seated, including A and B, four at a round table and four at a straight table. The
number of arrangements, in which A and B are not at the round table, is
(A) 7920 (B) 2160 (C) 10,080 (D) none of these
 Combinations
39. In how many ways can 10 true-false questions be replied
(A) 20 (B) 100 (C) 512 (D) 1024
40. There are 12 volleyball players in all in a college, out of which a team of 9 players is to be formed. If
the captain always remains the same, then in how many ways can the team be formed
(A) 36 (B) 108 (C) 99 (D) 165
41. There are 16 vacancies for clerks in a certain office, 20 applications are received. In how many ways
can the clerks be appointed
(A) 3800 (B) 3876 (C) 969 (D) 4845
42. In how many ways a committee of 5 members can be formed out of 8 gentlemen and 4 ladies, if one
particular lady is always to be taken
43. How many words can be formed by taking 3 consonants and 2 vowels out of 5 consonants and 4
vowels?
5
C3  4C2
(A) 5 C3  4C2 (B) (C) 5 C3 4C3 (D) (5 C3  4C2 ) (5)!
5
44. A male and a female typist are needed in an institution. If 10 ladies and 15 gentlemen apply, then in
how many ways can the selection be made
45. Everybody in a room shakes hand with everybody else. The total number of hand shakes is 66. The
total number of persons in the room is
(A) 11 (B) 12 (C) 13 (D) 14
46. There are 9 chairs in a room on which 6 persons are to be seated, out of which one is guest with one
specific chair. In how many ways they can sit
(A) 6720 (B) 60480 (C) 30 (D) 346

47. On the occasion of Deepawali festival each student of a class sends greeting cards to the others. If
there are 20 students in the class, then the total number of greeting cards exchanged by the students is
(A) 20 C2 (B) 2.20 C2 (C) 2.20 P2 (D) None of these
48. A father with 8 children takes them 3 at a time to the Zoological gardens, as often as he can without
taking the same 3 children together more than once. The number of times he will go to the garden is
49. A fruit basket contains 4 oranges, 5 apples and 6 mangoes. The number of ways person make selection
of fruits from among the fruits in the basket is
50. Out of 10 white, 9 black and 7 red balls, the number of ways in which selection of one or more balls
can be made, is
(A) 881 (B) 891 (C) 879 (D) 892
51. Out of 6 books, in how many ways can a set of one or more books be chosen
(A) 64 (B) 63 (C) 62 (D) 65
52. In an examination there are three multiple choice questions and each question has 4 choices. Number
of ways in which a student can fail to get all answers correct, is
(A) 11 (B) 12 (C) 27 (D) 63
53. The 9 horizontal and 9 vertical lines on an 8 × 8 chessboard form 'r' rectangles and 's' squares. The
ratio s : r in its lowest terms is
1 17 4
(A) (B) (C) (D) none
6 108 27
54. 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) 80 (D) 1200
55. 18 points are indicated on the perimeter of a triangle ABC (see figure).
How many triangles are there with vertices at these points?
(A) 331 (B) 408 (C) 710 (D) 711
 Integer Solutions / Distribution / Dearrangement

56. The number of ways in which 6 rings can be worn on the four fingers of one hand is
(A) 46 (B) 6 C4 (C) 64 (D) None of these
57. In how many ways can 4 prizes be distributed among 3 students, if each student can get all the 4 prizes
(A) 4 ! (B) 34 (C) 34  1 (D) 33
58. In how many ways 3 letters can be posted in 4 letter-boxes, if all the letters are not posted in the same
letter-box
(A) 63 (B) 60 (C) 77 (D) 81

59. There are 4 parcels and 5 post-offices. In how many different ways the registration of parcel can be
made
(A) 20 (B) 45 (C) 54 (D) 54  45
60. The number of ways in which three students of a class may be assigned a grade of A, B, C or D so that
no two students receive the same grade, is
(A) 34 (B) 43 (C) 4 P3 (D) 4C3
61. The number of ways lawn tennis mixed double can be made up from seven married couples if no
husband and wife play in the same set is
62. In how many ways can 5 keys be put in a ring

(A) 4! 2 (B) 5! 2 (C) 4 ! (D) 5!
63. The number of ways in which 5 different books can be distributed among 10 people if each person can
get at most one book is :
(A) 252 (B) 105 (C) 510 (D) 10C5.5!
64. The interior angles of a regular polygon measure 150º each. The number of diagonals of the polygon is
(A) 35 (B) 44 (C) 54 (D) 78
65. Number of ways in which 9 different prizes be given to 5 students if one particular boy receives
4 prizes and the rest of the students can get any numbers of prizes, is :
(A) 9C4  210 (B) 9C5  54 (C) 4  45 (D) none
66. There are n persons and m monkeys (m > n). Number of ways in which each person may become the
owner of one monkey is
(A) n m (B) mn (C) m Pn (D) mn
67. A rack has 5 different pairs of shoes. The number of ways in which 4 shoes can be chosen from it so
that there will be no complete pair is
(A) 1920 (B) 200 (C) 110 (D) 80
68. 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 the division may be made is :
(A) 420 (B) 630 (C) 710 (D) none
69. In an election three districts are to be canvassed by 2, 3 & 5 men respectively. If 10 men volunteer,
the number of ways they can be alloted to the different districts is :
10 ! 10 ! 10 ! 10 !
(A) (B) (C) (D)
2! 3! 5! 2! 5! 2
(2 !) 5 ! (2 !) 2 3 ! 5 !
70. The number of ways in which 10 identical apples can be distributed among 6 children so that each
child receives atleast one apple is :
(A) 126 (B) 252 (C) 378 (D) none of these
71. The number of all possible selections of one or more questions from 10 given questions, each equation
having an alternative is :
(A) 310 (B) 210 – 1 (C) 310 – 1 (D) 210
72. The number of ways of dividing a pack of 52 cards into 4 equal groups is
52! 52!
(A) (B) 52C4 (C) (D) none of these
13! 4
4!13!
4
73. The number of unordered pairs (A, B), of subsets of the set S = {1, 2, ... , 10}, such that A  B = and
A  B = S, is
(A) 210 (B) 29 (C) 10C2 (D) 1 + 25
74. The number of positive integers of upto 9 digits, in which the digit 1 appears atleast once, is
(A) 89 (B) 109 – 99 (C) 89 – 1 (D) 109 – 1
 Miscellaneous
75. Four ordinary dice are tossed. The number of outcomes, in which all the dice show the same number, is
64
(A) 4  6 ! (B) (C) 6 (D) 46
4
76. The number of arrangements of all the cards in a complete deck, such that cards of the same suit are
together, is
(A)
52!
(B)
13!4 (C) (13!)4.4! (D)
52!
4! 4! 13!4
77. 12 normal dice are thrown once. The number of ways in which each of the values 2, 3, 4, 5 and 6
occurs exactly twice is: [ 1,1, 2,2, 3,3, 4,4, 5,5, 6,6 can come in any order ]
(12) ! (12) ! (12) !
(A) (B) 6 (C) (D) none
6 2 .6! 26
78. An alphabet contains a A’S and b B’S. (In all a + b letters). The number of words, each containing all
the A’S and any number of B’S, is
(A) a + bCb (B) a + b + 1Ca (C) a + b + 1Cb (D) none of these
79. 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 !
(A) 13C3 · (B)
5! 3! 2! 5! 3! 3! 2!
14 !
(C) (D) none
3! 3! 2!

 Properties of nCr & n Pr
1. The value of n.n1 Pr 1 is

n n 1 n 1 n 1
(A) Pr (B) Pr 1 (C) Pr 1 (D) Pr
K 5 11( K  1) K 3
2. If PK 1  PK , then the values of K are
2
(A) 2 and 6 (B) 2 and 11 (C) 7 and 11 (D) 6 and 7
n2 n 2
n
3. C2  n C10 , then n =
(A) 12 (B) 4 only (C) – 3 only (D) 4 or – 3
4. If n C3  nC4  n 1C3 , then

(A) n  6 (B) n  7 (C) n  6 (D) None of these
 Permutations
5. The number of permutations of the letters x 2 y 4 z 3 will be
9! 9! 9!
(A) (B) (C) (D) 9!
2!4! 2!4!3! 4!3!
6. How many different nine-digit numbers can be formed from the digits of the number 223355888 by
rearrangement of the digits so that the odd digits occupy even places
(A) 16 (B) 36 (C) 60 (D) 180
7. How many words can be formed form the letters of the word COURTESY, whose first letter is C and
the last letter is Y
(A) 6 ! (B) 8 ! (C) 2 (6) ! (D) 2 (7) !
8. How many words can be made from the letters of the word DELHI, if L comes in the middle in every
word
(A) 12 (B) 24 (C) 60 (D) 6
9. There are three girls in a class of 10 students. The number of different ways in which they can be
seated in a row such that no two of the three girls are together is
10!
(A) 7!  6 P3 (B) 7!  8 P3 (C) 7!  3! (D)
3!7!
10. The number of natural numbers from 1000 to 9999 (both inclusive) that do not have all 4 different
digits is
(A) 4048 (B) 4464 (C) 4518 (D) 4536

11. The number of different seven digit numbers that can be written using only three digits 1, 2 & 3 under
the condition that the digit 2 occurs exactly twice in each number is :
(A) 672 (B) 640 (C) 512 (D) none
12. Out of seven consonants and four vowels, the number of words of six letters, formed by taking four
consonants and two vowels is (Assume that each ordered group of letter is a word):
(A) 210 (B) 462 (C) 151200 (D) 332640
13. All possible three digits even numbers which can be formed with the condition that if 5 is one of the
digit, then 7 is the next digit is :
(A) 5 (B) 325 (C) 345 (D) 365
14. A new flag is to be designed with six vertical strips using some or all of the colour yellow, green, blue
and red. Then, the number of ways this can be done such that no two adjacent strips have the same
colour is
(A) 12 × 81 (B) 16 × 192 (C) 20 × 125 (D) 24 × 216
15. The number of arrangements of the letters ' a b c d ' in which neither a, b nor c, d come together is:
(A) 6 (B) 12 (C) 16 (D) 8
16. The number of three digit numbers having only two consecutive digits identical is
(A) 153 (B) 162 (C) 180 (D) 161
17. The number of numbers of 9 different nonzero digits such that all the digits in the first four places are
less than the central digit and all the digits in the last four places are greater than the central digit is :
(A) 2(4!) (B) (4!)2 (C) 8 ! (D) none
18. In the decimal system of numeration the number of 6-digit number in which the digit in any place is
greater than the digit to the left of it is
(A) 210 (B) 84 (C) 126 (D) none
19. Four couples (husband and wife) decide to form a committee of four members. The number of different
committee that can be formed in which no couple find a place is
(A) 10 (B) 12 (C) 14 (D) 16
20. The number of n digit numbers which consists of the digits 1 & 2 only if each digit is to be used atleast
once, is equal to 510 then n is equal to:
(A) 7 (B) 8 (C) 9 (D) 10
21. A gentleman invites a party of m + n (m  n) friends to a dinner & places m at one table T1 and n at
another table T2, the table being round. If not all people shall have the same neighbour in any two
arrangement, then the number of ways in which he can arrange the guests, is
(A)
 m  n ! (B)
1  m  n !
(C) 2
 m  n !
(D) none
4 mn 2 mn mn

22. There are 2 identical white balls, 3 identical red balls and 4 green balls of different shades. The number
of ways in which they can be arranged in a row so that atleast one ball is separated from the balls of
the same colour, is :
(A) 6 (7 ! – 4 !) (B) 7 (6 ! – 4 !) (C) 8 ! – 5 ! (D) none
23. Sameer has to make a telephone call to his friend Harish, 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 Sameer has to make to be
successful is
(A) 10,000 (B) 3402 (C) 3200 (D) 5000
 Circular Permutations
24. Let there be 9 fixed points on the circumference of a circle. Each of these points is joined to every one
of the remaining 8 points by a straight line and the points are so positioned on the circumference that
atmost 2 straight lines meet in any interior point of the circle. The number of such interior intersection
points is
25. Number of ways in which n things of which r alike & the rest different can be arranged in a circle
distinguishing between clockwise and anticlockwise arrangement, is :
(n  r  1) ! ( n  1) ! ( n  1) ! ( n  1) !
(A) (B) (C) (D)
r! r ( r  1) ! r!
26. The number of ways in which we can arrange n ladies & n gentlemen at a round table so that 2 ladies
or 2 gentlemen may not sit next to one another is :
(A) (n – 1)! (n – 2)! (B) (n !) (n – 1) ! (C) (n + 1)! (n) ! (D) none
27. Ten people, including A and B, are to be seated at a rectangular table having 5 seats on each of its
longer sides. The number of seating arrangements, so that A and B are neither next to each other nor
directly opposite each other, is
(A) 9 !  2 (B) 8 ! (C) 8 !  28 (D) 8 !  64
 Combinations
28. Let S be the set of all functions from the set A to the set A. If n( A)  k , then n(S ) is
(A) k ! (B) k k (C) 2k 1 (D) 2 k
29. The total number of different combinations of one or more letters which can be made from the letters
of the word ‘MISSISSIPPI’ is
30. The total number of ways of selecting six coins out of 20 one rupee coins, 10 fifty paise coins and 7
twenty five paise coins is
(A) 28 (B) 56 (C) 37 C6 (D) None of these

31. Two teams are to play a series of 5 matches between them. A match ends in a win or lass or draw for
a team. A number of people forecast the result of each match and no two people make the same forecast
for the series of matches. The smallest group of people in which one person forecasts correctly for all
the matches will contain n people, when n is
(A) 81 (B) 243 (C) 486 (D) none
32. The number of ways to fill each of the four cells of the table with a distinct natural number such that
the sum of the numbers is 10 and the sums of the numbers placed diagonally are equal, is
(A) 2 ! × 2! (B) 4 ! (C) 2(4!) (D) None of these
33. A question paper on mathematics consists of twelve questions divided into three parts A, B and C,
each containing four questions. In how many ways can an examinee answer five questions, selecting
atleast one from each part.
(A) 624 (B) 208 (C) 2304 (D) none
34. If m denotes the number of 5 digit numbers if each successive digits are in their descending order of
magnitude and n is the corresponding figure. When the digits and in their ascending order of magnitude
then (m – n) has the value
(A) 10C4 (B) 9C5 (C) 10C3 (D) 9C3
35. There are m points on a straight line AB & n points on the line AC none of them being the point A.
Triangles are formed with these points as vertices, when
(i) A is excluded (ii) A is included. The ratio of number of triangles in the two cases is:
mn2 mn2 mn2 m (n  1)
(A) (B) (C) (D)
mn m  n 1 mn 2 (m  1) ( n  1)
36. The greatest possible number of points of intersection of 9 different straight lines & 9 different circles
in a plane is:
(A) 117 (B) 153 (C) 270 (D) none
37. In the figure, two 4 - digit numbers are to be formed by filling the place with digits. The number of
different ways in which the places can be filled by digits so that the sum of the numbers formed is also
a 4 - digit number and in no place the addition in with carrying, is
Th H T U
(A) 554 (B) 220 (C) 454 (D) none

38. 5 Indian & 5 American couples meet at a party & shake hands. If no wife shakes hands with her own
husband & no Indian wife shakes hands with a male, then the number of hand shakes that takes place
in the party is
(A) 95 (B) 110 (C) 135 (D) 150
39. A committee of 5 is to be chosen from a group of 9 people. Number of ways in which it can be formed
if two particular persons either serve together or not at all and two other particular persons refuse to
serve with each other, is
(A) 41 (B) 36 (C) 47 (D) 76
40. a, b, c  {1, 2, ... 14}. Let P(x) = ax2 + 2bx + c. What is the number of polynomials P(x) such that
x + 1 divides P(x) ? (a, b, c are distinct)
(A) 14C3 (B) 7C2 . 7C2 (C) 7C2 (D) 2(7C2 + 7C2)
41. The number of ways of choosing a white square and a black square, on a chess-board, so that they do
not belong to the same row or column, is
(A) 322 (B) 32  24 (C) 32  25 (D) none of these
 Integer Solutions / Distribution / Dearrangement

42. The number of ways in which 8 non-identical apples can be distributed among 3 boys such that every
boy should get atleast 1 apple & atmost 4 apples is K  7 P3 where K has the value equal to :
(A) 88 (B) 66 (C) 44 (D) 22
43. Number of ways in which 9 different toys be distributed among 4 children belonging to different age
groups in such a way that distribution among the 3 elder children is even and the youngest one is to
receive one toy more, is :
(5!) 2 9! 9!
(A) (B) (C) (D) none
8 2 3!(2!)3
44. There are 12 different marbles to be divided between two children in the ratio 1 : 2 . The number of
ways it can be done is :
(A) 990 (B) 495 (C) 600 (D) none
45. There are n identical red balls & m identical green balls. The number of different linear arrangements
consisting of "n red balls but not necessarily all the green balls" is xCy , then
(A) x = m + n, y = m (B) x = m + n + 1, y = m
(C) x = m + n + 1, y = m + 1 (D) x = m + n, y = n
46. There are (p + q) different books on different topics in Mathematics. (p  q)

If L = The number of ways in which these books are distributed between two students X and Y such
that X get p books and Y gets q books.
M = The number of ways in which these books are distributed between two students X and Y such that
one of them gets p books and another gets q books.
N = The number of ways in which these books are divided into two groups of p books and q books
then,
(A) L = M = N (B) L = 2M = 2N (C) 2L = M = 2N (D) L = M = 2N
47. Let m denote the number of ways in which 4 different books are distributed among 10 persons, each
receiving none or one only and let n denote the number of ways of distribution if the books are all
alike. Then
(A) m = 4n (B) n = 4m (C) m = 24n (D) none
48. The combinatorial coefficient C(n, r) can not be equal to the

(A) number of possible subsets of r members from a set of n distinct members.
(B) number of possible binary messages of length n with exactly r 1's.
(C) number of n on decreasing 2-D paths from the lattice point (0, 0) to (r, n).
(D) number of ways of selecting r things out of n different things when a particular thing is always
included plus the number of ways of selecting 'r' things out of n, when a particular thing is always
excluded.
49. The number of non-negative integral solutions of 3x +y + z = 24 is

50. Observe that 33 + 43 + 53 = 63. The number of cubes of positive integers, which can be expressed as a
sum of three integer cubes, is
(A) 1 (B) 3 (C) 6 (D) infinitely many
51. A positive integer n is called strictly ascending if its digits are in the increasing order. e.g. 2368 and
147 are strictly ascending but 43679 is not. The number of strictly ascending numbers < 109 is
(A) 29 – 1 (B) 29 (C) 29 + 1 (D) 9 !
52. The number of arrangements of all the cards in a deck, such that the red and the black cards alternate, is
(A) (26!)2 (B) 2(26!)2 (C) 2(52!)2 (D) (52!)2
 Miscellaneous
53. There are m men and n women. k distinguishable objects are to be distributed among them. (Each
person can receive any number of objects.) The number of distributions, such that no woman receives
any object, is
(A) mk (B) (m + n)k – mk (C) (m – n)k (D) none of these
54. Consider the letters of the word EQUATIONS. What is the number of arrangements of the letters in
this word so that the vowels appear, not necessarily successively, in the dictionary order ?
9! 9! 9!
(A) (B) (C) 9 ! (D)
5!4! 4! 5!
55. The adjoining diagram shows 8 clay targets, arranged in 3 columns, to be shot by 8 bullets. The number
of ways in which they can be shot, such that no target is shot before all the targets below it, if any, are
first shot, is

56. A and B are finite sets. There are 2 elements in A  B and 21 elements in A  B. Hence the number of
elements in A  B ( ( A  B) ( A  B)) is
A B
(A) 6 (B) 10 (C) 8 (D) 7
57. Eight identical rooks are to be placed on an 8  8 chess-board. The number of ways of doing this, so
that no two rooks are in attacking positions, is
(A) 8 (B) 8! (C) 88 (D) 82
Numerical Answer Type

1. An English school and a Vernacular school are both under one superintendent. Suppose that the
superintendentship, the four teachership of English and Vernacular school each, are vacant, if there be
altogether 11 candidates for the appointments, 3 of whom apply exclusively for the superintendentship
and 2 exclusively for the appointment in the English school, the number of ways in which the different
appointments can be disposed of is
2. An old man while dialing a 7 digit telephone number remembers that the first four digits consists of
one 1's, one 2's and two 3's. He also remembers that the fifth digit is either a 4 or 5 while has no
memorising of the sixth digit, he remembers that the seventh digit is 9 minus the sixth digit. Maximum
number of distinct trials he has to try to make sure that he dials the correct telephone number, is
3. There are 10 red balls of different shades & 9 green balls of identical shades. Then the number of
arranging them in a row so that no two green balls are together is :
4. A shelf contains 20 different books of which 4 are in single volume and the others form sets of 8, 5
and 3 volumes respectively. Number of ways in which the books may be arranged on the shelf, if the
volumes of each set are together and in their due order is
5. If all the letters of the word "QUEUE" are arranged in all possible manner as they are in a dictionary,
then the rank of the word QUEUE is :
6. All the five digits number in which each successive digit exceeds its predecessor are arranged in the
increasing order of their magnitude. The 97th number in the list does not contain the digit
7. The number of different ways in which five 'dashes' and eight 'dots' can be arranged, using only seven
of these 13 'dashes' & 'dots' is :
8. In a unique hockey series between India & Pakistan, they decide to play on till a team wins 5 matches.
The number of ways in which the series can be won by India, if no match ends in a draw is :

9. Delegates from 9 countries includes countries A, B, C, D are to be seated in a row. The number of
possible seating arrangements, when the delegates of the countries A and B are to be seated next to
each other and the delegates of the countries C and D are not to be seated next to each other is :
10. 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 Q n is the corresponding figure when they are in a circle. If Pn – Qn = 6, then 'n' is
equal to
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 ways of choosing a committee of 2 women & 3 men from 5 women & 6 men, if Mr. A
refuses to serve on the committee if Mr. B is a member & Mr. B can only serve, if Miss C is the
member of the committee, is :
13. Six people are going to sit in a row on a bench. A and B are adjacent. C does not want to sit adjacent
to D. E and F can sit anywhere. Number of ways in which these six people can be seated, is
14. Boxes numbered 1, 2, 3, 4 and 5 are kept in a row, and they are necessarily to be filled with either a
red or a blue ball, such that no two adjacent boxes can be filled with blue balls. Then how many
different arrangements are possible, given that the balls of a given colour are exactly identical in all
respects?
15. Given 11 points, of which 5 lie on one circle, other than these 5, no 4 lie on one circle. Then the maximum
number of circles that can be drawn so that each contains atleast three of the given points is:
16. The number of zeroes, at the end of 50!, is
17. How many nine digit numbers can be formed from the number 223355888 by rearranging its digits,
so that the odd digits occupy the even positions ?
18. m, n are positive integers such that gcd (m, n) = 1 and mn = 25!. The number of rational numbers
m
 1 is
n
19. n, r are positive integers n > r > 5. If 13C3 + 2.13C4 + 13C5 = nCr, then r equals
20. The number of teams for a mixed doubles tennis match, that can be formed from eight couples, is
21. Eight players take part in a tournament where each player competes with some other player. The
number of pairings is
22. Ten parabolae are drawn in a plane. Any two parabolae intersect in two real, and distinct,
points. No three parabolae are concurrent. The total number of disjoint regions of the
plane is
23. The number of lattice points in the 1st quadrant, lying on the straight line 3x + 5y = 283, is

24. The maximum number of intersection points of n circles and n straight lines, among themselves, is 80.
The value of n is
25. 900 n digit number, using only the digits 2, 5 and 7, are to be formed. The least value of n is
26. A = {1, 11, 21, 31, ... , 541, 551}. B is a subset of A such that x + y  552, for any x, y  B. The
maximum number of elements in B is
27. The maximum number of different permutations of 4 letters of the word "EARTHQUAKE" is :
Only One Option Correct

1. Number greater than 1000 but less than 4000 is formed using the digits 0, 2, 3, 4 repetition allowed is
(A) 125 (B) 105 (C) 128 (D) 625 [2002]
2. Five digit number divisible by 3 is formed using 0, 1, 2, 3, 4, 6 and 7 without repetition. Total number
of such numbers are [2002]
(A) 312 (B) 3125 (C) 120 (D) 216
3. The sum of integers from1to100 that are divisible by 2 or 5 is [2002]

(A) 3000 (B) 3050 (C) 3600 (D) 3250
4. Total number of four digit odd numbers that can be formed using 0, 1, 2, 3, 5, 7 are [2002]
(A) 216 (B) 375 (C) 400 (D) 720
5. The number of ways in which 6 men and 5 women can dine at around table if not women are to sit
together is given by [2003]
(A) 30 (B) 5!  4! (C) 7!  5! (D) 6!  5!
6. A student is to answer 10 out of 13 questions in an examination such that he must choose at least 4
from the first five questions. The number of choices available to him is [2003]
(A) 196 (B) 280 (C) 346 (D) 140
7. If nCr denotes then umber of combinations of n things taken r at a time, then the expression nCr+1 +
n
Cr–1 + 2 × nCr equals [2003]
n+2 n+1 n+1 n+2
(A) Cr+1 (B) Cr (C) Cr+1 (D) Cr
8. How many ways are there to arrange the letters in the word GARDEN with the vowels in alphabetical
order? [2004]
(A) 360 (B) 240 (C) 120 (D) 480
9. Then number of ways of distributing 8 identical balls in 3 distinct boxes so that none of the boxes is
empty is [2004]
8 8
(A) 3 (B) 21 (C) 5 (D) C.3

10. If the letters of the word SACHIN are arranged in all possible ways and these words are written out as
in dictionary, then the word SACHIN appears at serial number [2005]
(A) 602 (B) 603 (C) 600 (D) 601
6
11. The value of 50
C4   56r C3 [2005]
r 1
56 56 55 55
(A) C4 (B) C3 (C) C3 (D) C4
12. At an election, a voter may vote for any number of candidates, not greater than the number to be
elected. There are 10 candidates and 4 are to be elected. If a voter votes for at least one candidate, then
the number of ways in which he can vote is [2006]
(A) 5040 (B) 6210 (C) 385 (D) 1110
13. The sum of the series 20C0 – 20C1 + 20C2 – 20C3 +.....–......+ 20C10 is [2007]
(A) 0 (B) 20C10 (C) –20C10 (D) 20
C10
Directions: Question number 14 is Assertion Reason type. The question contains two statements:
Statement-1(Assertion) and Statement-2(Reason). Each of these questions also has four alternative
choices, only one of which is the correct answer. You have to select the correct choice.
(A) Statement-1is true, Statement-2 is false
(B) Statemen-1is false, Statement-2 is true
(C) Statement1istrue, Statement2 is true; Statement2 is a correct explanation for Statement1
(D) Statement1istrue, Statement2 is true; Statement2 is not a correct explanation for Statement1
14. In a shop there are five types of ice creams available. A child buys six ice creams. [2008]
Statement-1: The number of different ways the child can buy the six ice creams is 10C5.
Statement-2: The number of different ways the child can buy the six ice creams is equal to the number
of different ways of arranging 6A’s and 4B’s in a row.
15. How many different words can be formed by jumbling the letters in the word MISSISSIPPI in which
no two S are adjacent? [2008]
(A) 7∙ C4∙ C4
6 8
(B) 8∙ C4∙ C4
6 7
(C) 6∙7∙ C4
8
(D) 6∙8∙ C4
7
16. The total number of ways in which 5 balls of different colours can be distributed among 3 persons so
that each person gets at least one ball is [2012]
(A) 75 (B) 150 (C) 210 (D) 243
17. Let Tn be the number of all possible triangles formed by joining vertices of an n-sided regular polygon.
If Tn1  Tn  10 , then the value of n is : [2013]
(A) 7 (B) 5 (C) 10 (D) 8
18. If in a regular polygon the number of diagonals is 54, then the number of sides of this polygon is
(A) 12 (B) 6 (C) 10 (D) 9 [2015]
19. The number of ways in which 5 boys and 3 girls can be seated on a round table if a particular boy B1
and a particular girl G1 never sit adjacent to each other, is: [2017]
(A) 5  6! (B) 6  6! (C) 7! (D) 5  7!
20. The number of numbers between 2,000 and 5,000 that can be formed with the digits 0, 1, 2, 3, 4,
(repetition of digits is not allowed) and are multiple of 3 is? [2018]
(A) 30 (B) 48 (C) 24 (D) 36
21. The number of four-digit numbers strictly greater than 4321 that can be formed using the digits 0, 1,
2, 3, 4, 5 (repetition of digits is allowed) is: [2019]
(A) 288 (B) 360 (C) 306 (D) 310
22. The number of ways of choosing 10 objects out of 31 objects of which 10 are identical and the
remaining 21 are distinct is: [2019]
(A) 2  1
20
(B) 2 21
(C) 2 20
(D) 2  1
20
23. Two families with three members each and one family with four members are to be seated in a row.
In how many ways can they be seated so that the same family members are not separated?
(A) 2! 3! 4! (B) (3!)3  (4!) (C) (3!)2  (4!) (D) 3!(4!)3 [2020]
24. The value of (2  1P0  3  2 P1  4  3P2  ....up to 51th term)  (1!  2!  3!  ....up to 51th term) is equal to
(A) 1 – 51(51)! (B) 1 + (51)! (C) 1 + (52)! (D) 1 [2020]
25. The number of ordered pairs (r, k) for which 6  35Cr  (k 2  3)  36Cr 1 , where k is an integer, is
(A) 3 (B) 2 (C) 6 (D) 4 [2020]
26. Team 'A' consists of 7 boys and n girls and Team 'B' has 4 boys and 6 girls. Ifa total of 52 single
matches can be arranged between these two teams when a boy plays against a boy and a girl plays
against a girl, then n is equal [2021]
(A) 5 (B) 6 (C) 2 (D) 4
27. A scientific committee is to be formed from 6 Indians and 8 foreigners, which includes at least 2
Indians and double the number of foreigners as Indians. Then the number of ways, the committee can
be formed, is: [2021]
(A) 1625 (B) 575 (C) 560 (D) 1050
28. The total number of 5-digit numbers, formed by using the digits 1, 2, 3, 5, 6, 7 without repetition,
which are multiple of 6, is [2022]
(A) 36 (B) 48 (C) 60 (D) 72
Numerical Value Answer

29. If the letters of the word 'MOTHER' be permuted and all the words so formed (with or without
meaning) be listed as in a dictionary, then the position of the word 'MOTHER' is [2020]
30. A class contains b boys and g girls. If the number of ways of selecting 3 boys and 2 girls from the
class is 168, then b + 3g is equal to _______. [2020]
31. The number of words, with or without meaning, that can be formed by taking 4 letters at a time from
the letters of the word 'SYLLABUS' such that two letters are distinct and two letters are alike, is __.
[2020]

32. A test consists of6 multiple choice questions, each having 4 alternative answers of which only one is
correct. The number of ways, in which a candidate answers all six questions such that exactly four of
the answers are correct, is ________. [2020]
33. The total number of3-digit numbers, whose sum of digits is 10, is _________. [2020]
qs
34. If 1P1  2. 2 P2  3. 3P3  ...  15.15 P15  q Pr  s , 0  s  1 , then Pr  s is equal to ______. [2021]
35. The sum of all 3-digit numbers less than or equal to 500, that are formed without using the digit "1"
and they all are multiple of 11, is ________. [2021]
36. The number of natural numbers lying between 1012 and 23421 that can be formed using the digits 2,
3, 4, 5, 6 (repetition of digits is not allowed) and divisible by 55 is _______. [2022]
37. The number of 5-digit natural numbers, such that the product of their digits is 36, is [2022]
38. The letters of the word 'MANKIND' are written in all possible orders and arranged in serial order as
in an English dictionary. Then the serial number of the word 'MANKIND' is [2022]
39. The total number of four digit numbers such that each of the first three digits is divisible by the last
digit, is equal to _______. [2022]
40. The total number of 3-digit numbers, whose greatest common divisor with 36 is 2, is [2022]
41. The total number of three-digit numbers, with one digit repeated exactly two times, is [2022]
42. In an examination, there are 5 multiple choice questions with 3 choices, out of which exactly one is
correct. There are 3 marks for each correct answer, –2 marks for each wrong answer and 0 mark if the
question is not attempted. Then, the number of ways a student appearing in the examination gets 5
marks is [2022]

ONLY ONE OPTION CORRECT

1. No. of different garlands using 3 flowers of one kind and 12 flowers of seconds kind is
(A) 19 (B) 11! × 2! (C) 14C2 (D) none of these
2. Number of even divisiors of 504 is

(A) 12 (B) 24 (C) 6 (D) 18
3. 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
4. The number of ways of arranging six persons (having A, B, C and D among them) in a row so that A,
B, C and D are always in order ABCD (not necessarily together) is
(A) 4 (B) 10 (C) 30 (D) 720
5. Let A = {x : x is a prime number and x < 30}. The number of different rational numbers whose
numerator and denominator belong to A is
6. Let S be the set of all functions from the set A to the set A. If n (A) = k, then n(S) is
(A) k ! (B) kk (C) 2k – 1 (D) 2k
7. Let A be the set of 4-digit number a1a 2a 3a 4 where a1  a 2  a 3  a 4 , then n(A) is equal to
8. There are three coplanar parallel lines. If any p points are taken on each of the lines, the maximum
number of triangles with vertices at these points is
(A) 3p2 (p – 1) + 1 (B) 3p2 (p – 1) (C) p2 (4p – 3) (D) none of these
9. In the next word cup of cricket there will be 12 teams, divided equally in two groups. Teams of each
group will play a match against each other. From each group 3 top teams will qualify for the next
round. In this round each team will play against others once. Four top teams of this round will qualify
for the semi-final round, where each team will play against the other three. Two top teams of this
round will go to the final round, where they will play the best of three matches. The minimum number
of matches in the next world cup will be
10. In a plane there are two families of lines y = x + r, y = – x + r, where r  {0, 1, 2, 3, 4}. The number
of squares of diagonals of length 2 formed by the lines is
11. The number of flags with three strips in order, that can be formed using 2 identical red, 2 identical
blue and 2 identical white strips is
(A) 24 (B) 20 (C) 90 (D) 8

12. The number of rational numbers p/q, where p, q  {1, 2, 3, 4, 5, 6} is
13. A is a set containing n elements. A subset P of A is chosen the set A is reconstructed by replacing the
elements of P. A subset Q of A is again chosen. The number of ways of choosing P and Q so that
P  Q contains exactly one elements is
(A) 4n (B) 3n – 1 (C) 3n (D) n3n – 1
14. Triplet (x, y, z) is chosen from the set {1, 2, 3, .... n}, such that x < y < z. The number of such triplets is
(A) n 3 (B) n C3 (C) n C 2 (D) n C2  n C3
15. There are k different books and l copies of each in a college library. The number of ways in which a
student can make a selection of one or more books is
(A)  k  1l (B)  l  1k (C)  k  1l  1 (D)  l  1k  1
16. Along a railway line there are 20 stations. The number of different tickets required in order so that it
may be possible to travel from every station to every station is
(A) 380 (B) 225 (C) 196 (D) 105
17. The number of ways in which 4 letters of the word MATHEMATICS can be arranged is given by
(A) 136 (B) 192 (C) 1680 (D) 2454
18. Let y be an element of the set A = {1, 2, 3, 5, 6, 10, 15, 30} and x1, x 2 , x3 be positive integers such
that x1x 2 x3  y , then the number of positive integral solutions of x1x 2 x3  y is
19. 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
20. Let S be the set of 6-digits a1a 2a 3a 4a 5a 6a 7 (all digits distinct) where a1  a 2  a 3  a 4  a 5  a 6 . Then
n(S) is equal to
(A) 210 (B) 2100 (C) 4200 (D) 420
21. The number of positive integral solutions of the equation x1x 2 x3  60 is

22. Consider a set {1, 2, 3, ......, 100}. The number of ways in which a number can be selected from the
set so that it is of the form x y , where x, y,  N and  2 , is
(A) 12 (B) 16 (C) 5 (D) 11
23. The number of n-digit numbers, no two consecutive digits being the same, is
(A) n ! (B) 9 ! (C) 9n (D) n9
24. The number of divisors of 3630, which have a remainder of 1 when divided by 4, is
25. The number of ways of selecting two numbers from the set {1, 2, ......., 12} whose sum is divisible by 3 is
(A) 66 (B) 16 (C) 6 (D) 22
26. Number of positive integral solutions of x1x 2 x3  30 is

(A) 27 (B) 6 (C) 9 (D) 18
MORE THAN ONE OPTIONS MAY BE CORRECT

2n
1. 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 !( 2 n Cn )
2. If 100!  235 7..., then :

1 1 1
(A)   97 (B)   (  1) (C)    (D)   
2 2 3
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) C10  C3
13 5
(D) 5C3  8C7  5C4  8C6  5C5  8C5
4. If k is odd then k Cr is maximum for r equal to :

1 1
(A) (k  1) (B) (k  1) (C) k  1 (D) k
2 2
5. The number of non-negative integral solutions of x1  x2  x3  x4  n (where n is a positive integer) is:

n 3 n4 n 5 n4
(A) C3 (B) C4 (C) C5 (D) Cn
6. 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
7. If S  0!11! 2  2! ...  n  n! , then :

(A) n | S (B) (n  1) | S (C) n!| S (D) (n 1)!| S
8. Letters of the word SUDESH can be arranged in:

(A) 120 ways when two vowels are together
(B) 180 ways when vowels occur in alphabetical order
(C) 24 ways when vowels and consonants occupy their respective place
(D) 240 ways when vowels do not occur together

9. The number of ways in which 10 candidates A1, A2 ,..., A10 can be ranked so that A1 is always above
A2 is:
10!
(A) (B) 27 34 52 71 (C) 28 52 (D) 34 52 7
2
10. There are 10 seats in the first row of a theater 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  7 P3 (C) 4! 7C3 (D) 840
11. On Diwali, all the students of a class send greeting cards to one another. If the postmen deliver 1640
greeting cards to the students of this class, then the number of students in the class is :
(A) 40 (B) 41 (C) A prime (D) An even number
12. Let x be the number of 5 digit numbers sum of whose digits is even and y be the number of 5 digit
numbers sum of whose digits is odd, then:
(A) x  y (B) x  y  90,000 (C) x  45,000 (D) x  y
13. A man is dealt a poker hand (consisting of 5 cards) from an ordinary pack of 52 playing cards. The
number of ways in which he can be dealt a “straight” (a straight is five consecutive values not of the
same suit, eg. {Ace 2 . 3 . 4 . 5}, (2, 3, 4, 5, 6} ............ & {10 . J . Q. K. Ace} is
(A) 10 (45 – 4) (B) 4! 210 (C) 10 . 210 (D) 10200
14. The sides AB, BC and CA of a triangle ABC have 3, 4 and 5 interior points respectively on them. The
number of triangles that can be constructed using these interior points as vertices is :
(A) 60 (B) 205 (C) 115 (D) 405
15. An ice cream parlour has ice creams in eight different varieties. Number of ways of chossing 3 ice
creams taking atleast two ice creams of the same variety, is :
(A) 56 (B) 64 (C) 10C2  8C2 (D) 10C3  8C3
16. A seven digit number is divisible by 3 is to be formed using 7 out of numbers 1, 2, 3, ..., 9. The number
of ways in which this can be done is :
(A) 12(7!) (B) 7(8!) (C) 2(8!) (D) None of these
17. 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
1000
18. The number C500 is divisible by :
(A) 7 (B) 13 (C) 191 (D) 201

19. Identify the correct statements (s)
(A) Number of zeroes standing at the end of 125! is 30
(B) A telegraph has 10 arms and each arm is capable of 9 distinct positions excluding the position of
rest. The number of signals that can be transmitted is 1010 – 1
(C) Number of numbers greater than 4 lacs which can be formed by using only the digits 0 2 2 4 4
and 5 is 90
(D) In a table tennis tournament every player plays with every other player. If the number of games
played is 5050 then the number of players in the tournament is 100
20. Let N  (20)! and M  20C10

(A) The number of zeros at the end of N is 4 (B) the last digit of N /10 is 8
(C) Exponent of 5 in M is 0 (D) Exponent of 7 in M is 0
COMPREHENSION TYPE QUESTIONS
Comprehension - I
Consider the 10 letter-word W = CURRICULUM.
1. Number of ways in which 5 lettered words can be formed using the letters from the word ‘W’ if each
5 lettered word has exactly 3 different letters, is
(A) 360 (B) 560 (C) 610 (D) 720
2. Number of ways in which all the letters of the word W can be arranged if vowels are to be separated
is k (7!), then the value of k is equal to
(A) 5 (B) 4 (C) 3 (D) 2
3. Number of ways in which all the letters of the word W can be arranged if relative order of vowels and
consonants do not change is equal to
(A) 360 (B) 720 (C) 1080 (D) 1440
Comprehension - II
Consider the set S = {0, 1, 2, ......., 9}.
4. Number of all five digit numbers that can be formed using the digits from S if their digits are in due
order, is
(A) 126 (B) 252 (C) 310 (D) 378
5. Number of all five digit numbers that can be formed using the digits from S containing 2 alike and 3
other alike digit, is
(A) 810 (B) 750 (C) 720 (D) None
6. Number of 10-digit prime numbers that can be formed using each and every digit of S, is
(A) 0 (B) 1 (C) 10 (D) 100

Comprehension - III
If n( A) denotes the number of elements in the finite set A and A1, A2 ,... are finite sets, then :
 n  n  n 
n  Ai    n( Ai )  n( Ai  A j )   n( Ai  A j  Ak )  ...  (1) n1 n  Ai 
 i 1  i 1 i j i  j k  i 1 
7. Five letters are put in 5 addressed envelops randomly, the number of ways in which no letters goes to
the correct envelop is :
(A) 41 (B) 43 (C) 44 (D) 46
8. The number of positive integers  100 which are not divisible by 2, 3 or 5 is :

(A) 25 (B) 26 (C) 29 (D) 30
9. The number of integral solutions of x1  x2  x3  x4  30 such that 0  xi  10, is :

(A) 84 (B) 87 (C) 90 (D) None
Comprehension - VI
n  n   n 
If p is a prime. then exponent of p in n! equals E p (n)      2    3   ....
 p  p   p 
1000
10. The exponent of 7 in C500 is :
(A) 0 (B) 1 (C) 2 (D) 3
11. The number of zeros at the 50!

(A) 11 (B) 10 (C) 12 (D) 9
200
12. The largest two digit prime that divides C100 is :
ASSERTION REASONING TYPE
(A) Statement-1 is true, statement-2 is true and statement-2 is correct explanation for statement-1.
(B) Statement-1 is true, Statement-2 is true but Statement-2 is NOT the correct explanation for Statement-1.
(C) Statement-1 is true, Statement-2 is false.
(D) Statement-1 is false, Statement-2 is true.
1. Statement-1 : The product of three consecutive natural numbers is divisible by 6.

Statement-2 : The product of n consecutive natural numbers is divisible by n!
 40  60   40  60 
2. Statement-1 : The expression         ... attains maximum value when r  50 .
 r  0   r  1 1 
 2n 
Statement-2 :   is maximum when r  n .
 r 

120 
3. Statement-1 : The number of non-negative integral solutions of x1  x2  ...  x20  100 is  .
 20 
Statement-2 : The number of ways of distributing n identical objects among r persons giving zero or
 n  r  1
more objects to a person is  .
 r 1 
4. Let n, m N and n  m .
 n   n  1  n  2   m  n  2
Statement-1 :    2    3   .....  (n  m  1)     
 m  m   m   m   m  1
 n   n  1  n  2   m   n 1 
Statement-2 :        ...      
 m  m   m   m   m  1
5. Statement-1 : Then number of onto function f from A  {1, 2, 3, 4, 5, 6} to B  {7, 8, 9} such that
f (i)  f ( j) i  j is 6.
Statement-2 : The number of permutations of 7, 8, 9 taken 3 at a time is 6.
MATRIX-MATCH TYPE
1. Consider 6 children C1, C2, C3, C4, C5 and C6 of different heights, child with higher suffix is taller.
Column – I Column – II
(A) Number of ways in which these six children can line up in a single row (P) 20
so that none of them is standing between the two children taller than
him, is
(B) Number of ways in which they appear in a line if 3 children C1, C2 and (Q) 32
C3 are in ascending order of their height (not necessarily successive)
is,
(C) Number of ways in which 10 alike marbles can be distributed among (R) 90
them if every child gets atleast one marble but not more than 4, is
(D) Number of ways in which they can be stand in a rectangular array of 3 (S) 120
rows and two columns so that any child in a column is taller than the
child in the same column immediately in front of him, is
Eg.
Column  I Column  II
C3 C6
C2 C5
C1 C4

2. Suppose a set A consists of 10 distinct elements x1, x2 , x3 , ....., x10 .
The number of subsets of A which contain
Column I Column II
(A) None of x1, x2 , x3 (P) 512
(B) Each of x1, x2 , x3 (Q) 896
(C) At least one of x1, x2 , x3 (R) 128
(D) At most one of x1, x2 , x3 (S) 256
3. Consider all possible permutations of the letters of the word ENDEANOEL.

Column – I Column – II
(A) The number of permutations containing the word ENDEA is (P) 5!
(B) The number of permutations in which the letter E occurs in (Q) 2  5!
the first and the last positions is
(C) The number of permutations in which none of the letters D, L, (R) 7  5!
N occurs in the last five positions is
(D) The number of permutations in which the letters A, E, O occur (S) 21 5!
only in odd position is
INTEGER ANSWER TYPE QUESTIONS

1. Number of ways in which 7 people can occupy six seats, 3 seats on each side in a first class railway
compartment if two specified persons are to be always included and occupy adjacent seats on the same
side, is (5 !) · k, then k has the value equal to ______.
2. Let Pn denotes the number of ways in which three people can be selected out of 'n' people sitting in a
row, if no two of them are consecutive. If, Pn1  Pn  15 then the value of 'n' is ______.
3. Number of three digit number with atleast one 3 and at least one 2 is ______.
4. Total number of ways in which 6 ‘+’ & 4 ‘–’ signs can be arranged in a line such that no 2
‘–’ signs occur together is ______.
5. Define a 'good word' as a sequence of letters that consists only of the letters A, B and C and in which
A never immediately followed by B, B is never immediately followed by C, and C is never
immediately followed by A. If the number of n-letter good words are 384, then the value of n is _____.
6. Fifty college teachers are surveyed as to their possession of colour TV, VCR and tape recorder. Of
them, 22 own colour TV, 15 own VCR and 14 own tape recorders. Nine of these college teachers own
exactly two items out of colour TV, VCR and tape recorders; and, one college teacher owns all three.
How many of the 50 college teachers own none of three, colour TV, VCR or tape recorder?

7. A road network as shown in the figure connect four cities. In how many ways can you start from any
city (say A) and come back to it without travelling on the same road more than once?
8. There are 6 boxes numbered 1, 2, ..... 6. Each box is to be filled up either with a red or a green ball in
such a way that at least 1 box contains a green ball and the boxes containing green balls are
consecutive. The total number of ways in which this can be done, is ______.
1000!
9. The least value of the positive integer n, for which is not an integer, is ______.
13n
10. Consider the lines x = k and y = k, k {1, 2, ... , 9}.

The number of non-congruent rectangles, whose sides are along these lines, is ______.
11. The number of representations of the number 7056, as a product of 2 factors, is ______.
12. The number of 3 element subsets of {1, 2, ... , n}, in which the least element is 3 or the greatest element
is 7, is 33. The value of n is ______.
13. A point ‘P’ is at a distance of 12 cm from the centre of a circle of radius 13cm. The number of chords
of the circle passing through P, and which have integral lengths, is ______.
P
n
14. The expression C0  20C1  20C1  20C2  ...  20C19 20C20 equals nCr , where r    . The value of r is
20
2
______ {where [ ] is the step function}.
15. One hundred management students who read at least one of the three business magazines are surveyed
to study the readership pattern. It is found that 80 read Business India, 50 read Business world, and 30
read Business Today. Five students read all the three magazines. How many read exactly two
magazines?
16. Two classrooms A and B having capacity of 25 and (n – 25) seats respectively. An denotes the number
of possible seating arrangements of room 'A', when 'n' students are to be seated in these rooms, starting
from room 'A' which is to be filled up full to its capacity. If An – An – 1 = 25! (49C25) then the value of
'n' is ______.
17. The number of ways in which the number 108900 can be resolved as a product of two factors is ____.

18. In maths paper there is a question on "Match the column" in which column A contains 6 entries &
each entry of column A corresponds to exactly one of the 6 entries given in column B written
randomly. 2 marks are awarded for each correct matching & 1 mark is deducted from each incorrect
matching A student having no subjective knowledge decides to match all the 6 entries randomly. The
number of ways in which he can answer, to get atleast 25 % marks in this question is ______.
19. There is an alphabet of k letters, k  5 . The total number of palindromes, each of 5 letters, that can be
formed, is 729. The value of k is ______.
20. In a chess tournament, each participant was supposed to play exactly one game with each of the others.
However, two participants withdraw after having played exactly 3 games each, but not with each other.
The total number of games played in the tournament was 84. How many participants were there in all?
Only One Option Correct

1. How many different nine digit numbers can be formed from the number 223355888 by rearranging its
digits so that the odd digits occupy even positions? [2000]
(A) 16 (B) 36 (C) 60 (D) 180
2. 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
[2000]
(A)  m  n  12 (B) 4mn1 (C) m2 n2 (D) mn  m  1 n  1
3. Let Tn denote the number of triangles which can be formed using the vertices of a regular polygon of
'n' sides. If Tn1  Tn  21, , then ' n ' equals: [2001]
(A) 5 (B) 7 (C) 6 (D) 4
4. The number of arrangements of the letters of the word BANANA in which the two N’s do not appear
adjacently is [2002S]
(A) 40 (B) 60 (C) 80 (D) 100
5. Number of points with integral co-ordinates that lie inside a triangle whose co-ordinates are
(0, 0), (0, 21) and (21,0) [2003]
(A) 210 (B) 190 (C) 220 (D) None
6. If r, s, t are prime numbers and p, q are the positive integers such that their LCM of p, q is r 2t 4 s2 ,
then the numbers of ordered pair of (p, q) is [2006]
(A) 252 (B) 254 (C) 225 (D) 224

7. The letters of the word COCHIN are permuted and all the permutations are arranged in an alphabetical
order as in an English dictionary. The number of words that appear before the word COCHIN is
(A) 360 (B) 192 (C) 96 (D) 48 [2007]
8. The number of seven digit integers, with sum of the digits equal to 10 and formed by using the digits
1, 2 and 3 only, 5 [2009]
(A) 55 (B) 66 (C) 77 (D) 88
9. Six cards and six envelopes are numbered 1, 2, 3,4, 5,6 and cards are to be placed in envelopes so that
each envelope contains exactly one card and no card is placed in the envelope bearing the same number
and moreover the card numbered 1 is always placed in envelope numbered 2. Then the number of
ways it can be done is [Adv. 2014]
(A) 264 (B) 265 (C) 53 (D) 67
10. A debate club consists of 6 girls and 4 boys. A team of 4 members is to be selected from this club
including the Selection of a captain (from among these 4 memoers) for the team. If the team has to
include at most one boy, then the number of ways of selecting the team is [Adv. 2016]
(A) 380 (B) 320 (C) 260 (D) 95
Integer Value Answer / Non-Negative Integer

11. Let n1  n2  n3  n4  n5 be positive integers such that n1  n2  n3  n4  n5  20 . Then the number of
such distinct arrangements (n1 , n2 , n3 , n4 , n5 ) is [Adv. 2014]
12. Let n be the number of ways in which 5 boys and 5 girls can stand in a queue in such a way that all
the girls stand consecutively in the queue. Let m be the number of ways in which 5 boys and 5 girls
can stand in a queue in such a way that exactly four girls stand consecutively in the queue. Then the
m
value of is [Adv. 2015]
n
13. Words of length 10 are formed using the letters A, B, C, D, E, F, G, H, I, J. Let x be the number of
such words where no letter is repeated; and let y be the number of such words where exactly one letter
y
is repeated twice and no other letter is repeated. Then,  [Adv. 2017]
9x
14. The number of 5 digit numbers which are divisible by 4, with digits from the set {1, 2, 3, 4, 5} and the
repetition of digits is allowed, is _________. [Adv. 2018]
15. Five persons A, B, C, D and E are seated in a circular arrangement. If each of them is given a hat of
one of the three colours red, blue and green, then the number of ways of distributing the hats such that
the person seated in adjacent seats set different coloured hats is _____. [Adv. 2019]
16. In a hotel, four rooms are available. Six persons are to be accommodated in these four rooms in such
a way that each of these rooms contains at least one person and at most two persons. Then the number
of all possible ways in which this can be done is [Adv. 2020]

17. An engineer is required to visit a factory for exactly four days during the first 15 days of every month
and it is mandatory that no two visits take place on consecutive days. Then the number of all possible
ways in which such visits to the factory can be made by the engineer during 1-15 June 2021 is ____.
[Adv. 2020]
18. The number of 4-digit integers in the closed interval [2022m 4482] formed by using the digits 0, 2, 3,
4, 6, 7 is ________. [Adv. 2022]
Match the Following
19. Consider all possible permutations of the letters of the word ENDEANOEL Match the statements /
Expression in Column-I with the statements / Expressions in Column-II. [2008]
Column-I Column-II
(A) The number of permutations containing the word ENDEA is (P) 5!
(B) The number of permutations in which the letter E occurs in the (Q) 2 × 5!
first and the last position is
(C) he number of permutations in which none of the letters D, L, N (R) 7 × 5!
occurs in the last five positions is
(D) The number of permutations in which the letters A, E, O occurs (S) 21 × 5!
only in odd positions is
20. In a high school, a committee has to be formed from a group of 6 boys M1 , M 2 , M 3 , M 4 , M 5 , M 6 and
5 girls G1 , G2 , G3 , G4 , G5 .
(i) Let 1 be the total number of ways in which the committee can be formed such that the committee
has 5 members, having exactly 3 boys and 2 girls.
(ii) Let 2 be the total number of ways in which the committee can be formed such that the committee
has at least 2 members, and having an equal number of boys and girls.
(iii) Let 3 be the total number of ways in which the committee can be formed such that the committee
has 5 members, at least 2 of them being girls.
(iv) Let 4 be the total number of ways in which the committee can be formed such that the committee
has 4 members, having at least 2 girls such that both M 1 and G1 are NOT in the committee
together.
LIST – I LIST – II
P. The value of 1 is 1. 136
Q. The value of 2 is 2. 189
R. The value of 3 is 3. 192
S. The value of 4 is 4. 200
5. 381
6. 461
The correct option is: [Adv. 2018]
(A) P  4; Q  6; R  2; S  1 (B) P  1; Q  4; R  2; S  3
(C) P  4; Q  6; R  5; S  2 (D) P  4; Q  2; R  3; S  1

Permutations & Combinations: A) Multiplication Principle

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Permutations & Combinations: A) Multiplication Principle

Uploaded by

Copyright:

Available Formats

PERMUTATIONS & COMBINATIONS

II BASIC COUNTING PRINCIPLES

An ordered pair ( , ), where A,  B, can be formed in  ways.

It can further be extended as

Let A  B =  (the empty set).

Website: www.iitianspace.com | online.digitalpace.in 1

Let A = { 1 , 2 , ... , } and B = { 1 , 2 , ... , }.

v) = 1! + 2! + 3! + ... + ! is not a square, for  4.

The total number of permutations of distinct objects = !

Website: www.iitianspace.com | online.digitalpace.in 2

(On permutations of objects not all distinct)

6. If 20Pr = 13× 20Pr–1 , then the value of r is ___________.

Website: www.iitianspace.com | online.digitalpace.in 3

The number of of distinct objects is ( – 1)!

Proof : Consider a linear permutation of distinct objects 1, 2, 3

shown in the adjacent figure. 3

In fact, both the circular arrangements are same.

circular permutations. There are linear

same circular permutation.

permutations from the number of linear

Website: www.iitianspace.com | online.digitalpace.in 4

Proof : C – 1 represents the number of selections of – 1 objects out of distinct objects.

Website: www.iitianspace.com | online.digitalpace.in 5

Corr. ( C0)2 + ( C1)2 + . . . +( Cn)2 = 2 C

Combinatorial proof of (4)

1.(a)60(b)107 2. 15 3.(a)20(b)21(c)10 4.64800 5. 25C5 , 24C4

Website: www.iitianspace.com | online.digitalpace.in 7

Let the given equation be

b) Number of non-negative integral solutions of a linear inequation :

c) Number of integral solutions of a linear equation in 1

Website: www.iitianspace.com | online.digitalpace.in 8

2. Find the number of integral solutions of = 22, subject to – 3 , 1, , ,  0.

4. Use a combinatorial argument to show that C –1

5. Find the number of non-negative integer solutions of  23.

6. Find the number of non-negative integer solutions of ( )( ) = 21.

9. In how many ways can 14 be scored by tossing a fair die thrice ?

VIII The inclusion - exclusion principle

Website: www.iitianspace.com | online.digitalpace.in 9

2. Find the number of non-negative integer solutions of 1

3. How many positive integers divide 1040 or 2030 ?

5. Let D be the th derangement number. Prove that

8. Use a combinatorial argument to prove that :-

9. Prove (combinatorially) that

10. Prove (combinatorially) that  !  (  1)!  1

Website: www.iitianspace.com | online.digitalpace.in 10

1. Distinguishable balls and distinguishable cells

If an empty cell is allowed, the number of distributions = .

2. Identical balls and distinguishable cells

If an empty cell is allowed, then the number of distributions is +

If no cell is allowed to remain empty, then the number is –1C – .

Website: www.iitianspace.com | online.digitalpace.in 11

5. 540 7. (a) 315 – 3 · 215 + 3, (b) 2250 8. 141

9. 7000 10. 440

Website: www.iitianspace.com | online.digitalpace.in 12

 Properties of nCr & n Pr

3. If n is even and the value of n Cr is maximum, then r =

5. If 20 Cn2  nC16 , then the value of n is

Website: www.iitianspace.com | online.digitalpace.in 13

15. Using 5 conveyances, the number of ways of making 3 journeys is

Website: www.iitianspace.com | online.digitalpace.in 14

Website: www.iitianspace.com | online.digitalpace.in 16

 Integer Solutions / Distribution / Dearrangement