CHAPTER

05
Permutations and
Combinations
Learning Part
Session 1
● Fundamental Principle of Counting

● Factorial Notation

Session 2
● Divisibility Test

● Principle of Inclusion and Exclusion

● Permutation

Session 3
● Number of Permutations Under Certain Conditions

● Circular Permutations

● Restricted Circular Permutations

Session 4
● Combination

● Restricted Combinations

Session 5
● Combinations from Identical Objects

Session 6
● Arrangement in Groups

● Multinomial Theorem

● Multiplying Synthetically

Session 7
● Rank in a Dictionary

● Gap Method [when particular objects are never together]

Practice Part
● JEE Type Examples
● Chapter Exercises

Arihant on Your Mobile !

Exercises with the #L
symbol can be practised on your mobile. See inside cover page to activate for free.
360 Textbook of Algebra

In everyday life, we need to know about the number of ways of doing certain work from given number of available
options. For example, Three persons A,B and C are applying for a job in which only one post is vacant. Clearly, vacant
post can be filled either by A or B or C i.e., total number of ways doing this work is three.
Again, let two persons A and B are to be seated in a row, then only two possible ways of arrangement is AB or BA.In
two arrangements, persons are same but their order is different. Thus, in arranging things, order of things is important.

Session 1
Fundamental Principle of Counting, Factorial Notation

Fundamental Principle (ii) Addition Principle

of Counting If an operation can be performed in ‘m’ different ways and
another operation, which is independent of the first
operation, can be performed in ‘n’ different ways. Then,
(i) Multiplication Principle either of the two operations can be performed in (m + n )
If an operation can be performed in ‘m’ different ways, ways. This can be extended to any finite number of
following which a second operation can be performed in ‘n’ mutually exclusive operation.
different ways, then the two operations in succession can be Note For OR → ‘+’ (Addition)
performed inm × n ways. This can be extended to any finite
y Example 3. There are 25 students in a class in which
number of operations.
Note For AND → ‘×’ (multiply)
15 boys and 10 girls. The class teacher select either a
boy or a girl for monitor of the class. In how many
y Example 1. A hall has 12 gates. In how many ways ways the class teacher can make this selection?
can a man enter the hall through one gate and come Sol. Since, there are 15 ways to select a boy, so there are 10
out through a different gate? ways to select a girl.
Sol. Since, there are 12 ways of entering into the hall. After Hence, by the fundamental principle of addition, either a
entering into the hall, the man come out through a differ- boy or a girl can be performed in 15 + 10 = 25 ways.
ent gate in 11 ways.
Hence, by the fundamental principle of multiplication, total y Example 4. There are 4 students for Physics, 6
number of ways is 12 × 11 = 132 ways. students for Chemistry and 7 students for Mathematics
gold medal. In how many ways one of these gold
y Example 2. There are three stations A, B and C, five medals be awarded?
routes for going from station A to station B and four Sol. The Physics, Chemistry and Mathematics student’s gold
routes for going from station B to station C. Find the medal can be awarded in 4, 6 and 7 ways, respectively.
number of different ways through which a person can Hence, by the fundamental principle of addition, number
go from A to C via B. ways of awarding one of the three gold medals.
Sol. Since, there are five routes for going from A to B. So, = 4 + 6 + 7 = 17 ways.
there are four routes for going from B to C.

A
B
C
Factorial Notation
Hence, by the fundamental principle of multiplication, total Let n be a positive integer. Then, the continued product of
number of different ways first ‘n’ natural numbers is called factorial n, to be denoted
=5× 4 [i.e., A to B and then B to C ] by n ! or n i.e., n ! = n(n − 1)(n − 2 ) K 3 ⋅ 2 ⋅ 1
= 20 ways Note When n is negative or a fraction, n! is not defined.
 Chap 05 Permutations and Combinations 361

Some Important Properties Exponent of prime p in n!

(i) n ! = n (n − 1) ! = n (n − 1)(n − 2 ) ! Exponent of prime p in n ! is denoted by E p (n !), where p is
(ii) 0 ! = 1 ! = 1 prime number and n is a natural number. The last integer
n 
(iii) (2n ) ! = 2 n n ![1 ⋅ 3 ⋅ 5 K(2n − 1)] amongst 1, 2, 3, …, (n − 1), n which is divisible by p is   p,
p
n!
(iv) = n(n − 1)(n − 2 ) K (r + 1) [r < n ] where [ ⋅ ] denotes the greatest integer function.
r! ∴ E p (n !) = E p (1 ⋅ 2 ⋅ 3 K(n − 1) ⋅ n )
n! 
(v) = n(n − 1) (n − 2 ) K (n − r + 1) [r < n ] n  
(n − r ) ! = E p  p ⋅ 2 p ⋅ 3 pK(n − 1) p ⋅   p 
  p  
1 1 λ 
(vi) + = , then λ = (n + 2 ) 2
n ! (n + 1) ! (n + 2 ) ! [because the remaining natural numbers from 1 to n are
(vii) If x ! = y ! ⇒ x = y or x = 0, y = 1 not divisible by p]
or x = 1, y = 0 n    n 
=   + E p 1 ⋅ 2 ⋅ 3 K   …(i)
p   p 
y Example 5. Find n, if (n + 2)! = 60 × (n − 1)!.
n 
Sol. Q(n + 2)! = (n + 2)(n + 1)n (n − 1)! Now, the last integer amongs 1, 2, 3, …,   which is
p
(n + 2)!
⇒ = (n + 2)(n + 1)n n 
(n − 1)! p  n 
⇒ 60 = (n + 2)(n + 1)n [given] divisible by p is   =  2 . Now, from Eq. (i), we get
⇒ 5 × 4 × 3 = ( n + 2) × ( n + 1) × n
 p   p 
 
∴ n =3
n   n  
E p (n !) =   + E p  p, 2 p, 3 p, K,  2  p 
n
y Example 6. Evaluate ∑r × r! . p   p  
r =1
n 
n n n [because the remaining natural numbers from 1 to   are
Sol. We have, ∑r × r ! = ∑ {(r + 1) − 1}r ! = ∑(r + 1)! − r ! not divisible by p]
p
r =1 r =1 r =1

= (n + 1)! − 1! n   n    n 
∴ E p (n !) =   +  2  + E p  1 ⋅ 2 ⋅ 3 K  2  
[ put r = n in (r + 1)! and r = 1 is r !]  p   p    p  
= (n + 1)! − 1
Similarly, we get
n
n   n   n  n 
y Example 7. Find the remainder when ∑ r ! is divided E p (n !) =   +  2  +  3  + K +  s 
r =1  p   p   p   p 
by 15, if n ≥ 5.
Sol. Let where, s is the largest natural number such that
n
N = ∑ r ! = 1! + 2! + 3! + 4 ! + 5! + 6! + 7 ! + K + n ! ps ≤ n < ps + 1
r =1 Note Number of zeroes at the end of n! = E5 ( n!).
= (1! + 2! + 3! + 4 !) + (5! + 6! + 7 ! +K + n !)
= 33 + (5! + 6! + 7 ! + K+n !) y Example 8. Find the exponent of 3 in 100! .
N 33 (5! + 6! + 7 ! + K+ n !) Sol. In terms of prime factors 100! can be written as 2a ⋅ 3b ⋅ 5c ⋅ 7d K
⇒ = +
15 15 15 Now, b = E 3 (100!)
3
=2+ + Integer [as 5!, 6!, K are divisible by 15] 100 100 100 100
15 =   +  4  +  3  +  4  +K
 3  3  3  3 
3
= + Integer = 33 + 11 + 3 + 1 + 0 + ... = 48
15
Hence, exponent of 3 is 48.
Hence, remainder is 3.
362 Textbook of Algebra

Aliter ∴ 100! = 297 ⋅ 3b ⋅ 524 ⋅ 7d K = 273 ⋅ 3b ⋅ (2 × 5)24 ⋅ 7d K

Q 100! = 1 × 2 × 3 × 4 × 5 × K × 98 × 99 × 100 = 273 ⋅ 3b ⋅ (10)24 ⋅ 7d K
= (1 × 2 × 4 × 5 × 7 × K × 98 × 100) Hence, number of zeroes at the end of 100! is 24.
(3 × 6 × 9 × K × 96 × 99 )
or Exponent of 10 in 100! = min (97, 24) = 24.
= k × 3 (1 × 2 × 3 × K × 32 × 33)
33
Aliter
= [k (1 × 2 × 4 × 5 × K × 31 × 32)] Number of zeroes at the end of 100!
(3 × 6 × 9 × K × 30 × 33) 100 100
= 333 k1 × 311(1 × 2 × 3 × K × 10 × 11) = E 5 (100!) =   +  2  + K
 5  5 
= 344 [k1 (1 × 2 × 4 × 5 × K × 10 × 11)](3 × 6 × 9 ) = 20 + 4 + 0 + K = 24
= k 2 × 344 × 34 × 2 = k 3 × 348
y Example 11. For how many positive integral values of
Hence, exponent of 3 in 100! is 48. n does n! end with precisely 25 zeroes?
y Example 9. Prove that 33! is divisible by 219 and Sol. Q Number of zeroes at the end of n ! = 25 [given]
what is the largest integer n such that 33! is divisible ⇒ E 5 ( x !) = 25
by 2n ? n   n   n 
⇒  5  + 25 + 125 + K = 25
Sol. In terms of prime factors, 33! can be written as
2a ⋅ 3b ⋅ 5c ⋅ 7d ⋅ K
It’s easy to see that n = 105 is the smallest satisfactory value
33 33 33 33 33 of n. The next four values of n will also work (i.e., n = 106,
Now, E 2 (33!) =   +  2  +  3  +  4  +  5  + K
 2  2  2  2  2  107, 108, 109). Hence, the answer is 5.
= 16 + 8 + 4 + 2 + 1 + 0 + K
y Example 12. Find the exponent of 80 in 180!.
= 31
Sol. Q 80 = 24 × 5
Hence, the exponent of 2 in 33! is 31. Now, 33! is divisible
by 231 which is also divisible by 219 . 180 180 180 180
∴ E 2 (180!) =   +  2  +  3  +  4 
∴ Largest value of n is 31.  2  2  2  2 
180 180 180
y Example 10. Find the number of zeroes at the end +  5  +  6  +  7  +K
2  2  2 
of 100!.
= 90 + 45 + 22 + 11 + 5 + 2 + 1 = 176
Sol. In terms of prime factors, 100! can be written as
180 180 180
2a ⋅ 3b ⋅ 5c ⋅ 7d K and E 5 (180!) =   +  2  +  3  + K
 5  5  5 
100  100  100  100  100  100 
Now, E 2(100 !) =  + + + + + = 36 + 7 + 1 + 0 + K
 2   2 2   2 3   2 4   2 5   2 6 
= 44
= 50 + 25 + 12 + 6 + 3 + 1 = 97 176 
Now, exponent of 16 in 180! is  = 44, where [ ⋅ ] denotes the
100 100
and E 5 (100!) =   +  2   4 
 5  5  greatest integer function. Hence, the exponent of 80 in 180! is 44.
= 20 + 4 = 24
 Chap 05 Permutations and Combinations 363

#L Exercise for Session 1

1. There are three routes: air, rail and road for going from Chennai to Hyderabad. But from Hyderabad to
Vikarabad, there are two routes, rail and road. The number of routes from Chennai to Vikarabad via
Hyderabad is
(a) 4 (b) 5 (c) 6 (d) 7

2. There are 6 books on Mathematics, 4 books on Physics and 5 books on Chemistry in a book shop. The
number of ways can a student purchase either a book on Mathematics or a book on Chemistry, is
(a) 10 (b) 11 (c) 9 (d) 15
1 1 λ
3. If a, b and c are three consecutive positive integers such that a < b < c and + = , the value of λ is
a! b ! c!
(a) a (b) b (c) c (d) a + b + c

4. If n!, 3 × n ! and (n + 1)! are in GP, then n ! , 5 × n ! and (n + 1)! are in

(a) AP (b) GP (c) HP (d) AGP
n
5. Sum of the series ∑ (r 2 + 1) r! is
r =1

(a) (n + 1) ! (b) (n + 2) ! − 1 (c) n ⋅ (n + 1) ! (d) n ⋅ (n + 2) !

α β γ δ θ φ
6. If 15 ! = 2 ⋅ 3 ⋅ 5 ⋅ 7 ⋅ 11 ⋅ 13 , the value of α − β + γ − δ + θ − φ is
(a) 4 (b) 6 (c) 8 (d) 10

7. The number of naughts standing at the end of 125! is

(a) 29 (b) 30 (c) 31 (d) 32

8. The exponent of 12 in 100! is

(a) 24 (b) 25 (c) 47 (d) 48

9. The number 24! is divisible by

(a) 6 24 (b) 24 6 (c) 1212 (d) 48 5

10. The last non-zero digit in 20! is

(a) 2 (b) 4 (c) 6 (d) 8

11. The number of prime numbers among the numbers 105 ! + 2,105 ! + 3,105 ! + 4, …, 105 ! + 104
and 105 ! + 105 is
(a) 31 (b) 32 (c) 33 (d) None of these
Session 2
Divisibility Test, Principle of Inclusion and Exclusion,
Permutation
Divisibility Test Principle of Inclusion
In decimal system all numbers are formed by the digits 0, and Exclusion
1, 2, 3, …, 9. If a b c d e is a five-digit number in decimal
1. If A and B are finite sets, from the Venn diagram (i), it
system, then we can write that.
is clear that
a b c d e = 10 4 ⋅ a + 10 3 ⋅ b + 10 2 ⋅ c + 10 ⋅ d + e. U
Number a b c d e will be divisible
A B
(1) by 2, if e is divisible by 2.
(2) by 4, if 2d + e is divisible by 4. (i)
(3) by 8, if 4c + 2d + e is divisible by 8.
n (A ∪ B ) = n (A) + n (B ) − n (A ∩ B )
(4) by 2t , if number formed by last t digits is divisible by 2 t .
and n ( A ′ ∩ B ′ ) = n (U ) − n ( A ∪ B )
For example, Number 820101280 is divisible by 2 5
2. If A , B and C are three finite sets, then from the Venn
because 01280 is divisible by 2 5 . diagram (ii), it is clear that
(5) by 5, if e = 0 or 5.
U
(6) by 5t , if number formed by last t digits is
B
divisible by 5 t . A

For example, Number 1128375 is divisible by 5 3

because 375 is divisible by 5 3 .
C
(7) by 3, if a + b + c + d + e (sum of digits) is divisible
by 3. (ii)
(8) by 9, if a + b + c + d + e is divisible by 9. n ( A ∪ B ∪ C ) = n ( A ) + n ( B ) + n (C ) − n ( A ∩ B )
(9) by 6, if e = even and a + b + c + d + e is divisible by 3. − n ( B ∩ C ) −n (C ∩ A ) + n ( A ∩ B ∩ C )
(10) by 18, if e = even and a + b + c + d + e is divisible and n ( A ′ ∩ B ′ ∩ C ′ ) = n (U ) − n ( A ∪ B ∪ C )
by 9.
Note If A1,A2,A 3, …, An are finite sets, then
(11) by 7, if abcd − 2e is divisible by 7.
n ( A1 ∪ A2 ∪ ... ∪ An ) = Σn( Ai ) − Σn( Ai ∩ Aj ) + Σn( Ai ∩ Aj ∩ Ak ) −
For example, Number 6552 is divisible by 7 because ... + ( −1) n Σn( A1 ∩ A2 ∩ ... ∩ An )
655 − 2 × 2 = 651 = 93 × 7 is divisible by 7. and n( A′1 ∩ A′ 2 ∩ ... ∩ A′ n ) = n( U ) − n( A1 ∪ A2∪ ... ∪ An ).
(12) by 11, if a1
4+2+3e
c4 − +d
b{
Sum of digits at
y Example 13. Find the number of positive integers
Sum of digits
odd places at even places from 1 to 1000, which are divisible by atleast 2, 3 or 5.
is divisible by 11. Sol. Let Ak be the set of positive integers from 1 to 1000,
For example, Number 15222163 is divisible by 11 which is divisible by k. Obviously, we have to find
because n ( A 2 ∪ A 3 ∪ A 5 ). If [ ⋅ ] denotes the greatest integer
function, then
(1 + 2 + 2 + 6 ) − (5 + 2 + 1 + 3 ) = 0 is divisible by 11. 1000
n( A 2 ) =  = [500] = 500
(13) by 13, if abcd + 4e is divisible by 13.  2 
For example, Number 1638 is divisible by 13 because 1000
n( A 3 ) =  = [333.33] = 333
163 + 4 × 8 = 195 = 15 × 13 is divisible by 13.  3 
 Chap 05 Permutations and Combinations 365

1000
n( A 5 ) =  = [200] = 200 Note
 5  (i) The number of permutations of n different things taken all at
1000 a time = n Pn = n!
n( A 2 ∩ A 3 ) =  = [16667
. ] = 166
 6  P0 = 1 , n P1 = n and n Pn − 1 = n Pn = n!
n
(ii)
1000 n
Pr = n( n − 1 Pr = n( n − 1)( n − 2 Pr
= [6667
. ] = 66
(iii) − 1) − 2)
n( A 3 ∩ A 5 ) = 
 15  = n( n − 1)( n − 2)( n − 3 Pr − 3) = K
1000
n( A 2 ∩ A 5 ) =  = [100] = 100 n −1
Pr = ( n − r ) n −1
 10 
(iv) Pr −1
n
1000 Pr
and n ( A 2 ∩ A 3 ∩ A 5 ) =  = [33.33] = 33 (v) = ( n − r + 1)
 30 
n
Pr − 1

From Principle of Inclusion and Exclusion

y Example 14. If 56
Pr + 6 : 54
Pr + 3 = 30800 : 1, find r P2 .
n( A 2 ∪ A 3 ∪ A 5 ) = n( A 2 ) + n( A 3 ) + n( A 5 )
− n (A2 ∩ A3 ) 56
Pr +6 30800
Sol. We have, =
−n ( A 3 ∩ A 5 ) − n ( A 2 ∩ A 5 ) + n ( A 2 ∩ A 3 ∩ A 5 ) 54
Pr +3 1
= 500 + 333 + 200 − 166 − 66 − 100 + 33 = 734 54
Pr +4 30800
Hence, the number of positive integers from 1 to 1000, ⇒ (56)(55) 54 = [from note (iii)]
which are divisible by atleast 2, 3 or 5 is 734. Pr +3 1
Note 54
Pr +4
The number of positive integers from 1 to 1000, which are not ⇒ 54
= 10
divisible by 2, 3 or 5 is n ( A′2 ∩ A′3 ∩ A′3 ). Pr +3
∴n( A′ 2 ∩ A′ 3 ∩ A′ 5 ) = n( U ) − n( A2 ∪ A3 ∪ A5 ) [here , n( U ) = 1000] ⇒ 54 − (r + 4 ) + 1 = 10 [from note (v)]
= 1000 − 734 = 266
r = 41
∴ r
P2 = P2 = 41 ⋅ 40 = 1640
41

Permutation 11 (n − 1) n + 3
n+5
Each of the different arrangements which can be made by y Example 15. If Pn + 1 = ⋅ Pn , find n.
taking some or all of a number of things is called a 2
n+5
permutation. In permutation, order of the arrangement is Pn + 1 11(n − 1)
Sol. We have, =
important. n+3
Pn 2

Important Results (n + 5)(n + 4 ) ⋅n + 3 Pn − 1 11(n − 1)

⇒ n+3
= [from note (iii)]
1. The number of permutations of n different Pn 2
things, taking r at a time is denoted by n Pr or (n + 5)(n + 4 ) 11(n − 1)
= [from note (v)]
P (n , r ) or A (n , r ), then ( n + 3 − n + 1) 2
n
Pr = n (n − 1 )(n − 2) K (n − r + 1 ) ⇒ (n + 5)(n + 4 ) = 22(n − 1)
n! ⇒ n 2 − 13n + 42 = 0
=
(n − r ) !
⇒ (n − 6)(n − 7 ) = 0
where, n ∈ N , r ∈W and 0 ≤ r ≤ n. ∴ n = 6, 7
Proof LHS = n Pr = Number of ways of filling up r
y Example 16. If m + n P2 = 90 and m −n
P2 = 30, find the
vacant places simultaneously from n different things
values of m and n.
1 2 3 r m +n
Sol. Q P2 = 90 = 10 × 9 = 10
P2
n ways (n–1) ways (n–2) ways (n–r+1) ways ∴ m + n = 10 ...(i)
m −n
= n (n − 1) (n − 2 )...(n − r + 1) and P2 = 30 = 6 × 5 = P2 6

n (n − 1)(n − 2 )...(n − r + 1) × (n − r ) ∴ m −n =6 ...(ii)

=
(n − r ) ! From Eqs. (i) and (ii), we get
n!
= = RHS m = 8 and n = 2.
(n − r ) !
366 Textbook of Algebra

y Example 17. Find the value of r, if Note Total number of letters in English alphabet = 26
(i) Number of vowels = 5
(i) 11 Pr = 990
i.e., A, E, I, O, U [strong vowels]
(ii) 8
P5 + 5 ⋅ 8 P4 = 9 Pr (ii) W and Y an half vowels. [weak vowels]
(iii) 22
Pr + 1 : 20
Pr + 2 = 11 : 52 (iii) Number of consonants = 21 [except vowels]
i.e., B, C, D, F, G, ..., Y, Z
Sol. (i) Q 11 Pr = 990 = 11 × 10 × 9 = 11P3 (iv) Words which contains all vowels are
∴ r =3 EDUCATION, EQUATION, ...
(ii) Q 8
P5 + 5 ⋅ 8 P4 = 9 Pr (iv) Words which do not contains any vowels are
SKY, FLY, TRY, ...
 8P 
⇒ 8
P4  8 5 + 5 = 9 Pr
 P4  y Example 20. How many different signals can be
given using any number of flags from 4 flags of
⇒ 8
P4 (8 − 5 + 1 + 5) = 9 Pr [from note (v)]
different colours?
⇒ 9 ⋅ P4 = Pr
8 9
Sol. The signals can be made by using one or more flags at a
⇒ 9
P5 = 9 Pr [from note (iii)] time. Hence, by the fundamental principle of addition, the
total number of signals
∴ r =5
= 4 P1 + 4 P2 + 4 P3 + 4 P4
(iii) Q 22
Pr +1 :
20
Pr +2 = 11 : 52
= 4 + ( 4 × 3) + ( 4 × 3 × 2) + ( 4 × 3 × 2 × 1)
22
Pr +1 11 = 4 + 12 + 24 + 24 = 64
⇒ 20
=
Pr +2 52
y Example 21. Find the total number of 9-digit
22 ⋅ 21 ⋅ 20
Pr −1 11 numbers which have all different digits.
⇒ =
(19 − r ) ⋅ (20 − r ) ⋅ (21 − r ) ⋅ 20
Pr −1 52 Sol. Number of digits are 10 (0, 1, 2, 3, 4, 5, 6, 7, 8, 9)
[from note (iii) and (iv)] Total number of 9-digit numbers = 10
P9
⇒ (21 − r ) ⋅ (20 − r ) ⋅ (19 − r ) = 52 × 2 × 21 Out of these, the number of numbers having zero at the
= 14 × 13 × 12 first place = 9 P8
∴ r =7 Hence, required number of numbers = 10
P9 − 9 P8

y Example 18. Prove that = 10 × 9 P8 − 9 P8 = 9 × 9 P8

n +1
1
P1 + 2 ⋅ 2P2 + 3 ⋅ 3P3 + ... + n ⋅ nPn = Pn + 1 − 1. =9 ×
9!
= 9 × 9!
1!
Sol. LHS = 1P1 + 2 ⋅ 2 P2 + 3 ⋅ 3 P3 + ... + n ⋅ n Pn
Note Total number of n digit numbers ( 1 ≤ n ≤ 10 ) ,
n n
which have all different digits = Pn − 9 Pn − 1
∑r ⋅ ∑ {(r + 1) − 1)} ⋅
10
= r
Pr = r
Pr
r =1 r =1
n y Example 22. A 5-digit number divisible by 3 is to be
= ∑ {(r + 1) ⋅ r Pr − r Pr )} formed using the numbers 0, 1, 2, 3, 4 and 5 without
r =1
repetition. Find total number of ways in which this can
n
be done.
= ∑(r + 1 Pr + 1 − r Pr ) [from note (iii)]
Sol. A number will be divisible by 3, if sum of the digits in
r =1
n +1 n +1
number be divisible by 3.
= Pn + 1 − 1P1 = Pn + 1 − 1
Here, 0 + 1 + 2 + 3 + 4 + 5 = 15 , which is divisible by 3.
= RHS Therefore, the digit that can be left out, while the sum still
is multiple of 3, is either 0 or 3.
y Example 19. Determine the number of permutations If 0 left out
of the letters of the word ‘SIMPLETON’ taken all at Then, possible numbers = 5 P5 = 5! = 120
a time.
If 3 left out
Sol. There are 9 letters in the word ‘SIMPLETON’ and all the
9 letters are different. Hence, the number of permutations Then, possible numbers = 5 P5 − 4 P4 = 5! − 4 ! = 120 − 24 = 96
taking all the letters at a time Hence, required total numbers = 120 + 96 = 216
= 9 P9 = 9 ! = 362880
 Chap 05 Permutations and Combinations 367

