www.aptiDude.

com

Mathematical Aptitude - Tips & Tricks

CHAPTER-9

PERMUTATION &
COMBINATION

Page 1 of 10 || www.aptiDude.com
Copyright @ 2013, content compiled by aptiDude.com team and mathematical experts

www.aptiDude.com

Mathematical Aptitude - Tips & Tricks

PERMUTATION & COMBINATION

Permutations involve both the selection and
arrangement of objects while combinations involve
only selection of objects.
Consider the case of selecting two out of three
students A, B and C.
Case 1: PERMUTATION
Suppose we have to select two students, A and B,
and rank them according to the marks they have
scored. The different possibilities that exist are as
follows:
Rank 1

Rank 2

So, Total number of selections = 6

(Note that the selection (A, B) is different from the
selection (B, A) here.)
Case 2: COMBINATION
Now suppose we need to select two students for a
gardening assignment. The order in which the
students would be selected is not important here.
The possibilities in this case would include (A, B),
(B, C) and (A, C).
So, Total number of selections = 3
(Note that here, the selection (A, B) is same as the
selection (B, A))

2. Task1 or Task2 or Task 3 can be done

together in M + N + P ways (mutually
exclusive tasks)
Example 1: In how many ways a 3 digit number
can be formed from digits 1, 2, 3, 4 and 5 without
repetition of digits?
Solution: First digit can be chosen in 5 ways,
second digit in 4 ways and third digit in 3 ways.
Hence, Total numbers of 3 digit numbers that can
be formed are 5 * 4 * 3 = 60 ways
PERMUTATIONS
Number of permutations of n things taken r at a
time is denoted by nPr =

!
!

If r = 0, then nP0 =
If r = 1, then nP1 =
If r = n, then nPn =
If r = n-1, then nPn1 =

time is denoted by nCr =

=n

!
!
!

= n!

!
+ !

= n!

!
! !

FUNDAMENTAL PRINCIPLE of COUNTING

1. Task1, Task2 & Task 3 can be done

together in M * N * P ways (mutually
inclusive tasks)

=1

COMBINATIONS
Number of combinations of n objects taken r at a

If r = 0, then nC0 =

If there are 3 tasks to do in such a way that there

are M ways for doing the first task, N ways for
doing the second task and P ways for doing the
third task, then

If r = 1, then nC1 =
If r = n, then nCn =
If r = n-1, then nCn1 =

!
! !
!
! !
!
! !

=1
=n
=1

!
+ ! !

Page 2 of 10 || www.aptiDude.com
Copyright @ 2013, content compiled by aptiDude.com officials and mathematical experts

=n

www.aptiDude.com

Mathematical Aptitude - Tips & Tricks

DIFFERENT COROLLARIES OF PERMUTATIONS

COROLLARY

FORMULA

Number of permutations of n
things out of which M1 are alike of
one type, M2 are alike of second
type and M3 are alike of third type.

!
! ! !

Number of permutations of n
different things, taken r at a time,
when particular thing is to be
always
included
in
each
arrangement
Number of permutations of n
different things, taken r at a time,
when particular thing is never
included in any arrangement
Number of permutations of n
different things, taken r at a time,
when m particular things never
occur

Number of permutations of n
different things, taken all at a time,
when m specified things always
come together is

Number of permutations of n
different things, taken all at a time,
when m specified things never
come together is

(n 1Pr 1 ) * r

(n 1Pr)

(n mPr)

m! * (n m +1)!

n! [m! (n m +1)!]

ILLUSTRATION
Total number of words formed
from the letters of MISSISSIPPI are
=

!
! ! !

I occurs 4 times, S occurs 4 times

and P occurs 2 times
Number of ways of selecting 4
roses out of 10 distinct roses such
that a red rose is always included
(10 1P4 1 ) * 4
= 9P3 * 4 ways
Number of ways of selecting 4 balls
out of 10 distinct balls such that a
black ball is never included are:
(n 1Pr) = (9P4) ways
In how many can a team of 5 out of
10 members be arranged such that
player named Saurav & Vishal are
never selected?
Number of Ways = (10 2P5)
Arrange the letters of word
POSTAGE such that consonants
are always together.
Here, there are 3 vowels & 4
consonants.
Number of Ways = 4! * (7 4 +1)!
= 4! * 4!
Arrange the letters of word
POSTAGE such that consonants
are never together.
Number of Ways = 7! (4! * 4!)

If m men and n women are to be seated in a row so that no two women can sit together, then the
number of ways in which they can be seated is

