Unit 3 – Permutation and Combination

By
Name of the Creator- Vikas Ranjan
Designation- Trainer
Department- CTLD

1
 Permutations and Combination
BASIC CONCEPT BUILDER

Topics Covered under Permutations and Combination are:-

1. Basic Principles of Counting
2. Permutations
3. Circular Permutations
4. Combinations
5. Permutations vs. Combinations
6. Restricted Selection and Arrangement
7. Division and Distribution of Objects
8. Derangements and Multinomial Theorem
9. Some Useful Tips
10. Solved Examples

FUNDAMENTAL PRINCIPAL OF COUNTING

Rule of Product
If one experiment has n possible outcomes and another experiment has m possible outcomes,
then there are m × n possible outcomes when both of these experiments are performed.
In other words if a job has n parts and the job will be completed only when each part is
completed and the first part can be completed in a1 ways, the second part can be completed in a2
ways and so on.......then nth part can be completed in an ways, then the total number of ways of
doing the job is a1a2a3.......an. This is known as the rule of product.
Illustration:
A college offers 7 courses in the morning and 5 in the evening. Find the possible number of
choices with the student who wants to study one course in the morning and one in the evening.
Solution:
The student has seven choices from the morning courses out of which he can select one course in
7 ways.
For the evening course, he has 5 choices out of which he can select one in 5 ways.
Hence the total number of ways in which he can make the choice of one course in the morning
and one in the evening = 7 × 5 = 35.

Note: In the above illustration, we have found the total number of combinations of n
dissimilar things taking any number of them at a time, which is 2n - 1.
Basic Principles of Counting
Rule of Sum
If one experiment has n possible outcomes and another has m possible outcomes, then there are
(m + n) possible outcomes when exactly one of these experiments is performed.
In other words if a job can be done by n methods and by using the first method can be done in
a1 ways or by second method in a2 ways and so on ... by the nth method in an ways, then the

2
number of ways to get the job done is (a1 + a2 +.......+ an).
Illustration:
How many straight lines can be formed from six points, no three of which are collinear?
Solution:
To form a straight line, we need to select two points out of six points. This can be done in 6C2
ways = 6.5/2.1 = 15 ways.
Illustration:
In how many ways can a committee of five be formed from amongst four boys and six girls so as
to include exactly two girls?
Solution:
We have to select two girls from six girls and three boys from four boys.
Number of ways of selecting girls = 6C2 = 6.5/2.1 = 15
Number of ways of selecting boys = 4C3 = 4
Number of ways of forming the committee = 15 × 4 = 60.

Note: Here we have used multiplication rule.

Illustration:
A college offers 7 courses in the morning and 5 in the evening. Find the number of ways a
student can select exactly one course, either in the morning or in the evening.
Solution:
The student has seven choices from the morning courses out of which he can select one course in
7 ways.
For the evening course, he has 5 choices out of which he can select one in 5 ways.
Hence he has total number of 7 + 5 = 12 choices.
Illustration:
How many (i) 5 - digit, (ii) 3 - digit numbers can be formed by using 1, 2, 3, 4, 5 without
repetition of digits.
Solution:
(i) Making a 5-digit number amounts to filling 5 places.

Places:
Number of Choices: 5 4 3 2 1
The first place can be filled in 5 ways using any of the given digits.
The second place can be filled in 4 ways using any of the remaining 4 digits.
Similarly, we can fill the 3rd, 4th and 5th place.
No. of ways to fill all the five places.
= 5 × 4 × 3 × 2 × 1 = 120
=> 120 5-digit numbers can be formed.
(ii) Making a 3 - digit number amounts to filling 3 places.
Places:
Number of choices: 5 4 3
Number of ways to fill all the three places = 5 × 4 × 3 = 60.
Hence the total possible 3 - digit numbers = 60.
3
Basic Principles of Counting