y Example 23. A 5-digit number is formed by the digits Proof Let the required number of permutations be x .
1, 2, 3, 4, 5 without repetition. Find the number of the Since, p different things can be arranged among
numbers, thus formed divisible by 4. themselves in p ! ways, therefore if we replace p
Sol. Let a 5-digit number be abcde. identical things by p different things, which are also
different from the rest of things, the number of
It will be divisible by 4, if 2d + e is divisible by 4.
permutations will become x × p !
⇒ 2d + e is divisible by 4 ∴ e must be even.
123 Again, if we replace q identical things by q different
Even
things, the number of permutations will become
 e
⇒ 2 d +  is divisible by 4 ( x × p !) × q !
 2
1424 3 Again, if we replace r identical things by r different
Should be even
things, the number of permutations will become
Then, e = 2, d = 1, 3, 5 ( x × p ! × q !) × r ! . Now, all the n things are different
 Total four cases
and e = 4, d = 2  and therefore, number of permutations should be n ! .
∴ Required number of ways = 4 × {
3! = 24 Thus, x × p ! × q ! × r ! = n !
Number of ways n!
∴ x=
filling abc after filling de. p!q!r !
Aliter A number will be divisible by 4, if the last two digits
Remark
of the number is divisible by 4, then for divisible by 4, last
The above theorem can be extended further i.e. if there are
two digits 12 or 24 or 32 or 52
n things taken all at a time, p1 are alike of one kind, p2 are alike of
second kind,p3 are alike of third kind, ..., pr are alike of rth kind
such that p1 + p2 + p3 + K + pr = n, the number of permutations
3! ways 4 ways n!
of these n things is .
p1 ! p2 ! p3 ! ... pr !
Hence, the number formed is divisible by 4 = 3! × 4 = 24.

y Example 24. Find the number of permutations of y Example 25. How many words can be formed with
letters ab c d e f g taken all together if neither ‘beg’ the letters of the word ‘ARIHANT’ by rearranging them?
Sol. Here, total letters 7, in which 2A’s but the rest are
nor ‘cad’ pattern appear. 7!
Sol. The total number of permutations without any restriction is 7! different. Hence, the number of words formed = = 2520
2!
n (U ) = 7 ! = 5040
Let n ( A ) be the number of permutations in which ‘beg’ y Example 26. Find the number of permutations of the
pattern always appears letters of the words ‘DADDY DID A DEADLY DEED’.
b e gac d f Sol. Here, total letters 19, in which 9D ’s, 3A’s, 2Y’s, 3E’s and
i.e., n ( A ) = 5! = 120 rest occur only once.
19 !
and let n ( B ) be the number of permutations in which ‘cad’ ∴ Required number of permutations =
pattern always appears 9 ! × 3! × 2! × 3!
c a db e f g
i.e., n ( B ) = 5! = 120 y Example 27. How many words can be formed with
Now, n ( A ∩ B ) = Number of permutations in which ‘beg’ the letters of the words
and ‘cad’ pattern appear (i) HIGH SCHOOL and
begcad f (ii) INTERMEDIATE by rearranging them?
i.e., n ( A ∩ B ) = 3! = 6 Sol. (i) Here, total letters are 10, in which 3H’s and 2O’s, but
Hence, the number of permutations in which ‘beg’ and ‘cad’ the rest are different. Hence, the number of words
patterns do not appear is n ( A ′ ∩ B ′ ). 10!
formed =
or n ( A ′ ∩ B ′ ) = n (U ) − n ( A ∪ B ) 3! 2!
= n (U ) − [n ( A ) + n ( B ) − n ( A ∩ B )]
(ii) Here, total letters are 12, in which 2I’s, 2T’s and 3E’s
= 5040 − 120 − 120 + 6 = 4806
but the rest are different. Hence, the number of words
2. The number of permutations of n things taken all 12!
formed = Note [For Remember]
at a time, p are alike of one kind, q are alike of 2! 2! 3!
second kind and r are alike of a third kind and High School = 10 th class = Total number of letters are 10
n!
the rest n − ( p + q + r ) are all different is Intermediate = 12 th class = Total number of letters
p!q !r ! are 12
368 Textbook of Algebra

3. The number of permutations of n different y Example 31. In how many ways can 4 prizes be distributed
things taken r at a time when each thing may be among 5 students, if no student gets all the prizes?
repeated any number of times is n r . Sol. The number of ways in which the 4 prizes can be given
Proof Since, the number of permutations of n away to the 5 students, if a student can get any number
different things taken r at a time = Number of ways in of prizes = 54 = 625.
which r blank places can be filled by n different Again, the number of ways in which a student gets all the 4
things. prizes = 5, since there are 5 students and any one of them
may get all the four prizes.
Clearly, the first place can be filled in n ways. Since, Therefore, the required number of ways in which a student
each thing may be repeated, the second place can be does not get all the prizes = 625 − 5 = 620.
filled in n ways. Similarly, each of the 3rd, 4th, K, r th
place can be filled in n ways. y Example 32. Find the number of n-digit numbers, which
By multiplication principle, the number of contain the digits 2 and 7, but not the digits 0, 1, 8, 9.
permutations of n different things taken r at a time Sol. The total number without any restrictions containing
when each thing may be repeated any number of digits 2, 3, 4, 5, 6, 7 is n (U ) = 6n .
times The total number of numbers that contain 3, 4, 5, 6, 7 is
= n × n × n × K × r factors n ( A ) = 5n .
The total number of numbers that contain 2, 3, 4, 5, 6 is
= nr
n ( B ) = 5n .
Corollary When r = n The total number of numbers that contain 3, 4, 5, 6 is
i.e., the number of permutations of n different things, n ( A ∩ B ) = 4n .
taken all at a time, when each thing may be repeated The total number of numbers that do not contain digits 2
any number of times in each arrangements is n n . and 7 is n ( A ∪ B )
i.e., n ( A ∪ B ) = n ( A ) + n ( B ) − n ( A ∩ B )
y Example 28. A child has four pockets and three = 5n + 5n − 4 n = 2 (5n ) − 4 n
marbles. In how many ways can the child put the Hence, the total number of numbers that contain 2 and 7 is
marbles in its pockets? n( A ′ ∩ B ′ )
∴ n ( A ′ ∩ B ′ ) = n (U ) − n ( A ∪ B ) = 6n − 2 ⋅ (5n ) + 4n
Sol. The first marble can be put into the pocket in 4 ways, so
can the second. Thus, the number of ways in which the
child can put the marbles = 4 × 4 × 4 = 4 3 = 64 ways y Example 33. Show that the total number of
permutations of n different things taken not more than
y Example 29. There are m men and n monkeys r at a time, when each thing may be repeated any
(n > m ). If a man have any number of monkeys. In how n(n r − 1)
number of times is .
many ways may every monkey have a master? (n − 1)
Sol. The first monkey can select his master by m ways and Sol. Given, total different things = n
after that the second monkey can select his master again The number of permutations of n things taken one at a time
by m ways, so can the third and so on.
= n P1 = n , now if we taken two at a time (repetition is
All monkeys can select master = m × m × m K upto n
factors = (m )n ways allowed), then first place can be filled by n ways and second
place can again be filled in n ways.
y Example 30. How many four digit numbers can be ∴The number of permutations of n things taken two at a time
formed by using the digits 1, 2, 3, 4, 5, 6, 7, if atleast = n P1 × n P1 = n × n = n 2
one digit is repeated ? Similarly, the number of permutations of n things taken
Sol. The numbers that can be formed when repetition of digits three at a time = n 3
is allowed are 7 4 = 2401.
M M M M M
The numbers that can be formed when all the digits are The number of permutations of n things taken r at a
distinct when repetition is not allowed are 7 P4 = 840. time = n r . Hence, the total number of permutations
Therefore, the numbers that can be formed when atleast = n + n 2 + n 3 + K + nr
one digit is repeated = 7 4 − 7 P4 n ( n r − 1)
= [sum of r terms of a GP]
= 2401 − 840 = 1561 ( n − 1)
 Chap 05 Permutations and Combinations 369

#L Exercise for Session 2

1. If nP5 = 20 ⋅ nP3, then n equals
(a) 4 (b) 8 (c) 6 (d) 7
2. If P5 + 5 ⋅ P4 = Pr , then n + r equals
9 9 n

(a) 13 (b) 14 (c) 15 (d) 16

m
m+ n m−n P3
3. If P2 = 56 and P3 = 24, then n
equals
P2
(a) 20 (b) 40 (c) 60 (d) 80
2n + 1 2n − 1
4. If Pn − 1 : Pn = 7 : 10, then P3 equals
n

(a) 60 (b) 24 (c) 120 (d) 6

5. In a train, five seats are vacant, the number of ways three passengers can sit, is
(a) 10 (b) 20 (c) 30 (d) 60
6. If a denotes the number of permutations of x + 2 things taken all at a time, b the number of permutations of x
things taken 11 at a time and c the number of permutations of ( x − 11) things taken all at a time such that
a = 182 bc, the value of x is
(a) 10 (b) 12 (c) 15 (d) 18
7. The number of nine non-zero digits such that all the digits in the first four places are less than the digit in the
middle and all the digits in the last four places are greater than that in the middle, is
(a) 48 (b) 7560 (c) 10080 (d) 576
8. Total number of words that can be formed using all letters of the word ‘DIPESH’ that neither begins with ‘I’ nor
ends with ‘D’ is equal to
(a) 504 (b) 480 (c) 624 (d) 696
9. The number of all five digit numbers which are divisible by 4 that can be formed from the digits 0, 1, 2, 3, 4
(without repetition), is
(a) 36 (b) 30 (c) 34 (d) None of these
10. The number of words can be formed with the letters of the word ‘MATHEMATICS’ by rearranging them, is
11! 11! 11!
(a) (b) (c) (d) 11!
2! 2! 2! 2! 2! 2!

11. Six identical coins are arranged in a row. The number of ways in which the number of tails is equal to the
number of heads, is
(a) 9 (b) 20 (c) 40 (d) 120
12. A train time table must be compiled for various days of the week so that two trains twice a day depart for three
days, one train daily for two days and three trains once a day for two days. How many different time tables can
be compiled?
(a) 140 (b) 210 (c) 133 (d) 72
13. Five persons entered the lift cabin on the ground floor of an 8 floor house. Suppose each of them can leave
the cabin independently at any floor beginning with the first. The total number of ways in which each of the five
persons can leave the cabin at any one of the floor, is
(a) 57 (b) 75 (c) 35 (d) 2520
14. Four die are rolled. The number of ways in which atleast one die shows 3, is
(a) 625 (b) 671 (c) 1256 (d) 1296
15. The number of 4-digit numbers that can be made with the digits 1, 2, 3, 4 and 5 in which atleast two digits are
identical, is
(a) 45 − 5 ! (b) 505 (c) 600 (d) 120

16. There are unlimited number of identical balls of three different colours. How many arrangements of atmost 7
balls in a row can be made by using them?
(a) 2187 (b) 343 (c) 399 (d) 3279
Session 3
Number of Permutations Under Certain Conditions,
Circular Permutations, Restricted Circular Permutations

Number of Permutations Sol. The word ‘INSURANCE’ has nine different letters,
Under Certain Conditions combine the vowels into one bracket as (IUAE) and treat-
ing them as one letter we have six letters viz.
(i) Number of permutations of n different things, taken r (IUAE) N S R N C and these can be arranged among
at a time, when a particular thing is to be always 6!
themselves in ways and four vowels within the bracket
included in each arrangement, is r ⋅ n − 1 Pr − 1 2!
can be arranged themselves in 4 ! ways.
Corollary Number of permutations of n different 6!
∴ Required number of words = × 4 ! = 8640
things, taken r at a time, when p particular things is 2!
to be always included in each arrangement, is
p ! (r − ( p − 1)) n − p Pr − p . y Example 36. How many words can be formed with
the letters of the word ‘PATALIPUTRA’ without
(ii) Number of permutations of n different things, taken r changing the relative positions of vowels and
at a time, when a particular thing is never taken in consonants?
each arrangement, is
n −1 Sol. The word ‘PATALIPUTRA’ has eleven letters, in which
Pr . 2P’s, 3A’s, 2T’s, 1L, 1U, 1R and 1I. Vowels are AAIUA
(iii) Number of permutations of n different things, taken 5!
These vowels can be arranged themselves in = 20 ways.
all at a time, when m specified things always come 3!
together, is The consonants are PTLPTR these consonants can be
m ! × (n − m + 1) ! arranged themselves in
6!
= 180 ways
(iv) Number of permutations of n different things, taken 2!2!
all at a time, when m specified things never come ∴ Required number of words
together, is = 20 × 180 = 3600 ways.
n ! − m ! × (n − m + 1) !
y Example 37. Find the number of permutations
y Example 34. How many permutations can be made that can be had from the letters of the
out of the letters of the word ‘TRIANGLE’ ? How many word ‘OMEGA’
of these will begin with T and end with E ? (i) O and A occuping end places.
Sol. The word ‘TRIANGLE’ has eight different letters, which (ii) E being always in the middle.
can be arranged themselves in 8! ways.
∴ Total number of permutations = 8 ! = 40320
(iii) Vowels occuping odd places.
Again, when T is fixed at the first place and E at the last (iv) Vowels being never together.
place, the remaining six can be arranged themselves in Sol. There are five letters in the word ‘OMEGA’.
6 ! ways. (i) When O and A occuping end places
∴The number of permutations which begin with T and end with i.e., M E G (OA)
E = 6! = 720. the first three letters (M, E, G) can be arranged
themselves by 3 ! = 6 ways and last two letters (O, A)
y Example 35. In how many ways can the letters of can be arranged themselves by 2 ! = 2 ways.
the word ‘INSURANCE’ be arranged, so that the vowels ∴ Total number of such words
are never separate?
= 6 × 2 = 12 ways.
 Chap 05 Permutations and Combinations 371

(ii) When E is the fixed in the middle, then there are four Similarly, if n different things are arranged along a circle
places left to be filled by four remaining letters O, M, for each circular arrangement number of linear
G and A and this can be done in 4 ! ways. arrangements is n.
∴ Total number of such words = 4 ! = 24 ways.
Therefore, the number of linear arrangements of n
(iii) Three vowels (O, E, A) can be arranged in the odd different things = n × number of circular arrangements of
places in 3 ! ways (1st, 3rd and 5th) and the two n different things
consonants (M, G) can be arranged in the even places
in 2 ! ways (2nd and 4th) (ii) Arrangements of beads or flowers
∴ Total number of such words (all different) around a circular
= 3 ! × 2 ! = 12 ways. necklace or garland
(iv) Total number of words = 5 ! = 120 Consider five beads A, B, C , D and E in a necklace or five
Combine the vowels into one bracket as (OEA) and flowers A, B, C , D and E in a garland, etc. If the necklace or
treating them as one letter, we have garland on the left is turned over, we obtain the
(OEA), M, G and these can be arranged themselves in arrangement on the right i.e. anti-clockwise and clockwise
3 ! ways and three vowels with in the bracket can be order of arrangement is not different we will get
arranged themselves in 3 ! ways. arrangements as follows:
∴ Number of ways when vowels come together We see that arrangements in figures are not different.
= 3 ! × 3 ! = 36 ways.
Flip to right
Hence, number of ways when vowels being
never together = 120 − 36 = 84 ways. D C C D

Circular Permutations E B B E

A A
(i) Arrangements round a circular table
Consider five persons A, B, C , D and E on the Then, the number of circular permutations of n different
1
circumference of a circular table in order which has no things taken all at a time is (n − 1) !, if clockwise and
2
head now, shifting A, B, C , D and E one position in anti-clockwise orders are taken as not different.
anti-clockwise direction we will get arragements as
follows y Example 38. Find the number of ways in which 12
different beads can be arranged to form a necklace.
E D C
Sol. 12 different beads can be arranged among themselves in a
A D E C D B circular order in (12 − 1) ! = 11 ! ways. Now, in the case of
necklace, there is no distinction between clockwise and
B C A B E A anti-clockwise arrangements. So, the required number of
1
(i) (ii) (iii) arrangements = (11 !).
B A 2
C A B E
y Example 39. Consider 21 different pearls on a
necklace. How many ways can the pearls be placed in
D E C D
on this necklace such that 3 specific pearls always
(iv) (v)
remain together?
We see that, if 5 persons are sitting at a round table, they Sol. After fixing the places of three pearls, treating 3 specific
can be shifted five times and five different arrangements. pearls = 1 unit. So, we have now
Thus, obtained will be the same, because anti-clockwise 18 pearls + 1 unit = 19 and the number of arrangement will
order of A, B, C , D and E does not change. be (19 − 1) ! = 18 !
Also, the number of ways of 3 pearls can be arranged
But if A, B, C , D and E are sitting in a row and they are
between themselves is 3 ! = 6.
shifted in such an order that the last occupies the place of
Since, there is no distinction between the clockwise and
first, then the five arrangements will be different. Thus, if anti-clockwise arrangements.
there are 5 things, then for each circular arrangement 1
number of linear arrangements is 5. So, the required number of arrangements = 18 !⋅ 6 = 3 (18 !).
2
372 Textbook of Algebra

Restricted Circular y Example 42. In how many different ways can five
boys and five girls form a circle such that the boys and
Permutations girls alternate?
Sol. After fixing up one boy on the table, the remaining can
Case I If clockwise and anti-clockwise orders are taken as
be arranged in 4 ! ways but boys and girls are to alternate.
different, then the number of circular permutations of n There will be 5 places, one place each between two boys
different things taken r at a time. these five places can be filled by 5 girls in 5 ! ways.
n B1
Pr 1 n!
= = ⋅
r r (n − r ) ! B5
B2
Note For checking correctness of formula, put r = n, then we get
( n − 1) ! [result (5) (i)]
B4
y Example 40. In how many ways can 24 persons be B3
seated round a table, if there are 13 sets ?
Hence, by the principle of multiplication, the required
Sol. In case of circular table, the clockwise and anti-clockwise
number of ways = 4 ! × 5 ! = 2880.
orders are different, the required number of circular
24
P13 24 ! y Example 43. 20 persons were invited to a party. In
permutations = = .
13 13 × 11 ! how many ways can they and the host be seated at a
⇒ n ! = n × number of circular arrangements of n circular table ? In how many of these ways will two
different things particular persons be seated on either side of the host?
⇒ Number of circular arrangements of n different things Sol. I Part Total persons on the circular table
n! = 20 guest + 1 host = 21
= = ( n − 1) !
n They can be seated in (21 − 1) ! = 20 ! ways.
Hence, the number of circular permutations of n different
things taken all at a time is (n − 1) !, if clockwise and II Part After fixing the places of three persons
anti-clockwise orders are taken as different. (1 host + 2 persons).
Treating (1 host + 2 persons) = 1 unit, so we have now
y Example 41. Find the number of ways in which three {(remaining 18 persons + 1 unit) = 19} and the number of
Americans, two British, one Chinese, one Dutch and arrangement will be (19 − 1) ! = 18 ! also these two particular
one Egyptian can sit on a round table so that persons
persons can be seated on either side of the host in 2 ! ways.
of the same nationality are separated.
P20 H P1
Sol. The total number of persons without any restrictions is P19 P2
n (U ) = (8 − 1)! P18 P3
= 7! = 5040 P17 P4
P5
When, three Americans ( A1, A 2 , A 3 ) are sit together, P16
P6
n ( A ) = 5! × 3! P15
P14 P7
= 720
P13 P8
When, two British ( B1, B 2 ) are sit together P12 P P P9
11 10
n ( B ) = 6! × 2!
Hence, the number of ways of seating 21 persons on the
= 1440 circular table such that two particular persons be seated on
When, three Americans ( A1, A 2 , A 3 ) and two British ( B1, B 2 ) either side of the host = 18 ! × 2 ! = 2 × 18 !
are sit together n ( A ∩ B ) = 4 ! × 3! × 2! = 288
Case II If clockwise and anti-clockwise orders are taken as
∴ n ( A ∪ B ) = n ( A ) + nB ) − n ( A ∩ B ) not different, then the number of circular permutations of n
= 720 + 1440 − 288= 1872 n
P 1 n!
different things taken r at a time = r = ⋅
Hence, n ( A ∩ B ′ ) = n (U ) − n ( A ∪ B ) 2r 2r (n − r ) !
Note
= 5040 − 1872
For checking correctness of formula put r = n, then we get
= 3168 ( n − 1)!
[result (5) (ii)]
2
 Chap 05 Permutations and Combinations 373

