Module 4 Permutation & Combination:

Permutation : Permutation means arrangement of things. The word arrangement is

used, if the order of things is considered.

Combination: Combination means selection of things. The word selection is used, when
the order of things has no importance.

Module 4.1 PERMUTATION

An arrangement that can be formed by taking some or all of a finite set of things (or
objects) is called a Permutation. Order of the things is very important in case of
permutation. A permutation is said to be a Linear Permutation if the objects are
arranged in a line. A linear permutation is simply called as a permutation. A permutation
is said to be a Circular Permutation if the objects are arranged in the form of a circle.
The number of (linear) permutations that can be formed by taking r things at a time from
a set of n distinct things (r =  n) is denoted by

1. Number of permutations of n different things, taken r at a time, when a particular thng

is to be always included in each arrangement , is

2. Number of permutations of n different things, taken r at a time, when a particular thing

is never taken in each arrangement is

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

4. Number of permutations of n different things, taken all at a time, when m specified

never come together is .

65
The number of permutations of n dissimilar things taken r at a time when k(< r)
particular things always occur is

6. The number of permutations of n dissimilar things taken r at a time when k particular

things never occur is .

7. The number of permutations of n dissimilar things taken r at a time when repetition of

things is allowed any number of times is nr.

The number of permutations of n different things, taken not more than r at a time, when
each thing may occur any number of times Is

9. The number of permutations of n different things taken not more than r at a time

Module 4.2 CIRCULAR PERMUTATIONS

1. The number of circular permutations of n dissimilar things taken r at a time is

2. The number of circular permutations of n dissimilar things taken all at a time

is .

3. The number of circular permutations of n things taken r at a time in one direction is

4. The number of circular permutations of n dissimilar things in clock-wise direction =

Number of permutations in anti-clock-wise direction =

66
Module 4.3 Permutations when all the objects are distinct

Theorem 1 The number of permutations of n different objects taken r at a time, where 0 < r ≤ n
and the objects do not repeat is n ( n – 1) ( n – 2). . .( n – r + 1), which is denoted by n Pr.

Proof There will be as many permutations as there are ways of filling in r vacant places

... ……… by

← r vacant places →

the n objects. The first place can be filled in n ways; following which, the second place

can be filled in (n – 1) ways, following which the third place can be filled in (n – 2) ways,..., the
rth place can be filled in (n – (r – 1)) ways. Therefore, the number of ways of filling in r vacant
places in succession is n(n – 1) (n – 2) . . . (n – (r – 1)) or n ( n – 1) (n – 2) ... (n – r + 1)

This expression for nPr is cumbersome and we need a notation which will help to reduce the
size of this expression. The symbol n! (read as factorial n or n factorial ) comes to our rescue. In
the following text we will learn what actually n! means.

Factorial notation: The notation n! represents the product of first n natural numbers, i.e., the
product 1 × 2 × 3 × . . . × (n – 1) × n is denoted as n!. We read this symbol as ‘n factorial’. Thus,
1 × 2 × 3 × 4 . . . × (n – 1) × n = n !

1=1!
1×2=2!
1× 2 × 3 = 3 !
1 × 2 × 3 × 4 = 4 ! and so on.

We define 0 ! = 1
We can write 5 ! = 5 × 4 ! = 5 × 4 × 3 ! = 5 × 4 × 3 × 2 !
= 5 × 4 × 3 × 2 × 1!

Clearly, for a natural number n

n ! = n (n – 1) !
= n (n – 1) (n – 2) ! [provided (n ≥ 2)]
= n (n – 1) (n – 2) (n – 3) ! [provided (n ≥ 3)] and so on.

Evaluate (i) 5 ! (ii) 7 ! (iii) 7 ! – 5!

(i) 5 ! = 1 × 2 × 3 × 4 × 5 = 120
(ii) 7 ! = 1 × 2 × 3 × 4 × 5 × 6 ×7 = 5040
and (iii) 7 ! – 5! = 5040 – 120 = 4920.

67
Example: Suppose we have to form a number of consisting of three digits using the
digits 1,2,3,4, To form this number the digits have to be arranged. Different numbers will
get formed depending upon the order in which we arrange the digits. This is an example
of Permutation.

Now suppose that we have to make a team of 11 players out of 20 players, This is an
example of combination, because the order of players in the team will not result in a
change in the team. No matter in which order we list out the players the team will
remain the same! For a different team to be formed at least one player will have to be
changed.

Now let us look at two fundamental principles of counting:

