Chapter 16 Permutations

Exercise 16.1

1. Compute:
!
(i) !
! !
(ii) !

(iii)
O T IS
.C.M (6! 7! 8!)
N A D
CO N
Solution:
O UC AA
T IO
PY
!
!

Let us evaluate,
ED PR

! × × !
=
! !

= 30 × 29
©

= 870

! !
(ii)
!
D

Let us evaluate,
We know,
11! = 11 × 10 × 9 × … … × 1
10! = 10 × 9 × 8 × … .× 1
9! = 9 × 8 × 7 × … … .× 1
by using these values, we get,
 ! ! × × !
=
! !
!
= !

= 110 – 10
= 100

(iii) L.C.M (6! 7! 8!)

O T IS
Let us find the LCM of (6! 7! 8!)
N A D
CO N
We know,
O UC AA
T IO
PY
8! = 8 × 7 × 6!
7! = 7 × 6!
ED PR

6! = 6!
So,
©

L.C.M (6! 7! 8!) = LCM [8 × 7 × 6! ,7 × 6! ,6!]

= 8 × 7 × 6!
= 8!

2. Prove that: ! + !+ != !
D

Solution:
Given:
!+ !+ != !

Let us consider LHS: ! + !+ !

 !+ !+ != !+ × !
+ × × !
$ $
= × × !

= !

= RHS
Hence proved.