! + !

(+)!
Out of n intermediate stations, a train can be made to stop at 3 consecutive stations in (n 2) ways.
Also, The Train can stop at at least two consecutive stations in (n 2)2 ways

#APTI-TRICKS

Page 3 of 10 || www.aptiDude.com
Copyright @ 2013, content compiled by aptiDude.com officials and mathematical experts

www.aptiDude.com

Mathematical Aptitude - Tips & Tricks

CIRCULAR PERMUTATIONS
Number of circular permutations of
n dissimilar things taken all at a
time, if clockwise and anticlockwise directions are different

Number of circular permutations of

n dissimilar things taken all at a
time, if clockwise and anticlockwise directions are similar
(Cases of Necklaces & Garlands
Arrangement)
Number of circular permutations of
n dissimilar things taken r at a
time, if clockwise and anticlockwise directions are different

(n 1)!

(n 1)! / 2

(n Pr)/r

20 persons were invited to a party.

In how many ways can they and the
host be seated at a circular table?
Number of Persons
= 20+1 host = 21
Number of ways = (21-1)! = 20!
Consider 21 different pearls on a
necklace. How many ways can the
pearls be placed in on this
necklace?
Total Number of ways
= (21-1)! / 2

In how many ways can 24 persons

be seated round a table, if there are
13 seats?
Number of ways = (24 P13)/13

Number of circular permutations of

How many necklaces of 12 beads
n
n dissimilar things taken r at a
each can be made from 18 beads of
( Pr)/2r
time, if clockwise and antivarious colours?
clockwise directions are similar
Number of Ways = (18 P12)/2 *12
(Cases of Necklaces & Garlands
Arrangement)
DIFFERENT COROLLARIES of COMBINATIONS
Number of combinations of n
different things taken r at a time
when m particular things always
occur

Number of combinations of n
different things taken r at a time
when m particular things never
occur

Number of selections of r
consecutive things out of n things
in a row

(n mCr m )

(n mCr)

nr+1

Choose a committee of 5 members

out of 8 official & 4 non-official
members such that a particular nonofficial member is always included.
Number of ways =(12 1C5 1) = 11C4
Choose a committee of 5 members
out of 8 official & 4 non-official
members such that 2 particular
official members are never included.
Number of ways =(12 2C5) = 10C5
Selection of 5 consecutive cards out
of 13 cards in a suit of same colour.
Total Ways = 135+1 = 9 ways

Page 4 of 10 || www.aptiDude.com
Copyright @ 2013, content compiled by aptiDude.com officials and mathematical experts

www.aptiDude.com

Mathematical Aptitude - Tips & Tricks

Select a committee of 6 men and 5

women out of 8 men and 10 women,
such that particular man P refuses
to be a member of the committee in
which his wife Q is there.

Number of combinations of n
different things taken r at a time
when m particular things are
never together in any selection

(n Cr)(n mCr m )

Total Selections = 8C6 *10C5

Total Selections where P & Q are
together = (8 1C6 1)*(10 1C5 1)
=7 C5 * 9 C4
Total Selections where P and Q are
not together = [8C6 *10C5][7C5 * 9C4]
Number of selections of r consecutive things out of n things in a circle is n if (r < n) and 1if (r = n)
There are p intermediate stations on a railway line. Number of Ways in which a train can be made to stop at q
number of stations such that no two of them are consecutive = p m +1Cm
Suppose out of 12 stations, a train has to stop at 4 stations, no two of them being consecutive = 12 4 +1C4 = 9C4 ways
SELECTION out of NON-IDENTICAL THINGS
A man has 6 friends. In how many
+
+
+ ways he can invite all of his friends
to dinner?
+ (n Cn) = 2n
Number of Ways = 26
A man has 6 friends. In how many
Number of selections of 1 or more (n C1) + (n C2) + + (n Cn) ways he can invite some or all of his
things (at least one) out of n
friends to dinner?
= 2n 1
different things
Number of Ways = 26 1
SELECTION out of IDENTICAL THINGS
Number of selections of 0 or more
things out of n different things

(n C0)

(n C1)

(n C2)

Number of selections of r things

(r n) out of n identical things

Number of selections of 0 or more

things out of n identical things

n+1

Number of selections of 1 or more

things out of n identical things

Number of ways of selecting some

or all out of p+q+r items where p
are alike of one kind, q are alike of
second kind and rest all are alike of
third kind

(+1 represents zero selection here)

(p+1)(q+1)(r+1) 1
(1 corresponds to situation when
nothing is selected)

