9

Permutations and Combinations

STRUCTURE
90 INTRODUCTION
9.1 FUNDAMENTAL RULES OF COUNTING
92 PERMUTATIONS
9.3 FACTORIAL NOTATIONS
9.4 PERMUTATION OF n DIFFERENT THINGS
9.5 CIRCULAR PERMUTATION
96 PERMUTATION OF THINGS NOT ALL DIFFERENT
9.7 RESTRICTED PERMUTATIONS
98 COMBINATIONS
9.9 COMPLEMEN IARY THEOREMS
9110 RESTRICTED COMBINATIONS
911 COMBINATIONS OF THINGS NOT ALL DIFFERENT

OBJECTIVES
After studying this chapter, you should be able to understand
• permutations, factorial notations, and problems involving permuta-
tions
• cornbinatios and problems involving combinations
• difference between permutation and combination.

90. INTRODUCTION
Permutations refer to different arrangements of things from a givea
lot taken one or more at a time whereas combinations refer to different
sets or groups made out of a given lot, without repeating an element, taking
one or more of them at a time. The distinction will be clear from the
following illustration of combinations and permutations made out of a set
of three elements (a, b, C).
 300
BUSINESS MATHEMATICS
Combj,iatjo,,t Pef,nwtations
(i) one at a time (a), {b}, {c} (a), {b}, {c}
(Ii) two at a time {a, b} (b, C) (a, C) {a, b} (b, a)
{b, c} {c, b)
{a, c) {c, a}
(iii) three at a time (a, b, c} {a, b, c} (a, c, h}
(b, c, a) {b, a, c}
{c, a, b} (c, b, a).
It may he noticed that on the left above, every set has different
Combination whereas oil right above, there are sets with different
arrangements wherever possible of the same group. However no
element appears twice in any set, e.g., (a, a), {b, h}, {c,
c ), (a, b, b},
{c, C, C) etc.
91. FU NDAMENTAl. RULES OF COUNTING
There are two fundamental rules of counting or selection based on
the simple principles of multiplication and addition, the former when
events occur independently one after another, and the latter when either of
the events can occur. At times we have to combine the two, depending
on the nature of the problem. We can state the principle as follows
If one tiling can be done in tn way.c and when it has been done in any
f
O the In ways , a second thing can be done in ,i ways ,
together can be done in rn x n wars.
then the two things
Proof. Let a, 2' •• ,a m be the rn
b2 , , h,, be the n ways
ways of doing the first thing and b 1 ,
of doing the second thing independently of the first.
Then, the two things can be (lone simultaneously in the following ways
a1b1 ; cb1 ; a, b,....; a1h
a1b1 ; a2b, ; a 2 b.,; ... ; a2h,

a,b2 ; ab3 ; ... ; ab,,

These are ra x n number of ways of selecting both the things
simultaneously,

Li 3. • ' 5 6

iJ 2'
2J3 idj 15
I 1
>'ir\27 l_!-126

( 3.5 ( 3.6

5.1 5.2 J 5.3 54 5

661 62j465
PERMUTATIONS AND COMBINATIONS 301
We can illustrate the idea by the shown oil page 3130 diagram which
indicates how two dice with number I 2, 3, 4, 5 and 6 on its six sides can
combine in 6 2, i.e., 6.: 6 or 36 ways.
Therefore, from the fundamental principle of counting, if repetitions
are allowed all the N elements taken together can occur ill N ways. if,
however, only r of the N numbers are taken at a tune, the possible ways
are A' or 62 in the above case. 11 repetitions arc not allOVCd then the
diagonal comprising (1, I , i. 2,2} etc., is avoided and the total choices.
are 6x 5 -30 or it (n — I) only.
Exttruple 1. I/tore are Jive routes for journey Jro,ii station A to
station 13. In how oumy JiJ,7ereu( WUS can (4 OUt!! go from .4 to B and
return, if returning
(1) any oft/ic routes is token,
(ii) the saute route is token,
(iii) the same route is not taken.

Solution. (i) The man can go from A to B in S different ways,

for he may take any one of the live routes. When he has done so in any
of the 5 ways, he may return in 5 different ways, i.e , there are 5 different
wa y s at returirig.
:. The total number of different ways are 5 x5=25.
(ii) in case there is only one way of returning, then the total number
of different ways are 5 x I 5.
(iii) if there are 4 different ways of returning, then the total numbct
of different ways are 5 x 4 20.
Example 2. flow many telephone connections can he allotted with 5
anj 6 dic,'its from the natural ?Jutn/,er5 1 10 9 inclusive ?
Solution. As per the rules of counting, the total number of tele-
phone connections call
N'-9'=59,049
=9'=5,3l,44l
U.Ln1ple 3. In how many wa ys can a chairman and a vice-chairman
of a hoard of 6 members can occupy their seats ?
Solution. Whoever is chosen first, he would be seated in 6 ways
and having seated, the other one can be seated in 5 ways because one
person cannot hold both the seats. Therefore, both the chairman and the
vice-chairman call seated in 6 x 5 30 ways.
Example 4. (a In how many different ways, 3 rings of a lock capt
combine when each ring has 10 digits 0 to 9 ? If the lock opens in onl y one
co,nbutaiion of 3 digits how many unsuccessful events are pos.vlhle 9
302 BUSINESS MATHEMA1IS

(b) An automobile dealer provides motor cycles and scooters In 2 body

patterns and 5 different colours each. Indicate the number of chokes open
to a customer Visiting him.
Solution.. (a) Since the lock opens in one of the combination of 3
given digits, the unsuccessful attempts can be 1000— 1=999.
(b) With 2 body patterns and 5 different colours, a choice of each of
the motor cycle and scooter caii be made in 2 x 5=10 ways. Now he has
to decide whether to buy a motor cycle or a scooter so that the total
number of options becomes
2 x5+2x5=20.
Example 5. Three persons go into a railway carriage, where there
are 8 seals. In how many ways can they seat themselves?
Solution. Since there are eight vacant seats, the first man can
choose any one of these 8 seats. There are thus 8 ways of filling the first
seat, when that one is occupied 7 seats are left, therefore, the second man
can occupy any one of the 7 seats. The last man can now seat himself
in one of the remaining 6 seats.
Number of ways in which three persons can cccupy 8 seats is
8x7x6=336
92. PERMUTATIONS
In the rules of counting we have considered the possible choices of r
different objects from N different objects or events, with or without
repetition.
In permutations we have different arrangements of certain number
of objects, say r at a time taken from n different objects without repetition
of any given object in any one set more than once. To illustrate there
are many permutations of ABC but none will be like ABB or AAA,
thus
the objects in each set are different and there will be as many sets as are
the arrangements possible from a given number of objects For example
a bookseller has received three new books A, B, C. He can place them in his
showcase in any of the following 6 ways
ABC, ACB, BAC, BC'A, CAB, CBA
There are thus 6 ways of arranging three distinct objects when each
arrangement is of all the 3 objects. No repetition has been allowed in
any one arrangement, each element appears only once. Mathematically,
we can say that three distinct objects can be arranged in 3.2.1=6 ways.
We can reason out this as follows : "There are three places to be filled,
the first can be filled in 3 wa y s, the second in 2 ways while for the third
there is only I way. Hence, there are 3.2.1 ways in all.
93. KR AMP'S FACTORIAL NOTATION
The product of the first n natural numbers, viz..
called factorial n or n factorial and is written as I n or n 1, 2, 3, . , n, is
PERMUTATIONS AND COMBINATIONS 303

Thus n!=1X2x3X ... X(fl--1)xn

From this it follows that
n (n—i)!
• (n— 1). (n-2)

1 )(n-2)...(n— 1+1) {(fl—r) !}

!
Show that ----- =90
Illustrations I. 3how
101 10.9.8!
---0
8!
!
2. —=n3-11.
Show that (n-I-I)
(n-2)!
(n4-1) ! (r+ l)n('-.- I) (n—)2
LHS
(n-2) ! (n-2) I
=(n .-4-- l)n(n-1)=113-11.

3. Show that 30 1=2 15 . 15 1 . (I . 3 . 5...29).

30 !=1 .2.3.4.5 ... 29.30
=(l.3.5...29)(2.4.6...30)
=(1.3.5. .. 29)[(2. 1). (2. 2). (2. 3). .. (2.15
=(1 . 3 . S ... 29)211(I.2.3..,15)
=(I.3.5 ... 29)2'.I5

94 PERMUTATIONS OF u DIFFERENT THINGS

Permutations of n different things taker: r at a time, where r<n are
ntn 1)(n_2). ..(n—r -1.- 1).

The number of permutations of ?I things taken r at a time is

the same as the number of different ways in which r places can be filled
up by n things.
The first place can be filled up in U ways, for any one of the n things
can be put in it.

When the first place has been filled Up in any one of the n ways, the
second place can be filled up in (n —I) different ways, for any one of the
remaining n—I things can be put in it. Since each way of filling up the
first place can be associated with each way of filling Un the second place,
the first two places can he filled up in n(n - I) ways.
11
P 2 = n(n___ 1)
When the first two places have been filled UP in any one of the
n(ri-1) ways, the third place can be filled lip in (0-2) ways.
 304 BUSINESS MATHEMATICS

•. The first three places can be filled tip in n(n - 1)(n -2) ways, i.e.,
P3 -=10_. l)(n— 2)
Proceeding in the same way and noticing that the number of factors
are same as the number of places to be filled up and that each factor is
less than the former by 1, we have the total number of ways in which r
places can be filled up.
i:(n — 1) (11 --2) ... to r factors
==iJyt_I) (n —2).. (n—r-- 1)
=n(n— I) (a -2)•..(i' --r+ 1)
P, =Jm(n— I) (n--2) .. .Qt—r + )
Remarks 1. The number of permutations of it things taken
all at a time is
== 11(11 - I) (a-2). .3.2.1

2. (a -2) ... 3.2.l.r"P

3 = n(n - I) (1)---2) ... ( a - r -f 1)
-- n(n 1)("— 2) ... (it r -(it
I) {
(a I.)
it
- r) !
'I. We have
n = a!
Also

a!
0!
a'

According to the dctinition, 0 ! is meamimig!ess. Uut when used as a

symbol, its value is 1.
5. The number of l)errnutatLos of a difter:it things taken r at a
time in which each thing is repeated r times in any arrangement is a
Example 6. Find how Inaayfour-Ie!ter words can he formed out of
the word LOGARITHMS. (The words may not have an y meaning.)
Solution. There are 10 different ktters, therefore, n is equal to 10
and since we have to find four-letter words, r is 4. Hence the required
number of words are
10' -l0x9x8x ... x2x1
6x4. ... x2xl
==10x9 x8 x7=5,040
 305
PERMUTATIONS AND COMBINATIONS
11tilhers grealer than 7,000
Example 7. Indicate how many 4 digit 11
Can he formed from the digits 3, 5, 7, 8, 9.
Solution. If the digits are to be greater tLlrsu 7000, then the flrs
digit can he any one of the 7, S and 9.
; 3) and the
N ow the !irst digit can be chosen iii 3 ways lct't. which can be
remaining
m three digits can he any of the four digits
chosenn i P 3 ways. Therefore the total number of ways
=3x ' P 3 = 3 x4x 3>2 .72
Example 8. In how many wars cniilS J't'lzigu, 3 English and 3
TwniI Io'ks fe arranged if the book of each different language are are kept
together.
amongst themselves can b e
Solution. The each language book am
arranged in the following ways
Telugu 5 books in P 5, i.e., 5 ways
English 3 books in 3 P3, i.e., 3 1ways
Tamil : 3 books in 33, i.e., 3 ways
or 3 1 ways,
Also arrangement of these groups can be made in 3 P 3
hence by the fundamental theorem, the required arrangements are
5 ! x 3 I)< 3! x 3 !=25,920
9 . 5 CIRCULAR PERMUTAI'[ONS
it
These are related with arrangement of objects as in the case of
sitting arrangement of members in a round-table conference. Here the
arrangement does not change unless the order changes. Let us consider the
following two arrangements of 5 members

It may be seen that the above two arrangements are the same. But it
is not so in the following cases where the order changes
Therefore, in the circular arrangement, the relative position of the
other objects depends on the position of the object placed first, it IS
only then the arrangement of the remaining objects is made. Therefore,
the circular arrangement of n objects will be in (n — I) 1 ways and not '
 306
BUSINESS MATHEMATICS

ways, when all the objects are considered for the purpose. Thus the
circular arrangement of 5 persons will he in 4 ! ways, i.e.,
4.3.2.1 = 24
ways. We now make use of the above principle in a slightly complex
situation.
Example 9. In how many ways can 5 j,oy.c and 5 girls be Seated
around a table so that no 2 boys are adjacent
Solution. Let the girls be seated first. they call in
4 ! ways
according to the rule indicated above. Now since the places for the boys in
between girls are fixed, the option is there for the boys to occupy the
remaining 5 places. There are S ! ways for the boys to fill up the 5 places
in between 5 girls seated around a table already. Thus, the total number
of ways in which both girls and boys call seated such that no 2 boys are
adjacent are 4! x 5! z 2880 ways.
Rernarl(. In the circular arrangements, the clockwise and anti-
Clockwise arrangement do not make any difference because mere turning
of a given arrangement will make it o therwise. I [owevcr, if the neighbr_
oii
hood of one or more is restricted, the arrangement will get restricted to
that extent. It there is a question of arrangement of n different objects in
such a way that no two similar things are close to each other then the
number of ways will be I (n - I) !.
For example, if 7 persons are seated around a table so that all of
arr angements have not the same neighbours, then the required number of
ways Will beA (n— I) ! or A (6.5.4.3.2 1) =360.
Example M. In how lflwiy ways can 4 Indians and 4 Pakistanis he
seated at a round to/,/e so that no two Indians 'nap be together ?
Solutj. Put one of the Pakistani iii a fixed position and then
arrange the remaining three Pakistanis in all possible Ways. Thus the
number of ways in which the four Pakistanis he seated at a round table is
3 1. After they have taken their seats in any one way, there are four seats
for the Indians each between two Pakistanis. Therefore, the Indians
can be seated in 4 1 ways corresponding to one way of seating the
Pakistani.
Total number of arrangements is 4 ! x 3 1=144
Example ii. The chief ministers of 18 States in India meet to
discuss the problem of unemployment .
In how many ways can they seat
themselves at a round table if the Punjab and Bengal chief ministers choose
to sit together ?
Solution (a) Since the chief ministers are to sit at a round table, we
shall have to fix the position of one of the chief ministers and then make
the other 17 chief ministers take their seats. Since the Punjab and
Bengal chief ministers are to sit together, consider them as one. These
16 can now be arranged among themselves in 16 ! ways. Further the
Punjab and Bengal chief ministers can be arranged in 2 ! ways.
Hence the required number of ways is 16 lx 2
PERMUTATIONS ANI) COMBINATIONS 307

9'6. PERMUTATIONS OF THINGS NOT ALL DIFFERENT

The number of permutations of n things of which p things are of
one kind, q things are of a second kind, r things are of a third kind and
all the rest are different is given by
n
x= pq!X'
Let the n things he represented by it letters and suppose p number of them
are each similar to a, q of them are each similar to /, r of them are each
similar to c and the rest all different.
Let I he the required number of permutations. If the p number of
letters a he replaced b y p new letters, different from each other and
different from the rest, then without changing the position of any other
letter, they would produce p ! permutations.
x number of permutations would produce x x ! permutations,
i. e. the total iiumber of permutations would become x p 1
Again. if the q number of letters 'b' be replaced by q new letters
different from each other and different from the rest, then the total number
of permutations would become xx p ! x q I.
Again, if the r number of letters 'C' be replaced by r new letters
differerut from each other and different from the rest, the total number
of permutations would become x:< p ! x q ! x r !.
But now the it things are all different and the permutations of 'I
different things taken all at a time is '1
x'xp!Xq !xr!=n!
-
p!xq !xr
The above principle can easily be generalised.
Example 12. (a) Find the number of permutation of the word
ACCOUNTANT.
(I,) Find the number of permutations of letters in the word ENGINE-
ERING.
Solution. (a) The word ACCOUNTANT has 10 letters, of which 2
are As. 2 are Cs, 2 are Ns and 2 are Ts, the rest are different. Therefore.
the number of permutations is
10 1 10.9.8.7.6.5.4.3.2.1
2!2!2!2! 2.2.2.2
= 2.26,800
(h) Since the word ENGINEERING consists of 11 letters, in
which there are 3 Es, 3 Ns, 2 Gs, 2 Is and one R, the total number of
permutations is
Ii!
3! 31212!
 08 BUSINESS MATHMAT1CS

Example 13. Find the number of arrangements that Can be made out
of the letters of the word "ASSASSINATION"
Solution. There are 13 letters in the word of which A occurs thrice,
S occurs four times, I occurs twice and N occurs twice and the rest are all
different. Hence, the required number of arrangements is
13
3!412!2!
Example 14. flow ,nwiy numbers greater than a million can be
formed with the digits 4, 5, 5, 0, 4, 5, 3 ?
Solution. Each number must consist of 7 or more digits. There are
7 digits in all, of which there are 2 fours, 3 fives and the rest different.

The total numbers are 71 •420

2!3!
Of these numbers, some begin with zero and are less than one million
which must be rejected.
The numbers beginning with zero are 60
The required numbers are 420-60-360
Example 15. flow many dijferen words can be made out of the letters--
In the word ALLAHA BAD. In how many of these will the vowels occupy
the even places?
Solution, (1) The word 'ALLAI1AI3AD' consists of 9 letter of
which A is repeated four times, L is repeated twice and the rest all different.
Hence the required number of words are

=7560
4!2!
(ii) Since the word ALLAFIABAD consists of 9 letters, there are 4
even places which can be filled up by the 4 vowels in 1 way only, since
all the vowels are similar. Further, the remaining 5 places can be filled up
by the 5 consonants of which two are similar which can be filled in
5! .
'— ways. Hence the required number of arrangements are I X 60.

Example 16. How many arrangements can be made with the letters
of the word MATHEMATICS and in how many of them vowels occurs
together ?
Solution. The word MATHEMATICS consists of ii letters of
which 2 are As, 2 Ms, 2 Ts and the rest all different.
The total number of arrangements are
II!
2! 2!2!
PERMUTATION S AN!) COMBINATIONS 309

The word MATHEMATICS consists of 4 vowels A. A, K and I (two are

in which the four vowels
similar). To find the number of arrangements which
occur together, consider the four vowels as tied together and forming OilC
letter. Thus we are left with S letters of which 2 are Ms, 2 are i's, I is H.
I is C, I is S and thc vowels as 1 letter. These letters can be permuted in
_...L_ ways. The 4 vowels which are tied together can again be permuted

among themselves m ways (since two of the vowels are similar). Hence

the total number of arrangements are

120960
2!x2! 2!
NGE'
ExinipIo 17. In how many ways can the letters of word 'ARRANGE'
be arranged? 1/ow many of these arrangements are there in which
(i) the two Rs come together,
(ii) the two Rs rio not come together,
(iii) the two Rs and the Iwo As Caine together ?
Solution. The word ARRANGE consists of 7 letters of which two
are As, two are Rs and the rest all ditlererit. Hence they call arranged

amongst themselves in -- _.--, =1260 ways

(1) The number of arrangements in which the two Rs come together

can be obtained by treating the two Rs as one letter. Thus there are 6
letters of which two (the two As) are similar and so the total number of
!
arrangements- 6 -= 360.

(ii) The number of arrangements in which the two Rs do not come

together call obtained by subtracting from the total number of arrange-
ments, the arrangements in which the two Rs come together. Thus the
required number is 1260 —360=900.
(iii) The number of arrangements in which the two -Ps and the two
As come together can he obtained by treating the two Rs and the two As
as a single letter. Thus there are 5 letters which are all different and so
the number of arrangements is 5 ! = 120.

91. RESTRICTED PERMUTATIONS

(i) The number of permutations of n different things taken r at a time
In which p particular things (10 not occur is
Keep aside the p particular things and fill up the r places with the
remaining n—p things at our disposal. The number of such ways is
n- J,

(ii) The number of permutations of n different things taken r at a time

L which p particular things are present is P P_X rP
 BUSINESS MATHEMATICS

Keep aside the p particular things and form the permutations of the
remaining n-p things taken r-p at a time. The number of such permu-
tations "-'P,_,.
In each of these permutations introduce the p particular things taken
aside, one by one.
The first thing can be introduced in r-p+l ways. The second thing
can be introduced in r-p+2 ways and the pth thing in r-p-i- p or r
ways.
The p things can be introduced in each permutation in
(r-p+ l)(r--p+2) ... r ways which is clearly equal to rJ),
The required number of ways are ''P,_x rJ)
Example 18. If 12. "P 2 , find it.
npL._ and flPz=( it
Solution.

Now (n--4) (n-2)

12(n-4) ! =(n-2)
12(n 4)! = (n 2)n - 3) (n - 4)! }
12=n 2 -51i F6
712.---5n-- 6=0
(fl-_6)(n+-I):0
or n -= ---1
Since n is positive integer, we reject the second value of n • Thus
n=6.
Example 19. Find tire value of it if four times the number of permu.
lotions of,: things taken 3 together is equal to 5 limes the nwnher of permu-
tations of (n - 1) things take,, 3 together.
Solution. We are given that
4xP3 =5 X""Pa
4 xn(n-1)(n-2)=5 x (it -l)(n-2)(n -3)
Dividing throughout by (n-l)(n-2), we get
4n=5(n_ 3), i.e., 4n-5n--- IS