y Example 44. How many necklace of 12 beads each can be made from 18 beads of various colours?
Sol. In the case of necklace, there is no distinction between the clockwise and anti-clockwise arrangements, the required
number of circular permutations.
18
P12 18 ! 18 × 17 × 16 × 15 × 14 × 13 ! 119 × 13 !
= = = =
2 × 12 6 ! × 24 6 × 5 × 4 × 3 × 2 × 1 × 24 2

#L Exercise for Session 3

1. How many words can be formed from the letters of the word ‘COURTESY’ whose first letter is C and the last
letter is Y ?
(a) 6! (b) 8! (c) 2 (6) ! (d) 2 (7) !

2. The number of words that can be made by writing down the letters of the word ‘CALCULATE’ such that each
word starts and ends with a consonant, is
3 5
(a) (7) ! (b) 2 (7) ! (c) (7) ! (d) 3 (7) !
2 2

3. The number of words can be formed from the letters of the word ‘MAXIMUM’, if two consonants cannot occur
together, is
(a) 4! (b) 3 ! × 4 !
4!
(c) 3! (d)
3!

4. All the letters of the word ‘EAMCET’ are arranged in all possible ways. The number of such arrangements in
which two vowels are not adjacent to each other, is
(a) 54 (b) 72
(c) 114 (d) 360

5. How many words can be made from the letters of the word ‘DELHI’, if L comes in the middle in every word?
(a) 6 (b) 12 (c) 24 (d) 60

6. In how many ways can 5 boys and 3 girls sit in a row so that no two girls are sit together?
(a) 5 ! × 3 ! (b) 4 P3 × 5 ! (c) 6P3 × 5 ! (d) 5P3 × 3 !

7. There are n numbered seats around a round table. Total number of ways in whichn1 (n1 < n ) persons can sit
around the round table, is equal to
(a) nCn 1 (b) n Pn 1 (c) nC n1 − 1 (d) n Pn1 − 1

8. In how many ways can 7 men and 7 women can be seated around a round table such that no two women can
sit together?
(a) 7! (b) 7 ! × 6 ! (c) (6 !)2 (d) (7 !)2

9. The number of ways that 8 beads of different colours be string as a necklace, is

(a) 2520 (b) 2880 (c) 4320 (d) 5040

10. If 11 members of a committee sit at a round table so that the President and secretary always sit together, then
the number of arrangements, is
(a) 9 ! × 2 (b) 10! (c) 10 ! × 2 (d) 11!

11. In how many ways can 15 members of a council sit along a circular table, when the secretary is to sit on one
side of the Chairman and the deputy secretary on the other side?
(a) 12 ! × 2 (b) 24 (c) 15 ! × 2 (d) 30
Session 4
Combination, Restricted Combinations
Combination (ii) n C r = 0, if r > n
Each of the different groups or selections which can be (iii) n C 0 = n C n = 1 , n C 1 = n
made by some or all of a number of given things without
reference to the order of the things in each group is called (iv) n Pr = n C r , if r = 0 or 1
a combination. n
(v) n C r = n C n − r , if r >
2
Important Result (vi) If n C x = n C y ⇒ x = y or x + y = n
(1) The number of combinations of n different n +1
(vii) n C r + n C r − 1 = Cr [Pascal’s rule]
things taken r at a time is denoted by n C r or
n  n n −1
C (n , r ) or   . (viii) n C r = ⋅ Cr − 1
r  r
Then, (ix) n ⋅ n − 1 C r − 1 = (n − r + 1) ⋅ n C r − 1
n! n
n −r +1
n
Cr = [ 0 ≤ r ≤ n] (x)
Cr
=
r !( n − r )! n r
Cr − 1
n
Pr
= n
r! (xi) (a) If n is even , n C r is greatest for r =
2
n ( n − 1) ( n − 2) K ( n − r + 1)
= , n ∈ N and r ∈W n −1 n +1
r ( r − 1) ( r − 2) K 2 ⋅ 1 (b) If n is odd , n C r is greatest for r = or
2 2
Proof Let the number of combinations of n different
(xii) n C 0 + n C 1 + n C 2 + K + n C n = 2 n
things taken r at a time be n C r .
(xiii) n C 0 + n C 2 + n C 4 +K
Now, each combination consists of r different things and
these r things can be arranged among themselves in r ! = n C 1 + n C 3 + n C 5 + K = 2n − 1
ways.
(xiv) 2n + 1 C 0 + 2n + 1
C1 + 2n + 1
C 2 +K + 2n + 1
C n = 2 2n
Thus, for one combination of r different things, the
n +1 n +2 n+3
number of arrangements is r ! . (xv) n C n + Cn + C2 + Cn + K
2n − 1
Hence, for n C r combinations, number of arrangements is + Cn = 2n
Cn + 1
r ! × Cr
n
…(i)
y Example 45. If 15
C 3r = 15C r + 3 , find r C 2 .
But number of permutations of n different things taken r at
a time is n Pr . …(ii) Sol. We have, 15
C 3r = 15C r +3

From Eqs. (i) and (ii), we get ⇒ 3r = r + 3

n! or 3r + r + 3 = 15
r ! × n C r = n Pr = ⇒ 2r = 3 or 4r = 12
(n − r ) !
3
n! ⇒ r = or r = 3
∴ n
Cr = , r ∈W and n ∈ N 2
r ! (n − r ) ! 3
but r ∈W , so that r ≠
Note the following facts: 2
(i) n C r is a natural number ∴ r =3
Then, r
C 2 = 3C 2 = 3C 1 = 3
 Chap 05 Permutations and Combinations 375

y Example 46. If n C 9 = n C 7 , find n. ⇒

n
=2
r
Sol. We have, n
C 9 = nC 7 ⇒ n = 9 + 7 [Q9 ≠ 7]
⇒ n = 2r …(ii)
∴ n = 16 On solving Eqs. (i) and (ii), we get n = 10 and r = 5.

y Example 47. Prove that y Example 50. If n C r − 1 = 36, n C r = 84 and

 n  n   n   n + 2 n
C r + 1 = 126, find r.
  +2 +  = 
r   r − 1  r − 2  r  n
Cr 84
Sol. Here, =
n  n
Cr − 1 36
Sol. ∴   = n C r
r 
n −r +1 7  n Cr n − r + 1
n   n   n  ⇒ = Q n = 
∴ LHS =   + 2   +  r 3  C r − 1 r 
r  r − 1 r − 2
⇒ 3n − 3r + 3 = 7 r
= n Cr + 2 n Cr −1 + n Cr −2
⇒ 10r − 3n = 3 …(i)
= (n C r + n C r − 1) + (n C r −1 + n Cr − 2) n
Cr +1 n − (r + 1) + 1 126  n Cr n − r + 1
n +1 n +1 n+2 and = = Q n = 
= Cr + Cr −1 = Cr n
( r + 1)
Cr 84  C r − 1 r 
n + 2 n −r 3
=  = RHS ⇒ =
 r  r +1 2

y Example 48. If 2n
C 3 : n C 3 = 11 : 1, find the value of n . ⇒ 2n − 2r = 3r + 3
⇒ 5r − 2n = − 3
Sol. We have,
or 10r − 4 n = − 6 …(ii)
2n
C 3 : n C 3 = 11 : 1
2n
On subtracting Eq. (ii) from Eq. (i), we get
C3 11
⇒ n
= n =9
C3 1
From Eq. (i), we get
2n ( 2n − 1) (2n − 2)
10r − 27 = 3 ⇒ 10r = 30
1⋅2⋅3 4 ( 2n − 1)
⇒ = 11 ⇒ = 11 ∴ r =3
n ( n − 1) ( n − 2) ( n − 2)
1⋅2⋅3
y Example 51. Prove that product of r consecutive
⇒ 8 n − 4 = 11n − 22 ⇒ 3n = 18 positive integers is divisible by r ! .
∴ n =6 Sol. Let r consecutive positive integers be (m),
n +1 n −1
(m + 1), (m + 2), K , (m + r − 1), where m ∈ N .
y Example 49. If C r + 1 : nC r : C r − 1 = 11 : 6 : 3 , ∴ Product = m (m + 1) (m + 2) K (m + r − 1)
find the values of n and r. (m − 1)! m (m + 1) (m + 2) K (m + r − 1)
n +1
=
Cr +1 11 (m − 1)!
Sol. Here, =
n
Cr 6 (m + r − 1)! r ! ⋅ (m + r − 1)!
= =
n + 1 C r 11 n
 n n n −1  (m − 1)! r ! (m − 1)!
⇒ ⋅ = Q C r = r ⋅ Cr
r + 1 n Cr 6
− 1
 [Q m + r − 1C r is natural number]
n + 1 11 = r!⋅ m +r −1
Cr ,
⇒ =
r +1 6 which is divisible by r ! .
⇒ 6n + 6 = 11r + 11
⇒ 6n − 11r = 5 …(i)
y Example 52. Evaluate
3 5

and n −1
n
Cr
=
6 47
C4 + ∑ 50 − j C 3 + ∑ 56 − k C 53 − k .
Cr 3 j =0 k =0
−1
3 5
n −1
⇒
n
⋅
Cr −1
=
6  n n n −1  Sol. We have, 47
C4 + ∑ 50 − j C 3 + ∑ 56 − k C 53 − k
r n −1
Cr 3 Q C r = r ⋅ Cr − 1
 j =0 k =0
−1
376 Textbook of Algebra

3 5
= 47
C4 + ∑ 50 − j C 3
j =0
+ ∑ 56 − k C 3 [Q nC r
k =0
= nC n − r ] Restricted Combinations
(i) The number of selections (combinations) of r objects
= 47
C 4 + ( 50C 3 + 49
C3 + 48
C3 + 47
C3)
out of n different objects, when
+ ( 56C 3 + 55
C3 + 54
C3 + 53
C3 + 52
C 3 + 51C 3 ) (a) k particular things are always included= n − k C r − k .
= 47
C4 + 47
C3 + 48
C3 + 49
C3 + 50
C 3 + 51C 3 n −k
(b) k particular things are never included = Cr .
+ 52
C3 + 53
C3 + 54
C3 + 55
C3 + 56
C3 (ii) The number of combinations of r things out of n
= ( C4 + 47 47
C3) + 48
C3 + 49
C3 + 50
C3 + C3 51 different things, such that k particular things are not
together in any selection = n C r − n − k C r − k
+ 52
C3 + 53
C3 + 54
C3 + 55
C3 + 56
C3
(iii) The number of combinations of n different objects
= 48
C4 + 48
C3 + 49
C3 + 50
C 3 + 51C 3 + K + 56
C3 taking r at a time when, p particular objects are
= 49
C4 + 49
C3 + 50
C3 + K + 56
C3 always included and q particular objects are always
excluded = n − p −q C r − p
M M M M M
Note
= 56
C4 + 56
C3 = 57
C4 (i) The number of selections of r consecutive things out of
n things in a row = n − r + 1.
y Example 53. Prove that the greatest value of (ii) The number of selections of r consecutive things out of
n, if r < n
2n
C r ( 0 ≤ r ≤ 2n ) is 2n C n (for 1 ≤ r ≤ n). n things along a circle =  .
1, if r = n
2n
Cr  n Cr
2n − r + 1 n − r + 1
Sol. We have, = Q n = 
2n
C r −1  C r − 1
r r  y Example 55. In how many ways can a cricket, eleven
players by chosen out of a batch 15 players, if
2 ( n − r ) + ( r + 1) 1 + 2( n − r ) + 1
= = >1 (i) a particular is always chosen.
r r
2n
(ii) a particular player is never chosen?
Cr
⇒ 2n
>1 [for 1 ≤ r ≤ n] Sol. (i) Since, particular player is always chosen. It means
Cr −1 that 11 − 1 = 10 players are selected out of the
remaining 15 − 1 = 14 players.
∴ 2n
Cr −1 < 2n
Cr
∴ Required number of ways = 14C 10 = 14C 4
On putting r =1, 2, 3, …, n,
14 ⋅ 13 ⋅ 12 ⋅ 11
then 2n
C0 < 2n
C 1, 2n
C1 < 2n
C 2 , K, 2n
Cn − 1 < 2n
Cn = = 1001
1⋅2⋅3⋅ 4
On combining all inequalities, we get
(ii) Since, particular player is never chosen. It means that
⇒ 2n
C0 < 2n
C1 < 2n
C2 < 2n
C3 < K < 2n
Cn − 1 < 2n
Cn 11 players are selected out of the remaining 15 − 1 = 14
players.
but 2n
Cr = 2n
C 2n − r , it follows that
∴ Required number of ways = 14C 11 = 14C 3
2n
C 2n < 2n
C 2n − 1 < C 2n − 2 <
2n 2n
C 2n − 3 < K < Cn + 1 <
2n 2n
Cn
14 ⋅ 13 ⋅ 12
Hence, the greatest value of 2n
C r is 2n
Cn . = = 364
1 ⋅ 2⋅ 3

y Example 54. Thirty six games were played in a y Example 56. How many different selections of 6
football tournament with each team playing once books can be made from 11 different books, if
against each other. How many teams were there?
(i) two particular books are always selected.
Sol. Let the number of teams be n.
(ii) two particular books are never selected?
Then number of matches to be played is n C 2 = 36 Sol. (i) Since, two particular books are always selected. It
9 ×8 9 means that 6 − 2 = 4 books are selected out of the
⇒ n
C2 = = C2
1×2 remaining 11 − 2 = 9 books.
9 ⋅8⋅7 ⋅6
⇒ n =9 ∴ Required number of ways = 9C 4 = = 126.
1⋅2⋅3⋅ 4
 Chap 05 Permutations and Combinations 377

(ii) Since, two particular books are never selected. It y Example 59. A question paper consists of two
means that 6 books are selected out of the remaining sections having respectively, 3 and 5 questions. The
11 − 2 = 9 books. following note is given on the paper ‘‘It is not
∴ Required number of ways = 9C 6 necessory to attempt all the questions one question
9 ⋅8⋅7 from each section is compulsory’’. In how many
= 9C 3 = = 84.
1⋅2⋅3 ways can a candidate select the questions?
Sol. Here, we have two sections A and B (say), the section A
y Example 57. A person tries to form as many different has 3 questions and section B has 5 questions and one
parties as he can, out of his 20 friends. Each party question from each section is compulsory, according to
should consist of the same number. How many friends the given direction.
should be invited at a time? In how many of these ∴ Number of ways selecting one or more than one question
parties would the same friends be found? from section A is 2 3 − 1 = 7
Sol. Let the person invite r number of friends at a time. Then, and number of ways selecting one or more than one
the number of parties are 20 C r , which is maximum, question from section B is 2 5 − 1 = 31
when r = 10. Hence, by the principle of multiplication, the required
If a particular friend will be found in p parties, then p is the number of ways in which a candidate can select the
number of combinations out of 20 in which this particular questions
friend must be included. Therefore, we have to select 9 = 7 × 31 = 217.
more from 19 remaining friends.
Hence, p = 19C 9 y Example 60. A student is allowed to select atleast
(2) The number of ways (or combinations) of n one and atmost n books from a collection of (2n + 1)
different things selecting atleast one of them is books. If the total number of ways in which he can
select books is 63, find the value of n.
2n − 1 . This can also be stated as the total
Sol. Given, student select atleast one and atmost n books from
number of combinations of n different things. a collection of (2n + 1) books. It means that he select one
Proof For each things, there are two possibilities, whether book or two books or three books or … or n books.
it is selected or not selected. Hence, by the given hypothesis.
2n + 1 2n + 1 2n + 1
Hence, the total number of ways is given by total C1 + C2 + C 3 + ... + 2 n + 1 C n = 63 …(i)
possibilities of all the things which is equal to Also, the sum of binomial coefficients, is
2 × 2 × 2 × ... × n factors = 2 n 2n + 1
C0 + 2n + 1
C1 + K + 2n + 1
Cn + 2n + 1
Cn + 1
2n + 1
But, this includes one case in which nothing is selected. +K+ Cn + 1
2n + 1 2n + 1
= ( 1 + 1) =2
Hence, the total number of ways of selecting one or more
2n + 1
of n different things = 2 n − 1 ⇒ C 0 + 2 ( 2 n + 1C 1 + 2n + 1
C2 + K + 2n + 1
Cn )
2n + 1 2n + 1
Aliter Number of ways of selecting one, two, three, …, n + C 2n + 1 = 2 [Q C r = C n − r ]
n

2n + 1 2n + 1
things from n different things are ⇒ 1 + 2 × 63 + 1 = 2 ⇒ 128 = 2
2n + 1
n n n n
C 1 , C 2 , C 3 , ..., C n , respectively. ⇒ 2 =2
7
⇒ 7 = 2n + 1
∴ n =3
Hence, the total number of ways or selecting atleast one
thing is y Example 61. There are three books of Physics, four
n
C1 + nC2 + nC 3 + K + nCn of Chemistry and five of Mathematics. How many
= ( n C 0 + n C 1 + n C 2 + K + n C n ) − n C 0 = 2n − 1 different collections can be made such that each
collection consists of
y Example 58. Mohan has 8 friends, in how many (i) one book of each subject,
ways he invite one or more of them to dinner? (ii) atleast one book of each subject,
Sol. Mohan select one or more than one of his 8 friends. So, (iii) atleast one book of Mathematics.
required number of ways
Sol. (i) 3 C 1 × 4C 1 × 5C 1 = 3 × 4 × 5 = 60
= 8C 1 + 8C 2 + 8C 3 + K + 8C 8 (ii) (23 − 1) × (24 − 1) × (25 − 1) = 7 × 15 × 31 = 3255
= 2 − 1 = 255.
8
(iii) (25 − 1) × 27 = 31 × 128 = 3968
378 Textbook of Algebra

#L Exercise for Session 4

1. If 43Cr − 6 = 43C3r + 1, the value of r is
(a) 6 (b) 8 (c) 10 (d) 12
2. If 18
C15 + 2 ( C16 ) +
18
C16 + 1 = C3, the value of n is
17 n