Out of 100 identical balls, in how

many ways 10 balls can be chosen?
Number of Ways = 1
Out of 10 identical rings, in how
many ways can a ring be selected?
Number of Ways = 10 + 1 = 11
In how many ways at least one ring
can be selected out of 10 identical
rings?
Number of Ways = 10
A basket contains 4 oranges, 5
apples and 6 mangoes. In how many
ways can a person make selection of
fruits among the fruits in the basket?
Total number of selections
=(4+1)(5+1)(6+1) 1 = 209 ways

Page 5 of 10 || www.aptiDude.com
Copyright @ 2013, content compiled by aptiDude.com officials and mathematical experts

www.aptiDude.com

Mathematical Aptitude - Tips & Tricks

Number of ways of selecting some

or all out of p+q+r items where p
are alike of one kind, q are alike of
second kind and r are all of
different kinds
Number of ways of selecting some
or all out of p+q+r items where p
are all of different kind, q are all of
different kind and r are all of
different kinds

(p+1)(q+1)2r 1

[2p 2q 2r] 1

A basket contains 4 oranges, 5

apples and 3 other kind of fruits. In
how many ways can a person make
selection of fruits among the fruits
in the basket?
Total number of selections
=(4+1)(5+1)23 1 = 239 ways
If in above problem, all oranges, all
apples and all mangoes are of
different kind, then
Total number of selections
=[24 * 25 * 26] 1 ways

DISTRIBUTION of THINGS
Number of ways of distributing n
non identical things into r distinct
groups

Number of ways of distributing n

identical things into r distinct
groups (such that there is no
restriction in selection)

Number of ways of distributing n

identical things into r distinct
groups (such that no group
remains empty)

rn

(n + r 1Cr 1 )

(n 1Cr 1 )

In how many ways can 4 chocolates

be given to 5 children?
Number of Ways = 54 ways
(If not mentioned then its not
necessary that 4 chocolates will
always be of same kind)
How many solutions are there to the
equation a + b + c = 100 where a, b,
and c are whole numbers?
(Take it as 100 identical chocolates
distributed among 3 different
children)
Number of solutions
= (100 + 3 1C3 1 ) = 102C2 solutions
(whole numbers start from zero)
How many solutions are there to the
equation a + b + c = 100 where a, b,
and c are natural numbers?
(Take it as 100 identical chocolates
given to 3 different children such that
each child has at least one chocolate)
Number of solutions
= (100 1C3 1 ) = 99C2 solutions

DIVIDING & GROUPING of THINGS

The Fundamental way of Dividing the things is as follows
Example: Divide 7 different objects into 3 groups of one, two and four each ?
Solution : Number of Ways = 7C4 3C2 , i.e. First Selecting 4 from 7, then 2 from remaining three, and last 1 is
automatically selected
(But this method doesnt work when division of things is done in equal groups, like 6 things into 3 groups of 2 each)

Page 6 of 10 || www.aptiDude.com
Copyright @ 2013, content compiled by aptiDude.com officials and mathematical experts

www.aptiDude.com

Mathematical Aptitude - Tips & Tricks

Number of ways of dividing m + n

+ p different things in three groups
containing m, n and p things
respectively (m n p)

(++)!
! ! !
()!
! ! ! !

If m + n + p different things
distributed among three persons
Number of ways of dividing 2m
different things in two groups, each
containing m things
But, if 2m things are divided
equally between two persons, then
Number of ways of dividing 3m
different things in three groups,
each containing m things
If 3m things are divided equally
between three persons, then
Number of ways of dividing mn
different things in three groups,
each containing m things
If mn things are divided equally
between three persons, then

(++)!
! ! !
()!
! !
()!
!
()!
! !

()!
!
()!
! !

()!
!

(Unordered Group)

(if m = n = p)

*3! (Ordered Group)

(Unordered Group)

In how many ways 12 balls be

divided between 2 boys, one
receiving 5 and other receiving 7
balls?
Number of Ways =

()!
! !

* 2!= 1584

Number of ways in which 15

recruits can be divided into 3 equal
groups =

()!
! ! ! !

Divide 8 bundles of newspapers into

2 groups of 4 bundles each.
Number of ways

(Ordered Group)

(Unordered Group)

()!
! !

= 35 ways

Divide 6 different objects into 3

groups having two things each.
Number of ways

(Ordered Group)

(Unordered Group)

(Ordered Group)

()!
! !

= 15 ways

In how many ways can a pack of 52