n-=J5
Example 20. Proe that
Pr .= flX Pr.1
Solution. R.H.S. --it '
(t:-l) ! (n-I)!
=nx —=n
{(n-1)-(r-1)) (n --r)
nAP
F'ER1UTA1'IONS AND COMBINATIONS 311

Example 2 1. Find the numbers less than 1000 and divisible by 5

Ojich can be Jormed with digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 such that each digit
does not occur more than once in each number.
The required numbers may be of one digit, two digits or
three digits and each of them must end in 5 or 0, except the number of one
digit which must end with 5.
The number of one digit ending in 5 is 1
The number of two digits ending in 5 is 1' 1 —1
the number having 0 as the first figure is to be rejected)
The number of two digits ending in 0 is 01)1
The number of three digits ending in 5 is 'P-11'1
(.. the numbers having 0 as the first figure are P)
The number of three digits ending in 0 is 9P2
Hence the total number of required numbers is
1 -1-(° P - - I) - U P, +(F2 --P1 ) -F-9F
154
Example 22. (a) In how rnaizy different ways can 8 exa,ni,iatiOfl
papers be arranged in a line so that the best and worst papers are never
together ?
Solution. The total number of arrangements that can be made of
8 paprrs is 8 ! . Now let the best and the worst papers betaken together.
These taken as one and the remaining 6 can be arranged amongst them-
selves in 7 ways. In each of these arrangements the best and the worst
papers can he arranged in 2 ! ways.
The total number of arrangements in which the best and the
worst papers can come together are 7 ! x 2
The number of arrangements in which the two particular papers
are not together are
8 —2 x 7 40,320-10,080=30,240
(b) Six papers are set in an examination, of which two are 'Statistics'.
In how many different orders can the papers he arranged so that the two
statistics papers are not together ? [i.C.W.A., December 19901

Solution. Number of ways in which six papers can be arranged

=6
If two statistics papers are to be kept together then the six papers
can be arranged in 5 x 2 ways.
Hence the number of arrangements in which six papers can be
arranged so that the two statistics papers are not together
=6 !-5 !x2 ! =5 !x4=480.
Example 23. There are 5 boys and 3 girls. In how many ways can
they stand in a row so that no two girls are together ?
 312 BUSINESS MATHEMATICS

Solution. Since no two girls are to be together, each girl must be

placed between two boys. Place the 5 boys thus
X B1 x B2 XB 3 X B4 < Bx
Ja order that no two of the girls he together, they can only be placed in the
places marked as x There are 6 such places and so the 3 girls can he
placed in 6P3 ways. Further, the 5 boys can be arranged among thcni-
selves in 5 ! ways.
Since, for each way of placing girls there are 5 ways of placing the
boys, the total number of arragcments
= 6P3 !=14,400
x5 =4---- x5
Exaiiiple 24. How many num hers of SIX digits can f)e formed from
the digit 4, 5, 6, 7, 8, 9; no digit being repealed, flow many of them are
not divisible b y 5 ?
Soutior,. The six digits being different, they can he arranged
among themselves in 6 ! ways, all the digits being taken at a time.
Let us find the digits divisible by 5, such digits can be
be obtained when
S occurs in the unit place. The position of 5 being fixed, the remaining 5
digits can be arranged among themselves in 5 ways. So the numbers
divisible by 5 are 5
Hence the numbers not divisible by S are 6 ! -5 ! 600
Example 25. In how many nays can 3 boys and 5 girls be arranged
in row so that all the 3 bo ys are together,
Solution. Consider the 3 boys as one unit. Now there are 6 units
and they can be arranged among themselves in 6 ways. En each of
such arrangements, the 3 boys can be arranged among themselves in I 3
ways. -
:. Total number of arrangements in which the boys are together
1 6 13-=72Ox6=4320
Example 26. In how many ways can the letters of the word
FAILURE he arranged so that the consonants may occupy only odd
positions ?
Solution. There are 7 letters of which 3 (ELR) are consonants and
4 (AIUE) are vowels.
The 4 positions to be filled up with consonants are indicated below
1 2 3 4 5 6 7
(F) (L) (R)
The 3 consonants can be placed only in the 3 out of the 4 posi-
tions marked 1,35.7 The total number of ways in which this can be
done is
'Pa 4.3.2=24
 Ia1MUTATIONS AND COMBINATIONS 313