Addition rule : If an experiment can be performed in ‘n’ ways, & another experiment can
be performed in ‘m’ ways then either of the two experiments can be performed in (m+n)
ways. This rule can be extended to any finite number of experiments.

Example: Suppose there are 3 doors in a room, 2 on one side and 1 on other side.
A man want to go out from the room. Obviously he has ‘3’ options for it. He can come
out by door ‘A’ or door ‘B’ or door ’C’.

Multiplication Rule : If a work can be done in m ways, another work can be done in ‘n’
ways, then both of the operations can be performed in m x n ways. It can be extended
to any finite number of operations.

68
Example.: Suppose a man wants to cross-out a room, which has 2 doors on one side
and 1 door on other site. He has 2 x 1 = 2 ways for it.

Factorial n : The product of first ‘n’ natural numbers is denoted by n!.

n! = n(n-1) (n-2) ………………..3.2.1.

Ex. 5! = 5 x 4 x 3 x 2 x 1 =120

Note 0! = 1

Proof n! =n, (n-1)!

Or (n-1)! = [n x (n-1)!]/n = n! /n

Putting n = 1, we have

O! = 1!/1

or 0 = 1

Permutation

Number of permutations of ‘n’ different things taken ‘r’ at a time is given by:-

n
Pr = n!/(n-r)!

Proof: Say we have ‘n’ different things a1, a2……, an.

Clearly the first place can be filled up in ‘n’ ways. Number of things left after filling-up the
first place = n-1

So the second-place can be filled-up in (n-1) ways. Now number of things left after
filling-up the first and second places = n - 2

Now the third place can be filled-up in (n-2) ways.

69
Thus number of ways of filling-up first-place = n

Number of ways of filling-up second-place = n-1

Number of ways of filling-up third-place = n-2

Number of ways of filling-up r-th place = n – (r-1) = n-r+1

By multiplication – rule of counting, total no. of ways of filling up, first, second -- rth-
place together :-

n (n-1) (n-2) ------------ (n-r+1)

Hence:
n
Pr = n (n-1)(n-2) --------------(n-r+1)

= [n(n-1)(n-2)----------(n-r+1)] [(n-r)(n-r-1)-----3.2.1.] / [(n-r)(n-r-1)] ----3.2.1

n
Pr = n!/(n-r)!

Number of permutations of ‘n’ different things taken all at a time is given by:-

n
Pn = n!

Proof :
Now we have ‘n’ objects, and n-places.

Number of ways of filling-up first-place = n

Number of ways of filling-up second-place = n-1

Number of ways of filling-up third-place = n-2

Number of ways of filling-up r-th place, i.e. last place =1

Number of ways of filling-up first, second, --- n th place

= n (n-1) (n-2) ------ 2.1.

n
Pn = n!

70
Concept.

n
We have Pr = n!/n-r

Putting r = n, we have :-

n
Pr = n! / (n-r)

n
But Pn = n!

Clearly it is possible, only when n! = 1

Hence it is proof that 0! = 1

Note : Factorial of negative-number is not defined. The expression –3! has no

meaning.

Examples

Q. How many different signals can be made by 5 flags from 8-flags of different colours?

Ans. Number of ways taking 5 flags out of 8-flage = 8P5

= 8!/(8-5)!

= 8 x 7 x 6 x 5 x 4 = 6720

Q. How many words can be made by using the letters of the word “SIMPLETON” taken
all at a time?

Ans. There are ‘9’ different letters of the word “SIMPLETON”

Number of Permutations taking all the letters at a time = 9P9

= 9! = 362880.

Number of permutations of n-thing, taken all at a time, in which ‘P’ are of one type, ‘g’ of
them are of second-type, ‘r’ of them are of third-type, and rest are all different is
given by :-

n!/p! x q! x r!

71
Example: In how many ways can the letters of the word “Pre-University” be arranged?

13!/2! X 2! X 2!

Number of permutations of n-things, taken ‘r’ at a time when each thing can be repeated
r-times is given by = nr.

Proof.

Number of ways of filling-up first –place = n

Since repetition is allowed, so

Number of ways of filling-up second-place = n

Number of ways of filling-up third-place

Number of ways of filling-up r-th place = n

Hence total number of ways in which first, second ----r th, places can be filled-up

= n x n x n ------------- r factors.

= nr

Example: A child has 3 pocket and 4 coins. In how many ways can he put the coins

in his pocket.

Answer: First coin can be put in 3 ways, similarly second, third and forth coins also
can be put in 3 ways.