cards be divided equally among 4
players?
()!
Number of Ways =
!

Points to Remember:

(n Cr) = r! * (n Pr) and also, (n Cr) = (n Cn r)

(n C0)+ (n C1)+ (n C2)+..+ (n Cn) = 2n
(n C0)+ (n C2)+ (n C4)+..= (n C1)+ (n C3)+ (n C5)+ .= 2n 1
For n = even, Greatest Value of (n Cr) is (n Cn/2)
For n= odd Greatest Value of (n Cr) is (n Cn+1/2) or (n Cn1 /2)
n people can shake hands among themselves in nC2 ways
(10 people can do handshakes in 10C2 = 45 ways)
If n objects are arranged in a circle, then number of ways of selecting 3 of these n things, such that no
two of them are next to each other is n(n4 )(n5 ) / 6
#apti-Tricks

Page 7 of 10 || www.aptiDude.com
Copyright @ 2013, content compiled by aptiDude.com officials and mathematical experts

www.aptiDude.com

Mathematical Aptitude - Tips & Tricks

DERANGEMENT PRINCIPLE
If n things are arranged in a row, the number of
ways in which they can be deranged so that none
one of them occupies its original place is

Dn = n!

+
!
!
!
!
!

And if r things out of n things goes to wrong

place, then (n r) goes to correct places

Dn = nCnr * Dr
where

Dr= r! ! ! + ! ! + + !

Example1:
A person writes letters to six friends and addresses
the corresponding envelopes.
a) In how many ways can the letters be placed
in the envelopes so that all the letters are in
the wrong envelopes?
b) In how many ways can the letters be placed
in the envelopes so that at least 4 of them
are in the wrong envelopes?
Solution:
a) Number of ways in which all letters be
placed in wrong envelopes

= 6! ! ! + ! ! + ! = 265 ways
b) Number of ways in which at least 4 letters
are in wrong envelopes
= [ nCn4* D4] + [nCn5 * D5]+ [nCn6 * D6]
= [ 6C64 * D4] + [6C65 * D5]+ [6C66 * D6]
= 135 +264 + 265
=664 ways
TRY to SOLVE
Professor Forgetful had the test papers and the
mark sheets of 5 students. But, he entered
someone elses marks for each of the 5
students. In how many different ways could he
have made this error? (Ans = 44 ways)

GEOMETRICAL APPLICATIONS of P & C

1. If n distinct points are given , no three of them
being collinear, then number of line segments
formed by joining any two points = nC2
2. If m out of n points are collinear, then
number of line segments formed by joining any
two points = (nC2 mC2)+ 1
3. If n distinct points are given , no three of them
being collinear, then number of triangles
formed by joining any three points = nC3
4. If m out of n points are collinear, then
number of triangles formed by joining any three
points = (nC3 mC3)
5. If n distinct points are given on circumference
of a circle, then
No. of Straight Lines = nC2
No. of Triangles = nC3
No. of Quadrilaterals = nC4..and so on
6. In a grid of size n x n

No. of Squares of any size =

=
No. of Rectangles of any size =

7. In a grid of size n x m (n < m)

No. of Squares of any size
=
= + ( + )
No. of Rectangles of any size

=
+ ( + )

Example: Find Total Number of squares on a chess

board of size 8 x 8?
Solution: Number of squares
= 12 + 22 + 32 ++82
= (8*9*17) / 6 = 204 squares
Example: Find Total Number of rectangles & squares
in a rectangular grid of size 4 x 6?
Solution: Number of Rectangles = 4*6/4 [5*7] = 210
rectangles, and
Number of Squares = =4
=1 + 1 ( + 1 )
= (4*6) + (3*5) + (2*4) + (1*3) = 50 squares

Page 8 of 10 || www.aptiDude.com
Copyright @ 2013, content compiled by aptiDude.com officials and mathematical experts

www.aptiDude.com

Mathematical Aptitude - Tips & Tricks

8. If m parallel lines are intersected by a family of

n other parallel lines, then total number of
parallelograms so formed
= mC2 * nC2 =

()()

9. If there are n lines in a plane, such that no two

lines are parallel and no three are concurrent,
then number of regions in which a plane can be
divided by using these n lines
=

(+)

+1

Example: Find the maximum number of regions in

which a plane can be divided by using 10 straight
lines which are coplanar.
Solution:

(+)

+1 = 56 regions

Example: Find the maximum number of pieces in

which a circular cake piece can be divided by using
7 vertical cuts.
Solution:

(+)