One such arrangement is shown on page 312. For this arrangement the
4 vowels can occupy the four remaining positions such as 2, 4, 6. 7, I.e.
positions not Occupied by consonants is 4 1 or 24 ways.
Total number of arrangements are 24x 24= 576.
Example 21. In how many ways an the letters of the cord
STRA NGE l,e arranged so that
(i) the vowels are never separated,
(ii) the vowels nei'er come together, and
(iii) the vowels occupy only the 0(1(1 places.
(i) There arc 7 letters. Since the vowels are not to be
separated we may regard them as forming one Jcttc r so there are six letters
S, 1, R. V, G and ,4E. They can he arranged among themselves in 6
ways. ] 'Ile V\
' 0 \'owels can again he arranged in 2 1 ways.

i]mc total number of arrange ments 6 ! ' 2 1 440

(ii) The number of arrangements in which the vowels do not come
together can be obtained by subtracting from the total number of arrange-
ments. the number of arranccnients in which the vowels come together.
Since the total number of arrangements is 7 ! and the number of
arrangements in which the vowels conic togetia2r is 6 ! x 2 ! . Therefore,
the umber of arrangements in which the vowels do not come together
-=7!--6!x2! 6!x5-3600.
(iii) Since the number of letters in the word STRANGE are 7, the
total number of places are 7, and the number of add places are 4(l. 3. 5, 7).
The two vowels A and E ae to occupy t'.vo of these four odd places which
they can occupy in 4 P ways.
When the vowels have been placed in one way, there remain five
places to he filled up by the remaining 5 consonants which can he clone in
/ 5 ways. Now each of the ways of arranging the vowels can be
associated with each of the 5 P5 ways of arranging t he consonants.
The total number of arrangements = 4 P2 x 5 P5 12 x 120=1 440.
Exam pie 28. A number of four different digits is formed by using
the digits 1. 2, 3, 4, 5, 6, 7 in all possible ways. Find (I) how many such
numbers can be formed, and (ii) how many of them are greater than 3400 ?
Solution. (i) With the seven digits 1. 2, 3, 4. 5, 6, 7, the numbers
of four different digits that can be formed are 7P 4 =7x 6>5 x4=840.
(ii) Now we want to find the numbers out of 840 that are greater
than 3400.
If the number is greater than 3400, then the first left hand digit in
the four digit number cannot be I or 2.
The left hand digit must, therefore, he either 3, 4. 5. 6 or 7. If the
first left hand digit is 3, then the second left hand digit can be filled in
4 ways, i.e., with 4, 5, 6 or 7 and the third digit can be filled in 5 ways, i.e.,
314
BUSINESS MATHEMATICS
with the numbers except those chos,i for the lust two digits and the fourth
digit can be filled in 4 ways, i.e., with the digits except those used for the
first
3400 three
are digits. Thus the nurnbCf5 starting with 3 and greater than