(a) 18 (b) 20 (c) 22 (d) 24

3. If 20
Cn + 2 = nC16 , the value of n is
(a) 7 (b) 10 (c) 13 (d) None of these
5
4. If 47C4 + ∑ 52 − r C3 is equal to
r =1

(a) 47C6 (b) 52

C5 (c) 52
C4 (d) None of these
n+1
5. If C3 + C4 >
n n
C3 then
(a) n > 6 (b) n < 6 (c) n > 7 (d) n < 7

6. The Solution set of 10

Cx −1 > 2 . Cx is
10

(a) {1, 2, 3} (b) {4, 5, 6} (c) {8, 9, 10} (d) {9, 10, 11}
7. If 2n
C2 : C2 = 9 : 2 and Cr = 10, then r is equal to
n n

(a) 2 (b) 3 (c) 4 (d) 5

8. If 2n
C3 : nC2 = 44 : 3 , for which of the following value of r, the value of nCr will be 15.
(a) r = 3 (b) r = 4 (c) r = 5 (d) r = 6
9. If Cr = Cr − 1 and Pr = Pr + 1, the value of n is
n n n n

(a) 2 (b) 3 (c) 4 (d) 5

10. If nPr = 840, nCr = 35, the value of n is
(a) 1 (b) 3 (c) 5 (d) 7
11. If P3 + Cn − 2 = 14n, the value of n is
n n

(a) 5 (b) 6 (c) 8 (d) 10

12. There are 12 volleyball players in all in a college, out of which a team of 9 players is to be formed. If the captain
always remains the same, in how many ways can the team be formed ?
(a) 36 (b) 99 (c) 108 (d) 165
13. In how many ways a team of 11 players can be formed out of 25 players, if 6 out of them are always to be
included and 5 are always to be excluded
(a) 2002 (b) 2008 (c) 2020 (d) 8002
14. A man has 10 friends. In how many ways he can invite one or more of them to a party?
(a) 10! (b) 210 (c) 10 ! − 1 (d) 210 − 1

15. In an examination, there are three multiple choice questions and each question has four choices. Number of
ways in which a student can fail to get all answers correct, is
(a) 11 (b) 12 (c) 27 (d) 63
16. In an election, the number of candidates is 1 greater than the persons to be elected . If a voter can vote in
254 ways, the number of candidates is
(a) 6 (b) 7 (c) 8 (d) 10
17. The number of groups that can be made from 5 different green balls, 4 different blue balls and 3 different red
balls, if atleast one green and one blue ball is to be included
(a) 3700 (b) 3720 (c) 4340 (d) None of these
18. A person is permitted to select atleast one and atmost n coins from a collection of (2n + 1) distinct coins. If the
total number of ways in which he can select coins is 255, thenn equals
(a) 4 (b) 8 (c) 16 (d) 32
Session 5
Combinations from Identical Objects
Combinations from ∴ The total number of selections when all the three kinds of
fruits are selected = 5 × 6 × 7 = 210
Identical Objects But, in one of these selection number of each kind of fruit is
(i) The number of combinations of n identical objects zero and hence this selection must be excluded.
taking r objects (r ≤ n ) at a time = 1. ∴ Required number = 210 − 1 = 209
(ii) The number of combinations of zero or more objects
from n identical objects = n + 1.
(iii) The total number of combinations of atleast one out
Combinations when both Identical
of a 1 + a 2 + a 3 + K + a n objects, where a 1 are alike of and Distinct Objects are Present
one kind, a 2 are alike of second kind, a 3 are alike of The number of combinations (selections) of one or more
third kind, …, a n are alike of nth kind objects out of a 1 + a 2 + a 3 + K + a n objects, where a 1
= (a 1 + 1) (a 2 + 1) (a 3 + 1) K (a n + 1) − 1 are alike of one kind, a 2 are alike of second kind, a 3 are
alike of third kind, …, a n are alike of nth kind and k
y Example 62. How many selections of atleast one red are distinct.
ball from a bag containing 4 red balls and 5 black = {(a 1 + 1) (a 2 + 1) (a 3 + 1) L (a n + 1)}
balls, balls of the same colour being identical?
(k C 0 + k C1 + k C2 + K + k Ck ) − 1
Sol. Number of selections of atleast one red ball from 4 identi-
cal red balls = 4 = (a 1 + 1) (a 2 + 1) (a 3 + 1) + K + (a n + 1) 2 k − 1
Number of selections of any number of black balls from 5
identical black balls y Example 65. Find the number of ways in which one
=5+1=6 or more letters can be selected from the letters
∴ Required number of selections of balls AAAAA BBBB CCC DD EFG.
= 4 × 6 = 24 Sol. Here, 5A’s are alike, 4 B ’s are alike, 3 C ’s are alike, 2D ’s
are alike and E, F, G are different.
y Example 63. There are p copies each of n different ∴ Total number of combinations
books. Find the number of ways in which a non-empty = ( 5 + 1) ( 4 + 1) ( 3 + 1) ( 2 + 1) 2 3 − 1
selection can be made from them. = 6 ⋅5 ⋅ 4 ⋅3 ⋅8 − 1
Sol. Since, copies of the same book are identical. = 2879
∴ Number of selections of any number of copies of a book [excluding the case, when no letter is selected]
is p + 1. Similarly, in the case for each book.
Explanation Selection from ( AAAAA ) can be made by 6
Therefore, total number of selections is ( p + 1)n .
ways such include no A, include one A, include two A,
But this includes a selection, which is empty i.e., zero copy include three A, include four A, include five A. Similarly,
of each book. Excluding this, the required number of selections from ( BBBB ) can be made in 5 ways, selections
non-empty selections is ( p + 1)n − 1. from (CCC ) can be made in 4 ways, selections from ( DD )
can be made in 3 ways and from E, F, G can be made in
y Example 64. There are 4 oranges, 5 apples and 2 × 2 × 2 ways.
6 mangoes in a fruit basket and all fruits of the same
kind are identical. In how many ways can a person make
a selection of fruits from among the fruits in the basket?
Number of Divisors of N
Sol. Zero or more oranges can be selected out of 4 identical Every natural number N can always be put in the form
oranges = 4 + 1 = 5 ways. N = p 1α 1 ⋅ p 2α 2 ⋅ p 3α 3 ... p kα k , where p 1 , p 2 , p 3 , ..., p k are
Similarly, for apples number of selection = 5 + 1 = 6 ways distinct primes and α 1 , α 2 , α 3 , K, α k ∈W .
and mangoes can be selected in 6 + 1 = 7 ways.
380 Textbook of Algebra

(i) The total number of divisors of N including 1 and N = ( 3 + 1) ( 2 + 1) ( 2 + 1) ( 1 + 1) − 2

= (α 1 + 1) (α 2 + 1) (α 3 + 1) K (α k + 1) = 72 − 2 = 70

(ii) The total number of divisors of N excluding 1 and N And sum of all these divisors (proper)
= (α 1 + 1) (α 2 + 1) (α 3 + 1) K (α k + 1) − 2 = ( 20 + 21 + 22 + 23 ) ( 30 + 31 + 32 )

(iii) The total number of divisors of N excluding either 1 (7 0 + 71 + 7 2 ) (110 + 111 ) − 1 − 38808
or N = (α 1 + 1) (α 2 + 1) (α 3 + 1) K (α k + 1) − 1 = (15) (13) (57 ) (12) − 38809
(iv) Sum of all divisors = ( p 10 + p 11 + p 12 + p 13 + K + p 1∞1 ) = 133380 − 38809
( p 20 + p 21 + p 22 + p 23 + K + p 2α 2 ) ... = 94571

( p k0 + p k1 + p k2 + p k3 + K + p kα k ) y Example 67. Find the number of even proper divisors

 1 − p α1 + 1   1 − p α 2 + 1   1 − p αk + 1  of the number 1008.
=  1  ⋅ 2  ...  k  Sol. Q1008 = 24 × 32 × 71
−   −   − p k 
 1 p 1   1 p 2   1
∴ Required number of even proper divisors
(v) Sum of proper divisors (excluding 1 and the = Total number of selections of atleast one 2 and
expression itself) any number of 3’s or 7’s.
= Sum of all divisors − ( N + 1) = 4 × (2 + 1) × (1 + 1) − 1 = 23

(vi) The number of even divisors of N are possible only if y Example 68. Find the number of odd proper divisors
p 1 = 2 , otherwise there is no even divisor. of the number 35700. Also, find sum of the odd
∴ Required number of even divisors proper divisors.
Sol. Q35700 = 22 × 31 × 52 × 71 × 171
= α 1 (α 2 + 1) (α 3 + 1) + K + (α k + 1)
∴ Required number of odd proper divisors
(vii) The number of odd divisors of N
= Total number of selections of zero 2 and any
Case I If p 1 = 2 , the number of odd divisors number of 3’s or 5’s or
= (α 2 + 1) (α 3 + 1) K (α k + 1) 7’s or 17’s
= (1 + 1) (2 + 1) (1 + 1) (1 + 1 ) − 1 = 23
Case II If p 1 ≠ 2 , the number of odd divisors
∴ The sum of odd proper divisors
= (α 1 + 1) (α 2 + 1) (α 3 + 1) K (α k + 1)
= (30 + 31 ) (50 + 51 + 52 ) (7 0 + 71 ) (17 0 + 71 ) − 1
(viii) The number of ways in which N can be resolved as a = 4 × 31 × 8 × 18 − 1
product of two factors
= 17856 − 1 = 17855

 1 (α + 1) (α + 1) K (α + 1) , if N is not a
y Example 69. If N = 10800, find the
 2 1 2 k perfect square
= (i) the number of divisors of the form
1
 {(α 1 + 1) (α 2 + 1) K (α k + 1) + 1} , if N is a 4m + 2 , ∀ m ∈W .
2 perfect square (ii) the number of divisors which are multiple of 10.
(ix) The number of ways in which a composite number N (iii) the number of divisors which are multiple of 15.
can be resolved into two factors which are relatively Sol. We have, N = 10800 = 24 × 33 × 52
prime ( or coprime) to each other is equal to 2 n − 1 , (i) Q( 4 m + 2) = 2(2m + 1), in any divisor of the form
where n is the number of different factors (or different 4 m + 2, 2 should be exactly 1.
primes) in N . So, the number of divisors of the form
( 4 m + 2) = 1 × (3 + 1) × (2 + 1) = 1 × 4 × 3 = 12
y Example 66. Find the number of proper factors of
the number 38808. Also, find sum of all these divisors. (ii) ∴ The required number of proper divisors
Sol. The number 38808 = 23 ⋅ 32 ⋅ 7 2 ⋅ 11 = Total number of selections of atleast one 2 and one
5 from 2, 2, 2, 2, 3, 3, 3, 5, 5
Hence, the total number of proper factors (excluding 1 and
itself i.e., 38808) = 4 × (3 + 1) × 2 = 32
 Chap 05 Permutations and Combinations 381

(iii) ∴ The required number of proper divisors Proof The number of ways in which (m + n ) distinct
= Total number of selections of atleast one 3 and one objects are divided into two groups of the sizem and n
5 from 2, 2, 2, 2, 3, 3, 3, 5, 5
= The number of ways m objects are selected out of
= ( 4 + 1) × 3 × 2 = 30 (m + n ) objects to form one of the groups, which can
be done in m + n C m ways. The other group of n objects
y Example 70. Find the number of divisors of the
is formed by the remaining n objects.
number N = 2 3⋅ 3 5 ⋅ 5 7 ⋅7 9 ⋅9 11 , which are
perfect square.
m+n
Sol. QN = 2 3 ⋅ 3 5⋅ 5 7 ⋅ 7 9⋅ 9 11
= 2 3 ⋅ 3 5 ⋅ 5 7 ⋅ 7 9 ⋅ 3 22
= 2 3⋅ 3 27⋅ 5 7 ⋅ 7 9
m n
For perfect square of N , each prime factor must occur even
number of times. (Tree diagram)
2 can be taken in 2 ways (i.e., 20 or 22 ) (m + n )
m +n
3 can be taken in 14 ways (i.e., 30 or 32 or 34 or 36 or 38 or = C m ⋅n C n =
m!n!
310 or 312 or 314 or 316 or 318 or 320 or 322 or 324 or 326 )
Corollary I The number of ways to distribute (m + n )
5 can taken in 4 ways (i.e., 50 or 52 or 54 or 56 )
and 7 can taken in 5 ways
distinct objects among 2 persons in the groups
(i.e., 7 0 or 7 2 or 7 4 or 7 4 or 7 6 or 7 8 ) containing m and n objects
Hence, total divisors which are perfect squares = (Number of ways to divide) × (Number of groups)
= 2 × 14 × 4 × 5 = 560 (m + n )
= × 2!
m!n!
y Example 71. In how many ways the number 10800
can be resolved as a product of two factors? Corollary II The number of ways in which (m + n + p )
Sol. Let N = 10800 = 2 4 × 3 3 × 5 2 distinct objects can be divided into three unequal
groups containingm, n and p objects, is
Here, N is not a perfect square [Q power of 3 is odd]
1
Hence, the number of ways = ( 4 + 1) (3 + 1) (2 + 1) = 30
2 m+n+p

y Example 72. In how many ways the number 18900

can be split in two factors which are relatively prime
(or coprime)? m p
n
Sol. Let N = 18900 = 2 ⋅ 3 ⋅ 5 ⋅ 7
2 3 2 1
(Tree diagram)
Relatively prime or coprime Two numbers not neces-
sarily prime are said to be relatively prime or coprime, if
m +n +p (m + n + p ) !
their HCF (highest common factor) is one as 2, 3, 5, 7 are C m ⋅n + p C n ⋅p C p =
relatively prime numbers. m!n! p!
∴ n=4 [number of different primes in N ] Corollary III The number of ways to distribute
Hence, number of ways in which a composite number N (m + n + p ) distinct objects among 3 persons in the
can be resolved into two factors which are relatively groups containing m, n and p objects
prime or coprime = 24 − 1 = 23 = 8
= (Number of ways to divide) × (Number of groups)
Division of Objects Into Groups (m + n + p ) !
= × 3!
m!n! p!
(a) Division of Objects Into Groups of Unequal Size
Theorem Number of ways in which (m + n ) Corollary IV The number of ways in which
distinct objects can be divided into two unequal ( x 1 + x 2 + x 3 + L + x n ) distinct objects can be
(m + n ) ! divided into n unequal groups containing x 1 ,
groups containing m and n objects is . x 2 , x 3 , K, x n objects, is
m! n !
382 Textbook of Algebra

52
x1 + x2 + x3 +...+xn

13 13
13 13
x1 xn (Tree diagram)
.
x2 x3 ..
(Tree diagram) 52! 52!
4
× 4! =
4 ! (13!) (13!)4
(x 1 + x 2 + x 3 + L + x n ) ! Aliter Each player will get 13 cards. Now, first player can
.
x 1 ! x 2 ! x 3 !L x n ! be given 13 cards out of 52 cards in 52 C 13 ways. Second
Corollary V The number of ways to distribute player can be given 13 cards out of remaining 39 cards (i.e.,
( x 1 + x 2 + x 3 + K + x n ) distinct objects among n 52 − 13 = 39) in 39
C 13 ways. Third player can be given 13
persons in the groups containing x 1 , x 2 , K , x n cards out of remaining 26 cards (i.e., 39 − 13 = 26 ) in 26
C 13
objects ways and fourth player can be given 13 cards out of
remaining 13 cards (i.e., 26 − 13 = 13) in 13 C 13 ways.
= (Number of ways to divide) × (Number of groups)
( x + x 2 + x 3 + ... + x n ) ! Hence, required number of ways
= 1 × n! = C 13 ×
52 39
C 13 × 26
C 13 × 13C 13
x 1 ! x 2 ! x 3 !K x n !
52! 39 ! 26! 52!
(b) Division of Objects Into Groups of Equal Size = × × × 1=
13! 39 ! 13! 26! 13! 13! (13!)4
The number of ways in which mn distinct objects can
be divided equally into m groups, each containing n (ii) Here, order of group is not important, then the
objects and number of ways in which 52 different cards can be
(i) If order of groups is not important is. divided equally into 4 groups is

 (mn ) !  1 52
= × .
 (n !) m  m !
(ii) If order of groups is important is. 13 13
 (mn ) ! 1  (mn ) ! 13 13
 ×  ×m ! = .
 (n !) m m ! (n !) m (Tree diagram)

Note Division of 14n objects into 6 groups of 2n, 2n, 2n, 2n, 3n, 3n, 52!
 ( 14 n)!  4 ! (13!)4
 
 ( 2n)! ( 2n)! ( 2n)! ( 2n)! ( 3n)! ( 3n)!  ( 14 n) 1
size is = 4 2
× Aliter Each group will get 13 cards. Now, first group can be
4 ! 2! (( 2n)!) (( 3n)!) 4 ! 2! given 13 cards out of 52 cards in 52 C 13 ways. Second group
Now, the distribution ways of these 6 groups among 6 persons is can be given 13 cards out of remaining 39 cards (i.e.,
( 14 n)!
×
1
× 6!=
( 14 n)!
× 15
52 − 13 = 39) in 39 C 13 ways. Third group can be given 13
4 2
[( 2n)!)] [( 3n)!] 4 ! 2! [( 2n)!]4 [( 3n)!] 2 cards out of remaining 26 cards
(i.e., 39 − 13 = 26) in 26 C 13 ways and fourth group can be
y Example 73. In how many ways can a pack of 52 given 13 cards out of remaining 13 cards (i.e., 26 − 13 = 13)
in 13 C 13 ways. But the all (four) groups can be interchanged
cards be
in 4! ways. Hence, the required number of ways
(i) distributed equally among four players in order?
1
(ii) divided into four groups of 13 cards each? = 52 C 13 × 39C 13 × 26C 13 × 13C 13 ×
4!
(iii) divided into four sets, three of them having 17 cards 52! 39 ! 26! 1 52!
= × × ×1× =
each and fourth just one card? 13! 39 ! 13! 26! 13! 13! 4 ! (13!)4 4 !
Sol. (i) Here, order of group is important, then the numbers
(iii) First, we divide 52 cards into two sets which contains
of ways in which 52 different cards can be divided
1 and 51 cards respectively, is
equally into 4 players is
52!
1! 51!
 Chap 05 Permutations and Combinations 383

12! × 2 12 ⋅ 11 ⋅ 10 ⋅ 9 ⋅ 8 ⋅ 7 !⋅ 2
52 = = = 1584.
5! × 7 ! 5 ⋅ 4 ⋅3 ⋅2 ⋅1 ⋅7 !
II Part Here, order is not important, then the number of
17 1 ways in which 12 different balls can be divided into three
17 17 groups of 5,4 and 3 balls respectively, is
12! 12 ⋅ 11 ⋅ 10 ⋅ 9 ⋅ 8 ⋅ 7 ⋅ 6 ⋅ 5!
Now, 51 cards can be divided equally in three sets each = = = 27720
contains 17 cards (here order of sets is not important) 5! 4 ! 3! 5! ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1 ⋅ 3 ⋅ 2 ⋅ 1
51!
in ways.
3! (17 !)3 12
Hence, the required number of ways
52! 51!
= ×
1! 51! 3 !(17 !)3
5 2
52! 52! 4
= =
1! 3!(17 )3 (17 !) 3 3! (Tree diagram)

Aliter First set can be given 17 cards out of 52 cards in Aliter First group can be given 5 balls out of 12 balls in
52 12
C 17 . Second set can be given 17 cards out of remaining 35 C 5 ways. Second group can be given 4 balls out of
cards (i.e., 52 − 17 = 35) in 35 C 17 . Third set can be given 17 remaining 7 balls (12 − 5 = 7 ) in 7 C 4 and 3 balls can be
cards out of remaining 18 cards (i.e., 35 − 17 = 18) in 18 C 17 given out of remaining 3 balls in 3 C 3 .
and fourth set can be given 1 card out of 1 card in 1C 1. But
Hence, the required number of ways (here order of groups
the first three sets can interchanged in 3! ways. Hence, the are not important)
total number of ways for the required distribution
= 12
C 5 × 7C 4 × 3C 3
1
= 52 C 17 × 35C 17 × 18C 17 × 1C 1 × !
3 12! 7!
= × ×1
52! 35! 18! 1 (52)! 5! 7 ! 4 ! 3!
= × × ×1× =
17 ! 35! 17 ! 1! 17 ! 18! 3! (17 !)3 3! 12!
=
5! 4 ! 3!
y Example 74. In how many ways can 12 different balls
be divided between 2 boys, one receiving 5 and the y Example 75. In how many ways can 16 different
other 7 balls? Also, in how many ways can these 12 balls books be distributed among three students A, B, C so
be divided into groups of 5, 4 and 3 balls, respectively? that B gets 1 more than A and C gets 2 more than B ?
Sol. I Part Here, order is important, then the number of ways Sol. Let A gets n books, then B gets n + 1 and C gets n + 3.
in which 12 different balls can be divided between two
Now, n + (n + 1) + (n + 3) = 16
boys which contains
5 and 7 balls respectively, is ⇒ 3n = 12
∴ n=4
12
16