Illustration:
How many 4-letter words can be formed using a, b, c, d, e
(i) Without repetition (ii) With repetition
Solution:
(i) The number of words that can be formed is equal to the number of ways to fill the
three places.

Places:
Number of Choices: 5 4 3 2
=> 5 × 4 × 3 × = 120 words can be formed when repetition is not allowed.
(ii) The number of words that can be formed is equal to the number of was to fill the
three places.

Places:
Number of Choices: 5 5 5 5
First place can be filled in 5 ways. If repetition is allowed, all the remaining places can be filled
in 5 ways each.
=> 5 × 5 × 5 × 5 = 625 words can be formed when repetition is allowed.
Exercise
1. 1 Plane, 2 trains and 3 buses ply between Delhi and Agra.
(a) In how many ways can you to Agra from Delhi.
(b) In how many ways can you go and come back if you go by train,
2. Total number of combinations of n dissimilar things, taken at least one at a time .
Ans.1 (a) 6,
(b) 2 × = 12
2. 2n - 1

Permutations (Arrangements of Objects):

The number of permutations of n objects, taken r at a time, is the total number of arrangements
of n objects, in groups of r where the order of the arrangement is important.
(i) Without repetition

(a) Arranging n objects, taking r at a time in every arrangement, is equivalent to filling r places
from n things.

r-Places
Number of Choices: n n-1 n-2 n-3 n - (r - 1)
Number of ways of arranging = Number of ways of filling r places
= n(n - 1)(n - 2) ... (n - r + 1)
= (n(n - 1)(n - 2) ... (n - r + 1)((n-r)!))/((n-r)!) = n!/((n-r)!) = nPr.
(b) Number of arrangements of n different objects taken all at a time = npn = n!

4
(ii) With repetition
(a) Number of permutations (arrangements) of n different objects, taken r at a time, when
each object may occur once, twice, thrice up to r times in any arrangements
= Number of ways of filling r places, each out of n objects.

r-Places:
Number of Choices : n n n n n
Number of ways to arrange = Number of ways to fill r places = (n)r.
(iii) Number of arrangements that can be formed using n objects out of which p are identical
(and of one kind), q are identical (and of one kind) and rest are different = n!/p!q!r!.
Illustration:
How many 7 - letter words can be formed using the letters of the words:
(a) BELFAST, (b) ALABAMA
Solution:
(a) BELFAST has all different letters.
Hence, the number of words
7
P7 = 7! = 5040.
(b) ALABAMA has 4 A's but the rest are all different. Hence the number of words formed is
7!/4! = 7 × 6 × 5 = 210.
Illustration:
(a) How many anagrams can be made by using the letters of the word HINDUSTAN?
(b) How many of these anagrams begin and end with a vowel.
(c) In how many of these anagrams all the vowels come together.
(d) In how many of these anagrams none of the vowels come together.
(e) In how many of these anagrams do the vowels and the consonants occupy the same relative
positions as in HINDUSTAN?

Permutations

Solution:
(a) The total number of anagrams
= Arrangements of nine letters taken all at a time = 9!/2! = 181440.
(b) We have 3 vowels and 6 consonants, in which 2 consonants are alike. The first place can be
filled in 3 ways and the last in 2 ways. The rest of the places can be filled in 7!/2! ways. Hence
the total number anagrams = 3 × 2 × 7!/2! = 15210.
(c) Assume the vowels (IUA) as a single letter. The letters (IUA) H, D, S, T, N, N can arranged
in 7!/2! ways. Also IUA can be arranged, among themselves, in 3! = 6 ways.
Hence the total number of anagram = 7!/2! × 6 = 15120.
(d) Let us divide the task in two parts. In the first, we arrange the 6 consonants as shown in 6!/2!
ways.
× C × C × C × C × C × C × (C stands for consonants and × stand for blank spaces between them)
3 vowels can be arranged in 7 places (between the consonants) in 7p3 = 7!/2! =210.
(e) In this case the vowels are arranged among themselves in 3! = 6 ways. Also the consonants
are arranged among themselves in 6!/2! ways.
Hence the total number of anagrams = 6!/2! × 6 = 2160.
5
Illustration:
How many 3 digit numbers can be formed using the digits 0, 1, 2, 3, 4, 5 where
(a) Digits may not be repeated,
(b) Digits may be repeated
Solution:
(a) Let the 3 digit number by XYZ.
Position (X) can be filled by 1, 2, 3, 4, 5 but not 0, so it can be filled in 5 ways.
Position (Y) can be filled in 5 ways again. Since 0 can be placed in this position.
Position (Z) can be filled in 4 ways.
Hence, by the fundamental principal of counting, total number of ways is 5 × 5 × 4 = 100 ways.
(b) Let the 3 digit number be XYZ.
Position (X) can be filled in 5 ways.
Position (Y) can be filled in 6 ways
Position (Z) can be filled in 6 ways.
Hence, by the fundamental principle of counting, total number of ways is 5 × 6 × 6 = 180.