So total number of ways = 3 x 3 x 3 x 3 = 34 = 81

Module 4.4 Circular permutations

There are two cases of circular-permutations:-

(a) If clockwise and anti clock-wise orders are different, then total number of
circular-permutations is given by (n-1)!

(b) If clock-wise and anti-clock-wise orders are taken as not different, then total
number of circular-permutations is given by (n-1)!/2!

72
Proof(a):

(a) Let’s consider that 4 persons A,B,C, and D are sitting around a round table

Shifting A, B, C, D, one position in anticlock-wise direction, we get the following

agreements:-

Thus, we use that if 4 persons are sitting at a round table, then they can be shifted four
times, but these four arrangements will be the same, because the sequence of A, B, C,
D, is same. But if A, B, C, D, are sitting in a row, and they are shifted, then the four
linear-arrangement will be different.

Hence if we have ‘4’ things, then for each circular-arrangement number of linear-
arrangements =4

Similarly, if we have ‘n’ things, then for each circular – agreement, number of linear –
arrangement = n.

Let the total circular arrangement = p

Total number of linear–arrangements = n.p

73
Total number of linear–arrangements

= n. (number of circular-arrangements)

Or Number of circular-arrangements = 1 (number of linear arrangements)

n = 1( n!)/n

circular permutation = (n-1)!

Proof (b) When clock-wise and anti-clock wise arrangements are not different, then
observation can be made from both sides, and this will be the same. Here two
permutations will be counted as one. So total permutations will be half, hence
in this case.

Circular–permutations = (n-1)!/2

Note: Number of circular-permutations of ‘n’ different things taken ‘r’ at a time:-

(a) If clock-wise and anti-clockwise orders are taken as different, then total number
of circular-permutations = nPr/r

(b) If clock-wise and anti-clockwise orders are taken as not different, then total
n
number of circular – permutation = Pr/2r

Example: How many necklace of 12 beads each can be made from 18 beads of
different colours?

Ans. Here clock-wise and anti-clockwise arrangement s are same.

18
Hence total number of circular–permutations: P12/2x12

= 18!/(6 x 24)

Restricted – Permutations

(a) Number of permutations of ‘n’ things, taken ‘r’ at a time, when a particular thing is
to be always included in each arrangement

= r n-1 Pr-1

(b) Number of permutations of ‘n’ things, taken ‘r’ at a time, when a particular thing is
fixed: = n-1 Pr-1

74
(c) Number of permutations of ‘n’ things, taken ‘r’ at a time, when a particular thing is
never taken: = n-1 Pr.

(d) Number of permutations of ‘n’ things, taken ‘r’ at a time, when ‘m’ specified things
always come together = m! x ( n-m+1) !

(e) Number of permutations of ‘n’ things, taken all at a time, when ‘m’ specified things
always come together = n ! - [ m! x (n-m+1)! ]

Example: How many words can be formed with the letters of the word ‘OMEGA’ when:

(i) ‘O’ and ‘A’ occupying end places.

(ii) ‘E’ being always in the middle

(iii) Vowels occupying odd-places

(iv) Vowels being never together.

Ans.

(i) When ‘O’ and ‘A’ occupying end-places

=> M.E.G. (OA)

Here (OA) are fixed, hence M, E, G can be arranged in 3! ways

But (O,A) can be arranged themselves is 2! ways.

=> Total number of words = 3! x 2! = 12 ways.

(ii) When ‘E’ is fixed in the middle

=> O.M.(E), G.A.

Hence four-letter O.M.G.A. can be arranged in 4! i.e 24 ways.

(iii) Three vowels (O,E,A,) can be arranged in the odd-places (1st, 3rd and 5th) =
3! ways.

75
 And two consonants (M,G,) can be arranged in the even-place (2nd, 4th)
= 2 ! ways

=> Total number of ways= 3! x 2! = 12 ways.

(iv) Total number of words = 5! = 120!

If all the vowels come together, then we have: (O.E.A.), M,G

These can be arranged in 3! ways.

But (O,E.A.) can be arranged themselves in 3! ways.

=> Number of ways, when vowels come-together = 3! x 3!

= 36 ways

=> Number of ways, when vowels being never-together

= 120-36 = 84 ways.

Number of Combination of ‘n’ different things, taken ‘r’ at a time is given by:-

n
Cr= n! / r ! x (n-r)!

Proof: Each combination consists of ‘r’ different things, which can be arranged among
themselves in r! ways.

=> For one combination of ‘r’ different things, number of arrangements = r!