5 7
(Tree diagram)
4 7
5
12! 12 ⋅ 11 ⋅ 10 ⋅ 9 ⋅ 8 ⋅ 7 !
= × 2! = ⋅ 2 = 1584 (Tree diagram)
5! 7 ! (5⋅ 4 ⋅ 3 ⋅ 2⋅ 1)7 !
⇒ A , B, C gets 4, 5 and 7 books, respectively.
Aliter First boy can be given 5 balls out of 12 balls in 12 C 5 .
Second boy can be given 7 balls out of 7 balls (i.e., Hence, the total number of ways for the required
12 − 5 = 7) but there order is important boys interchange by distribution
(2 types), then required number of ways 16!
=
12! 4 ! 5! 7 !
= 12 C 5 × 7C 7 × 2! = × 1 × 2!
5! 7 !
384 Textbook of Algebra

y Example 76. In how many ways can 9 different The number of division ways for tree diagrams (i), (ii) and
books be distributed among three students if each (iii) are
9! 1 9! 9! 1
receives atleast 2 books? × , and × , respectively.
Sol. If each receives atleast 2 books, then the division as (2!)2 (5!) 2! 2! 3! 4 ! (3!)3 3!
shown by tree diagrams Hence, the total number of ways of distribution of these
groups among 3 students is
9 9 9  9! 1 9! 9! 1
 2 × + + 3
×  × 3!
(2!) (5!) 2 ! 2 ! 3 ! 4 ! (3!) 3 !

2 2 3 = [378 + 1260 + 280] × 6

2 5 3 4 3 3
= 11508
(i) (ii) (iii)

#L Exercise for Session 5

1. There are 3 oranges, 5 apples and 6 mangoes in a fruit basket (all fruits of same kind are identical). Number of
ways in which fruits can be selected from the basket, is
(a) 124 (b) 125 (c) 167 (d) 168
2. In a city no two persons have identical set of teeth and there is no person without a tooth. Also, no person has
more than 32 teeth. If we disguard the shape and size of tooth and consider only the positioning of the teeth,
the maximum population of the city is
(a) 2 32 (b) (32)2 − 1 (c) 232 − 1 (d) 231

3. If a1, a 2, a 3, L , a n + 1 be (n + 1) different prime numbers, then the number of different factors (other than 1) of
a1m ⋅ a 2 ⋅ a 3, K , a n + 1, is
(a) m + 1 (b) (m + 1) 2 n (c) m ⋅ 2n + 1 (d) None of these

4. Number of proper factors of 2400 is equal to

(a) 34 (b) 35
(c) 36 (d) 37

5. The sum of the divisors of 2 5 ⋅ 34 ⋅ 52 is

(a) 32 ⋅ 71 ⋅ 112 (b) 32 ⋅ 71 ⋅ 112 ⋅ 31
(c) 3 ⋅ 7 ⋅ 11⋅ 31 (d) None of these

6. The number of proper divisors of 2p ⋅ 6q ⋅ 21r , ∀ p, q , r ∈ N, is

(a) (p + q + 1) (q + r + 1) (r + 1) (b) (p + q + 1) (q + r + 1) (r + 1) − 2
(c) (p + q ) (q + r ) r − 2 (d) (p + q ) (q + r )r

7. The number of odd proper divisors of 3p ⋅ 6q ⋅ 15r , ∀ p, q , r ∈ N, is

(a) (p + 1) (q + 1) (r + 1) − 2 (b) (p + 1) (q + 1) (r + 1) − 1
(c) (p + q + r + 1) (r + 1) − 2 (d) (p + q + r + 1) (r + 1) − 1

8. The number of proper divisors of 1800, which are also divisible by 10, is
(a) 18 (b) 27 (c) 34 (d) 43

9. Total number of divisors of 480 that are of the form 4n + 2, n ≥ 0, is equal to

(a) 2 (b) 3 (c) 4 (d) 5

10. Total number of divisors of N = 2 ⋅ 3 ⋅ 5 5 4 10

⋅ 7 that are of the form 4n + 2, n ≥ 1, is equal to
6

(a) 54 (b) 55 (c) 384 (d) 385

 Chap 05 Permutations and Combinations 385

11. Total number of divisors of N = 3 5 ⋅ 5 7⋅ 79 that are of the form 4n + 1, n ≥ 0 is equal to

(a) 15 (b) 30 (c) 120 (d) 240

12. Number of ways in which 12 different books can be distributed equally among 3 persons, is
12 ! 12 ! 12 ! 12 !
(a) (b) (c) (d)
(4 !)3 (3 !)4 (4 !)4 (3 !)3

13. Number of ways in which 12 different things can be distributed in 3 groups, is

12 ! 12 ! 12 ! 12 !
(a) (b) (c) (d)
(4 !)3 3 ! (4 !)3 4 ! (3 !)3 (3 !)4

14. Number of ways in which 12 different things can be distributed in 5 sets of 2, 2, 2, 3, 3, things is
12 ! 12 ! 5 ! 12 ! 12 ! 5 !
(a) 2 3
(b) 2 3
(c) 3 4
(d)
(3 !) (2 !) (3 !) (2 !) (3 !) (2 !) (3 !)2 (2 !)4

15. Number of ways in which 12 different things can be divided among five persons so that they can get 2, 2, 2, 3,
3 things respectively, is
12 ! 12 ! 5 ! 12 ! 12 ! 5 !
(a) (b) (c) (d)
(3 !)2 (2 !)3 (3 !)2 (2 !)3 (3 !)2 (2 !)4 (3 !)2 (2 !)4

16. The total number of ways in which 2n persons can be divided into n couples, is
2n ! 2n ! 2n !
(a) (b) (c) (d) None of these
(n !)2 (2n !)n n ! (2n !)2

17. n different toys have to be distributed among n children. Total number of ways in which these toys can be
distributed so that exactly one child gets no toy, is equal to
(a) n ! (b) n ! nC2 (c) (n − 1) ! nC2 (d) n ! n −1C2

18. In how many ways can 8 different books be distributed among 3 students if each receives atleast 2 books?
(a) 490 (b) 980 (c) 2940 (d) 5880
Session 6
Arrangement in Groups, Multinomial Theorem,
Multiplying Synthetically

Arrangement in Groups All 5 balls can be arranged by 5! ways and boxes can be
3!
(a) The number of ways in which n different things arranged in each system by .
2!
can be arranged into r different groups is 3! 3!
Hence, required number of ways = 5! × + 5! ×
r (r + 1 )(r + 2) K (r + n − 1 ) or n !⋅ n − 1 C r − 1 2! 2!
according as blank groups are or are not admissible. = 120 × 3 + 120 × 3 = 720
Proof (b) The number of ways in which n different things
(i) Let n letters a 1 , a 2 , a 3 , K, a n be written in a row can be distributed into r different groups is
in any order. All the arrangements of the letters r n −r C 1 (r − 1 ) n + r C 2 (r − 2) n − K + ( −1 ) r −1 ⋅ r C r −1
in r, groups, blank groups being admissible, can Or
be obtained thus, place among the letters (r − 1)
r

marks of partition and arrange the (n + r − 1) ∑ ( −1 ) p ⋅ r C p ⋅ (r − p )n

p=0
things (consisting of letters and marks) in all Or
possible orders. Since, (r − 1) of the things are
Coefficient of x in n !(e x − 1 ) r .
n
alike, the number of different arrangements is
(n + r − 1) ! Here, blank groups are not allowed.
= r (r + 1)(r − 2 ) K(r + n − 1).
(r − 1) ! Proof In any distribution, denote the groups by
(ii) All the arrangements of the letters in r groups, g 1 , g 2 , g 3 , K, g r and consider the distributions in
none of the groups being blank, can be obtained which blanks are allowed.
as follows: The total number of these is r n .
(I) Arrange the letters in all possible orders. This can be The number in which g 1 is blank, is (r − 1) n .
done in n ! ways.
Therefore, the number in which g 1 is not blank, is
(II) In every such arrangement, place (r − 1) marks of
partition in (r − 1) out of the (n − 1) spaces between r n − (r − 1) n
the letters. This can be done in n − 1 C r − 1 ways. of these last, the number in which g 2 is blank, is
(r − 1) n − (r − 2 ) n
Hence, the required number is n !⋅ n − 1 C r − 1 .
Therefore, the number in which g 1 , g 2 are not blank, is
y Example 77. In how many ways 5 different balls can r n − 2 (r − 1) n + (r − 2 ) n
be arranged into 3 different boxes so that no box of these last, the number in which g 3 is blank, is
remains empty? (r − 1) n − 2 (r − 2 ) n + (r − 3 ) n
Sol. The required number of ways = 5!⋅ 5 − 1 C 3 − 1 = 5!⋅ 4C 2 Therefore, the number in which g 1 , g 2 , g 3 are not
 4 ⋅ 3 blank, is
= (120) ⋅   = 720
 1 ⋅2  r n − 3 (r − 1) n + 3 (r − 2 ) n − (r − 3 ) n
Aliter
This process can be continued as far as we like and it
Each box must contain atleast one ball, since no box
is obvious that the coefficients are formed as in a
remains empty. Boxes can have balls in the following
systems binomial expansion.
Hence, the number of distributions in which no one
Box I II III Box I II III
of x assigned groups is blank, is
Number of 1 1 3 Or Number of 1 2 2
balls balls r n − x C 1(r − 1)n + x C 2 (r − 2)n − K + ( −1)x (r − x )n
 Chap 05 Permutations and Combinations 387

when x = r , then Box I II III Box I II III

r n − r C 1 (r − 1) n + r C 2 (r − 2 ) n −K + ( −1) r − 1 ⋅ r C r − 1 Number of 1 1 3 Or Number of 1 2 2
balls balls
(r − (r − 1)) n + ( −1) r ⋅ r C r (r − r ) n
Or The number of ways to distribute the balls in I system
r − C 1 (r − 1) + C 2 (r − 2)n − K + ( −1)r − 1 ⋅ r C r − 1
n r n r
= 5C 1 × 4C 1 × 3C 3
Aliter ∴Thetotalnumberofwaystodistribute 1,1,3ballstotheboxes
3!
By Principle of Inclusion and Exclusion = 5C 1 × 4C 1 × 3C 3 × = 5 × 4 × 1 × 3 = 60
2!
Let Ai denotes the set of distribution of things, if ith and the number of ways to distribute the balls in II system
group gets nothing. Then, n( Ai ) = (r − 1) n = 5C 1 × 4C 2 × 2C 2
[as n things can be distributed among (r − 1) groups ∴ The total number of ways to distribute 1, 2, 2 balls to the
in (r − 1) n ways] boxes 3!
= 5C 1 × 4C 2 × 2C 2 ×
Then, n ( Ai ∩ A j ) represents number of distribution 2!
ways in which groups i and j get no object. Then, = 5 × 6 × 1 × 3 = 90
∴ The required number of ways = 60 + 90 = 150
n ( Ai ∩ A j ) = (r − 2 ) n
Also, n ( Ai ∩ A j ∩ Ak ) = (r − 3 ) n y Example 79. In how many ways can 5 different
This process can be continued, then the required books be tied up in three bundles?
number is 1 5 3
Sol. The required number of ways = ( 3 − C 1 ⋅ 25 + 3C 2 ⋅ 15 )
n ( A1 ′ A2 ′ ∩ K ∩ Ar ′ ) 3!
= n (U ) − n( A1 ∪ A2 ∪ K ∪ Ar ) 150
= = 25
= r n − { ∑ n( Ai ) − ∑ n ( Ai ∩ A j )
6

y Example 80. If n ( A ) = 5 and n (B ) = 3, find number

+ ∑ n ( Ai ∩ A j ∩ Ak ) K
+ ( −1) n ∑ n ( A1 ∩ A2 ∩ K ∩ Ar )}
of onto mappings from A to B.
Sol. We know that in onto mapping, each image must be
= r n − { r C 1 (r − 1) n − r C 2 (r − 2 ) n assigned atleast one pre-image.
This is equivalent to number of ways in which 5 different
+ r C 3 (r − 3 ) n − K+ ( −1) r ⋅ r C r − 1 }
balls (pre-images) can be distributed in 3 different boxes
= r n − r C 1 (r − 1) n + r C 2 (r − 2 ) n (images), if no box remains empty. The total number of
onto mappings from A to B
− r C 3 (r − 3 ) n + K + ( −1) r − 1 ⋅ r C r − 1 ⋅ 1
= 35 − 3C 1(3 − 1)5 + 3C 2 (3 − 2)5
r
p
Note Coefficient of x r in epx = . = 243 − 96 + 3 = 150
r!
(c) The number of ways in which n identical things
y Example 78. In how many ways 5 different balls can be can be distributed into r different groups is
distributed into 3 boxes so that no box remains empty? n +r −1
C r − 1 or n −1
Cr − 1
Sol. The required number of ways
According, as blank groups are or are not
= 35 − 3C 1(3 − 1)5 + 3C 2 (3 − 2)5 − 3C 3 (3 − 3)5
admissible.
= 243 − 96 + 3 − 0 = 150 Proof
Or If blank groups are not allowed Any such
Coefficient of x 5 in 5!(e x − 1)3 distribution can be effected as follows: place the n
things in a row and put marks of partition in a
= Coefficient of x 5 in 5!(e 3 x − 3e 2 x + 3e x − 1)
selection of (r − 1) out of the (n − 1) spaces between
 35 25 1 them. This can be done in n − 1 C r − 1 .
= 5!  − 3 × + 3 ×  = 35 − 3⋅25 + 3 = 243 − 96 + 3 = 150
 5! 5! 5! 
If blank groups are allowed The number of
Aliter distribution is the same as that of (n + r ) things of the
Each box must contain atleast one ball, since number box same sort into r groups with no blank groups. For
remains empty. Boxes can have balls in the following such a distribution can be effected thus, put one of the
systems
388 Textbook of Algebra

20 + 4 − 1
(n + r ) things into each of the r groups and distribute Hence, total number of Sols = C4 −1
the remaining n things into r groups, blank lots being 23 ⋅ 22 ⋅ 21
allowed. Hence, the required number is n + r − 1 C r − 1 . = C3 =
23
= 1771
1 ⋅2 ⋅3
Aliter The number of distribution of n identical (ii) Since, x + y + z + w = 20 …(i)
Here, x ≥ 1, y ≥ 1, z ≥ 1, w ≥ 1
things into r different groups is the coefficient of x n
or x− 1 ≥ 0, y − 1 ≥ 0, z − 1 ≥ 0, w − 1 ≥ 0
in (1 + x + x 2 + K + ∞ ) r or in ( x + x 2 + x 3 + K + ∞ ) r
Let x1 = x − 1 ⇒ x = x1 + 1
according as blank groups are or are not allowed. y1 = y − 1 ⇒ y = y1 + 1
These expressions are respectively equal to z1 = z − 1 ⇒ z = z1 + 1
(1 − x ) −r and x r (1 − x ) −r w1 = w − 1 ⇒ w = w1 + 1
Then, from Eq. (i), we get
Hence, coefficient of x n in two expressions are
x 1 + 1 + y1 + 1 + z1 + 1 + w 1 + 1 = 20
n +r −1 n −1
C r − 1 and C r − 1 , respectively. ⇒ x 1 + y1 + z1 + w 1 = 16
and x 1 ≥ 0, y1 ≥ 0, z1 ≥ 0, w 1 ≥ 0
y Example 81. In how many ways 5 identical balls can Hence, total number of Solutions = 16 + 4 − 1C 4 − 1
be distributed into 3 different boxes so that no box
19 ⋅ 18 ⋅ 17
remains empty? = 19C 3 = = 57 ⋅ 17 = 969
1 ⋅2 ⋅3
5 −1 4 ⋅3 Aliter
Sol. The required number of ways = C 3 − 1 = 4C 2 = =6
1 ⋅2 Part (ii) Q x + y + z + w = 20
Aliter Each box must contain atleast one ball, since no x ≥ 1, y ≥ 1, z ≥ 1, w ≥ 1
box remains empty. Boxes can have balls in the following Hence, total number of solutions
20 − 1
systems. = C 4 − 1 = 19C 3 = 969
Box I II III Box I II III
Number 1 1 3 Or Number of 1 2 2
y Example 84. How many integral solutions are there
of balls balls to x + y + z + t = 29, when x ≥ 1, y > 1, z ≥ 3 and t ≥ 0 ?
Sol. Since, x + y + z + t = 29 …(i)
Here, balls are identical but boxes are different the number
of combinations will be 1 in each systems. and x, y, z, t are integers
3! 3! ∴ x ≥ 1, y ≥ 2, z ≥ 3, t ≥ 0
∴ Required number of ways = 1 × + 1 × = 3 + 3 = 6
2! 2! ⇒ x − 1 ≥ 0, y − 2 ≥ 0, z − 3 ≥ 0, t ≥ 0
Let x 1 = x − 1, x 2 = y − 2, x 3 = z − 3
y Example 82. Four boys picked up 30 mangoes. In or x = x 1 + 1, y = x 2 + 2, z = x 3 + 3 and then x 1 ≥ 0, x 2 ≥ 0,
how many ways can they divide them, if all mangoes x 3 ≥ 0, t ≥ 0
be identical? From Eq. (i), we get
Sol. Clearly, 30 mangoes can be distributed among 4 boys such x 1 + 1 + x 2 + 2 + x 3 + 3 + t = 29
that each boy can receive any number of mangoes. ⇒ x 1 + x 2 + x 3 + t = 23
30 + 4 − 1
Hence, total number of ways = C4 −1 Hence, total number of solutions = 23 + 4 − 1C 4 − 1
33 ⋅ 32 ⋅ 31 26 ⋅ 25 ⋅ 24
= 33
C3 = = 5456 = 26
C3 = = 2600
1 ⋅2 ⋅3 1 ⋅2 ⋅3
Aliter
y Example 83. Find the positive number of solutions of Q x + y + z + t = 29 …(i)
x + y + z + w = 20 under the following conditions and x ≥ 1, y − 1 ≥ 1, z − 2 ≥ 1, t + 1 ≥ 1
(i) Zero value of x , y, z and w are included. Let x 1 = x , y1 = y − 1, z1 = z − 2, t 1 = t + 1
(ii) Zero values are excluded. or x = x 1, y = y1 + 1, z = z1 + 2, t = t 1 − 1
Sol. (i) Since, x + y + z + w = 20 and then x 1 ≥ 1, y1 ≥ 1, z1 ≥ 1, t 1 ≥ 1
From Eq. (i), x 1 + y1 + 1 + z1 + 2 + t 1 − 1 = 29
Here, x ≥ 0, y ≥ 0, z ≥ 0, w ≥ 0
⇒ x 1 + y1 + z1 + t 1 = 27
The number of Sols of the given equation in this case Hence, total number of solutions = 27 − 1
C4 −1 = 26
C3
is same as the number of ways of distributing 20
things among 4 different groups. 26 ⋅ 25 ⋅ 24
= = 2600
1 ⋅2 ⋅3
 Chap 05 Permutations and Combinations 389

y Example 85. How many integral Solutions are there = Coefficient of x n in the expansion of
to the system of equations x 1 + x 2 + x 3 + x 4 + x 5 = 20 x lr (1 + x + x 2 + K + x m − l ) r
and x 1 + x 2 = 15, when x k ≥ 0?
= Coefficient of x n − lr in the expansion of
Sol. We have, x 1 + x 2 + x 3 + x 4 + x 5 = 20 …(i)
(1 + x + x 2 + K + x m − l ) r
and x 1 + x 2 = 15 …(ii)
Then, from Eqs. (i) and (ii), we get two equations = Coefficient of x n − lr in the expansion of
r
x3 + x4 + x5 = 5 …(iii)  1 ⋅ (1 − x m − l + 1 ) 
 
x 1 + x 2 = 15 …(iv)  (1 − x ) 
and given x 1 ≥ 0, x 2 ≥ 0, x 3 ≥ 0, x 4 ≥ 0 and x 5 ≥ 0
[sum of m − l + 1 terms of GP]
Then, number of solutions of Eq. (iii)
n − lr
= 5 + 3 −1
C 3 − 1 = 7C 2
= Coefficient of x in the expansion of