4X5 X4=80
Now if the first left hand digit is filled in 4 ways, i.e., with either
4. . 6 or 7 then the secoiict digit can be filled in 6 ways, i.e., with any of
the given digits except the one used for the first digit, the third similarly
Can he filled in 5 and the fourth digit can be tilled in
4 ways. Thus the
total four digit numbers greater than 3400 are
4x6 x 5x4=430
Hence the required four digit numbers are 80 1 480=560.
Example 29. The letters of the word ZENITH are written in all
poss:/;le orders, flow many words are possil,le if all these words are
written out as in a dictionary ? What is the rank of the word ZENITH 7

The total number of possible words will (be 6 P6 720

Since there are 6 diflerent alphabets.
The number of words beginning with E will he 5 P5
120
Thus, the total number of words beginning with E, iV, 1, T and if
will be 5 xP--6ü0.
The words beginning with 7 will have their rank between 600 and
720. Of these 120 words, the number of words with
can he E in the second place,

120j5=24
Thus, the rank of the words beginning with ZE will be 601 to 624.

ordersNow, taking into account three letters we have the following rank
ZEFI 601-606
ZEI 607-612
ZEN 613-618
ZET 619-624
The total words in the dictionary beginning with ZEN are
ZENHIT 613
ZENHTJ 614
ZENIHT 615
ZENITH 616
ZENTHI 617
ZEN Till 618
The required rank is, therefore, 616.
PERMUTATIONS AND CO1F3INA I IONS 315

Example 30. If the letters of (lie word ''WOMAN'' he perinwa'ed

mid (lie words so formed be arranged OS in ci dictionary, w!rctt will be the
rank of the word ' ivomw" ? (CA. Entrance December, 19331

Solution. The total number of possible words will be 5P,= -120

since there are 5 alphabets.
The number of words beginning with A will be 1' -- 24. Thus the
number of words beginning with A, 41, N and 0 are 4 24 --96. The words
beginning with W w i ll have the i r ranks from 97 to 120.
The words beginning with W and having A, M and N in the sccond
place ace 3 x 3 P3 = 18.
The words beginning with W, 0 and A will be J' 2.
The words beginning with W and 0 will have their ranks from
97+ 18= 115 onwards.
The words beginning with U", 0 and 41 will have their ranks
from 1151-2= 117 onwards.
We hac
JJO41AV 117
Its
Hence the rank of the word ''woman" is 117.
EXERCISE (I)
1. (a) Evaluate (i) 1 3 , (a) ' P I, (ii:) (iv) 5, (v) 94•
if)3__5 : 12, (ii) 'P= 14: 1
(b) Find if 'P3:
(c) Find r if 7Pr60.713.
2, There are four routes for going from A to 13 and five routes for
going from B to C. in how many different ways can a man go from A to
C via B.
3. There are 8 vacant chairs in a room. In how many ways can
5 persons take their seats ?
4. There are 50 stations on a railway line. How many different
kinds of single first class tickets must be printed so as to enable a passenger
to go from one station to another ?
5. How many different numbers of six digits can be formed with
the digits 3, 1, 7, 0, 9, 5, 7 How many of these have 0 in ten's place ?
6. (a) How many different words can be formed with the letters of
the word SUNDAY? How many of the words begin with N ? How
many begin with N and end in
(b) How many different arrangements can be made by using all the
letters of the word (1) MONDAY (ii) ORIENTAL ? I low many of
these arrangements begin with A and end with N?
(c) In how many ways can a consonant and a vowel be chosen out
of the letters of each of the words (1) LOGARITHM, (ii) EQUATION 7
316 BUSINESS MAThIMATICS

7. How many different words containing all the letters of the word
TRIANGLE can be formed ? How many of them
(i) begin with T, (ii) begin with E, (iii) begin with T and end with
F ?, (iv) have 1' and F in the end places, (v) when consonants are ileVer
together, (vi) when no two vowels are together. (vu) when consonants
and vowels are both always together, (viii) vowels occupy odd places ?
(ix) the relative positions of the vowels and consonants remain unaltered ?
(x) vowels Occupy the second, third and fourth places ?
[flint. 8 !, (i) 7!. (ii) 7!, (iii) 6 !, (iv) 2 !x6 !,
(v) 8 ! - 4 x 5 !, (vi) 'Px 5 !, (vii) 2 5!x3
(viii) 4 P3 > 5 !, (ix) 5 !<3 !.J

S. Find how many words can be formed of the letters of the word
' FA ILURE', the four vowels always coming together.
9. In how many ways 10 examination papers he arranged so that
the best and worst papers never come together.
10. Find the number of ways in which i t hooks can be arranged on
a slid I so that two particular books are not together.
11. (a) In how many ways call books on Commercial Mathematics
and S books on Secretarial Practice be placed oil shelf so that books on
the Same subject always remain together ? (no two hooks are identical).
(1) Six papers are set in all
of which two arc mathe-
matical. In how many different orders call papers be arranged so
that (i)
the two mathematical papers are together and (U) the two mathe-
niatical papers are not consecutive ?
12. (a) Find the number of permutations of the letters of the word
'SIGNAL' such that the vowels may occupy only odd positions.
(f) In how mans' wa y
s can the letters of the word VIOLENT be
arranged so that the vowels 1. 0, E. occupy even places only.
13. (a) how many numbers between 1000 and 10.000 can he formed
With the diQitS 1. 2, 3, 4, 5 1 6,7.8, 9? I-low many of them are odd?

(/) How many numbers between 3000 and 4000 can be formed with
the diGIts 1, 2, 3, 4, 5, 6?

14. The figures 1, 2, 3, 4, 5 are written in every possible order.

How many of the numbers so formed will he greater than 23000?
15. A library has 5 copies of one book, 4 copies of each of two
books, 6 copies of each of three books and single copies of 8 books. In
how many ways can all the books he arranged?
16. (a) How man y permutations can he
made out of the letters of
the following words taken all together ?
(I) PERMUTATION (ii) EXAMINATION,
(ill) MISSISSIPPI, (iv) COLLEGE.
PERMUTAIU)NS AND COM [IINArtONS 317
(ii) How many permutations can he made out of the letters of the
word lNt)EPENI)ENCE '? In how man y of them the vowels occur
together ?
17. How many numbers greater than a million can be formed with
the digits, 1, 7, 1, 0, 7, 3, 7 ?
13, (a) Find the number of all possible different words into which
the word 'INTERFERENCL' can he comerted by change of place of the
letters, it being given that no two consonants are to be together.
flow many different words can be formed with the letters of
HARYANA ? In how many of these
(i) 11 and N are together,
(ii) begin with II and end with N 1
19. A telegraph post liai five arms and each arm is Capable of 4
distinct positions including the positions of rest. What is the total ilumber
of signals that can he made ?
20, In how many ways can 10 letters be posted in 5 letter boxes ?
21. (a) In how many ways can 8 different beads be strung on a
necklace ?
(/) In how many ways can S boys form a ring ?
22. (a) In how many ways 6 men can sit at a round table so that
all shall not have the same neighbours in any two arrangements ?
() In how many Ways can 7 Indians and 6 Pakistanis sit down a
round table so that no two Indians are together ?
D. (n how many ways can 4 men and 3 ladies be arranged at a
round table if the 3 ladies (I) never sit together, (ii) always Sit together ?
24. A guard of IS men is formed from a group of 'n soldiers in all
possible ways. Find
(1) the number of times three particular Soldiers A, ii and
C are
together on guard. and
(ii) the number of times two particular soldiers D and E
are
together on guard.
Also find In if it is found that D and E are three times as often
together on guard as A, B and C are.
25. A family consisting of an old man, 6 adults and 4 children, is
to be seated in a row for dinner. The children wish to Occupy the two
seats at each end and the old mail to have a child on either side of
him In how many ways can the seating arrangement be made for the
dinner 7
26. Seven persons Sit in a row. Find the total number of seating
arrangements, if
(i) three persons A, B, C Sit together in a particular order
318 BUSINESS MATHEMATICS

(ii) A, /1, C sit together (in any order)

(iii) B and C occupy the end seats
(iv) C al va 'ccupies the middle seat.
27. If all the TerJnutations of the letters of the word CHALK he
written down as in a tItetl)aary, what is the rank of this word ?
28. There arc six students of whom 2 are Indians, 2 Americans and
the remaining 2 are Russians. They have to stand in a line so that the
two Indians are together, the two Americans are together and so also the
two Russians. Show that there are 48 different ways of arranging the
students.
ANSWERS
i. () (i) n (ii) n._4 (c) r=5, 2. 20, 3. 6720, 4. 2450, 5. 600,
120, 6. ((1) 720, 120, 24, (b) (i) 720, (ii) 40, 320 and (i) 24, (ii) 720, (c)
(i) 18. (ii) 15, 8. 576, 9. 2903040, 10. (ii-2) {n— I) !}, II. (a) 1440,
(h) 240, 480, 12. (a) 144, (b) 144, 13. (a) 3024, (b) 60, 14. 78, 15. (39)!/5!
X (4 !)2 (6 !). 16. (a) (i) (l I)! (ii) 4989600, (iii) 34650, (iv) .1260,
(v) 1663200, 16800. 17. 360, 18. (ci) 240, (b) 840, 240, 20, 19. 1023,
20. 310, 21. (a) 2520, (I) 5040. 22. (a) 60, (b) (7 !)2, 23. (i) 4320, (ii) 720,
25. 4 ! < 5! X 7 !. 26. (i) 120, (ii) 720, (iii) 240, (6) 720,
27. (4 ! ± 3 ! ± L !± 1)1' , i.e., 32nd.
98 COMBINATIONS
permutations the objects are based on the order of the arrange-
ments where each change in order constitutes a different arrangement.
But, if order is not of any consequence then it is a problem of combi-
nation. Combinations, therefore, are the groups which can be made by
taking some or all of things at a time.
Thus in combination order does not matter, it is simply the identity
of items in the selection that matters. A change in any one item will cons-
titute a new combination. For example, the number of different ways in
which 6 people call arranged ill queue is a question of permutations
where order matters. The number of different ways in which 6 people can
sit in a committee of 3 is a question of combinations where order does not
matter, but the constituents of each selection do matter. However, repeti-
tion in each combination is not allowed except otherwise stated. Thus
combination of 3 objects taken all at a time is only one but permutations
of 3 objects taken all at a time are 3 ! or 6 as was, in the previous example
for arrangements of three books.
The mathematical formula for finding out combination requires a
slight modification in the formula used for permutations This is as
follows
7?
For permutation. nP

For combination, O C, or nC, or C(n, r) or r )_(n--r) !r!

 P ERMUTATIONS AND COMBINATIONS