For nCr combination number of arrangements: r n

Cr

n
=> Total number of permutations = r! Cr ---------------(1)

But number of permutation of ‘n’ different things, taken ‘r’ at a time

= nPr -------(2)

From (1) and (2) :

76
 n
Pr = r! . nCr

or n!/(n-r)! = r! . nCr

n
or Cr = n!/r!x(n-r)!

Note: nCr = nCn-r or n

Cr = n!/r!x(n-r)! and nCn-r = n!/(n-r)!x(n-(n-r))!

= n!/(n-r)!xr!

Restricted – Combinations

(a) Number of combinations of ‘n’ different things taken ‘r’ at a time, when ‘p’
particular things are always included = n-pCr-p.

(b) Number of combination of ‘n’ different things, taken ‘r’ at a time, when ‘p’
particular things are always to be excluded = n-pCr

Example: In how many ways can a cricket-eleven be chosen out of 15 players? if

(i) A particular player is always chosen,

(ii) A particular is never chosen.

Answer:

(i) A particular player is always chosen, it means that 10 players are selected out of
the remaining 14 players.

14
=. Required number of ways = C10 = 14C4

= 14!/4!x19! = 1365

(ii) A particular players is never chosen, it means that 11 players are selected out of 14
players.

14
=> Required number of ways = C11

= 14!/11!x3! = 364

77
(iii) Number of ways of selecting zero or more things from ‘n’ different things is given
by:- 2n-1

Proof: Number of ways of selecting one thing, out of n-things = nC1

Number of selecting two things, out of n-things =nC2

Number of ways of selecting three things, out of n-things =nC3

Number of ways of selecting ‘n’ things out of ‘n’ things = nCn

=>Total number of ways of selecting one or more things out of n different things

= nC1 + nC2 + nC3 + ------------- + nCn

= (nC0 + nC1 + -----------------nCn) - nC0

= 2n – 1 [ nC0=1]

Example: John has 8 friends. In how many ways can he invite one or more of them to
dinner?

Ans. John can select one or more than one of his 8 friends.

=> Required number of ways = 28 – 1= 255.

(iv) Number of ways of selecting zero or more things from ‘n’ identical things is given by
:- n+1

Example: In how many ways, can zero or more letters be selected form the letters
AAAAA?

Ans. Number of ways of :

Selecting zero 'A's = 1

Selecting one 'A's = 1

Selecting two 'A's =1

78
 Selecting three 'A's = 1

Selecting four 'A's = 1

Selecting five 'A's = 1

=> Required number of ways = 6 [5+1]

(V) Number of ways of selecting one or more things from ‘p’ identical things of one
type ‘q’ identical things of another type, ‘r’ identical things of the third type and ‘n’
different things is given by :-

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

Example: Find the number of different choices that can be made from 3 apples, 4
bananas and 5 mangoes, if at least one fruit is to be chosen.

Answer:

Number of ways of selecting apples = (3+1) = 4 ways.

Number of ways of selecting bananas = (4+1) = 5 ways.

Number of ways of selecting mangoes = (5+1) = 6 ways.

Total number of ways of selecting fruits = 4 x 5 x 6

But this includes, when no fruits i.e. zero fruits is selected

=> Number of ways of selecting at least one fruit = (4x5x6) -1 = 119

Note :- There was no fruit of a different type, hence here n=o

=> 2n = 20=1

(VI) Number of ways of selecting ‘r’ things from ‘n’ identical things is ‘1’.

Example: In how many ways 5 balls can be selected from ‘12’ identical red balls?

Ans. The balls are identical, total number of ways of selecting 5 balls = 1.

79
Example: How many numbers of four digits can be formed with digits 1, 2, 3, 4 and 5?

Ans. Here n = 5 [Number of digits]

And r = 4 [ Number of places to be filled-up]

5
Required number is P4 = 5!/1! = 5 x 4 x 3 x 2 x 1

Module 4.5 Restricted – Permutations

(a) Number of permutations of ‘n’ things, taken ‘r’ at a time, when a particular thing is
to be always included in each arrangement

= r n-1 Pr-1

(b) Number of permutations of ‘n’ things, taken ‘r’ at a time, when a particular thing is
fixed: = n-1 Pr-1

(c) Number of permutations of ‘n’ things, taken ‘r’ at a time, when a particular thing is
never taken: = n-1 Pr.

(d) Number of permutations of ‘n’ things, taken ‘r’ at a time, when ‘m’ specified things
always come together = m! x ( n-m+1) !