7 ⋅6 (1 − x m − l + 1 ) r (1 − x ) −r
= = 21
1 ⋅2
y Example 87. In how many ways can three persons,
and number of solutions of Eq. (iv) each throwing a single dice once, make a sum of 15 ?
15 + 2 − 1
= C 2 − 1 = 16C 1 = 16 Sol. Number on the faces of the dice are 1, 2, 3, 4, 5, 6 (least
Hence, total number of solutions of the given system of number 1, greatest number 6)
equations Here, l = 1, m = 6, r = 3 and n = 15
= 21 × 16 = 336 ∴ Required number of ways = Coefficient of x 15 − 1 × 3 in the
expansion of (1 − x 6 )3 (1 − x )−3
y Example 86. Find the number of non-negative
integral solutions of 3x + y + z = 24. = Coefficient of x 12 in the expansion of
Sol. We have, (1 − 3x 6 + 3x 12 )(1 + 3C 1 x + 4C 2 x 2 + K + 8C 6 x 6 + K
3x + y + z = 24 and given x ≥ 0, y ≥ 0, z ≥ 0 + 14C 12 x 12 + K )
Let x =k = 14C 12 − 3 × 8C 6 + 3 = 14C 2 − 3 × 8C 2 + 3
∴ y + z = 24 − 3k …(i) = 91 − 84 + 3 = 10
Here, 24 ≥ 24 − 3k ≥ 0[Q x ≥ 0]
Hence, 0 ≤ k ≤ 8 y Example 88. In how many ways in which an
The total number of integral solutions of Eq. (i) is examiner can assign 30 marks to 8 questions, giving
24 − 3k + 2 − 1
C2 −1 = 25 − 3k
C 1 = 25 − 3k not less than 2 marks to any question.
Sol. If examiner given marks any seven question 2 (each)
Hence, the total number of Sols of the original equation marks, then marks on remaining questions given by
8 8 8
examiner = − 7 × 2 + 30 = 16
= ∑(25 − 3k ) = 25 ∑1 − 3 ∑k If x i are the marks assigned to ith question, then
k =0 k =0 k =0
x 1 + x 2 + x 3 + K + x 8 = 30 and 2 ≤ x i ≤ 16
8 ⋅9
= 25 ⋅ 9 − 3 ⋅ = 225 − 108 = 117 for i = 1, 2, 3, K, 8.
2
Here, l = 2,m = 16, r = 8 and n = 30
(d) The number of ways in which n identical things ∴ Required number of ways
can be distributed into r groups so that no group 30 − 2 × 8
= Coefficient of x in the expansion of
contains less than l things and more than m
things (l < m ) is coefficient of x n − lr in the (1 − x 16 − 2 + 1 )8 (1 − x )−8
expansion of (1 − x m − l + 1 ) r (1 − x ) −r . = Coefficient of x 14 in the expansion of

Proof Required number of ways (1 − x 15 )8 (1 + 8C 1x + 9C 2 x 2 + K+ 21C 14 x 14 + K )

= Coefficient of x n in the expansion of = Coefficient of x 14 in the expansion of

(1 + 8C 1x + 9C 2 x 2 + K + 21C 14 x 14 + K )
(x l + x l + 1 + x l + 2 + K + x m )r
= 21C 14 = 21C 7
[Q no group contains less than l things and
Note Coefficient of x r in the expansion of ( 1 − x ) − n is n + r −1
Cr .
more than m things, here r groups]
390 Textbook of Algebra