Illustration:
Find the number of ways in which 6 letters can be posted in 10 letterboxes.
Solution:
For every letter, we have 10 choices (i.e. 10 letterboxes).
Hence the total number of ways = 106 = 1,000,000.

Circular Permutations

The arrangements we have considered so far are linear. There are also arrangements in closed
loops, called circular arrangements.
Consider four persons A, B, C and D, who are to be arranged along a circle. It's one circular
arrangement is as shown in adjoining figure.

Shifting A, B, C, D one position in anticlockwise direction we will get arrangements as follows.

Arrangements as shown in figure (I) (II) (III) and (IV) are not different as relative position of

6
none of the four persons A, B, C, D is changed. But in case of linear arrangements the four
arrangements are.

Thus, it is clear that corresponding to a single circular arrangement of four different things there
will be 4 different linear arrangements. Let the number of different things be n and the number of
their circular permutations be x.
Now for one circular permutation, number of linear arrangements is n
For x circular arrangements number of linear arrangements
= nx................................(1)
But number of linear arrangements of n different things
= n!.................................(2)
From (1) and (2) we get
Nx = n! => x = n!/n = (n - 1)!.
Suppose n persons (a1, a2, a3,......., an) are to be seated around a circular table. There are n! ways
in which they can be seated in a row. On the other hand, all the linear arrangements
a1, a2, a3,.........., an
an, a1, a2, ........., an-1
an-1, an, a1, a2, ........., an-2
................................................
................................................
a2, a3, a4, ........., a1

Circular Permutations

will lead to the same arrangements for a circular table. Hence one circular arrangement
corresponds to n unique row (linear) arrangements. Hence the total number of circular
arrangements of n persons is = (n - 1)!.
In other words the permutation in a row has a beginning and an end, but there is nothing like
beginning or end in circular permutation. Hus, in circular permutation, we consider one object is
fixed and the remaining objects are arranged in (n - 1)! ways (as in the case of arrangement in a
row).
Distinction between clockwise and Anti-clockwise Arrangements
Consider the following circular arrangements:

In figure I the order is clockwise whereas in figure II, the other is anti-clock wise. These are two
different arrangements. When distinction is made between the clockwise and the anti-clockwise
arrangements of n different objects around a circle, then the number of arrangements = (n - 1)!.
But if no distinction is made between the clockwise and anti-clockwise arrangements of n

7
different objects around a circle, then the number of arrangements is (n - 1)!.
As an example consider the arrangements of beads (all different) on a necklace as shown in
figure A and B.

Look at (A) having 3 beads x1, x2, x3 as shown. Flip (A) over on its right. We get (B) at once.
However, (A) and (B) are really the outcomes of one arrangement but are counted as 2 different
arrangements in our calculation. To nullify this redundancy, the actual number of different
arrangements is
(n - 1)!/2.

Note: (i) When the positions are numbered, circular arrangements is treated
as a linear arrangement.
(ii) In linear arrangements it does not make difference
whether the positions are numbered or not.