(e) Number of permutations of ‘n’ things, taken all at a time, when ‘m’ specified things
always come together = n ! - [ m! x (n-m+1)! ]

Example: How many words can be formed with the letters of the word ‘OMEGA’ when:

(i) ‘O’ and ‘A’ occupying end places.

(ii) ‘E’ being always in the middle

(iii) Vowels occupying odd-places

(iv) Vowels being never together.

Ans.

80
(i) When ‘O’ and ‘A’ occupying end-places

=> M.E.G. (OA)

Here (OA) are fixed, hence M, E, G can be arranged in 3! ways

But (O,A) can be arranged themselves is 2! ways.

=> Total number of words = 3! x 2! = 12 ways.

(ii) When ‘E’ is fixed in the middle

=> O.M.(E), G.A.

Hence four-letter O.M.G.A. can be arranged in 4! i.e 24 ways.

(iii) Three vowels (O,E,A,) can be arranged in the odd-places (1st, 3rd and 5th) =
3! ways.

And two consonants (M,G,) can be arranged in the even-place (2nd, 4th)
= 2 ! ways

=> Total number of ways= 3! x 2! = 12 ways.

(iv) Total number of words = 5! = 120!

If all the vowels come together, then we have: (O.E.A.), M,G

These can be arranged in 3! ways.

But (O,E.A.) can be arranged themselves in 3! ways.

=> Number of ways, when vowels come-together = 3! x 3!

= 36 ways

=> Number of ways, when vowels being never-together

= 120-36 = 84 ways.

81
Number of Combination of ‘n’ different things, taken ‘r’ at a time is given by:-

n
Cr= n! / r ! x (n-r)!

Proof: Each combination consists of ‘r’ different things, which can be arranged among
themselves in r! ways.

=> For one combination of ‘r’ different things, number of arrangements = r!

For nCr combination number of arrangements: r n

Cr

n
=> Total number of permutations = r! Cr ---------------(1)

But number of permutation of ‘n’ different things, taken ‘r’ at a time

= nPr -------(2)

From (1) and (2) :

n
Pr = r! . nCr

or n!/(n-r)! = r! . nCr

n
or Cr = n!/r!x(n-r)!

Note: nCr = nCn-r

n
or Cr = n!/r!x(n-r)! and nCn-r = n!/(n-r)!x(n-(n-r))!

= n!/(n-r)!xr!

Restricted – Combinations

(a) Number of combinations of ‘n’ different things taken ‘r’ at a time, when ‘p’
particular things are always included = n-pCr-p.

(b) Number of combination of ‘n’ different things, taken ‘r’ at a time, when ‘p’
particular things are always to be excluded = n-pCr

82
Example: In how many ways can a cricket-eleven be chosen out of 15 players? if

(i) A particular player is always chosen,

(ii) A particular is never chosen.

Ans: (i) A particular player is always chosen, it means that 10 players are selected
out of the remaining 14 players.

14
=. Required number of ways = C10 = 14C4

= 14!/4!x19! = 1365

(ii) A particular players is never chosen, it means that 11 players are selected out of 14
players.

14
=> Required number of ways = C11

= 14!/11!x3! = 364

(iii) Number of ways of selecting zero or more things from ‘n’ different things is given
by:- 2n-1

Proof: Number of ways of selecting one thing, out of n-things = nC1

Number of selecting two things, out of n-things =nC2

Number of ways of selecting three things, out of n-things =nC3

Number of ways of selecting ‘n’ things out of ‘n’ things = nCn

=>Total number of ways of selecting one or more things out of n different things

= nC1 + nC2 + nC3 + ------------- + nCn

= (nC0 + nC1 + -----------------nCn) - nC0

= 2n – 1 [ nC0=1]

83
Example: John has 8 friends. In how many ways can he invite one or more of them to
dinner?

Ans. John can select one or more than one of his 8 friends.

=> Required number of ways = 28 – 1= 255.

(iv) Number of ways of selecting zero or more things from ‘n’ identical things is given by
:- n+1

Example: In how many ways, can zero or more letters be selected form the letters
AAAAA?

Ans. Number of ways of :

Selecting zero 'A's = 1

Selecting one 'A's = 1

Selecting two 'A's =1

Selecting three 'A's = 1

Selecting four 'A's = 1

Selecting five 'A's = 1

=> Required number of ways = 6 [5+1]

(V) Number of ways of selecting one or more things from ‘p’ identical things of one
type ‘q’ identical things of another type, ‘r’ identical things of the third type and ‘n’
different things is given by :-

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