O T IS
3. Find x in each of the following:
N A D
CO N
'
(i) % ! + & ! = ( !
O UC AA
T IO
PY
'
(ii) != !+ !
ED PR

'
(iii) ( ! + ) ! = !

Solution:
©

'
(i) ! + ! = !
% & (

We know that
5! = 5 × 4 × 3 × 2 × 1
6!= 6 × 5 × 4 × 3 × 2 × 1
D

So by using these values,

.
,
! +-! = /!
.
,
! + -×,! = / !
-$ .
= !
-×,! /
/ .
-
! = /×-!
/×/×-!
X= -!

= 36
∴ The value of x is 36.

'
!= !+ !

O T IS
(ii)

We know that
N A D
CO N
10! = 10 × 9!
O UC AA
T IO
PY
9! = 9 × 8!
ED PR

So by using these values,

.
!= !+ !
.
!= !+
©

× !
.
!= !
.
= !
× !
× × !
X=
D

= 10 × 10
= 100
∴The value of x is 100
 '
(iii) ( ! + ) ! = !

We know that
8! = 8 × 7 × 6!
7! = 7 × 6!
So by using these values,
.
/
! +1! = !

/
! + 1×/! = !
O T IS
.
N A D
CO N
$1 .
= !
O UC AA
T IO
PY
1×/!
.
!= !
1
ED PR

.
=
1! ×1!
× ×1!
©

X= 1!

=8×8
= 64
∴ the value of x is 64.
D

4. Convert the following products into factorials:

(i) 5.6.7.8.9.10
(ii) 3.6.9.12.15.18
(iii) (n+1) (n+2) (n+3) …...(2n)
(iv) 1.3.5.7.9…… (2n -1)
Solution:
(i) 5.6.7.8.9.10
Let us evaluate
We can write it as:
× × ×,×-×/×1× × ×
5. 6. 7. 8. 9. 10 = × × ×,
!
= ,!

O T IS
N A D
CO N
(ii) 3.6.9.12.15.18
O UC AA
T IO
PY
Let us evaluate
3.6.9.12.15.18 = 3 × 1 × 3 × 2 × 3 × 3 × 3 × 4 ×
ED PR

3×5 × 3×6
= 36 1 × 2 × 3 × 4 × 5 × 6
©

= 36 (6!)

(iii) (n+1) (n+2) (n+3) …...(2n)

Let us evaluate
[ … 2 … 2$ 2$ 2$ … 2 ]
D

(n+1) (n+2) (n+3) ….(2n)= … 2

3 !
= 3!
(iv) 1.3.5.7.9…… (2n -1)
Let us evaluate
[ - … 3 ][ , / … 3 ]
1. 3. 5. 7. 9… (2n -1) = [ , / …. 3 ]
[ , … 3 3 ]
= 4[ … 3 ]
3 !
= 4 3!

O T IS
N A D
CO N
5. Which of the following are true:
O UC AA
T IO
PY
(i) (2 +3)! = 2! + 3!
(ii) × != ! × !
ED PR

Solution:
(i) (2 +3)! = 2! + 3!
©

Let us consider LHS: (2 + 3)!

(2 + 3)! = 5!
Now RHS,
2! + 3! = 2 × 1 + 3 × 2 × 1
= 2+ 6
D

=8
LHS ≠ RHS
∴The given expression is false.

(ii) × != ! × !
Let us consider LHS: 2 × 3 !
2 × 3 ! = 6!
=6×5×4×3×2×1
= 720
Now RHS
2! × 3! = 2 × 1 × 3 × 2 × 1

O T IS
= 12
LHS ≠ RHS
N A D
CO N
∴The given expression is false.
O UC AA
T IO
PY
ED PR

6. Prove that: n! (n +2) = n! + (n + 1)!

Solution:
Given:
©

n! (n +1) = n! + (n +1)!
Let us consider RHS = n! +(n +1)!
n! + (n +1)! = n! + (n +1) (n + 1 – 1)!
= n! + (n +1) n!
D

= n! (1 +n + 1)
n! (n + 2)
= L.H.S = R.H.S
Hence, proved.
 Exercise 16.2

1. In a class, there are 27 boys and 14 girls. The teacher

wants to select 1 boy and 1 girl to represent the class in a
function. In how many ways can the teacher make this
selection?

O T IS
Solution:
Given:
N A D
CO N
27 boys and 14 girls.
O UC AA
T IO
PY
Here the teacher has to
(i) select a boy among 27 boys and
ED PR

(ii) select a girl among 14 girls.

27
Number of ways to select one boy is C1 and similarly the
©

number of ways to select one girls is 14C1.

Hence, the number of ways to select 1 boy and 1 girl to
represent the class in a function is
14
C1 × 27
C1 = 14 × 27 = 378 ways.
D

2. A person wants to buy one fountain pen, one ball pen,

and one pencil from a stationery shop. If there are 10
fountain pen varieties, 12 ball pen varieties and 5 pencil
varieties, in how many ways can he select these articles?
Solution:
Given:
10 fountain pens, 12 ball pens, and 5 pencil
Here the person has to
(i) select a ball pen from 12 ball pens.
(ii) select a fountain pen from 10 fountain pens and

O T IS
(iii) select a pencil from 5 pencils.
10
The number of ways to select one fountain pen is C1 and
N A D
CO N
similarly the number of ways to select one ball pen is 12C1 and
O UC AA
T IO
PY
number of ways to select one pencil from 5 pencils is 5C1
Hence, the number of ways to select one fountain pen, one ball
ED PR

pen and one pencil from a stationery shop is 10C1 × 12C1 × 5C1
= 10 × 12 × 5 = 600 ways.
©

3. From goa to Bombay there are two roots; air, and sea.
From Bombay to Delhi there are three routes; air, rail and
road. From goa to Delhi via Bombay, how many kinds of
D

routes are there?

Solution:
Given:
The number of roots from goa to Bombay is air and sea.
So, the number of ways to go from goa to Bombay is 2C1
Given: The number of roots from Bombay to Delhi are: air, rail
and road.
So, the number of ways to go from Bombay to Delhi is 3C1
Hence, the number of ways to go from goa to Delhi via Bombay
is 2C1 × 3C1 = 2 × 3 = 6 ways.

O T IS
4. A mint prepares metallic calendars specifying months,
N A D
dates and days in the form of monthly sheets (one plate for

CO N
O UC AA
each month). How many types of calendars should it
T IO
PY
prepare to serve for all the possibilities in future years?
Solution:
ED PR

The mint has to perform

(i) select the number of days in the month of February (there
©

can be 28 or 29 days), and

(ii) select the first day of February.
Now,
In 2 ways mint can select the number of days in February and
D

for selecting first day of February, it can start from any of one
of the seven days of the week, so there are 7 possibilities.
Hence, the number of types calendars should it prepare to serve
for all the possibilities in future years in 7 × 2 = 14.
5. There are four parcels and five post – offices. In how
many different ways can the parcels be sent by registered
post?
Solution:
Given:
Total number of parcels = 4

O T IS
Total number of post – office = 5
One parcel can be posted in 5 ways that is in either of the one
N A D
CO N
post offices.
O UC AA
T IO
PY
So, 5C1. Similarly, for other parcels also it can be posted in 5C1
ways.
ED PR

Hence the number of ways the parcels be sent by registered post

is 5C1 × 5C1 × 5C1 × 5C1 = 5 × 5 × 5 × 5 = 625 ways.
©

6. A coin is tossed five times, and outcomes are recorded.

How many possible outcomes are there?
Solution:
D

Given:
A coin is tossed 5 times, so much, so each time the outcomes is
either heads or tails so two possibilities are possible.
the total possible outcomes are: 267 × 267 × 267 × 267 × 267 =
2 × 2 × 2 × 2 × 2 = 32 outcomes.
7. In how many ways can an examinee answer a set of ten
true/false type question?
Solution:
Given:
An examinee can answer a question either true or false, so there
are two possibilities.

O T IS
The number of ways for an examinee to answer a set of ten true/
false type questions are:
N A D
CO N
267 × 267 × 267 × 267 × 267 × 267 × 267 × 267 ×
O UC AA
T IO
PY
267 × 267
= 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 = 1024 ways.
ED PR
©

8. A letter lock consists of three rings each marked with 10

different letters. In how many ways it is possible to make an
unsuccessful attempt to open the lock?
Solution
The total number of ways to make an attempt to open the lock
D

is = 10 × 10 × 10 = 1000
The number of successful attempts to open the lock = 1
The number of unsuccessful attempts to open the lock = 1000
– 1 = 999
Hence, required number of possible ways to make an
unsuccessful attempt to open the lock is 999.

9. There are 6 multiple choice questions in an examination.

How many sequences of answers are possible, if the first
three questions have 4 choices each and the next three have

O T IS
2 each? N A D
Solution:

CO N
Given: multiple choice question, only one answer is correct of
O UC AA
T IO
PY
the given options.
For the first three questions only one answer is correct out of
ED PR

four. So it can be answered in 4 ways.

Total number of ways to answer the first 3 questions =
©

467 × 467 × 467 = 4 × 4 × 4 = 64

Each of the next 3 questions can be answered in 2 ways
Total number of ways to answer the next 3 questions
267 × 267 × 267 = 2 × 2 × 2 = 8
D

Hence, total possible outcomes possible are 64 × 8 = 512

10. There are 5 books on mathematics and 6 books on

physics in a book shop. In how many ways can a student
buy:
(I) a mathematics book and a physics book
(ii) either a mathematics book or a physics book?

Solution:
(i) Given: there are 5 books of mathematics and 6 books of
physics.

O T IS
In order to buy one mathematics book, number of ways is 5C1
similarly to buy one physics book number of ways is 6C1
N A D
CO N
Hence, the number of ways a student buy a mathematics book
O UC AA
T IO
PY
and a physics book is 5C1 × 6C1 = 5 × 6 = 30
ED PR

(ii) given: there is a total of 11 books.

So in order to buy either a mathematics book or a physics book
©

it means that only one book out of eleven is bought.

Hence, the number of ways in which a student can either buy
either a mathematics book or a physics book is 11C1 = 11
D

11. Given 7 flags of different colours, how many different

signals can be generated if a signal requires the use of two
flags, one below the other?
Solution:
Given: seven flags are available and out of which two are
needed to make a signal.
From this, we can say, that we have to select two flags out of
seven and arrange these two flags to get one signal.
Seven flags of different colours are available, so first flag can
be selected in 7 ways.

O T IS
Now, the second flag can be selected from any one of the
remaining flags in 6 ways.
N A D
CO N
Hence, the required number of signals are 7 × 6 = 42.
O UC AA
T IO
PY
12. A team consist of 6 boys and 4 girls, and other has 5 boys
ED PR

and 3 girls. How many single matches can be arranged

between the two teams when a boy plays against a boy and
©

a girl plays against a girl?

Solution:
Given:
A team consists of 6 boys and 4 girls, and other team has 5 boys
D

and 3 girls.
Let team 1 be = 6 boys and 4 girls
Team 2 be = 5 boys and 3 girls
Singles matches are to be played, either a boy plays against a
boy, and a girl plays against a girl.
So, number of ways to select a boy from team 1 is 6C1.
Similarly, number of ways to select a boy from team 2 is 5C1.
Hence number of singles matches between boys is 6C1 × 5C1 =
6 × 5 = 30
A number of ways to select a girl from team 1 is 4C1. Similarly,
number of ways to select a girl from team 2 is 3C1
Hence number of singles matches between girls is 3C1 × 4C1 =
4 × 3 = 12 O T IS
N A D
CO N
∴The total number of single matches are = 30 + 12 = 42.
O UC AA
T IO
PY
ED PR

13. Twelve students compete in a race. In how many ways

first three prizes be given?
Solution:
©

Given:
Twelve students compete in a race.
Number of ways to select the winner of the first prize is 12C1
Number of ways to select the winner of the second prize is 11C1
D

(11, since one student is already given a prize)

Number of ways to select the winner of the third prize is 10C1
(10, since two students are already given a prize)
Hence, total number of ways is 12C1 × 11C1 × 10C1 = 12 × 11 ×
10 = 1320.
14. How many A.P’s with 10 terms are there whose first
term is in the set {1,2,3} and whose common difference is in
the set {1, 2,3,4, 5} ?
Solution:
We know that, each AP consists of a unique first term and a

O T IS
common difference. So, number of ways to select the first term
of a given set is 3C1 = 3
N A D
CO N
And, number of ways to select a common difference of given
O UC AA
T IO
PY
set is 5C1 = 5
Hence, total number of AP’s possible are 3C1 × 5C1 = 3 × 5 =
ED PR

15.
©

15. From among the 36 teachers in a college, one principle,

one vice – principle and the teacher – in – charge is to be
appointed. In how many ways can this be done?

Solution:
D

Number of ways to appoint one principal, vice- principal and

the teacher in charge is equal to the number of ways to select
the three teachers from 36 members.
So, a total of three position are to be appointed.
Number of ways to select principal is 36C1 = 36
Number of ways to select vice – principal is 35C1 = 35 (35, since
one position is already given)
Hence, number of ways to appoint three teachers is 36C1 × 35C1
×34C1 = 36 × 35 × 34 = 42840.

16. how many three – digit number are there with no digit

O T IS
repeated? N A D
CO N
Solution:
O UC AA
Let us assume we have three boxes.
T IO
PY
The first box can be fill with any one of the nine digits (0 not
allowed at first place).
ED PR

So, the possibilities are 9C1

The second box can be filled with any one of the nine digits.
©

So the available possibilities are 9C1

The third box can be filled with any one of the eight digits
So the available possibilities are 8C1
Hence, the total number of possible outcomes are
D

967 × 967 × 867 = 9 × 9 × 8 = 48.

17. How many three – digits numbers are there?

Solution:
Let us assume we have three boxes.
The first box can be filled with any one of the nine digits (zero
not allowed at first position)
So, possibilities are 9C1
The second box can be filled with any one of the ten digits
So the available possibilities are 10C1
Third box can be filled with any one of the ten digits

O T IS
So the available possibilities are 10C1
Hence, the total number of possible outcomes are 9C1 × 10C1 ×
N A D
CO N
10
C1 = 9 × 10 × 10 = 900
O UC AA
T IO
PY
18. How many three – digit odd numbers are there?
ED PR

Solution:
We know that in odd numbers, the last digits consist of
©

(1,3,5,7,9)
Let us assume we have three boxes.
The first box can be filled with any one of the nine digits (Zero
not allowed at first position)
D

So the possibilities are 9C1

The second box can be filled with any one of the ten digits
So the available possibilities are 10C1
The third box can be filled with any one of the five digits
(1,3,5,7,9)
So the available possibilities are 5C1
Hence the total number of possible outcomes are 9C1 × 10C1 ×
5
C1 = 9 × 10 × 5 = 450

19. How many different five – digit number license plates

can be made if

O T IS
(i) The first digit cannot be zero, and the repetition of digits
N A D
CO N
is not allowed,
O UC AA
(ii) The first – digit cannot be zero, but the repetition of
T IO
PY
digits is allowed?
Solution:
ED PR

(i) We know that zero cannot be the first digit of the licences
plates. And the repetition of digits is not allowed.
©

Let us assume five boxes, now the first box can be filled with
one of the nine available digits is not allowed.
Let us assume five boxes, now the first box can be filled with
one of the nine available digits, so the possibility is 9C1
D

Similarly, the second box can be filled with one of the nine
available digits, so the possibility is 9C1
The third box can be filled with one of the eight available digits,
so the possibility is 8C1
The fourth box can be filled with one of the seven available
digits, so the possibility is 7C1
Hence the total number of possible outcomes is 9C1 × 9C1 × 8C1
× 7C1 × 6C1 = 9 × 9 × 8 × 7 × 6 = 27,216

(ii) we know that zero cannot be the first digit of the license

O T IS
plates. And the repetition of digits is allowed.
N A D
Let us assume five boxes, now the first box can be filled with

CO N
One of the nine available digits, so the possibility is 9C1
O UC AA
T IO
PY
Similarly, the second box can be filled with one of the ten
available digits, so the possibility is 10C1
ED PR

The third box can be filled with one of the ten available digits,
so the possibility is 10C1
©

The fourth box can be filled with one of the ten available digits,
so the possibility is 10C1
The fifth box can be filled with one of the ten available digits,
so the possibility is 10C1
D

Hence, the total number of possible outcomes is

967 × 1067 × 1067 × 1067 × 1067 = 9 × 10 × 10 × 10 × 10
= 90,000
20. how many four – digits numbers can be formed with
the digits 3,5,7,8,9 which are grater then 7000, if repetition
of digits is not allowed?
Solution:
The required numbers are greater than 7000.
So, the thousand’s place can be filled with any of the 3 digits:
7,8,9

O T IS
N A D
Let us assume four boxes, now in the first box can either be one

CO N
of the three numbers 7, 8 or 9 so their possibilities which are
O UC AA
T IO
PY
3
C1
In the second box, the numbers can be any of the four digits
ED PR

left, so the possibility is 4C1

In the third box, the numbers can be any of the two digits left,
©

so the possibility is 2C1

In the fourth box, the numbers can be any of the two digits left,
so the possibility is 2C1
Hence, the total number of possible outcomes is 3C1 × 4C1 ×
D

3
C1 × 2C1 = 3 × 4 × 3 × 2 = 72

21. How many four – digit numbers can be formed with the
digits 3,5,7,8,9 which are greater than 8000, if repetition of
digits is not allowed?
Solution:
The required numbers are greater than 8000.
So, the thousand’s place can be filled with 2 digits: 8 or 9
Let us assume four boxes, now in the first box can either be one
of the two numbers 8 or 9, so there are two possibilities which
is 2C1

O T IS
In the second box, the numbers can be any of the four digits
left, so the possibility is 4C1
N A D
CO N
In the third box, the numbers can be any of the three digits left,
O UC AA
T IO
PY
so the possibility is 3C1
In the fourth box, the numbers can be any of the two digits left,
ED PR

so the possibility is 2C1

Hence total number of possible outcomes is 2C1 × 4C1 × 3C1 ×
©

2
C1 = 2 × 4 × 3 × 2 = 48.

22. In how many ways can six persons be seated in a row?

Solution:
D

Let us assume there are six seats.

In the first seat, any one of six members can be seated, so the
total number of possibilities is 6C1
In the second seat, any one of five members can be seated, so
the total number of possibilities is 5C1 ways.
In the third seat, any one of four members can be seated, so the
total number of possibilities is 4C1 ways
In the fourth seat, any one of four members can be seated, so
the total number of possibilities is 3C1 ways
In the fifth seat, any one of four members can be seated, so the
total number of possibilities is 2C1 ways.

O T IS
In the sixth seat, any one of four members can be seated, so the
total number of possibilities is 1C1 ways.
N A D
CO N
Hence, the total number of possible outcomes
O UC AA
T IO
PY
= 6C1 × 5C1 × 4C1 × 3C1× 2C1× 1C1 = 6 × 5 × 4 × 3 × 2 × 1 =
720
ED PR
©

23. How many 9- digit numbers of different digits can be

formed?
Solution:
In a nine – digit number, 0 cannot appear in the first digit and
D

the repetition of digits is not allowed. So, the number of ways

of filling up the first digit is 9C1 = 9
Now, 9 digits are left including 0. So, the second digit can be
filled with any of the remaining 9 digits in 9 ways.
Similarly, the third box can be filled with one of the eight
available digits, so the possibility is 8C1
The fourth digit can be filled with one of the seven available
digits, so the possibility is 7C1
The fifth digit can be filled with one of the seven available
digits, so the possibility is 6C1

O T IS
The sixth digit can be filled with one of the seven available
digits, so the possibility is 5C1
N A D
CO N
The seventh digit can be filled with one of the seven available
O UC AA
T IO
PY
digits, so the possibility is 4C1
The eighth digit can be filled with one of the seven available
ED PR

digits, so the possibility is 3C1

The ninth digit can be filled with one of the seven available
©

digits, so the possibility is 2C1

Hence the number of total possible outcomes is
9
C1 × 9C1 × 8C1× 7C1× 6C1 = 9 × 9 × 8 × 7 × 6 × 5 × 4 × 3 ×
2 = 9(9!)
D

24. How many odd numbers less than 1000 can be formed
by using the digits 0, 3, 5, 7 when repetition of digits is not
allowed?
Solution:
Any number less than 1000 may be any of a number from one
– digits number, two- digit number and three – digit number.
Case 1: one – digit odd number
In order to make the number odd, the last digit has to be either
of (3, 5, 7)
In the first box either of the three digits (3, 5, 7) can be placed,

O T IS
so the possibility is 3C1 = 3 possible ways.
N A D
CO N
Case 2: two – digit odd number
O UC AA
T IO
PY
Tens place can be filled up by 3 ways (using any of the digit
among 3, 5 and 7)
ED PR

And then the ones places can be filled in any of the remaining
2 digits.
©

So, there are 3 × 2 = 6 such 2 – digit numbers

Case 3: Three- digit odd number

Ignore zero at one’s place for some instance.
D

Hundreds place can be filled up in 3 ways (using any of any of

the digit among 3, 5 and 7) then tens place in 3 ways by using
remaining 3 digits (after using a digit, there will be three digits)
and then the ones place in 2 ways.
So, there are a total of 3* 3 * 3 = 18 numbers of 3 – digit
numbers which includes both odd and even numbers (one’s
place digit are zero). In order to get the odd numbers, it is
required to ignore the even numbers i.e. numbers ending with
zero.
To obtain the even 3 – digit numbers, one’s place can be filled

O T IS
up in 1 way (only 0 to be filled), hundred place in 3 ways (using
any of the digits among 3,5,7) and then tens place in 2 ways
N A D
CO N
(using remaining 2 digits after filling up hundreds place).
O UC AA
T IO
PY
So, there are a total of 1 * 3 * 2 = 6 even 3 – digit numbers
using the digits 0,3,5 and 7 (repetition not allowed)
ED PR

Then, number of three – digit odd numbers using the digits

0,3,5 and 7 (repetition not allowed) = 18 – 6 = 12.
©

∴The odd numbers less than 1000 that can be formed by using
the digits 0,3,5,7 when repetition of digits is not allowed are 3
+ 6 + 12 = 21.
D
 Exercise 16.3

1. Evaluate each of the following:

(i) 8P3
(ii) 10P4
(iii) 6P6

O T IS
(iv) P(6,4) N A D
CO N
Solution:
O UC AA
T IO
PY
(i) 8P3
We know that, 8P3 can be written as p (8,3)
ED PR

By using the formula,

3!
©

P (n,r) = 3 8 !
!
P (8, 3) = !
!
= -!
×1×/×-!
= -!
D

=8×7×6
= 336
∴ 8P3 = 336

(ii) 10P4
We know that, 10P4 can be written as P (10, 4)
By using the formula,
3!
P(n,r) = 3 8 !
!
P(10,4) = , !
!
= /!

O T IS
× × ×1×/!
= /!
N A D
= 10 × 9 × 8 × 7

CO N
O UC AA
T IO
PY
= 5040
∴ 10P4 = 5040
ED PR

(iii) 6P6
©

We know that, 6P6 can be written as P(6,6)

By using the formula,
3!
P (n,r) = 3 8!
/!
P(6,6) = / / !
D

/×-×,× × ×
= [since, 0! = 1]

=6×5×4×3×2×1
= 720
∴ 6P6 = 720
(iv) P(6,4)
By using the formula,
3!
P (n, r) = 3 8 !
/!
P (6,4) = / , !
/!
= !
/×-×,× × !
= !
O T IS
N A D
=6×5×4×3

CO N
O UC AA
T IO
PY
= 360
∴P (6,4) = 360
ED PR

2. If P(5, r) = p(6, r – 1), find r.

©

Solution:
Given:
P (5, r) = p(6,r -1)
By using the formula
3!
D

P(n, r) =
3 8 !
-!
P(5,r) = - 8 !
/!
P (6,r -1) = / 8 !
/!
= / 8$ !
 /!
=
1 8 !

So, form the question,

P (5,r) = P(6, r -1)
Substituting the obtained values in above expression we get,
-! /!
- 8 !
= 1 8 !

O T IS
Upon evaluating,
1 8 ! /!
= -!
N A D
CO N
- 8 !
[ 1 8 1 8 1 8 !] /×-!
=
O UC AA
T IO
PY
- 8 ! -!
[ 1 8 1 8 1 8 !] /×-!
- 8 !
= -!
ED PR

[ 1 8 / 8 - 8 !]
- 8 !
=6

7−: 6−: =6
©

42 – 6r – 7r + r2 = 6
42 – 6 – 13r + r2 = 0
r2 – 13r + 36 = 0
D

r2 – 9r – 4r + 36 = 0
r(r – 9) – 4(r – 9) = 0
(r – 9) (r – 4) = 0
R = 9 or 4
For, p (n, r): r ≤ n
∴r = 4 [for, p (5,r)]
3. If 5 P(4, n) = 6 P(5,n -1), find n.
Solution:
Given:
5 P(4,n) = 6 P(5, n -1)
By using the formula,
3!
P (n.r) = 3 8 !

P (4, n) =
O T IS
,!
, 3 !
N A D
CO N
-!
P (5, n- 1) = <-
O UC AA
T IO 3 =!

PY
-!
=
- 3$ !
ED PR

So, from the question,

5 P( 4, n) = 6 P(5, n -1)
©

Substituting the obtained values in above expression we get,

-×,! /×-!
, 3 !
= / 3 !

Upon evaluation,
/ 3 ! / -!
, 3 !
= - × ,!
D

[ / 3 / 3 / 3 !] /×-×,!
, 3 !
= -×,!
[ / 3 - 3 , 3 !]
, 3 !
=6

(6 – n ) (5 – n) = 6
30 – 6n – 5n + n2 = 6
30 – 6 – 11n + n2 = 0
n2 – 11n + 24 = 0
n2 – 8n – 3n + 24 = 0
n(n – 8) – 3(n – 8) = 0
(n – 8) (n – 3) = 0
n = 8 or 3
for, P(n , r) : r ≤ n

O T IS
∴n = 3[for, P(4, n)]
N A D
CO N
O UC AA
T IO
PY
4. If P(n, 5) = 20 P(n, 3), find n
Solution:
ED PR

Given:
P(n,5) = 20 P (n, 3)
©

By using the formula,

3!
P(n, r) = 3 8 !
3!
P (n ,5) =
3 - !
3!
D

P (n , 3) = 3 !

So, from the question,

P (n , 5) = 20 P(n, 3)
Substituting the obtained values in above expression we get,
3! ×3!
3 - !
= 3 !
Upon evaluating
3! 3 !
3! 3 - !
= 20
[ 3 3 3 !]
3 -!
= 20
[ 3 3 , 3 - !]
= 20
3 - !

> − 3 > − 4 = 20

O T IS
n2 – 3n – 4n + 12 = 20
N A D
CO N
n2 – 7n + 12 – 20 = 0
O UC AA
T IO
PY
n2 – 7n – 8 = 0
n2 – 8n + n – 8 = 0
ED PR

n(n – 8) – 1(n – 8) = 0
(n – 8) (n – 1) = 0
©

N = 8 or 1
For P (n, r): n ≥ r
∴ n = 8 [for P(n, 5)]

5. If nP4 = 360, Find the value of n.

D

Solution:
Given:
n
P4 = 360
n
P4 can be written as P (n, 4)
by using the formula,
 3!
P(n, r) =
3 8 !
3!
P(n, 4) =
3 , !

So, from the question,

n
P4 = P (n, 4) = 360
substituting the obtained values in above expression we get,
3!
= 360
3 , !
[3 3 3 O T IS3 3 , !]
= 360
N A D
CO N
3 , !
O UC AA
T IO
PY
n(n -1)(n -2) (n-3) = 360
n(n- 1)(n-2) (n – 3) = 6 × 5 × 4 × 3
ED PR

on comparing,
The value of n is 6.
©

6. If P (9, r) = 3024, find r.

Solution:
Given:
D

P(9, r) = 3024
By using the formula,
3!
P (n , r) = 3 8 !
!
P (9, r) =
8 !

So, from the question,

P (9, r) = 3024
Substituting the obtained values in above expression we get,
!
8 !
= 3024
,
8 !
= !
,
= × ×/×-×,× × ×
,
=
,×-×,× × ×
O T IS
N A D
CO N
=
-!
O UC AA
T IO
PY
9 − : != 5!
9–r=5
ED PR

-r = 5 – 9
-r = -4
©

∴The value of r is 4.

7. If P(11, r) = P (12, r -1), find r.

Solution:
D

Given:
P(11, r) = P (12, r -1)
By using the formula,
3!
P(n, r) =
3 8 !
!
P (11, r) = 8 !
 !
P(12, r – 1) = < =!
8

!
= 8$ !
!
=
8 !

So, from the question,

P (11, r) = P (12, r -1)

!
= O T IS
Substituting the obtained values in above expression we get,
!
N A D
CO N
8 ! 8 !
O UC AA
T IO
PY
Upon evaluating
8 ! !
=
8 ! !
ED PR

[ 8 8 8 !] × !
8 !
=
!
©

[ 8 8 8 !]
8 !
= 12

(13 – r) (12 – r) = 12
156 – 12r – 13r + r2 = 12
156 – 12 – 25r + r2 = 0
D

r2 – 25r + 144 = 0
r2 – 16r – 9r + 144 = 0
r(r – 16) -9(r -16) = 0
(r – 9) (r – 16) = 0
r = 9 or 16
for P (n, r): r ≤ n
∴ r = 9 [for p (11, r)]

8. If P (n, 4) = 12. P (n, 2), Find n.

Solution:
Given:

O T IS
P (n, 4) = 12. P (n, 2)
N A D
By using the formula,

CO N
3!
O UC AA
T IO
PY
P(n , r) = 3 8 !
3!
P (n, 4) =
3 , !
ED PR

3!
P (n, 2) = 3 !
©

So, from the question,

P (n, 4) = 12. P (n, 2)
Substituting the obtained values in above expression we get,
3! ×3!
3 , !
= 3 !
D

Upon evaluating,
2! 2 – !
2! 2 – , !
= 12
[ 3 3 3 !]
3 , !
= 12
[ 3 3 3 , !]
3 , !
= 12
(n-2) (n – 3) = 12
n2 -3n – 2n + 6 = 12
n2 – 5n + 6 – 12 = 0
n2 – 5n – 6 = 0
n2 – 6n + n – 6 = 0
n(n – 6) – 1(n – 6)= 0

O T IS
(n -6) (n – 1) = 0
N = 6 or 1
N A D
CO N
For, P (n, r): n ≥ r
O UC AA
T IO
PY
∴ n = 6[for, P (n, 4)]
ED PR

9. If P (n -1, 3): P (n, 4) = 1:9, find n.

Solution:
©

Given:
P(n -1, 3): P(n, 4) = 1: 9
A 2 ,
=
B 2,,

By using the formula,

D

3!
P (n, r) = 3 8 !
3 !
P (n -1, 3) =
3 !
3 !
= 3 , !
 3!
P(n,4) =
3 , !

So, from the question,

A 2– ,
A 2,,
=

Substituting the obtained values in above expression we get,

4D7 !
C F
4DE !
4! =
C F

O T IS
4DE !

3 ! 3 , !
C F ×C F=
N A D
CO N
3 , ! 3!
3 !
O UC AA
=
T IO
PY
3!
3 !
3 3 !
=
ED PR

3
=
©

N=9
∴ The value of n is 9.

10. If P(2n -1, n): P(2n + 1, n - 1) = 22:7 find n.

solution:
D

given:
P(2n - 1, n) : P(2n + 1, n - 1) = 22:7
A 2 ,2
A 2 $ ,2
= 1

by using the formula,

 2!
P(n,r) =
2 G !
3 !
P(2n – 1,n) = 3 3 !
3 !
= 3 !
2– !
P(2n + 1, n ) = 2 2 !
3 !

O T IS
= 3 !
3$ !
N A D
CO N
P(2n +1, n -1) =
3$ 3$ !
O UC AA
T IO
PY
3 !
= 3 !
3 !
ED PR

P(2n -1, n) =
3 3 !
3 !
= 3 !
©

3$ !
P(2n +1, n-1) = 3$ 3$ !
3 !
= 3 !
3$ !
P(2n +1, n -1) = 3$ 3$ !
D

3 !
= 3 !
3$ !
P(2n +1, n -1) = 3$ 3$ !
3$ !
= 3$ !

So, from the question,

 H 3 ,3
H 3$ ,3
= 1

Substituting the obtained values in above expression we get,

I4D7 !
C F
4D7 !
I4J7 ! = 1
C F
4JI !

3 ! 3$ !
C 3 !
F×C 3$ !
F = 1
3 ! [ 3$ 3$ 3$ 3$ !]
C F× =
3 !
O T IS
[ 3$ 3$ 3$ ] 1
N A D
3 ! [ 3$ 3$ 3 3 !]

CO N
C 3 !
F × [ 3$! 3 3 !]
= 1
O UC AA
T IO
PY
[ 3$ 3$ ]
3$
= 1

7(n +2) (n +1) = 22 × 2 2> + 1

ED PR

7(n2 + n + 2n + 2) = 88n + 44
©

7(n2 + 3n + 2) = 88n + 44
7n2 + 21n + 14 = 88n + 44
7n2 + 21n – 88n + 14 – 44 = 0
7n2 – 70n + 3n - 30 = 0
7n(n – 10) + 3(n -10) = 0
D

(n – 10) (7n + 3) = 0
N 10, − 1

We know that, n ≠ − 1

∴The value of n is 10
11. If P(n, 5): P(n , 3) = 2: 1, find n.
Solution:
Given:
P(n,5): P(n,3) = 2: 1
A 2,-
A 2,
=

By using the formula,

P(n, r) =
3!

O T IS
3 8 !
N A D
CO N
3!
P(n, 5) =
3 - !
O UC AA
T IO
PY
3!
P(n, 3) = 3 !
ED PR

So, from the question,

A 2,-
B 2,
=
©

Substituting the obtained values in above expression we get,

4!
L N
K 4DM !
4! P=
C F
4DO !

3! 3 !
C 3 - !
F×C 3!
F=
D

3 !
3 - !
=
[ 3 3 3 !]
3 - !
=
[ 3 3 , 3 - !]
3 - !
=
(n -3)(n – 4) = 2
n2 – 3n – 4n + 12 = 2
n2 – 7n + 12 – 2 = 0
n2 - 5n – 2n + 10 = 0
n (n – 5) – 2(n – 5) = 0
(n – 5) (n – 2) = 0

O T IS
N = 5 or 2
For P (n, r): n ≥ r
N A D
CO N
∴n = 5 [for, P(n, 5)]
O UC AA
T IO
PY
12. Prove that:
ED PR

1. P(1,1) + 2. P(2,2) + 3. P(3,3) +……+ n. P(n, n) = P(n + 1,

n + 1) -1
©

Solution:
By using the formula,
3!
P(n, r) =
3 8 !
3!
D

P(n,n) = 3 3 !
3!
= !

= n! [since, 0! = 1]
Consider LHS:
= 1. P(1,1) + 2. P(2,2) + 3. P(3,3) +…..+ n.P(n,n)
=1.1 ! + 2.2! + 3.3! +…..+n.n![since , p(n,n) = n!]

= ∑38R :. :!

= ∑38R :. :! + :! − :!

= ∑38R : + 1 :! − :!
O T IS
N A D
CO N
= ∑38R : + 1 − :!
O UC AA
T IO
PY
ED PR

= (2! – 1!) + (3! – 2!) + (4!- 3!) +……+ (n!-((n -1)! ) + ((n +
1!)-n !)
= 2! – 1! + 3! – 2! + 4! – 3! +……+n! – (n – 1)! + (n + 1)! – n
©

!
=(n + 1)! – 1!
= (n + 1)! – 1 [since, P (n,n) = n!]
D

= p(n + 1, n+ 1) – 1
= RHS
Hence proved.

13. If P(15, r -1): P(16 , r – 2) = 3: 4, find r.

Solution:
Given:
P(15, r – 1): P(16, r – 2) = 3: 4
A -,G –
A /,G –
=,

O T IS
By using the formula,
N A D
3!

CO N
P(n, r) = 3 8 !
O UC AA
T IO
PY
-!
P(15, r – 1) = -–G$ !
-!
ED PR

= / 8 !
/!
P (16, r – 2) = / 8$ !
©

/!
= 8 !

So, from the question,

A -,G –
=
A /,G – ,
D

Substituting the obtained values in above expression we get,

7M!
C F
7SDT !
7S! =,
C F
7UDT !
 -! 8 !
C F×C F=,
/ 8 ! /!

-! [ 8 8 8 !]
C / 8 !
F×
/× -!
=
,

× O T IS
[ 8 1 8 / 8 !]
=,
N A D
CO N
/ 8 ! /

18 − : 17 − : = 12
O UC AA
T IO
PY
306 – 18r – 17r + r2 = 12
ED PR

306 – 12 – 35r + r2 = 0
R2 – 35r + 294 = 0
©

R2 – 21r - 14r + 294 = 0

R(r – 21) – 14(r – 21) = 0
(r – 14)(r – 21) = 0
R = 14 or 21
For, P(n,r) : r ≤ n
D

∴ r = 14 [for, P?(15, r – 1)]

V
14. n+5Pn+1 = n+3
Pn, find n.

Solution:
Given:
n+5 2 n+3
Pn+1 = Pn
2–
P(n + 5, n + 1) = B 2 $ ,2

O T IS
By using the formula,
N A D
CO N
3!
P(n, r) =
O UC AA
3 8 !
T IO
PY
3$- ! 3$- !
=
ED PR

P(n + 5, n + 1) = 3$- 3 ! ,!
©

3$ ! 3$ !
P(n + 3, n) = 3$ 3 !
= !

So, from the question,

3
P(n+ 5, n + 1) = W > + 3, >
D

Substituting the obtained values in above expression we get

3$- ! 3 3$ !
,!
= × !
 3$- ! ,!
= ×
3 3$ ! !

3$- 3$- 3$- ! ,

=
3 3$ !

3$- 3$,
O T IS
= 22
N A D
CO N
3
O UC AA
T IO
PY
(n + 5) (n + 4) = 22(n – 1)
ED PR

n2 + 4n + 5n + 20 = 22n – 22
n2 + 9n + 20 – 22n + 22 = 0
©

n2 – 13n + 42 = 0
n2 – 6n – 7n + 42 = 0
n(n – 6) – 7(n – 6) = 0
(n – 7 ) (n – 6) = 0
N = 7 or 6
D

∴The value of n can either be 6 or 7.

15. In how many ways can five children stand in a queue?

Solution:
Number of arrangement of ‘n’ things taken all at a time = p(n,
n)
So by using the formula
By using the formula,

O T IS
3!
N A D
CO N
P(n, r) = 3 8 !
O UC AA
T IO
PY
The total number of ways in which five children can stand in a
ED PR

queue = the number of arrangements of 5 things taken all at a

time = P (5 , 5)
©

So,
-!
P( 5,5) = - - !
-!
= !
D

= 5![since, 0! = 1]
=5×4×3×2×1
= 120
Hence, number of ways in which five children can stand in a
queue are 120.
16. From among the 36 teachers in a school, one principle
and one vice – principle is to be appointed. In how many
ways can this be done?

O T IS
Solution:
N A D
CO N
Given:
O UC AA
T IO
PY
The total number of teachers in a school = 36
We know, number of arrangement of n things taken r at a time
ED PR

= P (n, r)
By using the formula,
©

3!
P(n, r) =
3 8 !

∴The total number of ways in which this can be done = the

number of arrangements of 36 things taken 2 at a time = p(36,
D

2)

/!
P(36, 2) =
/ !
/!
= ,!
 /× -× ,!
=
,!

= 36 × 35
= 1260

Hence, number of ways in which one principal and one vice –

principal is to be appointed out of total 36 teachers in school
are 1260.
O T IS
N A D
CO N
Exercise 16.4
O UC AA
T IO
PY
1. in how many ways can the letters of the words
ED PR

“FAILURE” be arranged so that the consonants may

occupy only odd position?
©

Solution:
Given:
The word ‘Failure’
Number of vowels in word ‘failure’ = 4(E, A, I, U)
D

Number of consonants = 3(F, L, R)

Let consonants be denoted by C
Odd positions are 1, 3, 5 or 7
The consonants can be arranged in these 4 odd places in 4 P3
ways.
Remaining 3 even places (2,4,6) are to be occupied by the 4
vowels. This can be done in 4P3 ways.

So, the total number of words in which consonants occupy

odd places = 4P3 × 4P3

O T IS
By using the formula,
3!
N A D
CO N
P (n, r) = 3 8 !
,! ,!
O UC AA
T IO
P(4,3) × P(4, 3) = ×

PY
, ! , !

=4×3×2×1×4×3×2×1
ED PR

= 24 × 24
= 576
©

Hence, the number of arrangements so that the consonants

occupy only odd positions is 576.

2. In how many ways can the letters of word “STRANGE”

D

be arranged so that
(i) The volumes come together?
(ii) The volumes never come together? And
(iii) the vowels occupy only the odd places?
Solution:
Given:
The word ‘STRANGE’
There are 7 letters in the word ‘STRANGE’, which includes 2
vowels (A,E) and 5 consonants (S,T,R,N,G)

O T IS
(i) The vowels come together?
N A D
CO N
Considering 2 vowels as one letter so we will have 6 letters
O UC AA
T IO
PY
which can be arranged in6P6 ways.
Hence, the required number of words are
ED PR

By using the formula,

3!
©

P(n, r) = 3 8 !
/! !
P 6,6 × W 2,2 = / / !
× !

= 6! × 2!
=6×5×4×3×2×1×2×1
= 720 × 2
D

= 1440
Hence, total number of arrangements in which vowels come
together is 1440.
(ii) The vowels never come together?
The total number of letters in the word ‘STRANGE’ is 7P7 =
7! = 7 × 6 × 5 × 4 × 3 × 2 × 1 = 5040

So,
Total number of words in which vowels never come together

O T IS
= total number of words – number of words in which vowels
N A D
are always together

CO N
= 5040 – 1440
O UC AA
T IO
PY
= 3600
Hence, the total number of arrangements in which vowel
ED PR

never come together is 3600.

©

(iii) the vowels occupy only the odd places?

There are 7 letters in the word ‘STRANGE’ . out of these
letters (A,E) are the vowels.
There are 4 odd places in the word ‘STRANGE’. The two
D

vowels can be arranged in P42 ways.

The remaining 5 consonants can be arranged among

themselves in 5P5 ways.
So, the total number of arrangements is
By using the formula,
3!
P(n,r) = 3 8 !

,! -!
X 4,2 × W 5,5 = , !
×
- - !

=
,!
× 5! O T IS
N A D
!

CO N
O UC AA
T IO
PY
=4×3×5×4×3×2×1
= 12 × 120
ED PR

= 1440
©

Hence, the number of arrangements so that the vowels occupy

only odd positions is 1440.

3. How many words can be formed from the letters of the

word ‘SUNDAY’? how many of these begin with D?
D

Solution:
Given:
The word ‘SUNDAY’
Total number of letters in the word ‘SUNDAY’ is 6.
So, number of arrangements of 6 things, taken all at a time is
6
P6
= 6! = 6 × 5 × 4 × 3 × 2 × 1 = 720

O T IS
Now, we shall find the number of words stating with D
N A D
So let’s fix the first position with letters D, then remaining

CO N
number of letters is 5.
O UC AA
T IO
PY
The number of arrangements of 5 things, taken all at a time is
5
P5 = 5! = 5 × 4 × 3 × 2 × 1 = 120
ED PR

Hence, the total number of words can be made by letters of

©

the words ‘SUNDAY’ is 720.

The possible number of words using letters of ‘SUNDAY’
staring with ‘D’ is 120.
D

4. How many words can be formed out of the letters of the

word. ‘ORIENTAL’, so that the vowels always occupy the
odd places?

Solution:
Given:
The word ‘ORIENTAL’
Number of vowels in the word ‘ORIENTAL’ = 4(O, I, E, A)
Number of consonants in given word = 4( R, N, T, L)

O T IS
Odd position are (1, 3, 5 or 7 )
Four vowels can be arranged in these 4 odd places in 4P4
N A D
CO N
ways.
O UC AA
T IO
PY
Remaining 4 even places (2, 4, 6, 8) are to be occupied by the
4 consonants in 4P4 ways.
ED PR

So by using the formula,

3!
©

P(n , r) = 3 8!
,! ,!
P(4,4) × P( 4, 4) = ×
, , ! , , !

= 4! × 4!
=4×3×2×1×4×3×2×1
= 24 × 24
D

= 576
Hence, the number of arrangements so that the vowels occupy
only odd positions is 576.
5. How many different words can be formed with the
letters of word ‘SUNDAY’? how many of the words begin
with N? How many begin with N and end in y?

O T IS
Solution:
N A D
CO N
Given:
O UC AA
T IO
PY
The word ‘SUNDAY’
Total number of letters in the word ‘SUNDAY’ is 6.
ED PR

So, number of arrangements of 6 things, taken all at a time is

6
P6
©

= 6! = 6 × 5 × 4 × 3 × 2 × 1 = 720
Now, we shall find the number of words stating with N
So let’s fix the first position with letters N, then remaining
number of letters is 5.
D

The number of arrangements of 5 things, taken all at a time is

5
p5 = 5! = 5 × 4 × 3 × 2 × 1 = 120

Now, we need to find out a number of words starting with N

and ending Y
So let’s fix the first position with letter N and Y at the end
then remaining number of letters is 4 which can be arrange in
4
P4 ways = 4! = 4 × 3 × 2 × 1 = 24

Hence. The total number of words can be made by letters of

O T IS
the word ‘SUNDAY’ is 720.
N A D
The possible number of words using letters of ‘SUNDAY’

CO N
starting with ‘N’ is 120
O UC AA
T IO
PY
The possible number of words using letters of ‘SUNDAY’
ED PR

starting with ‘N’ and ending with ‘Y’ is 24.

©

6. How many different words can be formed from the

letters of the word ‘GANESHPURI’? in how many of
these words:
(i) the letter G always occupies the first place?
D

(ii) the letter P and I respectively occupy the first and last
place?
(iii) are the vowels always together?
(iv) the vowels always occupy even places?
Solution:
Given:
The word ‘GANESPURI’
There are 10 letters in the word ‘GANESHPURI’. The total
number of words formed is 10P10 = 10!

O T IS
(i) the letter G always occupies the first place?
N A D
CO N
If we fix the first position with letter G, then remaining
O UC AA
T IO
PY
number of letters is 9.
The number of arrangements of9 things, taken all at a time is
ED PR

9
P9 = 9 ! ways
Hence, a possible number of words using letters of
©

‘GANESHPURI’ starting with ‘G’ is 9!

(ii)the letters P and I respectively occupy the first and last

place?
D

If we fix the first position with letter P and I in the end, then
remaining number of letters is 8.
The number of arrangements of 8 things, taken all at a time is
8
P8 = 8! Ways.
Hence, a possible number of words using letters of
‘GANESPURI’ starting with ‘p’ and ending with ‘I’ is 8!

(iii) are the vowels always together?

There are 4 vowels and 6 consonants in the word
‘GANESPURI’

O T IS
N A D
CO N
Consider 4(A, E, I, U) vowels as one letter, then total number
O UC AA
T IO
PY
of letters is 7 (A,E,I,U,G,N,S,H,P,R)
The number of arrangements of 7 things, taken all at a time is
ED PR

7
p7 = 7! Ways.
©

(A, E, I , U) can be put together in 4! Ways

Hence, total number of arrangements in which vowels come
together is 7! × 4!
D

(iv) the vowels always occupy even places?

Number of vowels in the word ‘GANESHPURI’ = 4 (A, E, I,
U)
Number of consonants = 6(G, N, S, H, R, I )
Even positions are 2, 4, 6, 8 or 10
Now, we have to arrange 10 letters in a row such that vowels
occupy even paces. There are 5 even places (2,4,6,8, or 10 ). 4
vowels can be arranged in these 5 even places in 5P4 ways.

Remaining 5 odd places (1,3,5,7,9) are to be occupied by the

O T IS
6 consonants in 6P5 ways.
N A D
CO N
So, by using the formula,
O UC AA
T IO
PY
3!
P(n, r) = 3 8 !
-! /!
ED PR

P(5,4) × P(6,5) = - , !
× / - !

= 5! × 6!
©

Hence, number of arrangements so that the vowels occupy

only even positions is 5! × 6!.
D
 O T IS
N A D
CO N
O UC AA
T IO Exercise 16.5

PY
1. Find the number of words formed by permuting all the
ED PR

letters of the following words:

(i) INDEPENDENCE
©

(ii) INTERMEDIATE
(iii) ARRANGE
(iv) INDIA
(v)PAKISTAN
D

(vi) RUSSIA
(vii) SERIES
(viii) EXERCISES
(ix) CONSTANTIOPLE
Solution
(i) INDEPENDENCE
There are 12 letters in the word ‘INDEPENDENCE’ out of
which 2 are D’S , 3 are N,s 4 are E’s and the rest all are
distinct.
So by using the formula,

O T IS
N A D
CO N
3!
O UC AA
T IO
PY
Y! ×Z!×8!
!
Total number of arrangements = ! !,!
ED PR

[ × × × × ×1×/×-×,× × × ]
= ! !,!
©

[ × × × × ×1×/×-]
= × × × ×

= 11 × 10 × 9 × 8 × 7 × 6 × 5
D

= 1663200

(ii) INTERMEDIATE
There are 12 letters in the word ‘INTERMEDIATE’ out of
which 2 are I’s , 2 are T’s, 3 are E’s and the rest all are
district.
So by using the formula,
3!
Y! ×Z!×8!

O T IS
Total number of arrangements =
!
! ! !
N A D
CO N
O UC AA
T IO
PY
[ × × × × ×1×/×-×,× × × ]
=
ED PR

! ! !

[ × × × × ×1×/×-× × × ]
©

= !

= 12 × 11 × 10 × 9 × 8 × 7 × 6 × 5
D

= 19958400

(iii) ARRANGE
There are 7 letters in the word ‘ARRANGE’ out of which 2
are A’s , 2 are R’s and the rest all are distinct.
So by using the formula,
 3!
Y!×Z!×8!
1!
Total number of arrangements =
! !
[1×/×-×,× × × ]
= ! !

=7×6×5×3×2×1

O T IS
=1260 N A D
CO N
O UC AA
T IO
PY
(iv) INDIA
ED PR

There are 5 letters in the word ‘INDIA’ out of which 2 are I’s
and the rest all are distinct.
©

So by using the formula,

3!
Y!×Z!×8!
-!
Total number of arrangements = !
[-×,× × × ]
D

= !

=5 ×4×3
= 60

(v)PAKISTAN
There are 8 letters in the word ‘PAKISTAN’ out of which 2
are A’s and the rest all are distinct.
So by using the formula,
3!
Y!×Z!×8!
!
Total number of arrangements = !
[ ×1×/×-×,× × × ]

O T IS
= !
N A D
CO N
O UC AA
T IO
PY
=8×7×6×5×4×3
ED PR

= 20160
©

(vi) RUSSIA
There are 6 letters in the word ‘RUSSIA’ out of which 2 are
S’s and the rest all are distinct.
So by using the formula,
3!
Y!×Z!×8!
D

/!
Total number of arrangements = !
[/×-×,× × × ]
= !

=6×5×4×3
=360
(vii) SERIES
There are 6 letters in the word ‘SERIES’ out of which 2 are
S’s, 2 are E’s and the rest all are distinct.
So by using the formula,
3!
Y!×Z!×8!

O T IS
Total number of arrangement =
/!
! !
N A D
CO N
O UC AA
T IO
PY
[/×-×,× × × ]
=
! !
ED PR

=6×5×3×2×1
©

= 180

(viii) EXERCISES
There are 9 letters in the word ‘EXERCISES’ out of which 3
D

are E’s , 2 are S’s and the rest all are distinct.
So by using the formula,
3!
Y! ×Z!×8!
!
Total number of arrangements =
! !
 [ × ×1×/×-×,× × × ]
= ! !

[ × ×1×/×-×,× × × ]
= × × × ×

=9×8×7×5×4×3×1

= 30240
O T IS
N A D
CO N
O UC AA
T IO
PY
(ix) CONSTANTIOPLE
ED PR

There are 14 letters in the word ‘CONSTANTIOPLE’ out of

which 2 are O’s , 3 are N’s, 2 are T’s and the rest all are
©

distinct.
So by using the formula,
3!
Y! ×Z!×8!
,!
Total number of arrangements = ! ! !
D

,!
= × × × × × ×
,!
= ,
2. In how many ways can the letters of the word
‘ALGEBRA’ be arranged without changing the relative
order of the vowels and consonants?

Solution:
Given:

O T IS
The word ‘ALGEBRA’
There are 4 consonants in the word ‘ALGEBRA’
N A D
CO N
The number of ways to arrange these consonants is 4P4 = 4!
O UC AA
T IO
PY
There are 3 vowels in the world ‘ALGEBRA’ of which, 2 are
ED PR

A’s
3! !
So vowels can be arranged in Y! ×Z!×8! =
©

!
ways
!
Hence, the required number of arrangements = 4! × L !N

[,× × × × × × ]
= ×
D

= 4 × 3 × 2 × 1 × 3 = 72

3. How many words can be formed with the letters of the

word ‘UNIVERSITY’ the vowels remaining together?
Solution:
Given:
The word ‘UNIVERSITY’
There are 10 letters in the word ‘UNIVERSITY’ out of which
2 are I’s

O T IS
There are 4 vowels in the world ‘UNIVERSITY’ out of which
2 are I’s
N A D
CO N
3! ,!
So these vowels can be put together in Y! ×Z!×8! =
O UC AA
T IO
PY
!
ways
ED PR

Let us consider these 4 vowels as one letter, remaining 7

letters can be arranged in 7! Ways.
©

,!
Hence, the required number of arrangement = L !N × 7!
,× × × ×1×/×-×,× × ×
= ×
D

=4×3×2×1×7×6×5×4×3

= 60480
4. find the total number of arrangements of the letters in
the expression a3 b2 c4 when written at full length.

Solution:
There are 9 (i.e. powers 3 + 2 + 4 = 9) objects in the
expression a3 b2 c4 and there are 3 a’s, 2b’s, 4 c’s

O T IS
So by using the formula,
N A D
CO N
3!
O UC AA
T IO
PY
Y! ×Z!×8!
ED PR

!
Total number of arrangements = ! ! ,!
©

[ × ×1×/×-×,× × × ]
= × × × × ×,× × ×

=7×6×5×3×2×1
D

= 1260

5. How many words can be formed with the letters of the

word ‘PARALLEL’ so that all L’s do not come together?
Solution:
Given:
The word ‘PARALLELE’
There are 8 letters in the world ‘PARALLEL’ out of which 2
are A’s, 3 are L’s and the rest all are distinct.

O T IS
So by using the formula,
3!
N A D
CO N
Y! ×Z!×8!
!
O UC AA
T IO
PY
Total number of arrangement = ! !
ED PR

[ ×1×/×-×,× × × ]
= × × × ×
©

=8×7×5×4×3×1

= 3360
D

Now, let us consider all L’s together as one letter, so we have

6 letters out of which A repeats 2 times and other are distinct.

/!
These 6 letters can be arranged in !
ways.
/!
The number of words in which all L’s come together = !
 [/×-×,× × × ]
= ×

=6×5×4×3
= 360

So now the number of words in which all L’s do not come

together = total number of arrangements – the number of

O T IS
words in which all L’s come together
N A D
CO N
= 3360 – 360 = 3000.
O UC AA
T IO
PY
ED PR

6. How many words can be formed by arranging the

©

letters of the word ‘MUMBAI’ so that all M’s come

together?

Solution:
Given:
D

The word ‘MUMBAI’

There are 6 letters in the word ‘MUMBAI’ out of which 2 are
M’s and the rest all are distinct.
So let us consider both M’s together as one letter, the
remaining 5 letters can be arranged in 5! Ways.
Total number of arrangements = 5!
=5×4×3×2×1
= 120
Hence, a total number of words formed during the

O T IS
arrangement of letters of word MUMBAI such that all M’s
N A D
remains together equals to 120.

CO N
O UC AA
T IO
PY
ED PR

7. How many numbers can be formed with the digits 1, 2,

©

3, 4, 3, 2,1 so that the odd digits always occupy the odd

places?

Solution:
D

Given:
The digits 1,2,3,4,3,2,1
The total number of digits are 7
There are 4 odd digits 1,1,3,3 and 4 odd places (1,3,5,7)
 3!
So, the odd digits can be arranged in odd places in =
Y!×Z!×8!
,!
! !
ways.
The remaining even digits 2,3,4 can be arranged in 3 even
3! !
places in Y! ×Z! ×8! = !
ways.

O T IS
,! !
Hence, the total number of digits = ×
! ! !
N A D
CO N
[,× × × × × × ]
= ! ! !
O UC AA
T IO
PY
=3×2×1×3×1
= 18
ED PR

Hence, the number of ways of arranging the digits such odd

©

digits always occupies odd places is equal to 18.

8. How many different signals can be made from 4 red, 2

white and 3 green flags by arranging all of them vertically
D

on a flagstaff?

Solution:
Given:
Number of red flags = 4
Number of white flags = 2
Number of green flags = 3
So there are total 9 flags, out of which 4 are red, 2 are white, 3
are green
By using the formula,
3! !
Y! ×Z!×8!
= ,! ! !

O T IS
N A D
[ × ×1×/×-]

CO N
= × ×
O UC AA
T IO
PY
=9×4×7×5
ED PR
©

= 1260
Hence, 1260 different signals can be made.

9. How many numbers of four digits can be formed with

D

the digits 1,3,3,0?

Solution:
Given:
The digits 1,3,3,0
Total number of digits = 4
Digits of the same type = 2
,!
Total number of 4 digit number = !

Where, zero cannot be the first digit of the four digit numbers.
!
So, total number of 3 digit numbers = !
,! !
Total number of numbers = !
− !
,× × ×
=C F−C F
O T IS
N A D
CO N
= [4 × 3] − [3]
O UC AA
T IO
PY
= 12 – 3
ED PR

=9
©

Hence, total number of four digits can be formed is 9.

10. In how many ways can the letters of the word

‘ARRANGE’ be arranged so that the two R’s are never
together?
D

Solution:
There are 7 letters in the word ‘ARRANGE’ out of which 2
are A’s, 2 are R’s and the rest all are distinct.
So by using the formula,
3!
Y!×Z!×8!
1!
Total number of arrangements =
! !
[1×/×-×,× × × ]
= ! !

=7×6×5×4×3×2×1
O T IS
N A D
CO N
O UC AA
= 1260 T IO
PY
Let us consider all R’s together as one letter, there are 6 letters
ED PR

remaining. Out of which 2 times A repeats and other are

distinct.
3! /!
So these 6 letters can be arranged in Y!×Z!×8! =
©

!
ways

/!
The number of words in which all R’s come together = !

[/×-×,× × !]
=
!
D

=6×5×4×3

= 360
So, now the number of words in which all L’s do not come
together = total number of arrangements – the number of
words in which all L’s come together
= 1260 – 360
= 900
Hence, the total number of arrangements of word ARRANGE

O T IS
in such a way that not all R’s come together is 900.
N A D
CO N
11. how many different numbers, greater than 50000 can
O UC AA
T IO
PY
be formed with the digits 0,1, 1, 5,9.
ED PR

Solution:
Given:
©

The digits 0,1,1,5,9

Total number of digits = 5

So now number greater than 50000 will have either 5 or 9 in
D

the first place and will consists of 5 digits.

,!
Number of 5 digits numbers at first place = [since, 1 is
!

repeated]
 [,× × !]
= !

=4×3
= 12
,!
Similarly, number of 9 digits numbers at first place = !
= 12

The required number of numbers = 12 + 12 =24

Hence, 12 different numbers can be formed.

O T IS
N A D
CO N
12. How many words can be formed from the letters of the
O UC AA
T IO
PY
word ‘SERIES’ which start with S and end with S?
ED PR

Solution:
Given:
©

The word ‘SERIES’

There are 6 letters in the word ‘SERIES’ out of which 2 are

S’s, 2 are E’s and the rest all are distinct.
D

Now, let us fix 5 letters at the extreme left and also at the right
end. So we are left with 4 letters of which 2 are E’s

3! ,!
These 4 letters can be arranged in
Y!×Z!×8!
= !
ways.
 ,!
Required number of arrangements is
!
[,× × !]
=
!

=4×3

= 12

O T IS
Hence, a total number of arrangements of the letters of the
N A D
CO N
word ‘SERIES’ in such a way that the first and last position is
O UC AA
T IO
PY
always occupied by the letter S is 12.
ED PR
©

13. How many permutations of the letters of the word

‘MADHUBANI’ do not begin with M but end with I?
D

Solution:
Given:
The word ‘MADHUBANI’
Total number of letters = 9
A total number of arrangements of word MADHUBANI
excluding I: total letters 8. Repeating letters, A, repeating
twice.
!
The total number of arrangements that end with letter I = !
[ ×1×/×-×,× × !]
= !

=8×7×6×5×4×3

O T IS
N A D
CO N
= 20160
O UC AA
T IO
PY
If the word start with ‘M’ and end with ‘I’ there are 7 places
for 7 letters.
ED PR

The total number of arrangements that start with ‘M’ and end
1!
with letter I = !
©

[1×/×-×,× × !]
= !

=7×6×5×4×3
D

= 2520

The total number of arrangements that do not start with ‘M’

but end with letter I= the total number of arrangements that
end with letter I – the total number of arrangements that start
with ‘M’ and end with letter I

= 20160 – 2520
= 17640
Hence, a total number of arrangements of word

O T IS
MADHUBANI in such a way that the word is not starting
with M but ends with I is 17640.
N A D
CO N
O UC AA
T IO
PY
ED PR
©

14. find the number of numbers, greater than a million

that can be formed with the digit 2,3,0,3,4,3.
D

Solution:
Given:
The digits 2,3, 0,3,4,2,3
Total number of digits = 7
We know, zero cannot be the first digit of the 7 digit numbers.
3! /!
Number of 6 digit number = Y!×Z!×8! = ! !
ways. [2 is

repeated twice and 3 is repeated 3 times]

/!
The total number of arrangements = ! !
[/×-×,× × × ]

O T IS
= × × N A D
CO N
=5×4×3×1
O UC AA
T IO
PY
= 60
3! 1!
Now, number of 7 digit number = Y! ×Z!×8! =
ED PR

! !
ways
©

1!
The total number of arrangements = ! !

[1×/×-×,× × × ]
= × ×
D

=7×5×4×3×1
= 420
So, total numbers which is greater than 1 million = 420 – 60 =
360
Hence, total number of arrangements of 7 digits
(2,3,0,3,4,2,3) forming a 7-digit number is 360.

O T IS
N A D
CO N
O UC AA
T IO
PY
ED PR
©
D
 ©
ED PR
D
O UC AA
N A D
O T IS
T IO
CO N
PY