Illustration:
20 persons we invited to a party. In how many ways can they be seated in a round table such that
two particular persons sit on either side of the host?
Solution:
After fixing the places of three persons (1 host + 2 persons) and treating them as 1 unit we can
arrange the total (20 - 2 + 1) = 19 units in 18! ways. Again these particular persons can sit on
either side of the host in 2 ways.
Hence the total number of ways is 18! × 2.
Illustration:
In how many ways 10 boys and 5 girls can sit around a circular table, so that no two girls sit
together.
Solution:

Circular Permutations

10 boys can be seated in a circle in 9! ways. There are 10 spaces between the boys, which can be
occupied by 5 girls in 10p5 ways. Hence total number of ways = 9! 10p5 = (9!10!)/5! .
Number of circular permutations of n different things taken r at a time
8
= (if clockwise and anticlockwise orders are taken as different)

= (if clockwise and anticlockwise orders are not taken to be different)

Illustration:
In how many ways can 20 persons be seated round a table if there are 9 chairs?
Solution:
In case of circular table the clockwise and anticlockwise arrangements are different.

Hence the total number of ways =

Illustration:
How many necklaces of 10 beads each can be made from 20 beads of different colours?
Solution:
In case of necklace there is no distinction between the clockwise and anticlockwise
arrangements. Then the required number of circular permutations

= 19!/(10!)2 .

Restricted Selection and Arrangement

(a) The number of ways in which r objects can be selected form n different objects if k particular
objects are
(i)
Always included = n-kCr-k.
(ii)
Never included = n-kCr.
(b) The number of arrangement of n distinct objects taken r at a time so that k particular
objects are
(i)
Always included = n-kCr-k.r!,
(ii)
Never included = n-kCr.r!.

Illustration:
A delegation of four students is to be selected form a total of 12 students. In how many ways can
the delegation be selected if
(a) All the students are equally willing.
(b) Two particular students have to be included in the delegation.
(c) Two particular students do not wish to be together in the delegation.
(d) Two particular students wish to be included together only,
(e) Two particular students refuse to be together and two other particular student wish to be
together only in the delegation.
Solution:
(a)
Formation of delegation means selection of 4 out of 12. Hence the number of ways = 12C4
= 495.
(b)
Two particular students are already selected. Hence we need to select 2 out of the remaining
10. Hence the number of ways = 10C2 = 45.
(c)
The number of ways in which both are selected = 45. Hence the number of ways in which
9
the two are not included together = 495 - 45 = 450.
(d)
There are two possible cases
(i) Either both are selected. In this case the number of ways in which this selection can be made
= 45.
or
(ii) both are selected. In this case all the four students are selected from the rest of ten students.
This can be done in 10C4 = 210 ways.
Hence the total number of ways of selection = 45 + 210 = 255.
(e)
We assume that students A and B wish to be selected together and students C and D do not
wish to be together. Now there are following 6 cases.
(i) (A, B, C) selected (D) not selected
(ii) (A, B, D) selected (C) not selected
(iii) (A, B) selected (C, D) not selected
(iv) (C) selected (A, B, D) not selected
(v) (D) selected (A, B, C) not selected
(vi) A, B, C, D not selected
For (i) the number of ways selection = 8C1 = 8
For (ii) the number of ways selection = 8C1 = 8
For (iii) the number of ways selection = 8C2 = 28
For (iv) the number of ways selection = 8C3 = 56
For (v) the number of ways selection = 8C3 = 56
For (vi) the number of ways selection = 8C4 = 70
Hence, total number of ways = 8 + 8 + 28 + 56 + 56 + 70 = 226.

Some results related to nCr

(i) n
Cr = nCn-r
(ii)
If nCr = nCk, then r = k or n-r = k
n
(iii)
Cr + nCr-1 = n+1Cr
(iv) n
Cr = n/r n-1Cr-1