319
Or - l)(n-2)...(n ri I)

For example,
pie, a manager of a shop of ready made pa rinen
display 4 eombi:iatiis out of the total 6 colours of Ltd , Is wants to
received in his store, he can display ill cs g arments
following ways
Or(6 6!
4
(5T
6.5.432
(i)(4- 15
Th eorexu The number of
at a lime are given h comb//I//f /o/J of ii (hf/crc,:t filings taken r

- ----- , wi/crc (r n)
r ! (n--r)
Proof Let 'C,
denote the
different things taken r at required number of combination 5 of n
a time,
Each of these combinations has r different things.
If the r different thImim be arranged among tlienisejvcs i ll
possible wa s, each combination would produce r I all
permutfltjms
'C, combinations would
p roduce C, r !
permutations.
number is clearly equal to the munuher of perillutatjons of a But this
taken r at a time. d ifferent things

Hence '•C :< r !

' Cr
1)('12),.,(,z - r + I)
rn
n(n___h)(n2)(nrl I) (a— r) ! a!
(n-.r)! r! (n—r)!
Exnirnple 37. In an exa mination in paper
questions are set, In how on Advance .4ceouf. JO
questions . 'nanv di/Jere,,, nays cn an CXOpl?jp7C
choose 7
Solution. The number of different choices
IS ev idctJy equal
number of was in which 7 places can he to the
filled up by 10 different things.
the required number of ways
/9", 8
10 ,

l>2x3 120.
Fan3p1e
32. In how many nays can 4 white and 3 black ball., be
selected from a bOX Containing 20 white and 15 black
balls.
Solution.
This problem involves merely selection and hence, is a
problem of combinations. 4 out of 20
white halls can be selected in
20 s< 19 18 x I
' i.e., -- 4845 ways.
4x3>2>-:I Call this process as the first pro-
320 BUSINESS MATfIEMATLCS

- 15x 14x13
css. 3 out of 15 black balls can be selected in 'C3 i.e., - = 45 5
3x2xI
ways. Call this process as the second process. The t.vo processcs can be
carried out together in 4845x4552,204,475 ways.
Example 33. From 6 boys and 4 girls, 5 are to he selected for
admission for a particular course. In how many ways can this he done if
there must be exactly 2 girls ?
Solution. Since there has to be exactly 2 girls, there should be
3 boys, the possible combinations would, therefore be
4x3 6x5<4
-l2U ways

Example 34. In a inercanitleJirn, 4posts fall vacant and 35 candi-

dates apply Jor the posts. in how fliaiiy ways can it he m ale,
(i) if one particular candidate is always tFiClUae(/,
(ii) i/one particular candidate is always exclude 1 f ?
Solution. (i) Since a particular person is always to be selected, we
must select the remaining 3 candidates out of the remaining 34.
The required number of selections

=1C 34x33x25984
1x2x3
(ii) Since a particular person is always to be excluded, the choice is
restricted to 4 candidates out of the remaining 34.
The required number of selections

1X2x3x4
Example 35. AJat/ter takes 8 children, three at a time to the Zoo, as
oflen as he can wit/lout taking the saute i/tree together more than once, (1)
how often will each child go 7 (ii) how oflen will he go ?
Solution. (i) A particular child goes as often as that child can be
included in the combinations of 8 children taken 3 at a time.
Let us select one child first of all, then we have to select only 2 from
the remaining 7. This can be done in 7C2 ways.
The number of times the particular child will go is

(ii) The father goes as often as the combinations of 8 children taken

3 at ittime.
The number of times the father will go is
=56
PERMU rATIONS Ar-It) COMBINATIONS 321

Example 36. -It an election there are five candidates out of whom
three are w be elected, and a voter is entitled to vote for any number of
candidates not greater than the number to be elected. In how many ways may
a voter choose to vote.
Soltioi. The voter may vote for one, two or three candidates (flit
of the 5 candidates. He can choose to vote for one candidate in C1
ways, two candidates in ways and 3 candidates in 5 C3 ways. Hence
the total number of ways in which the voter can choose to vote is
&Ci + 5 C.,4Ca= 5-I-JO + 1025
Example 37. The question paper of 'Cost Accounting and Income
Tax' contains ten questions divided into two groups of five questions each. In
/10W ninny ways can an examinee answer six questions taking at least two
questions from each group ?
Solution. The questions may he answered in the following ways
(fl 2 questions from 1St group I- 4. questions from 2nd group
(II) 3 ,, ,, ,, -13
(III) 4 ,, ,. ,, 1-2
(i) Two questions can be chosen from 1st group in 1 C, ways and 4
questions from 2nd group in C4 ways. Since each way of selecting
questions from the 1st group can be associated with each way of selecting
questions from the 2nd group, the total number of ways of sdcctiug ques-
tions from both the groups is 1 C, < C4.
(ii) In like manner, 3 questions from the 1st group and 3 questions
from the 2nd group may be selected in 5 Cx 5 C ways.
(iii) Again, 4 questions from the first group and 2 questions from the
second group may be selected in 11C, x 1 C, ways.
The total number of ways
== 5 C2 x C 4 + 5 C3 x C3 +C4 x

- 5 C2 x 5 C, -f--C2 x 1 C, --C1 x5C2

5x4 5x4 5x4 5x4

5 F5x
XI x x
= 10x5+lOx 10+5x 10=200
Example 38. For an examination, a candidate has to select 7
subjects from three different groups A, B and C. The three groups A. B. C
contain 4, 5, 6 subjects respectively. In how many different ways can a
candidate tuake his selection if he has to select at least 2 subjects from each
group.
Solution. The different ways in which a candidate can make a
selection of 7 subjects so as to have at least 2 from each group can be as
follows
(1) 2 from 4, 2 from B and 3 from C,
(II) 2 from A. 3 from B and 2 from C.
(111) 3 from A, 2 from B and 2 from C.
 322
BUSINESS MATIB7MATjCS
Now the selection of (I) can be done in dC
x 5 C2 x 6C3
=6x10x 201200 ways
Again the selection (II) can be done in c'2
x 5C x 6C2
=6x lox 15=900 ways.
Also the selection (111) can be done in C3 5 C2
x x 6C2
=4x lOx 15=600 ways.
The required number of se1ectio
5 are 1200+90046002700
E*anip!e 39. Out of 10
can be formed each containing 6 co coasoijantS and 4 vowels, how many words
nsonants and 3 Vowels?
SOluti on. 6 consonants can be chosen out of 10 in
3 vowels can be Chosen out of 4 in t' ways. '°C'5 ways and
Co mbining each way of selccing the Consonants with each way
Of selecting the v
3 voweowels the number of s elections having 6 consonants
°C and
Each of these selections contains 9 letters which can
be arranged among themselves in 9 ways.
The total number of words=°C x 4 C > 9
=10C4x4C1X9
l0x9x8x7
1x2x3x4x 4x 362880=304,819200
Example 40. boat's crew consist of 8 men, 3 of whom can
row on one side and 2 A
only on the otherin which only
the crew Can be arranged. Finj the Pzum/,er of ways'
Soint ion 4
men must row on each side. But on one side there
are already three men and on the other side two.
on the side of three men So one must be placed
and two on the other side. This
or 3 ways. can be done in

Again, 4 men on each side can be arranged among themselves in

4 ! ways. Hence the required number of ways
=31x4!X4 !=3x24x241728
Example 41.
SO Os' to include 3 boysA Party of6 is to be formed from 10 boys and Zgirls
and 3 girls. In how many
d er ent ways can the party
/eformej if two particular girls refuse to join the iff
same party?
So1ut0
If the two particular girls do not refuse to join the same
party,
'0c5 wthen we can select 3 girls from 7 in 1C, ways and 3 boys from 10 in
ays. Hence a party of 6 including 3 boys and 3 girls can be
C 3 x b0c35x 120=4200 formed
ways.
Now let us find the number of ways such that 2 girls who refuse to
Join the same party arc included in the same party. For such arrangemen
we have to select only I girl from the re ts
maining 5 and 3 boys from the ttoa
of 10. This can be done in l
5 C1 x Ioc3=sx 1
20600 ways
.. (2)
PERMUTATIONS AND COMBINATIONS 323
We notice that in arrangement (2) those two particular girls who
refuse to join are included. Hence the required number of arrangements
can be obtained by subtracting (2) trom (I), ic., 4200-600==3600.
Example 42. A party of 3 ladies and 4 gentlemen is to he formed
from 8 ladies and 7 gentlemen. In how ninny different ways can the party
be formed if ?fr.r. X and Mr. Y refuse to join the same party ?
[LC.W.A.. June 1990]
Solution. 3 ladies call selected out of 8 ladies in 8 C3 ways and
4 gentlemen Can be selected out of 7 gentlemen in 7 C ways.
rhe number of ways of choosing the committee
8! 7!
5! X-j—,—I96O.

If both Mrs. X and Mr. Y are members, there remain to be selected

2 ladies from 7 ladies and 3 gentlemen from 6 gentlemen. This can be
done in
6'
C2x6C3 420 ways.
! 4! )<313!
The number of ways of forming the party in which Mrs. K and
Mr. refuse to join
Y
=1960-420=1540
Example 43 A cricket team of II players is to be formed Ira/li 16
players including 4 bowlers and 2 wicket-keepers. In how many different
wars can a team he formed so that the (coin contains (a) exactly 3 bowlers
and / wicket-keeper, (I) at least 3 bowlers and at least one wicket-keeper.
Solution. (a) Here a cricket team of 11 is exactly to contain
bowlers and a wicket keeper. 3 bowlers can he selected out of 4 in 4 C3, ie
4 ways. I wicket keeper can be selected out of 2 in 'Ci , i.e., 2 ways.
Now the remaining 7 players to complete the team can be selected from
the remaining 10 players in IOC , ie., 120 ways. Hence by the funda-
mental principle the total number of ways in which the team can he
formed =42X 120=960.
(b) in this case the cricket team of I can he formed in the following
ways
(I) 3 bowlers. 1 wicket keeper and 7 other players.
(II) 3 bowlers, 2 wicket keepers and 6 other players.
(ITT) 4 bowlers. I wicket keeper and 6 other players.
(IV) 4 bowlers, 2 wicket keepers and 5 other players.
We now consider all these 4 cases.
(1) 3 bowlers, 1 wicket keeper and 7 other players can he selected in
4 C 2 Cx lO C7 r4 2x120=960ways
(ii) 3 bowlers, 2 wicket keepers and 6 other players can be selected
4 C3 x 2 C2 < 10 C6 =4X1 x210=-840 ways.
 324 BUSINESS MATHEMATICS

(iii) 4 bowlers, 1 wicket keeper and 6 other players can ne selected

in dc4 x 1 C1 x lo C6 1X2X2Io42o ways
(iv) 4 bowlers, 2 wicket keepers and 5 other players can be selected
in 4G4x'Cç '°G5 =lx1X252252 ways.
Hence the total number of different ways
=960+840 1-420±252=2472
Example 44. A guard of 12 me' is formed from a group of n
soldiers in all possible ways. Find (1) Me number of times two particular
soldiers A and B are together on guard and (ii) the nwnher of (lines three
particular soldiers C, D and E are together on guard.
Also findn if it is found that A and B are three times is often together
on guard as C, D and E are.
Solution. (1) A guard containing A and B will have 10 other men
from the remaining (n-2) soldiers. Hence the number of such guards in
which A and B are together is _2C10.
(ii) Similarly the guard with C, D, E will have 9 other men. This
can be selected in "C9 ways. Hence C, D, E are together C9 times.
(iii) A and B are together in 2C10 times and C, D, E
are together in
"C times.
2C3Xt_.3C
(n-2)!3x(n_3)!
101(n-12)! 9!(n—l>)i
()(" -3) I 3x(n-3)
- - I.

10x9 ! ( n-12) l'9 I (n-12) 1

(n-2)=3x10
n=32
Example 45. Find the number of combinations that can be made by
taking 4 letters of the word COMBINATION.

Solution. There are 11 letters of 8 different kinds

C, (0, 0), M, B, (1, 1), (N, N) A, T
Thus two Os, two Is and 2Ns are alike. In all the required Coin-
bmnations some may contain all dissimilar letters, some may not contain
all different letters. Following cases arise:
(1) All the four letters are different,
(1!) 2 letters are alike, 2 are different,
(II!) 2 letters are alike of one kind, 2 are alike of other kind.
(1) There are 8 different letters. The required number of combi-
nations = 8C4.
(ii) There are three pairs of alike letters,
vii,, (0, 0), (I, I) (N N),
One pair can he chcsen in 3C 1
ways. Remaining 2 different letters can be
selected from remaining 7 different letters in 7C, ways. Hence the number
of combinations of this type is 3 C1 ) C2.
?KMUTATONS AND COMBINATIONS 325
(lii) Two pairs of similar letters can be chosen in 1C, ways.
Hence the total number of required combinations is
SCF3CxlC+C_l36
Some Iniportant Deductions

1. 1k c0 = ----------. = 1
Ol(:-O) 1 O!n! lxnT

if. PlC_h; ' C2 -- -1 -n--and 'c'

Ill.
1
Proof: 1lC,1=
"TO1
IV.

V. n c,= x

These are important theorems and should be committed to the

memory. We give below the proof of the last one which is quite important.
Let us find the number of combinations iii which a particular letter
Bay a 1 would occur, The number of such combinations is C,_ 1 because
we are to choose (r- 1) letters out of the remaining (ii - 1) letters. Similarly
the number of combinations containing a is ' Cr _, the number of com-
binations containing a is also -'C, and so on. The total number of
such letters is n, theref'ore the total number of letters written in these
combinations is a
rX ? C,=nx PP-I C,_ 1 a
:j "C-_=--- x -

This result is true for all integral values of r and n,

Changing ato a - 1, r to r - I we get
n-I x'2C
'C_1=-_-___
r-J
Similarly ,-2C -- n-2 >< '3C'-3
r-2

(r -2) x n(r
(r_ 2)
Multiplying the corresponding sides and cancelling out the common
factors, we get
PC'-
a ( 1') -2) ',-
(r .-I) (r-.--2) 2
326 BUSINESS MATHEMATICS

n(n-I)(n-2) (n-r+2)(n_r+1)
= lXr-2TiT2.1 -
n(n- l)(n -2) ... (n--rf2)(n-r+1)(fl -r) ... 3.2
-- [r(r-1).2 1] [(n-r)...3. 2. 11

r! (n--r)!
99. COMPLEMENTARY THEOREMS
The number of combinations of n different things taken r at a time,
is same as the number of combinations of n different things taken (n-r) at
a time.
I. ., "Cr"C,r, where Orn

We have
r-
____________
j (n - r )

and Cn_r=() !
'ii
n . - (n -- J1 i1,.)
,cr=,lcft_,

Car 1. If "C r ="Cp then either r=p or r + p = n for

therefore, n-r=p or r+p=n.
Cor 2, If in the formula G_,="C,, we put
(1) r=n, then "C0 ='C. 1
(ii) r=rz- 1, then "C1='c',,_1=n, etc.
910. RESTRICTED COMBINATIONS
(1) The number of combinations of n things taken r at a time in which
p particular things always occur is "-'C,_.
If thep particular things are set aside, there remain (n-p) things
out of which (r-p) things may be chosen in 'C, 2, ways. With each of
these groups we combine the p particular things so that we get all the
combinations in each of which the p particular things will always occur.
The required number of combinations=PC,_
(ii) The number of combinations of n filings token r at a time in which
pparticular things never occur Is
Let the p particular things be set aside, then there will remain (n-p)
things out of which r things may be selected in - ,'Cr ways.
In none of these groups p particular things will occur. Hence the
required number of combinations =
Example 46. Prove that
n+ I C, =C, +C, -

Solution We know that

' r!(n_rI
PERMUTATIONS AND COMBINATIONS - 327

• •c Fcr - r (nn --
I n!
F )! - (r— 1) (n --r-- 1)!
n nI
r(r— I) i(n—r) ! +(r 1) (n—r+l) (n—F)!

(r—l) 1TL7 (n—r-j-1)

r
r—l) I (n—r) ! L r (n_r+ I)
- (ii 4- 1)!
I (n—r-t-l) !
Example 47. Find the value of r if 18C,1C,f4
Sohitlon. Since "C C- - WC have ' 8 C, =
But, we are given 18 C 18 _ , 18c,
18—r=r+2
18-2-'r-f-r
16=2r
r=.
Example 48. Findn, "C6 C=91 4.
Solution. We know that
- nI (n_3)_____
an 1-3C --
3! (11-3-3)
• 'C5 n1 3! (n--6)
•.
'-3C, 6 ! (n
-i < (ii 3)!
nI -l n(n - I) (a --2)
(n-3)! <6.5.4
n(n-1) (n-2) 91
Also we are given
6-. 5-.4 ----
n(n-1) (n-2)=5.6.91 =5.6.7.13=15.14.13.
Expressing the three Consecutive integers in descending order, we
get n=15.
911. COMBINATIONS OF THINGS NOT ALL DIFFERENT
We will here show that the total number of combinations of a
different things taken some or all at a time is 2 —1.
The first thing can be dealt within 2 ways, for it may either be left
or taken. The second thing can also be dealt within 2 ways.
Since each way of dealing with the first can be associated with each
way of dealing with the second, the total number of ways of dealing with
the two tbings=2 x 2=2g.
Proceeding similarly, the total number of ways=2
32 S US1NESS MATHEMATICS

But this number includes one case in which none of the things are
taken.
The required number of combinations=2-- I
Now, we consider the ,ir,uther of combinations of n things not all diffe-
rent. The total number of combinations of (p f-q+r-4....) things, where p
are of one kind, q of the second kind and r of the third kind and so on,
taken any number at a time are

Consideu the p like things. The p things can be dealt with in (p+1)
ways, for we may take 1, or 2 or 3, or p or none in any selection.
Similarly the q like things can be dealt with in (q 1) ways, r things in
(r-1- 1) ways, etc. Associating each group of selections with the others,
the total number of dealing with them is
(p . f l)(q+ l)(r-f i)...
But this iiurnhcr includes one case when all things are left. Therefore,
the total number of ways
:(p_f. l)(ql- l)(r 1r 1)......- I

Example 49. In order to pass C A. (Intermediate) examination mini-

mum marks have to be secured in each of the 7 subjects. In how many cases
can a student foil ?
Solutou. Each subject can be dealt in two ways. the student may
pass or fail in it. So the 7 subjects can be dealt in 2 7 ways. But this
includes the case in which the student passes in all the 7 subjects. Exclud-
ing this, the number of ways in which the student can fail is 2— I = 127.
Example 50. A question paper contains 6 questions, each having an
altcrnafne . In how many ways can an examinee answer one or more
questions ?
Solution. The first question can he dealt with in 3 ways, for the
question itself may be answered, or its alternative may he answered or
none of theni may be answered.
Similarly, the second question also can be dealt with in 3 ways.
Hence the first two questions can be dealt with in 3x 3 or 32 ways. Proceed-
ing thus, all the 6 questions may be dealt with in 3 6 ways.
But this number includes one case in which none of the questions is
answered.
The required number of ways= 3— 1=728.
Example 51. There are n points in a plane, no three of which
ore co/linear (lying on the same straight line) with the exception of p
points which are collinear. Find the number of
(i) different straight lines and
(ii) different triangles formed l 'yjoining them.
Solution. (i) Any two points when joined give a straight line.
 329
PERMUTATIONS AND COMBINATIONS

The number of possible straight lines formed by joining n points

in pairs='C2.
But p of the points lie in the same straight line.
C2 straight lines are lost and instead we get only 1 straight line
in which they lie.
.. The required number of straight lines is

nC2

(ii) Any 3 noo-collinertr points give a triangle.

The number of triangles formed by joining ii points taken three
at a timeC3.
Since p of the points are collinear. 'C trian8les are losi.
The required number of triangles is
- n(n—l)(n-2) p(p— I) (p 2)
-
6 6
EXERCISE (It)

1. Find the value of 'C,,

2. () If 2C : 2,IC = 8, find n.
(h) If "C---"C., find the value of 2'C
(C) If Io P, =6,04,800 and °C= 120, show that r=-7.
. A cricket team is to be formed consisting of 2 wicket keepers. 4
bowlers and 5 batsmen from a group of players containing 4 wicket
keepers, 8 bowlers and ii batsmen- Find the number of ways a cricket
team can be constituted.
[Hint, C, x C4 x
4. In how many ways can you choose six out of nine questions?
In how many of these ways the first question is always excluded? In how
many ways the 6rst and second questions are always included ?
S. There are 10 professors and 20 students out of whom a committee
of 2 professors and 3 students is to he formed. Find the number of ways
in which this call be done. Further in how many of these committees
(I) a particular professor is included ?
(ii) a particular student is excluded 7
6. In how man y ways can 21 white balls and 19 black balls he
arranged in a row so that no two black balls may be together.
7. Find out the number of ways in which a cricket team consisting
of 11 players can be selected from 14 players Also find out how many of
these (I) will include captain. (U) will not include captain.
 330
BUSINESS MAT1I51s
8. Out of 5 males and 6 females, a comnlitteo of
Find the number of ways ii, 5 is to be formed.
hich it call be done so that among the
persons chosen in the comrnicte there are W3 mates and 2 females,
(ii) 2 males, (iii) no females, (iv)
males. at least one female, (v) not more than 3
[flint. (I) 5 C3 >< 5 Cx 6 cap
(ii)(iii) sq,
(iv) 6CIX5CI-,6CZC3+6CsX5CI8CX5CC
(v) 5C c5 ±c 1 x6C4+.tc2Xsc3C<4ot]

9. From 7 gentlemen and 4 ladies a Coriilfl j ttec

of S is to be formed
In how many ways can this be done so as to include at least
one lady ?
10. The staff of a batik consists of the manager, the deputy manager
and
10 other officers. A Committee of 4 is to be selected. Find th
number of ways in which this can be done so as to always include (i) e
manager, (ii) the manager but the
manager nor the deputy maclager not the deputy manager, (iii) neither the
11. A
council consists of 10 members, 6 belonging to the party A
4 to the party B. In how many ways can a c and
that the members of the party A ommittee of 5 be selected so
are in a majority ?
12. A cricket club consists of 16 members of which only 6 can bowl.
In bow many ways can an devon he chosen to include at least
4 bowlers ?
13. An examination paper Winch is divided into
ing of 3 and 4 questions respectively, carries the note. two groups consist-
"It is not necessary
to answer all the questions. One question must he answered from each
group." In how many ways can an examinec select the questiocis ?
14. (a) Out of 17 consonants and 5
vowels, how many different
words can be formed each consisting of 3 ConSonacits and 2 vowels ?
(lv) Find the number of words which can he formed with two
different consonants and one vowel, out of 7 different consonants and 3
different vowels, the vowel to lie between two consonants ?
15. There are 48 different books including 18 books on Advance
Accounts, 16 books on Law and 14
books on Management. Find the
number of different ways in which a selection of twelve books call
made so as to have 4 books from each group.
16. How many c
1, 2, 3, 4, 5, 6, 7, ombinations can be formed of 8 counters marked
8 taking theni 4 at a time, there being at least one odd
and one even counter, in each c ombination ?
[Hint. 1 CI )< '< 1 C2 -fC8 X 4C1].

17. There are 12 Points in a plane of which 5 are in a line. Find (I)
the maximum number of triangles that can he foinied with vertices at
these points, (ii)
the maximum number of distinct straight lines that can
be obtained by joining these points.
[Hint. i) 12 C3 - 5 C3 , (ii) - 5C2-1_
PLRMUTATONS AND COMBINATIONS 331

18. A gentleman invites a party of 13 guests to a dinner and places

8 of them at one table and the remaining 5 at another, the tables being
round. Find the number of ways in which he can arrange the guests.
[Hint. Total number ofarrangements=' 3Cx7 !x4 !].
19. Find the number of ways in which (1) a selection, (ii) an arrange-
ment of 4 letters can be made from the letters of the word "MATHE-
MATICS"
[Hint. (1) Total number of selections
1C, + ICI x 7 C2 + 8 C= 136

(ii) Total number of permutations

=1680+756 118=2454]
20. In a crosswordpuzzle twenty words are to be guessed of which
eight words have each an alternative solution also, Find the number of
possible solution.
ANSWERS
1. 56, 210, n(n- 1)(n---2)} 3 1 2. (a) 13, (b) 120. 3. 4 C2 x 8 C4 x C5,
4. 84, 28, 35 5. 1 C2 x 2 °C3 = 51300, (i) C 1 x 20 C3 =- 10260,
(ii) 11)C2 x 9 C3 =43605. 6. 1540. 7. 364, (1) 286, (ii) 86. 9. 441.
b
10. (1) " Cl, (ii) C31 (iii) '°C4 . 11. 186. 12. 3096. 13. 12
14. (a) 816000, (b) 126. 15.ac', x 16 C4 x I4C4 16. 68..
17. (i) 210, (ii) 57. 20. 256.
Binomial Theorem
STRUCTURE
100 INTRODUCTION
101 BINOMIAL THEOREM
102 POSITION OF TERMS
103 BINOMIAL COEFFICIENTS
104 BINOMIAL THEOREM WITH ANY INDEX
10'5 SUMMATION OF SERIES

Objectives
After studying this chapter, you should be able to understand:
• Binomial theorem, position of terms, binomial coefficients and its
application.
• Binomial theorem with any index and calculation of square root,
cube root etc. and simplification.
• Summation of series using binomial theorem.
100 INTRODUCTION
A binomial expression in mathematics in one which has two terms,
e.g., (a+b), (4x+ 3y), (x+ a), etc. These terms are at time complementary
when the expression is used for objects which are of dichotomous character,
i.e., success or failure, true or false, male or female, literate or illiterate.
In business mathematics and statistics, there are various problems based on
such classification where the theorem is found to be very useful.
From elementary algebra, we know

(a+ i) (a + b)(a'+2ab 4-b 2)=a3+ 3a2 b ± 3ab + M

These are quite simple but if the expansion is to a higher order or
with negative and fractional indices the problem becomes quite complicated.
It is here that the rule of expansion stated as the binomial theorem is very
bandy. It will be seen later that we can trace the individual terms of the
expansion without writing the whole series.