(e) If a group has n things in which p are identical, [Q the remaining (n − 1) letters can be placed in (n − 1)
then the number of ways of selecting r things envelopes is (n − 1) ! ]
from a group is and n ( Ai ∩ A j ) = 1 × 1 × (n − 2 ) ! [Qi and j can be placed in
r r their corresponding envelopes and remaining (n − 2 )
∑ n−p
C r or ∑ n − p C r ,according asr ≤ p or letters can be placed in (n − 2 ) envelopes in (n − 2 ) ! way]
r =0 r =r − p
r ≥ p. Also, n ( Ai ∩ A j ∩ Ak ) = 1 × 1 × 1 × (n − 3 ) !
Hence, the required number is
y Example 89. A bag has contains 23 balls in which 7 n ( A1 ′ ∩ A2 ′ ∩ A 3 ′ ∩ K ∩ An ′ )
are identical. Then, find the number of ways of
= n (U ) − n ( A1 ∪ A2 ∪ A 3 ∪ K ∪ An )
selecting 12 balls from bag.
= n ! − {∑ n ( Ai ) − ∑ n( Ai ∩ A j )
Sol. Here, n = 23, p = 7, r = 12 (r > p )
12 + ∑ n ( Ai ∩ A j ∩ Ak ) −K + ( −1) n
∴ Required number of selections = ∑ 16
Cr
r =5 ∑ n ( A1 ∩ A2 ∩ A 3 ∩ K ∩ An )
= C 5 + C 6 + C 7 + C 8 + C 9 + C 10 + C 11 + C 12
16 16 16 16 16 16 16 16
= n ! − { n C 1 × (n − 1) ! − n C 2 × (n − 2 ) !
= ( 16C 5 + 16C 6 ) + ( 16C 7 + 16C 8 ) + ( 16C 9 + 16C 10 ) + n C 3 × (n − 3 ) ! −K + ( −1) n − 1 × n C n × 1 ! }
+ ( 16C 11 + 16C 12 ) n × (n − 1) ! n(n − 1)
n +1 = n! −  − × (n − 2 ) !
= 17C 6 + 17C 8 + 17C 10 + 17C 12 [Q n C r + n C r −1 = Cr ]  1! 2!
n(n − 1)(n − 2 ) 
= C 11 + C 9 + C 10 + C 12 [Q C r = n C n − r ] × (n − 3 ) ! − K + ( −1) n − 1 × 1
17 17 17 17 n
+
3! 
= ( 17C 11 + 17C 12 ) + ( 17C 9 + 17C 10 )
n ! n ! n ! 
= n ! −  − + − K + ( −1) n ⋅ 1
= 18C 12 + 18C 10 = 18C 6 + 18C 8  1! 2 ! 3 ! 
Derangements Any change in the order of the things in  1 1 1 ( −1) n 

a group is called a derangement. = n ! 1 − + − + K + 

 1! 2 ! 3 ! n! 
Or
When ‘n’ things are to be placed at ‘n’ specific places but Maha Short Cut Method
none of them is placed on its specified position, then we  1 1 1 ( −1) n 
say that the ‘n’ things are deranged. If D n = n ! 1 − + − + K + 
 1! 2 ! 3 ! n! 
Or
Then, D n + 1 = (n + 1 ) D n + ( −1 ) n + 1 , ∀ x ∈ N
Assume a 1 , a 2 , a 3 , K, a n be n distinct things such that their
positions are fixed in a row. If we now rearrange a 1 , a 2 , and D n + 1 = n ( D n + D n − 1 ), ∀ x ∈ N − {1 }
a 3 , K, a n in such a way that no one occupy its original where D 1 = 0
position, then such an arrangement is called a For n = 1, from result I
derangement. D 2 = 2 D 1 + ( −1) 2 = 0 + 1 = 1
Consider ‘n’ letters and ‘n’ corresponding envelops. The For n = 2, from result I
number of ways in which letters can be placed in the D 3 = 3 D 2 + ( −1) 3 = 3 × 1 − 1 = 2
envelopes (one letter in each envelope) so that no letter is
placed in correct envelope is For n = 3, from result I
 1 1 1 1 D 4 = 4 D 3 + ( −1) 4 = 4 × 2 + 1 = 9
n !  1 − + − + K + ( −1) n 
 1! 2 ! 3 ! n ! For n = 4, from result I
Proof n letters are denoted by 1, 2, 3, K, n. Let Ai denote D 5 = 5 D 4 + ( −1) 5 = 5 × 9 − 1 = 44
the set of distribution of letters in envelopes (one letter in For n = 5, from result I
each envelop) so that the
i th letter is placed in the corresponding envelope, then D 6 = 6 D 5 + ( −1) 6 = 6 × 44 + 1 = 265
n ( Ai ) = 1 × (n − 1) ! Note D1 = 0, D2 = 1, D3 = 2, D4 = 9, D5 = 44, D6 = 265 [Remember]
 Chap 05 Permutations and Combinations 391

Remark The number of ways to put 2 letters in 2

If r things goes to wrong place out of n things, then ( n − r ) things addressed envelopes so that all are in wrong
goes to original place (here r < n). envelopes
If Dn = Number of ways, if all n things goes to wrong places.
= The number of ways without restriction − The
and Dr = Number of ways, if r things goes to wrong places.
If r goes to wrong places out of n, then ( n − r ) goes to correct
number of ways in which all are in correct envelopes
places. − The number of ways in which 1 letter is in the
Then, Dn = n Cn − r Dr correct envelope
where, Dr = r !  1 − + ! − + K + ( −1) r 
1 1 1 1 = 2! − 1 − 0 = 2 − 1
 1! 2! 3! r !
n =1 …(ii) [from Eq. (i)]
If atleast p things goes to wrong places, then Dn = ∑ Cn − r ⋅ Dr
n

r =p
The number of ways to put 3 letters in 3
addressed envelopes so that all are in wrong
y Example 90. A person writes letters to six friends envelopes
and addresses the corresponding envelopes. In how = The number of ways without restriction − The
many ways can the letters be placed in the envelopes number of ways in which all are in correct envelopes
so that (i) atleast two of them are in the wrong − The number of ways in which 1 letter is in the
envelopes. (ii) all the letters are in the wrong correct envelope − The number of ways in which 2
envelopes. letter are in correct envelope
Sol. (i) The number of ways in which atleast two of them in = 3 ! − 1 − 3 C 1 × 1 − 0 [from Eqs. (i) and (ii)]
the wrong envelopes
6 =2
= ∑ 6
C 6 − r ⋅ Dr [ 3C 1 means that select one envelope to put the letter
r =2
correctly]
= 6
C4 × D 2 + 6C 3 × D 3 + 6C 2 × D 4 + 6C 1
The number of ways to put 4 letters in 4
× D 5 + 6C 0 × D 6 addressed envelopes so that all are in wrong
= 15D 2 + 20D 3 + 15D 4 + 6D 5 + D 6 [from note] envelopes
= 15 × 1 + 20 × 2 + 15 × 9 + 6 × 44 + 265 = The number of ways without restriction − The
= 719
number of ways in which all are in correct envelopes
− The number of ways in which 1 letter is in the
(ii) The number of ways in which all letters be placed in correct envelope − The number of ways in which 2
wrong envelopes = D 6 = 265 [from note] letters are in correct envelopes − The number of ways
Aliter in which 3 letters are in correct envelopes
(i) The number of all the possible ways of putting 6 = 4 ! − 1 − 4C 1 × 2 − 4C 2 × 1 − 4C 3 × 0
letters into 6 envelopes is 6 ! . [from Eqs. (i), (ii) and (iii)]
Number of ways to place all letters correctly into = 24 − 1 − 8 − 6 − 0 = 9 …(iv)
corresponding envelopes = 1
The number of ways to put 5 letters in 5
and number of ways to place one letter in the wrong addressed envelopes so that all are in wrong
envelope and other 5 letters in the write envelope = 0 envelopes
[Q It is not possible that only one letter goes in the = The number of ways without restriction − The
wrong envelope, when if 5 letters goes in the right number of ways in which all are in correct envelopes −
envelope, then remaining one letter also goes in the The number of ways in which 1 letter is in the correct
write envelope] envelopes − The number of ways in which 2 letters are
Hence, number of ways to place atleast two letters in correct envelopes − The number of ways in which 3
goes in the wrong envelopes letters are in correct envelopes − The number of ways
in which 4 letters are in correct envelopes
= 6 ! − 0 − 1 = 6 ! − 1 = 720 − 1 = 719
= 5 ! − 1 − 5C 1 × 9 − 5C 2 × 2 − 5C 3 × 1 − 5C 4 × 0
(ii) The number of ways 1 letter in 1 address envelope, so
that one letter is in wrong envelope = 0 …(i) [from Eqs. (i), (ii), (iii) and (iv)]
[because it is not possible that only one letter goes in = 120 − 1 − 45 − 20 − 10 − 0 = 44
the wrong envelope]
392 Textbook of Algebra

The number of ways to put 6 letters in 6 addressed y Example 91. In how many ways the sum of upper
envelopes so that all are in wrong envelopes faces of four distinct die can be five?
= The number of ways without restriction − The Sol. Here, the number of required ways will be equal to the
number of ways in which all are in correct envelopes number of solutions of x 1 + x 2 + x 3 + x 4 = 5 i.e., 1 ≤ x i ≤ 6
− The number of ways in which 1 letter is in the for i = 1, 2, 3, 4.
correct envelope − The number of ways in which 2 Since, upper limit is 6, which is greater than required
sum, so upper limit taken as infiite. So, number of Sols is
letters are in correct envelopes − The number of ways
equal to coefficient of α 5 in the expansion of
in which 3 letters are in correct envelopes − The (1 + α + α 2 + K + ∞ )4
number of ways in which 4 letters are in correct
envelopes − The number of ways in which 5 letters = Coefficient of α 5 in the expansion of (1 − α )−4
are in correct envelopes. = Coefficient of α 5 in the expansion of
= 6 ! − 1 − 6 C 1 × 44 − 6 C 2 × 9 − 6 C 3 × 2 (1 + 4C 1α + 5C 2 α 2 + K )
− 6C 4 × 1 − 6C 5 × 0 8 ⋅7 ⋅6
= 8C 5 = 8C 3 = = 56
[from Eqs. (i), (ii), (iii), (iv) and (v)] 1 ⋅2 ⋅3
= 720 − 1 − 264 − 135 − 40 − 15 = 720 − 455 = 265 Case II If the upper limit of a variable is less than
the sum required and the lower limit of all variables
Multinomial Theorem is non-negative, then the upper limit of that variable
is that given in the problem.
(i) If there are l objects of one kind, m objects of second
kind, n objects of third kind and so on, then the y Example 92. In an examination, the maximum
number of ways of choosing r objects out of these marks each of three papers is 50 and the maximum
objects (i.e., l + m + n +K) is the coefficient of x r in mark for the fourth paper is 100. Find the number
the expansion of of ways in which the candidate can score 60%
(1 + x + x 2 + x 3 + K + x l )(1 + x + x 2 + K + x m ) marks in aggregate.
(1 + x + x 2 + K + x n ) Sol. Aggregate of marks = 50 × 3 + 100 = 250
Further, if one object of each kind is to be included, 60
then the number of ways of choosing r objects out of ∴ 60% of the aggregate = × 250 = 150
100
these objects (i.e., l + m + n +K) is the coefficient of
Let the marks scored by the candidate in four papers be x 1,
x r in the expansion of x 2 , x 3 and x 4 . Here, the number of required ways will be
( x + x 2 + x 3 + K + x l )( x + x 2 + x 3 + K + x m ) equal to the number of Sols of x 1 + x 2 + x 3 + x 4 = 150 i.e.,
(x + x 2 + x 3 + K + x n ) K 0 ≤ x 1, x 2 , x 3 ≤ 50 and 0 ≤ x 4 ≤ 100.
Since, the upper limit is 100 < required sum (150).
(ii) If there are l objects of one kind, m objects of second
kind, n objects of third kind and so on, then the The number of solutions of the equation is equal to
number of possible arrangements/permutations of r coefficient of α150 in the expansion of
objects out of these objects (i.e., l + m + n +K) is the (α 0 + α1 + α 2 + K + α 50 )3 (α 0 + α1 + α 2 + K + α100 )
coefficient of x r in the expansion of
= Coefficient of α150 in the expansion of
 x x2 xl   x x2 xm 
r ! 1 + + + K +  1 + + +K +  (1 − α 51 )3 (1 − α10 )(1 − α )−4
 1! 2 ! l !   1! 2 ! m! 
 x x2 xn  = Coefficient of α150 in the expansion of
1 + + +K +  K.
 1! 2 ! n!  (1 − 3α 51 + 3α102 )(1 − α101 )(1 + 4C 1α + 5C 2 α 2 + K + ∞ )
= Coefficient of α150 in the expansion of
Different Cases of (1 − 3α 51 − α101 + 3α102 )(1 + 4C 1α + 5C 2 α 2 + K + ∞ )
Multinomial Theorem = C 150 − 3 ×
153 102
C 99 − C 49 + 3 × 51C 48
52

Case I If upper limit of a variable is more than or = C3 − 3 ×

153 102
C3 − 52
C 3 + 3 × 51C 3
equal to the sum required, then the upper limit of = 110556
that variable can be taken as infinite.
 Chap 05 Permutations and Combinations 393

Very Important Trick … on multiplying by 1 + α + α 2 + α 3 → To each coefficient

On multiplying p 0 + p 1 α + p 2 α 2 + p 3 α 3 + K + p n α n add 3 preceding coefficients

by (1 + α ), we get 1 4 7 8 7 4 1 ...
p 0 + (p 0 + p1 ) α + (p1 + p2 ) α 2 + (p2 + p 3 ) α 3 + K …on multiplying by 1 + α + α → To each coefficient add 2
2

n −1 n +1
+ (pn − 2 + pn − 1 )α + (pn − 1 + pn )α + pnα n
preceding coefficients.
i.e., we just add coefficient of α r with coefficient of α r − 1 1 5 12 19 22 19 12 ...
(i.e., previous term) to get coefficient α r in product. …on multiplying by 1 + α + α 2 → To each coefficient add 2
Now, coefficient of α = p r − 1 + p r
r
preceding coefficients.
On multiplying p 0 + p 1 α + p 2 α 2 + p 3 α 3 + K + p n α n by ... ... ... ... ... ... 53 ...
(1 + α + α 2 )
Hence, required coefficient is 53.
we get, p 0 + ( p 0 + p 1 ) α + ( p 0 + p 1 + p 2 ) α 2
y Example 94. Find the number of different
+ (p1 + p2 + p 3 ) α 3 + (p2 + p 3 + p 4 ) α 4 + K
selections of 5 letters which can be made from
i.e., to find coefficient of α r in product and add this with 2 5A’s, 4B ’s, 3C’s, 2D’s and 1E
preceding coefficients. Sol. All selections of 5 letters are given by 5th degree terms in
Now, coefficient of α r = p r − 2 + p r − 1 + p r (1 + A + A 2 + A 3 + A 4 + A 5 )(1 + B + B 2 + B 3 + B 4 )
Similarly, in product of p 0 + p 1 α + p 2 α 2 + K with (1 + C + C 2 + C 3 )(1 + D + D 2 )(1 + E )
(1 + α + α 2 + α 3 ), the coefficient of α r in product will be ∴ Number of 5 letter selections
p − 3 + pr − 2 + pr − 1 + pr = Coefficient of α 5 in (1 + α + α 2 + α 3 + α 4 + α 5 )
1r 444 24443
3 preceding coefficients (1 + α + α 2 + α 3 + α 4 )(1 + α + α 2 + α 3 )
and in product of p 0 + p 1 α + p 2 α 2 + K with (1 + α + α 2 )(1 + α )
( 1 + α + α 2 + α 3 + α 4 ), the coefficient of α r in product Multiplying synthetically
will be p r − 4 + p r − 3 + p r − 2 + p r − 1 + p r 1 α α 2
α3 α4 α 5 ...
14444 4244444 3
4 preceding coefficients 1 1 1 1 1 1

Finally, in product of p 0 + p 1 α + p 2 α + K with 2 –––––––––––––––––––––––––––––– × 1 + α + α + α 2 + α 3+ α 4

(1 + α + α 2 + α 3 + K + upto ∞ ), the coefficient of α r in 1 2 3 4 5 5 ...

–––––––––––––––––––––––––––––– × 1 + α + α 2 + α 3
product will be p 0 + p 1 + p 2 + K + p r − 1 + p r
1444424444 3 1 3 6 10 14 17 ...
all preceding coefficients
–––––––––––––––––––––––––––––– ×1 + α + α 2
y Example 93. Find the coefficient of α in the 6
1 4 10 19 30 41 ...
product (1 + α + α 2 )(1 + α + α 2 )(1 + α + α 2 + α 3 ) –––––––––––––––––––––––––––––– × 1 + α
(1 + α )(1 + α )(1 + α ). 1 5 14 29 49 71
Sol. The given product can be written as Hence, required coefficient is 71.
(1 + α + α 2 )(1 + α + α 2 )(1 + α + α 2 + α 3 )(1 + α )3
y Example 95. Find the number of combinations and
or (1 + α + α 2 )(1 + α + α 2 )(1 + α + α 2 + α 3 )
permutations of 4 letters taken from the word
( 1 + 3α + 3α 2 + α 3 ) EXAMINATION.
Sol. There are 11 letters

Multiplying Synthetically A, A, N, N, X, M, T, O.
Then, number of combinations
= coefficient of x 4 in (1 + x + x 2 )3 (1 + x )5
1 α α 2
α 3
α 4
α 5
α 6
...
[Q2A’s, 2I ’s, 2N’s, 1E, 1X, 1M, 1T and 1O]
1 3 3 1 0 0 0
= Coefficient of x 4 in {(1 + x )3 + x 6 + 3(1 + x )2 x 2
394 Textbook of Algebra

+ 3(1 + x )x 4 }(1 + x )5 A X A O
= Coefficient of x in 4
7 ×6
∴ Number of selections = 3 C 1 × 7 C 2 = 3 × = 63
{(1 + x ) + x (1 + x ) + 3x (1 + x ) + 3x (1 + x ) }
8 6 5 2 7 4 6 1×2
4!
8 ⋅7 ⋅6 ⋅5 7 ⋅6 and number of permutations = 63 ⋅ = 756
= 8C 4 + 0 + 3 ⋅ 7C 2 + 3 = + 3⋅ + 3 = 70 + 63 + 3 2!
1 ⋅2 ⋅3 ⋅ 4 1 ⋅2 From Case I, II and III
= 136
The required number of combinations = 70 + 3 + 63 = 136
and number of permutations
3 and number of permutations = 1680 + 18 + 756 = 2454
 x x2  x
5
= Coefficient of x 4 in 4 ! 1 + +  1 +  Note Number of combinations and permutations of 4 letters
 1! 2!   1!  taken from the word MATHEMATICS are 136 and 2454
3 respectively, as like of EXAMINATION.
 x 2
= Coefficient of x 4 in 4 ! 1 + x +  (1 + x )
5
 2
Number of Solutions with the
= Coefficient of x 4 in
 x6 3 3 
Help of Multinomial Theorem
4 ! (1 + x )3 + + (1 + x )2 x 2 + x 4 (1 + x ) (1 + x )5 Case I If the equation
 8 2 4 
α + 2 β + 3γ + K + q θ = n …(i)
= Coefficient of x 4 in
(a) If zero included, the number of solution of Eq. (i)
 x6 3 3 
4 ! (1 + x )8 + (1 + x )5 + x 2 (1 + x )7 + x 4 (1 + x )6  = Coefficient of x n in (1 + x + x 2 + K )
 8 2 4 
(1 + x 2 + x 4 + K )(1 + x 3 + x 6 + K ) K
 3 3  8 ⋅7 ⋅6 ⋅5 3 7 ⋅6 3 
= 4 !  8 C 4 + 0 + ⋅ 7C 2 +  = 24  + ⋅ +  (1 + x q + x 2q + K )
 2 4 1 ⋅2 ⋅3 ⋅ 4 2 1 ⋅2 4 
= 8 ⋅ 7 ⋅ 6 ⋅ 5 + 6(3 ⋅ 7 ⋅ 6) + 6 ⋅ 3 = 1680 + 756 + 18 = 2454 = Coefficient of x n in
Aliter There are 11 letters: (1 − x ) −1 (1 − x 2 ) −1 (1 − x 3 ) −1 K (1 − x q ) −1
A, A, I, I, N, N, E, X, M, T, O (b) If zero excluded, then the number of solutions of Eq. (i)
The following cases arise: = Coefficient of x n in ( x + x 2 + x 3 + K )
Case I All letters different The required number of ( x 2 + x 4 + x 6 + K )( x 3 + x 6 + x 9 + K )
choosing 4 different letters from 8 different (A, I, N, E, X, K ( x q + x 2q + K )
M, T, O) types of the letters
8 ⋅7 ⋅6 ⋅5 = Coefficient of x n in x 1 + 2 + 3 + K + q (1 − x ) −1
= 8C 4 = = 70
1⋅2 ⋅3 ⋅ 4 (1 − x 2 ) −1 (1 − x 3 ) −1 K (1 − x q ) −1
and number of permutations = 8 P 4 = 8 ⋅ 7 ⋅ 6 ⋅ 5 = 1680 q (q + 1 )
n−
= Coefficient of x 2 in
Case II Two alike of one type and two alike of
another type This must be 2A’s, 2I’s or 2I’s, 2N’s, or (1 − x ) (1 − x ) (1 − x 3 ) −1 K(1 − x q ) −1
−1 2 −1

2N’s, 2A’s.
y Example 96. Find the number of non-negative
∴ Number of selections = 3 C 2 = 3 integral solutions of x 1 + x 2 + x 3 + 4 x 4 = 20.
For example, [for arrangements] Sol. Number of non-negative integral solutions of the
given equation
A A I I
= Coefficient of x 20 in (1 − x )−1(1 − x )−1(1 − x )−1(1 − x 4 )−1
4! = Coefficient of x 20 in (1 − x )−3 (1 − x 4 )−1
and number of permutations = 3 ⋅ = 18
2! 2!
= Coefficient of x 20 in (1 + 3C 1 + 4C 2 x 2 + 5C 3 x 3 + 6C 4 x 4
Case III Two alike and two different This must be
+ K + 10C 8 x 8 + K + 14C 12 x 12 + K + 18C 16 x 16 + K
2A’s or 2I’s or 2N’s
+ C 20 x 20 + K )(1 + x 4 + x 8 + x 12 + x 16 + x 20 + K )
22
and for each case 7 different letters.
= 1 + 6C 4 + 10C 8 + 14C 12 + 18C 16 + 22
C 20
For example, for 2A’s, 7 differents’s are I, N, E, X, M, T, O
For example, [for arrangements] = 1 + 6C 2 + 10C 2 + 14C 2 + 18C 2 + 22
C2
 Chap 05 Permutations and Combinations 395

 6 ⋅ 5  10 ⋅ 9   14 ⋅ 13  18 ⋅ 17   22 ⋅ 21 Sol. The number of ways of distributing blankets is equal to

=1+   +   +  +  +  the number of solutions of the equation 3x + 2y + z = 15,
 1 ⋅ 2  1 ⋅ 2   1 ⋅ 2   1 ⋅ 2   1 ⋅ 2 
where x ≥ 1, y ≥ 1, z ≥ 1 which is equal to coefficient
= 1 + 15 + 45 + 91 + 153 + 231 = 536 of α15 in
y Example 97. Find the number of positive unequal (α 3 + α 6 + α 9 + α12 + α15 + ...)
integral solutions of the equation x + y + z + w = 20. × (α 2 + α 4 + α 6 + α 8 + α10 + α12 + α14 +...)
Sol. We have, x + y + z + w = 20 …(i) × (α + α 2 + α 3 + ... + α15 + ...)
Assume x < y < z < w . Here, x, y, z , w ≥ 1 = Coefficient of α 9 in (1 + α 3 + α 6 + α 9 )
Now, let x = x 1, y − x = x 2 , z − y = x 3 and w − z = x 4 × (1 + α 2 + α 4 + α 6 + α 8 )
∴ x = x 1, y = x 1 + x 2 , z = x 1 + x 2 + x 3 and
× (1 + α + α 2 + α 3 + α 4 + α 5 + α 6 + α 7 + α 8 + α 9 )
w = x1 + x 2 + x 3 + x 4
[neglecting higher powers]
From Eq. (i), 4 x 1 + 3x 2 + 2x 3 + x 4 = 20
= Coefficient of α 9 in (1 + α 2 + α 4 + α 6 + α 8 + α 3
Then, x 1, x 2 , x 3 , x 4 ≥ 1
Q 4 x 1 + 3x 2 + 2x 3 + x 4 = 20 …(ii) + α 5 + α 7 + α 9 + α 6 + α 8 + α 9 ) × (1 + α + α 2
∴ Number of positive integral solutions of Eq. (ii) α3 + α4 + α5 + α6 + α7 + α8 + α9 )
= Coefficient of x 20 − 10 in [neglecting higher powers]
(1 − x 4 )−1(1 − x 3 )−1(1 − x 2 )−1 (1 − x )−1 = 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 = 12

= Coefficient of x 10 in Case II If the inequation

(1 − x 4 )−1(1 − x 3 )−1 (1 − x 2 )−1 (1 − x )−1 x 1 + x 2 + x 3 +K + x m ≤ n …(i)
[when the required sum is not fixed]
= Coefficient of x 10 in (1 + x 4 + x 8 + x 12 + ...)
In this case, we introduce a dummy variable x m + 1 .
× (1 + x 3 + x 6 + x 9 + x 12 + K ) ×
So that,
(1 + x 2 + x 4 + x 6 + x 8 + x 10 + ...) × (1 + x + x 2 + x 3 + x 4
x 1 + x 2 + x 3 + K + x m + x m + 1 = n,
+ x 5 + x 6 + x 7 + x 8 + x 9 + x 10 + K )
xm +1 ≥ 0 …(ii)
= Coefficient of x 10 in
(1 + x 3 + x 6 + x 9 + x 4 + x 7 + x 10 + x 8 ) Here, the number of Sols of Eqs. (i) and (ii) will be same.
× (1 + x 2 + x 4 + x 6 + x 8 + x 10 )(1 + x + x 2 + x 3 y Example 99. Find the number of positive integral
+ x 4 + x 5 + x 6 + x 7 + x 8 + x 9 + x 10 ) solutions of the inequation 3x + y + z ≤ 30.
[neglecting higher powers] Sol. Let dummy variable w , then
= Coefficient of x 10 in 3x + y + z + w = 30, w ≥ 0 …(i)
(1 + x 2 + x 4 + x 6 + x 8 + x 10 + x 3 + x 5 + x 7 + x 9 + x 6 Now, let a = x − 1, b = y − 1, c = z − 1, d = w , then
+ x 8 + x 10 + x 9 + x 4 + x 6 + x 8 + x 10 + x 7 + x 9 + x 10 3a + b + c + d = 25, where a, b, c, d ≥ 0 …(ii)
∴ Number of positive integral solutions of Eq. (i)
+ x 8 + x 10 )(1 + x + x 2 + x 3 + x 4 + x 5 + x 6 + x 7
= Number of non-negative integral solutions of Eq. (ii)
+ x 8 + x 9 + x 10 ) [neglecting higher powers] = Coefficient of α 25 in (1 + α 3 + α 6 + K )
=1+1+1+1+1+1+1+1+1+1+1+1+1 (1 + α + α 2 + K )3
+ 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 = 23 = Coefficient of α 25
in (1 + α + α + K )(1 − α )−3
3 6

But x, y, z and w can be arranged in 4 P4 = 4 ! = 24 = Coefficient of α 25 in

Hence, required number of Sols = (23)(24 ) = 552 (1 + α 3 + α 6 + K )(1 + 3C 1α + 4C 2 α 2 + K )
= C 25 +
27 24
C 22 + 21C 19 + 18C 16 + 15C 13 + 12C 10 + 9C 7
y Example 98. In how many ways can 15 identical
blankets be distribted among six beggars such that + 6C 4 + 3C 1
everyone gets atleast one blanket and two particular = C2 +
27
C 2 + 21C 2 + 18C 2 + 15C 2 + 12C 2 + 9C 2
24

beggars get equal blankets and another three

+ 6C 2 + 3C 1
particular beggars get equal blankets.
= 351 + 276 + 210 + 153 + 105 + 66 + 36 + 15 + 3 = 1215
Aliter
396 Textbook of Algebra

From Eq. (ii), 3a + b + c + d = 25, where a, b, c, d ≥ 0 Total number of cases = 66 = 26 × 36 = 64 × 729 = 46656
Clearly, 0 ≤ a ≤ 8, if a = k , then and number of ways to get the sum less than or equal to 15,
b + c + d = 25 − 3k …(iii) which is 4501 [from Example 100]
Hence, number of non-negative integral solutions of Hence, the number of ways to get a sum greater than 15 is
Eq. (iii) is 46656 − 4501 = 42155
25 − 3k + 3 − 1 (27 − 3k )(26 − 3k )
C 3 − 1 = 27 − 3k C 2 = Case IV If the equation
2
3 2 x 1 x 2 x 3 K x n = 2 α1 ⋅ 3 α 2 ⋅ 5 α 3 K
= (3k − 53k + 234 )
2 where α 1 , α 2 , α 3 , K are natural numbers.
Therefore, required number is In this case number of positive integral solutions
3 8 ( x 1 , x 2 , x 3 , K, x n ) are
∑(3k 2 − 53k + 234 )
2k = 0 ( α 1 + n − 1 C n − 1 )( α 2 + n − 1 C n − 1 )( α 3 + n − 1 C n − 1 ) K
3   8 × 9 × 17  8 × 9 
= 3 ⋅   − 53 ⋅   + 234 × 9 = 1215
2  6   2   y Example 102. Find the total number of positive
integral solutions for ( x , y , z ) such that xyz = 24.
y Example 100. In how many ways can we get a sum
Sol. Q xyz = 24 = 23 × 31
of atmost 15 by throwing six distinct dice ?
Sol. Let x 1, x 2 , x 3 , x 4 , x 5 and x 6 be the number that appears Hence, total number of positive integral solutions
on the six dice. = ( 3 + 3 −1C 3 − 1 )( 1 + 3 − 1C 3 − 1 )
The number of ways = Number of solutions of the inequation = 5C 2 × 3C 2 = 30
x 1 + x 2 + x 3 + x 4 + x 5 + x 6 ≤ 15 Aliter
Introducing a dummy variable x 7 ( x 7 ≥ 0), the inequation Q xyz = 24 = 23 × 31
becomes an equation
Now, consider three boxes x , y , z .
x 1 + x 2 + x 3 + x 4 + x 5 + x 6 + x 7 = 15
3 can be put in any of the three boxes.
Here, 1 ≤ x i ≤ 6 for i = 1, 2, 3, 4, 5, 6 and x 7 ≥ 0.
Also, 2, 2, 2 can be distributed in the three boxes in
Therefore, number of solutions 3 + 3 −1
C 3 −1 = 5C 2 = 10 ways. Hence, the total number of
= Coefficient of x 15 in ( x + x 2 + x 3 + x 4 + x 5 + x 6 )6 positive integral solutions = the number of distributions
× (1 + x + x 2 + K ) which is given by 3 × 10 = 30.
−7
= Coefficient of x in (1 − x ) (1 − x )
9 6 6

= Coefficient of x 9 in (1 − 6x 6 )(1 + 7C 1x + 8C 2 x 2 + K ) Geometrical Problems

[neglecting higher powers]
(a) If there are n points in a plane out of these points no
= 15C 9 − 6 × 9C 3 = 15C 6 − 6 × 9C 3
three are in the same line exceptm points which are
= 5005 − 504 = 4501 collinear, then
Case III If the inequation (i) Total number of different lines obtained by
x 1 + x 2 + x 3 +K + x n ≥ n joining these n points is n C 2 − m C 2 + 1
[when the values of x 1 , x 2 ,…, x n are restricted] (ii) Total number of different triangles formed by
In this case first find the number of solutions of joining these n points is n C 3 − m C 3
x 1 + x 2 + x 3 + K + x n ≤ n − 1 and then subtract it (iii) Total number of different quadrilateral formed
from the total number of solutions. by joining these n points is
y Example 101. In how many ways can we get a sum
n
C 4 − ( m C 3 ⋅n C 1 + m C 4 ⋅ n C 0 )
greater than 15 by throwing six distinct dice?
y Example 103. There are 10 points in a plane out of
Sol. Let x 1, x 2 , x 3 , x 4 , x 5 and x 6 be the number that appears
these points no three are in the same straight line
on the six dice.
except 4 points which are collinear. How many
The number of ways = Number of solutions of the
inequation (i) straight lines (ii) trian-gles
x 1 + x 2 + x 3 + x 4 + x 5 + x 6 > 15 (iii) quadrilateral, by joining them?
Here, 1 ≤ x i ≤ 6, i = 1, 2, 3, 4, 5, 6 Sol. (i) Required number of straight lines
 Chap 05 Permutations and Combinations 397

10 ⋅ 9 4 ⋅ 3 n ( n − 1) n (n − 3) 14 × 11
= 10C 2 − 4C 2 + 1 = − + 1 = 45 − 6 + 1 = 40 ⇒ − n = 77 ⇒ =
1⋅2 1 ⋅2 2 2 2
we get, n = 14
(ii) Required number of triangles
(c) n straight lines are drawn in a plane such that no two
10 ⋅ 9 ⋅ 8 4
= 10C 3 − 4C 3 = − C 1 = 120 − 4 = 116 of them are parallel and no three of them are
1 ⋅2 ⋅3 concurrent. Then, number of parts into which these
(iii) Required number of quadrilaterals lines divides the plane is equal to
= 10C 4 − ( 4 C 3 ⋅ 6C 1 + 4C 4 ⋅ 6C 0 )
n
(n 2 + n + 2 )
1 + ∑ k, .e.
10 ⋅ 9 ⋅ 8 ⋅ 7 k =1 2
= − ( 4C 1 ⋅6 C 1 + 1.1)
1 ⋅2 ⋅3 ⋅ 4
y Example 107. If n lines are drawn in a plane such
= 210 − ( 4 × 6 + 1) = 210 − 25 = 185
that no two of them are parallel and no three of them
(b) If there are n points in a plane out of these points no are concurrent, such that these lines divide the plane
any three are collinear, then in 67 parts, then find number of different points at
(i) Total points of intersection of the lines joining which these lines will cut.
these n points = p C 2 , where p = n C 2 Sol. Given number of straight lines = n , then
(ii) If n points are the vertices of a polygon, then n
n2 + n + 2
n(n − 3 )
1+ ∑k = 67 ⇒
2
= 67
total number of diagonals = n C 2 − n = k =1
2 ⇒ n + n − 132 = 0 ⇒ (n + 12) (n − 11) = 0
2

y Example 104. How many number of points of ∴ n = 11, n ≠ − 12

intersection of n straight lines, if n satisfies 11 ⋅ 10
Hence, required number of points = n C 2 = 11C 2 =
n +5 11(n − 1) n +3 2
Pn +1 = × Pn ? = 55
2
(d) If m parallel lines in a plane are intersected by a
n+5 11(n − 1) n + 3
Sol. We have, Pn +1 = × Pn family of other n parallel lines. Then, total number of
2
parallelograms so formed
(n + 5)! 11(n − 1) (n + 3)!
⇒ = × mn (m − 1) (n − 1)
4! 2 3! = mC 2 ⋅n C 2 i.e.,
4
(n + 5) (n + 4 ) 11(n − 1)
⇒ =
4 2 y Example 108. Find number of rectangles in a chess
⇒ n − 13n + 42 = 0 ⇒ (n − 6) (n − 7 ) = 0
2 board, which are not a square.
⇒ n = 6 or n = 7 Sol. Number of rectangles = 9C 2 × 9C 2 = (36)2 = 1296

The number of points of intersection of lines is 6 C 2 or 7 C Number of squares = 8 × 8 + 7 × 7 + 6 × 6 + … + 1 × 1

= 204
= 15 or 21
∴ Required number = 1296 − 204 = 1092
y Example 105. The interior angles of a regular 1 2 3 4 5 6 7 8 9
polygon measure 150° each. Then, find the number of
2
diagonals of the polygon.
3
Sol. Each exterior angle = 30°
4
π
360 × 5
360° 180
∴ Number of sides = = = 12 6
30° π
30 × 7
180 8
∴ Number of diagonals = C 2 − 12 = 66 − 12 = 54
12
9
Square can be formed as follows :
y Example 106. In a polygon the number of diagonals is
To form the smallest square, select any two consecutive
77. Find the number of sides of the polygon. lines from the given (here 9) vertical and horizontal lines.
Sol. Let number of sides of the polygon = n, then n C 2 − n = 77 This can be done in 8 × 8 ways (1-2, 2-3, 3-4, …, 8-9)
398 Textbook of Algebra

Again, to form the square consists of four small squares, Sol. The required number of ways
select the lines as follows (1-3, 2-4, 3-5,…, 7-9) from both = Coefficient of x 6 in ( 2 C 1x + 2C 2 x 2 ) ( 4 C 1x + 4C 2 x 2
vertical and horizontal lines, thus 7 × 7 squares are
obtained. Proceed in the same way) + 4C 3 x 3 + 4C 4 x 4 ) ( 2 C 1x + 2C 2 x 2 )
Note If n parallel lines are intersected by another n parallel lines, = Coefficient of x 3 in (2 + x )2 ( 4 + 6x + 4 x 2 + x 3 )
( n − 1) n ( 2n − 1)
then number of rhombus = ∑ ( n − 1) =
2
6 = Coefficient of x 3 in ( 4 + 4 x + x 2 ) ( 4 + 6x + 4 x 2 + x 3 )
(e) Number of Rectangles and Squares = 4 + 16 + 6
(i) Number of rectangles of any size in a square of = 26
n
n × n is ∑ r 3 and number of squares of any Aliter
r =1 In the given figure there are 8 squares and we have to place
n 6X ’s this can be done in
size is ∑ r 2 . 8 ⋅7
r =1
8
C 6 = 8C 2 = = 28 ways
1⋅2
(ii) In a rectangle of n × p (n < p ) number of
But these include the possibility that either headed row or
np
rectangles of any size is (n + 1) ( p + 1) and lowest row may not have any X . These two possibilities are
4 to be excluded.
number of squares of any size is ∴ Required number of ways = 28 − 2 = 26
n
∑ (n + 1 − r ) ( p + 1 − r ).
r =1 X X

y Example 109. Find the number of rectangles X X X X OR X X X X

excluding squares from a rectangle of size 9 × 6.
Sol. Here, n = 6 and p = 9 X X

∴ Number of rectangles excluding square

6 ⋅9 6
y Example 111. In how many ways the letters of the
= (6 + 1) (9 + 1) − ∑ (7 − r ) (10 − r )
4 r =1 word DIPESH can be placed in the squares of the
6
adjoining figure so that no row remains empty?
= 945 − ∑(70 − 17r + r 2 ) = 945 − 154 = 791
r =1

(f) If there are n rows, first row has α 1 squares, 2nd row
has α 2 squares, 3rd row has α 3 squares, ... and nth
row has α n squares. If we have to filled up the
squares with β X s such that each row has atleast
one X. The number of ways = Coefficient of x β in
( α1 C1 x + α2
C 2 x 2 +… + α 1 C α 1 x α 1 )
× ( α 2 C 1 x + α 2 C 2 x 2 +… + α2
Cα2 x α2 )
× ( α 3 C 1 x + α 3 C 2 x 2 +… + α 3 C α 3 x α 3 ) ×
… × ( α n C 1 x + α n C 2 x 2 +… + α n C α n x α n ) Sol. If all letters are same, then number of ways
= Coefficient of x 6 in ( 3C 1x + 3C 2 x 2 + 3C 3 x 3 )3 ( 1C 1x )2
y Example 110. Six X ’s have to be placed in the = Coefficient of x in (3 + 3x + x 2 )3
squares of the figure below, such that each row
contains atleast one X. In how many different ways = Coefficient of x in (3 + 3x )3
can this be done? [neglecting higher degree term]
= 27 × 3C 1 = 81
But in DIPESH all letters are different.
∴ Required number of ways = 81 × 6!
 Chap 05 Permutations and Combinations 399