(v)
(vi) (a) If n is even nCr is greatest for r = n/2
(b) If n is odd, is greatest for r = (n-1)/2,(n+1)/2

Restricted Selection and Arrangement

Illustration:
(a) How many diagonals are there in as n-sided polygon (n > 3?
(b) How many triangles can be formed by joining the vertices of an
n-sided polygon?

How many these triangles have

(i) Exactly one side common with that of the polygon?
(ii) Exactly two sides common with that of the polygon?
10
 (iii) No side common with that of the polygon?
Solution:
(a) Number of lines formed by joining the vertices of a polygon
= number of selection of 2 points each selected from the given n points
= nC2 = (n(n-1)!)/2.1 .
Out of nC2 lines, n are the sides of the polygon.
Hence the number of diagonals = nC2-n = ((n(n-1))/2) - n = (n(n-3))/2 .
(b) Number of triangles formed by joining the vertices of the polygon = number of selection of 3
points from n points.
n
C3 = (n(n-1)(n-2))/3.2.1 .
Let the vertices of the polygon be marked as A1, A2, A3,......., An.
(i)
Select two consecutive vertices A1, A2 of the polygon. For the required triangles we can select
the third vertex from the A4, A5,...., An-1. This can be done in n-4C1 ways. Also two consecutive
points (end points of a side of polygon) can be selected in n ways.
(ii)
For the required triangle, we have to select three consecutive vertices of the polygon. i.e. (A1
A2 A3), (A2 A3 A4) (A3 A4A5).....(An A1 A2). This can be done in n ways.
(iii)
Triangle having no side common + triangle having exactly one side common + triangle
having exactly two sides common
(with those of the polygon) = Total number triangles formed
=> Triangle having no side common with those of the polygon.
= nC3 - n(n - 4) - n = ((n(n-1)(n-2))/6) -n(n - 4) - n.
= n/6 [n2 + 3n + 2 - 6n + 24 - 6] = [n2 + 9 + 20] = (n(n-4)(n-5))/6.
All possible selections
(i) Selection from distinct objects :
The number of selections from n different objects, taking at least one = nC1 + nC2 + nC3 +...+nCn = 2n - 1.
In other words, for every object we have two choices, either select or reject in a particular group.
Total number of choice (all possible selections) = 2.2.2.. . .n times = 2n. But this also includes the
case when none is selected. And the number of such cases is 2n - 1.
(ii) Selection from identical objects:
(a) The number of selections of r objects out of n identical objects is 1.
(b) Total number of selections of zero or more objects from n identical objects is n+1.
(c) The total number of selections of at least one out of a1 + a2 + a3 +........+ an objects, where a1
are alike (of one kind), a2 are alike (of second kind) and so on.......an are alike (of nth kind), is
[(a1 + 1)(a2 + 1)(a3 + 1).........(an + 1)] - 1.
Illustration:
In how many ways can a person having 3 coins of 25 paise, 4 coins of 50 paise and 2 coins of 1
rupee give none or some coins to a beggar?

Useful Tips for Algebra

SOME USEFUL TIPS

(i) Number of combinations of dissimilar things taken r at a time when p particular things
always occur = n-pCr-p.
Explanation: Here, actually we are making a selection of (r - p) things out of (n - p) things
11
which can be done in n-pCr-p ways.
(ii) Number of permutations of n dissimilar things taken r at a time when p particular
things always occur = n-pCr-pr!
Explanation: Here, number of combinations is the same as above but every combinations of r
things can be permutated in ways and that's why total number of permutations = n-pCr-pr!
(iii) Number of combinations of n dissimilar things taken r at a time when p particular
things never occur = n-pCr-p.
Explanation: Here, actual selection of r things is being made out of (n - p) things and that's why
total number of selections = n-pCr-p.
(iv) Number of permutations of n dissimilar things taken r at a time when p particular
things never occur = n-pCr-p .
Explanation: Here, number of combinations is the same as above but every selection made of r
things can be permutated in ays and therefore then total no. of permutations = n-pCr-p .
(v) Gap Method: If there are m men and n women (m > n) and they have to sit in a row in such
a way that no two women sit together then total no. of such arrangements = m+1Cn. m!
Explanation: If we denote men by m and women by w then there are exactly (m + 1) places in
which women can be placed such that no two women will be together. This can be done in
m+1Cn ways. Moreover, m men can be arranged among themselves in m! ways. Therefore, total
number of arrangements : m+1Cn.m!
w m w m w...................m w m w
(vi) String method: Many a times, one may encounter a problem of arranging n number of
persons in a row such that m of them is always together. For this we tie all these m persons with
a string i.e. we treat them as one, then we have (n - m + 1). Therefore total number of
arrangements = (n - m + 1)!.m!.
Never together: If question is to find the number of arrangements such that m out of n are never
all together then such total number of arrangements.
Total possible arrangements of a n persons without any restrictions - Total arrangements when m
out of them are always together.

Solved Examples

Example 1 A letter lock consists of three rings each marked with 10 different letters. In
how many ways is it possible to make an unsuccessful attempt to open the block?
Solution:

Two rings may have same letter at a time but same ring cannot have two letters at time,
therefore, we must proceed ring wise.
Each of the three rings can have any one of the 10 different letters in 10 ways.
Therefore Total number of attempts = 10 × 10 × 10 = 1000.
But out of these 1000 attempts only one attempt is successful.
Therefore Required number of unsuccessful attempts
= 1000 - 1 = 999.

Example 2Find the total number of signals that can be made by five flags of different
12
colour when any number of them may be used in any signal.
Solution:

Case I : When only one flag is used.

No. of signals made = 5P1 =
5.
Case II : When only two flag is used.
Number of signals made = 5P2 = 5.4 = 20.
Case III : When only three flags are used.
Number of signals is made = 5P3 = 5.4.3 = 60.
Case IV : When only four flags are used.
Number of signals made = 5P4 = 5.4.3.2 = 120.
Case V : When five flags are used.
Number of signals made = 5P5 = 5! = 120.

Hence, required number = 5 + 20 + 60 + 120 + 120 = 325.

Example 3 Prove that if each of the m points in one straight line be joined to each of the n
points on the other straight line, the excluding the points on the given two lines. Number of
points of intersection of these lines is 1/4 mn
(m-1(n-1).
Solution:
To get one point of intersection we need two points on the first line and two points on the second
line. These can be selected out of n-points in nC2 ways and for m points in mC2 ways.
Therefore Required number = mC2 × nC2
= (m(m-1))/2! . (n(n-1))/2!
= 1/4 m n (m - 1)(n - 1)

Example 4 There are ten points in a plane. Of these ten points four points are in a straight
line and with the exception of these four points, no other three points are in the same
straight line. Find
(i) The number of straight lines formed.
(ii) The number of triangles formed.
(iii) The number of quadrilaterals formed by joining these ten points.
Solved Examples
Solution:
(i) For straight line, we need 2 points

No. of point selected out of 4 No. of points selected out of No. of straight line form
collinear points remaining 6 points
0 2 4
C0 × 6C2 = 15
1 1 4
C1 × 6C1 = 24
2 0 1

13
 (In last case only one straight line is formed)
Therefore Required number = 15 + 24 + 1 = 40
(ii) For triangle, we need 3 points
No. of point selected out of 4 No. of points selected out of No. of triangles formed
collinear points remaining 6 points
0 3 4
C0 × 6C3 = 20
1 2 4
C1 × 6C2 = 60
2 1 4
C2 × 6C1 = 36
3 0 0

(In last case number of triangles formed is 0)

Therefore Required number = 20 + 60 + 36 + 0 = 116
(iii) For a quadrilateral, we need 4 points
No. of point selected out of 4 No. of points selected out of No. of quadrilateral form
collinear points remaining 6 points
0 4 4
C0 × 6C4 = 15
1 3 4
C1 × 6C3 = 80
2 2 4
C2 × 6C2 = 90
3 1 0
4 0 0

(In these cases number quadrilateral is formed

Therefore Required number = 15 + 80 + 90 = 185.

Example 5 A family consists of a grandfather, 6 sons and daughters and 4 grand children.
They are to be seated in a row for dinner. The grand children wish to occupy the two
seats at each end and the grandfather refuses to have a grandchild on either side of him.
In how many ways can the seating arrangements be made for the dinner?
Solution:
There are 6 adults, 4 grand children and 1 grand father.
Let us mark the seat for 11 persons from 1 to 11.
S S S S S S
1 2 3 .....................9 10 11
Seats number 1, 2 and 10, 11 at the ends are to be occupied by 4 grand children and it can be
done in 4P4 = 4! = 24 ways.
Now, we will seat the grandfather who cannot occupy seat number 3 or seat number 9 because he
does not want to have a child by his side. Hence, he has to choose any of five seats 4, 5, 6, 7, 8
i.e. can seat himself in 5 ways.

Example 6 Find the number of 4 lettered words that can be formed form the letters of
the word PROPORTION?
Solution:
14
 Step 1 Letter Freq.
P 2
R 2
O 3
T 1
I 1
N 1

10 (always check total)

Step 2
(i) here we cannot have all the 4 letters alike, so
(ii) 3 alike 1 diff. Selection Remark
Say X Y 1
C1 × 5C1 = 5 1
C1 → 3O's
5
C1 → one form {P, R, T, I, N}

Arrangement of these 3X's and 1 Y =

= 4!/3! = 4
Hence total such words = 5 × 4 = 20.

(iii)2 same 2 diff. Selection

2(X) (Y, Z) 3C1 × 5C2 =
12
Arrangement = (p+q+r)/p!q!r! = (2+1+1)2!1!1! = 12
Hence total words = 12 × 30 = 360

(iv)2 same 2 another same Selection

(2X) (2Y) 3C2 = 3
Arrangements = (2+2)!/2!2! = 6
Total words = 3 × 6 = 18
(v) 1 same, 3 diff º 4diff. Selection 6C4 = 6C2 =
15 Arrangement = (1+1+1+1)!/1!1!1!1! = 4! = 24
Total words = 15 × 24 = 360
(vi) 1 same, 3 another same º case ii (already considered)
Hence grand total of desired words
= 20 + 360 + 18 + 360 - 758.

Example 10 How many different numbers can be formed with the digits 1, 3, 5, 7, 9 when
taken all at a time and what is their sum?
Solution:
The total number of numbers = |5 = 120. Suppose we have 9 in the unit's place. We will have |4
= 24 such numbers. The number of numbers in which we have 1, 3, 5 or 7 in the unit's place is |4
= 24.
Hence, the sum of the digits in the unit's place in all the 120 numbers
= 24 (1 + 3 + 5 + 7 + 9)
15
 = 600.
The number of numbers when we have any one of the given digits in ten's place is also |4 = 24 in
each case. Hence, the sum of the digits in the ten's place = 24 (1 + 3 + 5 + 7 + 9) tens
= 60 tens = 600 × 10.
Proceeding similarly, the required sum
= 600 units + 600 tens + 600 hundreds + 600 thousands + 60 ten thousands.
= 60 (1 + 10 + 100 + 1000 + 10000) = 600 × 11111
= 6666600.

16
 References
R1:-THE PEARSON GUIDE TO Quantitative Aptitude for CAT : Dinesh Khattar
R2:-Quantitative Aptitude by R.S. Agrawal
R3:- Arun Sharma: How to prepare for Quantitative Aptitude for CAT
R4:-Reference website:- campusgate.com, gmatclub.com, examrace.com, Indiabix.com, toppr.com, cracku.in.
R5:- Campus Placement : Ankur Malhotra

17