+1 = 29 pieces

10. Number of triangles with one side common to

a n sided polygon = n * (n 4)
Number of triangles with two sides common to
a n sided polygon = n
Number of triangles with no side common to
that of a n sided polygon =

()()

2. Number of positive integral solutions of

equation of type x1 + x2 + x3 ++xr = n

= (n 1Cr 1)
= Number of ways of distributing n identical
things among r persons when each person can
get at least one thing
Example 1: Find the positive number of solutions
of the equation x + y + z + w = 20, when
a) Zero values of x, y, z and w are included
(Whole Number Solutions)
b) Zero Values are excluded (Natural Number
Solutions)
Solution:
a) Number of solutions including zero values
= (n + r 1Cr 1) = (20 + 4 1C4 1) = 23C3
= 1771 solutions
b) Number of solutions when zero values are
excluded (x, y, w, z 1)
= (n 1Cr 1) = (20 1C4 1) = 19C3
= 969 solutions
Example 2: Find the integral solutions of the
equation x + y + z + w = 29, when x 1, y 2, z 3
and w 0.
Solution: These type of problems are solved as
follows
Let x =1, y = 2, z = 3, w = 0
Then, x + y + w + z = 6
Subtract 6 from R.H.S, i.e. 29 6 = 23
So, Number of Positive Solutions will be given by
= (n + r 1Cr 1) = (23 + 4 1C4 1) = 26C3
= 2600 solutions

USE of P & C in SOLUTION of EQUATIONS

1. Number of non-negative integral solutions of
equation of type x1 + x2 + x3 ++xr = n

= (n + r 1Cr 1)
= Number of ways of distributing n identical
things among r persons when each person can
get zero, one or more things

Example 3: How many integral solutions are there

for the system of equations x1 + x2 + x3 +x4+x5 = 20
and x1 + x2 =15 when xk 0
Solution: We have x1 + x2 + x3 +x4+x5 = 20
It can be written as x3 +x4+x5 = 5
-(I)
Because x1 + x2 =15
-(II)
For (I), Number of Solutions = 7C2 = 21
For (II), Number of Solutions = 16C1 = 16
Total Integral Solutions = 21 * 16 = 336

Page 9 of 10 || www.aptiDude.com
Copyright @ 2013, content compiled by aptiDude.com officials and mathematical experts

www.aptiDude.com

Mathematical Aptitude - Tips & Tricks

Example 4: Find the number of non-negative

integral solutions of the equation x + y + z + w 29,
where x, y, z, w 0.
Solution: The equation can be written like this
x + y + z + w + p = 29
where, 0 p 29
So, Number of Solutions
= (n + r 1Cr 1) = (29 + 5 1C5 1) = 33C4
= 40920 solutions
Try These:
1) How many non-negative integral solutions
are there for equation x + y + z + 4w = 20?
(Ans: 536, Hint: take cases for t =1 to t = 5)

As per the above pattern, Rank of ZENITH

= (5*5!) +(0*4!) +(2*3!) +(1*2!) +(0*1!)
+(0*0!)+1
= 615
(+1 included in the last for the word ZENITH itself)
Example 2: If letters of the word BOMBAY are
arranged as per dictionary then, find the rank of
word BOMBAY?
Solution:
Here the word contains repeated letters, hence it is
arranged in the following manner

2) How many 3 digit numbers between 100 and

1000 have the sum of digits 12?
(Ans: 66, Hint : Take Cases for a + b + c =12)
apti-Trick: PROBLEMS based on finding the
RANK of a given word
Example 1: If letters of the word ZENITH are
arranged as per dictionary then, find the rank of
word ZENITH?
Solution:

AS per the above pattern, rank of word BOMBAY

= (1/2! * 5!)+(3*4!)+(2 * 3!)+(1*2!) + 0 + 0 + 1
= 147
(+1 added for the word BOMBAY itself)
Sum of all the numbers which can be formed using the n
digits without repetition is;

(n-1)! * (Sum of Digits)*(1111..n times)

Example: Find the sum of all the four digit numbers
which can be formed by using the digits 1,3,7,9 without
repetition.
Solution: No. of Digits = 4, Sum of Digits = 1+3+7+9 = 20
Sum of all numbers = (4-1)! * 20 * (1111) = 133320
If repetition is allowed, then the sum of all numbers is

n(n-1) * (Sum of Digits) * (1111..n times)

Page 10 of 10 || www.aptiDude.com
Copyright @ 2013, content compiled by aptiDude.com officials and mathematical experts