#L Exercise for Session 6

1. If number of ways in which 7 different balls can be distributed into 4 different boxes, so that no box remains
empty is 100 λ, the value of λ is
(a) 18 (b) 108 (c) 1008 (d) 10008

2. If number of ways in which 7 different balls can be distributed into 4 boxes, so that no box remains empty is
48 λ, the value of λ is
(a) 231 (b) 331 (c) 431 (d) 531

3. If number of ways in which 7 identical balls can be distributed into 4 boxes, so that no box remains empty is4λ,
the value of λ is
(a) 5 (b) 7 (c) 9 (d) 11

4. Number of non-negative integral solutions of the equation a + b + c = 6 is

(a) 28 (b) 32 (c) 36 (d) 56

5. Number of integral solutions of a + b + c = 0, a ≥ − 5, b ≥ − 5 and c ≥ − 5, is

(a) 272 (b) 136 (c) 240 (d) 120

6. If a, b and c are integers and a ≥ 1, b ≥ 2 and c ≥ 3. If a + b + c = 15, the number of possible solutions of the
equation is
(a) 55 (b) 66 (c) 45 (d) None of these

7. Number of integral solutions of 2x + y + z = 10 (x ≥ 0, y ≥ 0, Z ≥ 0) is

(a) 18 (b) 27 (c) 36 (d) 51

8. A person writes letters to six friends and addresses the corresponding envelopes. Let x be the number of ways
so that atleast two of the letters are in wrong envelopes and y be the number of ways so that all the letters are
in wrong envelopes. Then, x − y is equal to
(a) 719 (b) 265 (c) 454 (d) None of these

9. A person goes for an examination in which there are four papers with a maximum ofm marks from each paper.
The number of ways in which one can get 2 m marks, is
(b)   (m + 1) (2m 2 + 4m + 1)
2 m+ 3 1
(a) C3
 3

(c)   (m + 1) (2m 2 + 4m + 3)
1
(d) None of these
 3

10. The number of selections of four letters from the letters of the word ASSASSINATION, is
(a) 72 (b) 71 (c) 66 (d) 52

11. The number of positive integral solutions of 2x1 + 3x 2 + 4x 3 + 5x4 = 25, is

(a) 20 (b) 22 (c) 23 (d) None of these

12. If a, b , and c are positive integers such that a + b + c ≤ 8, the number of possible values of the ordered triplet (
a, b , c ) is
(a) 84 (b) 56 (c) 83 (d) None of these

13. The total number of positive integral solutions of 15 < x1 + x 2 + x 3 ≤ 20 is equal to

(a) 685 (b) 785 (c) 1125 (d) None of these

14. The total number of integral solutions for ( x , y , z ) such that xyz = 24, is
(a) 36 (b) 90 (c) 120 (d) None of these

15. There are 12 points in a plane in which 6 are collinear. Number of different straight lines that can be drawn by
joining them, is
(a) 51 (b) 52 (c) 132 (d) 18
400 Textbook of Algebra

16. 4 points out of 11 points in a plane are collinear. Number of different triangles that can be drawn by joining
them, is
(a) 165 (b) 161 (c) 152 (d) 159

17. The number of triangles that can be formed with 10 points as vertices, n of them being collinear, is 110. Then, n
is
(a) 3 (b) 4 (c) 5 (d) 6

18. ABCD is a convex quadrilateral. 3, 4, 5 and 6 points are marked on the sides AB, BC, CD and DA, respectively.
The number of triangles with vertices on different sides, is
(a) 270 (b) 220 (c) 282 (d) None of these

19. There are 10 points in a plane of which no three points are collinear and 4 points are concyclic. The number of
different circles that can be drawn through atleast 3 points of these points, is
(a) 116 (b) 120 (c) 117 (d) None of these

20. 4 points out of 8 points in a plane are collinear. Number of different quadrilateral that can be formed by joining
them, is
(a) 56 (b) 60 (c) 76 (d) 53

21. There are 2n points in a plane in which m are collinear (n > m > 4). Number of quadrilateral formed by joining
these lines
(a) is equal to C4 − mC4
2n
(b) is greater than C4 − mC4
2n

(c) is less than 2n

C4 − mC4 (d) None of these

22. In a polygon the number of diagonals is 54. The number of sides of the polygon, is
(a) 10 (b) 12 (c) 9 (d) None of these

23. In a polygon no three diagonals are concurrent. If the total number of points of intersection of diagonals interior
to the polygon be 70, then the number of diagonals of the polygon, is
(a) 20 (b) 28 (c) 8 (d) None of these

24. n lines are drawn in a plane such that no two of them are parallel and no three of them are concurrent. The
number of different points at which these lines will cut, is
n −1
(a) ∑k (b) n (n − 1) (c) n 2 (d) None of these
k =1

25. Six straight lines are drawn in a plane such that no two lines are parallel and no three lines are concurrent. Then,
the number of parts into which these lines divide the plane, is
(a) 15 (b) 22 (c) 29 (d) 36

26. A parallelogram is cut by two sets of m lines parallel to its sides. The number of parallelogram thus formed, is
(a) ( mC2 )2 (b) ( m + 1C2 )2 (c) ( m + 2C2 )2 (d) None of these

27. The number of rectangles excluding squares from a rectangle of size 11 × 8 is 48λ, then the value of λ is
(a) 13 (b) 23 (c) 43 (d) 53

28. The number of ways the letters of the word PERSON can be placed in the squares of the figure shown so that
no row remains empty, is

R1

R2

R3

(a) 24 × 6 ! (b) 26 × 6 ! (c) 26 × 7 ! (d) 27 × 7 !

Session 7
Rank in a Dictionary, Gap Method

Rank in a Dictionary y Example 113. If letters of the word are arranged as in

The dictionary format means words are arranged in dictionary, find the rank of the following words.
alphabetical order. (i) INDIA (ii) SURITI (iii) DOCOMO
Following Examples will help you learn how to find the Sol. (i) The letters in alphabetical order are A, D, I, I, N
rank in the dictionary. ∴ The first word is ADIIN
4!
Number of words beginning with A = = 12
y Example 112. If the letters of the word are arranged 2!
as in dictionary, find the rank of the following words. Number of words beginning with D =
4!
= 12
(i) RAJU (ii) UMANG 2!
(iii) AIRTEL Number of words beginning with IA = 3 ! = 6
Sol. (i) In a dictionary, the letters in alphabetical order are Number of words beginning with ID = 3 ! = 6
A, J, R, U Number of words beginning with II = 3 ! = 6
∴ The first word is AJRU. Number of words beginning with INA = 2 ! = 2
Number of words beginning with INDA = 1 ! = 1
Number of words beginning with A = Number of Number of words beginning with INDIA = 1
ways arranging J, R, U = 3 ! = 6
∴ Rank of the word INDIA
Number of words beginning with J = 3 ! = 6
= 12 + 12 + 6 + 6 + 6 + 2 + 1 + 1 = 46
The next word begin with R and it is RAJU.
(ii) The letters in alphabetical order are I, I, R, S, T, U
∴ Number of words before RAJU = 12 ∴ The first word is IIRSTU
∴ Rank of word RAJU = 13 Number of words beginning with I = 5 ! = 120
5!
(ii) The letters in alphabetical order are A, G, M, N, U Number of words beginning with R = = 60
2!
∴ The first word is AGMNU Number of words beginning with SI = 4 ! = 24
Number of words beginning with A = 4 ! = 24 4!
Number of words beginning with SR = = 12
Number of words beginning with G = 4 ! = 24 2!
Number of words beginning with M = 4 ! = 24 4!
Number of words beginning with N = 4 ! = 24 Number of words beginning with ST = = 12
2!
Number of words beginning with UA = 3 ! = 6 Number of words beginning with SUI = 3 ! = 6
Number of words beginning with UG = 3 ! = 6 Number of words beginning with SURII = 1 ! = 1
Number of words beginning with UMAG = 1 ! = 1 Number of words beginning with SURITI = 1
Number of words beginning with UMANG = 1 ∴ Rank of the word SURITI
∴ Rank of the word = 120 + 60 + 24 + 12 + 12 + 6 + 1 + 1 = 236
UMANG = 24 + 24 + 24 + 24 + 6 + 6 + 1 + 1 = 110 (iii) The letters in alphabetical order are C, D, M, O, O, O
(iii) The letters in alphabetical order are A, E, I, L, R, T ∴ The first word is CDMOOO
5!
∴ The first word is AEILRT Number of words beginning with C = = 20
3!
Number of words beginning with AE = 4 ! = 24 4!
Number of words beginning with DC = =4
Number of words beginning with AIE = 3 ! = 6 3!
Number of words beginning with AIL = 3 ! = 6 4!
Number of words beginning with DM = =4
Number of words beginning with AIRE = 2 ! = 2 3!
Number of words beginning with AIRL = 2 ! = 2 2!
Number of words beginning with DOCM = =1
Number of words beginning with AIRTEL = 1 2!
Number of words beginning with DOCOMO = 1
∴ Rank of the word AIRTEL= 24 + 6 + 6 + 2 + 2 + 1 = 41
∴ Rank of the word DOCOMO = 20 + 4 + 4 + 1 + 1 = 30
402 Textbook of Algebra

Gap Method y Example 117. Find the number of ways in which 5

girls and 5 boys can be arranged in a row, if boys and
[when particular objects are girls are alternate.
never together] Sol. First five girls can be arranged in 5 ! ways
i.e., × G × G × G × G × G or G × G × G × G × G ×
y Example 114. There are 10 candidates for an
Now, if girls and boys are alternate, then boys can occupy
examination out of which 4 are appearing in places with ‘ × ’ as shows above.
Mathematics and remaining 6 are appearing in Hence, total number of arrangements is
different subjects. In how many ways can they be 5 ! × 5 ! + 5 ! × 5 ! = 2 × (5 !)2
seated in a row so that no two Mathematics Use of Set Theory
candidates are together? A set is well defined collection of distinct objects.
Sol. In this method first arrange the remaining candidates
Subset
Here, remaining candidates = 6
If every element of a set A is also an element of a set B,
×0×0×0×0×0×0× then A is called the subset B, we write
× : Places available for Mathematics candidates
A ⊂ B ⇔ {x ∈ A ⇒ x ∈ B }
0 : Places for others Union
Remaining candidates can be arranged in 6 ! ways. There
are seven places available for Mathematics candidates so The union of two sets A and B is the set of all those
that no two Mathematics candidates are together. Now, elements which are either in A or in B or in both. This set is
four candidates can be placed in these seven places denoted by A ∪ B or A + B.
in 7 P4 ways. Symbolically, A ∪ B = { x : x ∈ A or x ∈ B }
Hence, the total number of ways = 6 ! × P4 = 720 × 840
7
Intersection
= 604800 The intersection of two sets A and B is the set of all
elements which are common in A and B. This set is denoted
y Example 115. In how many ways can 7 plus (+ ) and 5 by A ∩ B or AB.
minus ( − ) signs be arranged in a row so that no two Symbolically, A ∩ B = { x : x ∈ A and x ∈ B }
minus ( − ) signs are together?
Sol. In this method, first arrange the plus ( + ) signs. y Example 118. A is a set containing n elements. A
Here, minus ( − ) signs = 5 subset P1 of A is chosen. The set A is reconstructed
0+0+0+0+0+0+0+0 by replacing the elements of P1 . Next, a subset P2 of
We can put minus ( − ) sign in any of the 8 places in the A is chosen and again the set is reconstructed by
above arrangement i.e., we have to select 5 places out of 8 replacing the elements of P2 . In this way m (> 1)
which can be done is 8 C 5 ways = 8C 3 ways = 56 ways.
subsets P1 , P2 , ..., Pm of A are chosen. Find the
y Example 116. Find the number of ways in which 5 number of ways of choosing P1 , P2 , ..., Pm , so that
girls and 5 boys can be arranged in a row, if no two
(i) P1 ∩ P2 ∩ P3 ∩ ... ∩ Pm = φ
boys are together.
Sol. In this example, there is no condition for arranging the (ii) P1 ∪ P2 ∪ P3 ∪ ... ∪ Pm = A
girls. Now, 5 girls can be arranged in 5 ! ways. Sol. Let A = {a1, a 2 , a 3 , ..., an }
×G ×G ×G ×G ×G × (i) For each ai (1 ≤ i ≤ n ), we have either a ∈ P j or
When girls are arranged, six gaps are generated as shown ai ∉ P j (1 ≤ j ≤ m ). i.e., there are 2m choices in which
above with ‘× ’. ai (1 ≤ i ≤ n ) may belong to the P j ’s.
Now, boys must occupy the places with ‘×’ marked, so that
no two boys are together. Out of these, there is only one choice, in which ai ∈ P j
for all j = 1, 2, ..., m which is not favourable for
Therefore, five boys can be arranged in these six gaps in
6
P5 ways. P1 ∩ P2 ∩ P3 ∩ ... ∩ Pm to be φ. Thus,
ai ∉ P1 ∩ P2 ∩ ... ∩ Pm in (2m − 1) ways. Since, there
Hence, total number of arrangement is 5 ! × 6 P5 .
are n elements in the set A, the total number of
choices is (2m − 1)n .
 Chap 05 Permutations and Combinations 403

(ii) There is exactly one choice, in which, ai ∈ P j for all y Example 120. Find the sum of the digits in the unit’s
j = 1, 2, 3, ..., m which is not favourable for place of all numbers formed with the help of 3, 4, 5, 6
P1 ∪ P2 ∪ P3 ∪ ... ∪ Pm to be equal to A. Thus, ai can taken all at a time.
belong to P1 ∪ P2 ∪ P3 ∪ ... ∪ Pm in (2m − 1) ways. Sol. Sum of the digits in the unit’s place
Since, there are n elements in the set A, the number of = ( 4 − 1) ! (3 + 4 + 5 + 6) = 6 × 18 = 108
ways in which P1 ∪ P2 ∪ P3 ∪ ... ∪ Pm can be equal to (ii) The sum of all digit numbers that can be formed using
A is (2m − 1)n . the digits a1, a 2 , ..., an (repetition of digits not allowed)
(10n − 1)
is = (n − 1) ! (a1 + a 2 + K + an )
y Example 119. A is a set containing n elements. A 9
subset P of A is chosen. The set A is reconstructed y Example 121. Find the sum of all five digit
by replacing the elements of P. A subset of A is numbers that can be formed using the digits 1, 2, 3,
again chosen. Find the number of ways of choosing 4 and 5 (repetition of digits not allowed)
P and Q, so that  105 − 1
Sol. Required sum = (5 − 1) ! (1 + 2 + 3 + 4 + 5)  
(i) P ∩ Q contains exactly r elements.  9 
= 24 ⋅ 15 ⋅ 11111 = 3999960
(ii) P ∩ Q contains exactly 2 elements. Aliter
(iii) P ∩ Q = φ Since, one of the numbers formed with the 5 digits a, b, c , d
Sol. Let A = {a1, a 2 , a 3 , ..., an } and e is 104 a + 103 b + 102 c + 10d + e ;
(i) The r elements in P and Q such that P ∩ Q can be Hence, 104 a will occur altogether in 4 ! ways similarly each
chosen out of n is n C r ways a general element of A of 104 b, 104 c , 104 d , 104 e will occur in 4 ! ways.
must satisfy one of the following possibilities [here, Hence, if all the numbers formed with the digits be written
general element be ai (1 ≤ i ≤ n )] one below the other, thus
(i) ai ∈ P and ai ∈ Q
104 ⋅ a + 103 ⋅ b + 102 ⋅ c + 10 ⋅ d + e
(ii) ai ∈ P and ai ∉Q
(iii) ai ∈ P and ai ∈ Q 104 ⋅ b + 103 ⋅ c + 102 ⋅ d + 10 ⋅ e + a
(iv) ai ∉ P and ai ∉Q 104 ⋅ c + 103 ⋅ d + 102 ⋅ e + 10 ⋅ a + b
Let a1, a 2 , ..., ar ∈ P ∩ Q
104 ⋅ d + 103 ⋅ e + 102 ⋅ a + 10 ⋅ b + c
There is only one choice each of them (i.e., (i) choice)
and three choices (ii), (iii) and (iv) for each of 104 ⋅ e + 103 ⋅ a + 102 ⋅ b + 10 ⋅ c + d
remaining (n − r ) elements. Hence, the required sum
Hence, number of ways of remaining elements = 3n − r
= 4 ! × (a + b + c + d + e ) × (104 + 103 + 102 + 10 + 1)
Hence, number of ways in which P ∩ Q contains
= 4 ! × (1 + 2 + 3 + 4 + 5) (11111) = 3999960
exactly r elements = n C r × 3n − r
(i) Put r = 2, then n C 2 × 3n − 2 Difference between Permutation and Combination
(iii) Put r = 0, then n C 0 × 3n = 3n Problems of permutations Problems of combinations
1. Arrangements Selections, choose
Sum of digits
2. Standing in a line, seated in a row Distributed group is formed
(i) The sum of the digits in the unit’s place of all numbers 3. Problems on digits Committee
formed with the help of a1, a 2 , ..., an taken all at a time
is (n − 1) ! (a1 + a 2 + K + an ) 4. Problems on letters from a word Geometrical problems
(repetition of digits not allowed)
404 Textbook of Algebra

#L Exercise for Session 7

1. The letters of the word ‘‘DELHI’’ are arranged in all possible ways as in a dictionary, the rank of the word
‘‘DELHI’’ is
(a) 4 (b) 5
(c) 6 (d) 7

2. The letters of the word ‘‘KANPUR’’ are arranged in all possible ways as in a dictionary, the rank of the word
‘‘KANPUR’’ from last is
(a) 121 (b) 122
(c) 598 (d) 599

3. The letters of the word ‘‘MUMBAI’’ are arranged in all possible ways as in a dictionary, the rank of the word
‘‘MUMBAI’’ is
(a) 297 (b) 295
(c) 299 (d) 301

4. The letters of the word ‘‘CHENNAI’’ are arranged in all possible ways as in a dictionary, then rank of the word
‘‘CHENNAI’’ from last is
(a) 2016 (b) 2017
(c) 2018 (d) 2019

5. If all permutations of the letters of the word ‘‘AGAIN’’ are arranged as in a dictionary, then 50th word is
(a) NAAGI (b) NAGAI
(c) NAAIG (d) NAIAG
 Shortcuts and Important Results to Remember
1 When two dice are thrown, the number of ways of getting 11 Highest power of prime p in n Cr , since
a total r (sum of numbers on upper faces), is n!
n
Cr =
(i) r − 1, if 2 ≤ r ≤ 7 r ! (n − r ) !
(ii) 13 − r, if 8 ≤ r ≤ 12
If Hp (n !) = α,
2 When three dice are thrown, the number of ways of
getting a total r (sum of numbers on upper faces), is Hp (r !) = β

(i) r −1
C2 , if 3 ≤ r ≤ 8 and Hp {(n − r ) !} = γ

(ii) 25, if r = 9 Then, Hp (n Cr ) = α − ( β + γ )

(iii) 27, if r = 10, 11 12 Highest power of prime p in n Pr , since
(iv) 25, if r = 12 n!
(v) 20 − r
C2 , if 13 ≤ r ≤ 18
n
Pr =
(n − r ) !
3 The product of k consecutive positive integers is divisible If Hp (n !) = λ , Hp {(n − r ) !} = µ. Then, Hp (n Pr ) = λ − µ
by k !.
4 Number of zeroes in n ! = E5 (n !) 13 If there are n rows. Ist row has m1squares, IInd row has m2
squares, IIIrd row has m3 squares and so on. If we placed
5 n straight lines are drawn in the plane such that no two
λ X’s in the squares such that each row contains atleast
lines are parallel and no three lines are concurrent. Then,
one X. Then the number of ways = Coefficient of x λ in
the number of parts into which these lines divides the
(n 2 + n + 2 ) ( m 1 C1 x + m 1 C2 x 2 + ...+ m1
Cm 1 x m 1 )
plane is equal to .
2 × ( m2 C1 x + m2 C2 x 2 + m2
C3 x 3 + ...+ m2
Cm 2 x m2 ) ×
6 n
Cr is divisible by n only, if n is a prime number ( m3 C1 x + m3 C2 x 2 + ... + m3
Cm3 x m3 ) ×...
(1 ≤ r ≤ n − 1).
1 1 1
7 The number of diagonals in n-gon (n sides closed If + = , ∀ x, y, n ∈ N
x y n
n(n − 3)
polygon) is .
2 ⇒ ( x − n) ( y − n) = n2
8 In n-gon no three diagonals are concurrent, then the total ∴ x = n + λ,
number of points of intersection of diagonals interior to
n2
the polygon is n C4 . y =n+ ,
λ
9 Consider a polygon of n sides, then number of triangles in
where λ is divisor of n 2 .
which no side is common with that of the polygon are
1 Then, number of integral solutions ( x, y ) is equal to
n (n − 4) (n − 5).
6 number of divisors of n 2 .
10 If m parallel lines in a plane are intersected by a family of If n = 3, n 2 = 9 = 32 , the equation has 3 solutions.
other n parallel lines. The total number of parallelograms ( x, y ) = (4, 12 ), (6, 6), (12, 4)
mn(m − 1)(n − 1)
so formed = mC2 ⋅n C2 =
4