84
Example: Find the number of different choices that can be made from 3 apples, 4
bananas and 5 mangoes, if at least one fruit is to be chosen.

Ans:

Number of ways of selecting apples = (3+1) = 4 ways.

Number of ways of selecting bananas = (4+1) = 5 ways.

Number of ways of selecting mangoes = (5+1) = 6 ways.

Total number of ways of selecting fruits = 4 x 5 x 6

But this includes, when no fruits i.e. zero fruits is selected

=> Number of ways of selecting at least one fruit = (4x5x6) -1 = 119

Note :- There was no fruit of a different type, hence here n=o

=> 2n = 20=1

(VI) Number of ways of selecting ‘r’ things from ‘n’ identical things is ‘1’.

Example: In how many ways 5 balls can be selected from ‘12’ identical red balls?

Ans. The balls are identical, total number of ways of selecting 5 balls = 1.

Example: How many numbers of four digits can be formed with digits 1, 2, 3, 4 and 5?

Ans. Here n = 5 [Number of digits]

And r = 4 [ Number of places to be filled-up]

5
Required number is P4 = 5!/1! = 5 x 4 x 3 x 2 x 1

85
Restricted – Combinations

(a) Number of combinations of ‘n’ different things taken ‘r’ at a time, when ‘p’
particular things are always included = n-pCr-p.

(b) Number of combination of ‘n’ different things, taken ‘r’ at a time, when ‘p’
particular things are always to be excluded = n-pCr

Example: In how many ways can a cricket-eleven be chosen out of 15 players? if

(i) A particular player is always chosen,

(ii) A particular is never chosen.

Ans:

(i) A particular player is always chosen, it means that 10 players are selected out of
the remaining 14 players.

14
=. Required number of ways = C10 = 14C4

= 14!/4!x19! = 1365

(ii) A particular players is never chosen, it means that 11 players are selected out of 14
players.

14
=> Required number of ways = C11

= 14!/11!x3! = 364

(iii) Number of ways of selecting zero or more things from ‘n’ different things is given
by:- 2n-1

Proof: Number of ways of selecting one thing, out of n-things = nC1

Number of selecting two things, out of n-things =nC2

Number of ways of selecting three things, out of n-things =nC3

86
 Number of ways of selecting ‘n’ things out of ‘n’ things = nCn

=>Total number of ways of selecting one or more things out of n different things

= nC1 + nC2 + nC3 + ------------- + nCn

= (nC0 + nC1 + -----------------nCn) - nC0

= 2n – 1 [ nC0=1]

Example: John has 8 friends. In how many ways can he invite one or more of them to
dinner?

Ans. John can select one or more than one of his 8 friends.

=> Required number of ways = 28 – 1= 255.

(iv) Number of ways of selecting zero or more things from ‘n’ identical things is given by
:- n+1

Example: In how many ways, can zero or more letters be selected form the letters
AAAAA?

Ans. Number of ways of :

Selecting zero 'A's = 1

Selecting one 'A's = 1

Selecting two 'A's =1

Selecting three 'A's = 1

Selecting four 'A's = 1

Selecting five 'A's = 1

=> Required number of ways = 6 [5+1]

87
(V) Number of ways of selecting one or more things from ‘p’ identical things of one
type ‘q’ identical things of another type, ‘r’ identical things of the third type and ‘n’
different things is given by :-

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

Example: Find the number of different choices that can be made from 3 apples, 4
bananas and 5 mangoes, if at least one fruit is to be chosen.

Ans:

Number of ways of selecting apples = (3+1) = 4 ways.

Number of ways of selecting bananas = (4+1) = 5 ways.

Number of ways of selecting mangoes = (5+1) = 6 ways.

Total number of ways of selecting fruits = 4 x 5 x 6

But this includes, when no fruits i.e. zero fruits is selected

=> Number of ways of selecting at least one fruit = (4x5x6) -1 = 119

Note :- There was no fruit of a different type, hence here n=o

=> 2n = 20=1

(VI) Number of ways of selecting ‘r’ things from ‘n’ identical things is ‘1’.

Example: In how many ways 5 balls can be selected from ‘12’ identical red balls?

Ans. The balls are identical, total number of ways of selecting 5 balls = 1.

Example: How many numbers of four digits can be formed with digits 1, 2, 3, 4 and 5?

Ans. Here n = 5 [Number of digits]

And r = 4 [ Number of places to be filled-up]

5
Required number is P4 = 5!/1! = 5 x 4 x 3 x 2 x 1

88