You are on page 1of 17

08.

Permutations & Combinations


08. Permutations & Combinations
01. Factorial
Factorial The continued product of first n natural numbers is called the “n factorial” and is
denoted by ⌊ or n! i.e.
n! = 1 × 2 × 3 × 4 × ... × (n – 1) × n

02. Exponent of Prime p In Factorial n


Let p be a prime number and n be a positive integer.
Let Ep (n) denote the exponent of the prime p in the positive inter n. Then,
       
              
      
where s is the largest positive integer such that ps ≤ n < ps+1

03. Some Useful Symbols


If n is a natural number and r is a positive integer satisfying 0 ≤ r ≤ n, then the natural

number  is denoted by the symbol nPr or, P (n, r).
 

i.e.,      
 

If n is a natural number and r is a positive integer satisfying 0 ≤ r ≤ n, then the natural



number  is denoted by the symbol nCr, or, C(n, r). Thus,
  
n 
Cr = C (n, r) = 
  

n
Property I Cr = nCn–r , for 0 ≤ r ≤ n.

Remark The above property can be restated as follow:


If x and y are non-negative integers such that nCx = nCy , then x = y or, x + y = n.

Property II Let n and r be non-negative integers such that 1 ≤ r ≤ n.



Then, nCr =            nCr–1 = n+1Cr

Property III Let n and r be non-negative integers such that 1 ≤ r ≤ n.

Then, nCr =       

Property IV If 1 ≤ r ≤ n, then n. n-1Cr–1 = (n – r + 1)nCr-1
Property V If n is even, then the greatest value of nCr (0 ≤ r ≤ n) is nCn/2.

2
08. Permutations & Combinations
 
n
     
Property VI If n is odd, then the greatest value of Cr (0 ≤ r ≤ n) is  or 
 

04. Fundamental Principles of Counting


Fundamental Principle of Multiplication If there are two jobs such that one of them can be
completed in m ways, and when it has been completed in any one of these m ways, second
job can be completed in n ways; then the jobs in succession can be completed in m × n
ways.

Remark The above principle can be extended for any finite number of jobs as stated below:
If there are n jobs J1, J2, ... Jn such that job Ji can be performed independently in mi
ways in which all the jobs can be performed is m1×m2×m3× ... ×mn.

Fundamental Principle of Addition If there are two jobs such that they can be performed
independently in m and n ways respectively, then either of the two jobs can be performed in
(m + n) ways.

05. Permutations and Combinations


Combination Each of the different selections made by takin some or all of a number of
distinct objects or items, irrespective of their arrangements or order in which they are
placed, is called a combination.
Permutations Each of the different arrangements which can be made by taking some or all of
a number of distinct objects is called a permutation.

Results I Let r and n be positive integers such that 1 ≤ r ≤ n. Then, prove that the
number of all permutations of n distinct items or objects taken r at a time is
n(n – 1) (n – 2) (n – 3) ... (n – (r – 1))

Remark 1 We have,
n (n – 1) (n – 2) ... (n – (r – 1))
           
=     
   
So, the total number of arrangements (permutations) of n-distinct items, taking r at a
time is nPr or P(n, r).

Results II The number of all permutations (arrangements) of n distinct objects taken all at
a time is n!

3
08. Permutations & Combinations

Results III The number of ways of selecting r items or objects from a group of n distinct
items or objects is

   
  

Remark 2 Let there be n-distinct objects which are to be arranged in a row by taking r-at a
time. The job of arranging n items by taking r at a time can be divided into two
ordered sub-jobs J1 and J2 given by
J1 : Selecting r items from n-distinct items.
J2 : Arranging r selected items.

Remark 3 Sum of the numbers formed by n non-zero digits


  
= (sum of the digits) (n – 1)! 
   

06. Permutations of Objects Not All Distinct


Results I The number of mutually distinguishable permutations of n things, taken all at a
time, of which p are alike of one kind, q alike of second, such that p + q = n,

is 
 

Remark 1 The number of permutations of n things, of which 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 + ... + pr = n, is


        

Remark 2 The number of permutations of n things, of which p are alike of one kind, q are
alike of second kind and remaining all are distinct, is


 

Remark 3 Suppose there are r things to be arranged, allowing repetitions, Let further p1,
p2, ... pr be the integers such that the first object occurs exactly p1 times, the second
occurs exactly p2 times, etc. Then, the total number of permutations of these r objects
to the above condition is
     

        

4
08. Permutations & Combinations
07. Circular Permutations
Results 1 The number of circular permutations of n distinct objects is (n – 1)!

NOTE ☞ In the above theorem anticlockwise and clockwise order of arrangements are considered as
distinct permutations.

Difference Between Clockwise and Anticlockwise Arrangements The number of circular


permutation of n things in which clockwise and anticlockwise arrangements give rise to
different permutations is (n – 1)!. For example, the number of permutations of 5 persons
seated around a table is (5 – 1)! = 4!. Because with respect to the table, the clockwise and
anticlockwise arrangements are distinct.
If anticlockwise and clockwise order of arrangements are not distinct e.g. arrangements of
beads in necklace, arrangements of flowers in a garland etc. then the number of circular

permutations of n distinct items is  {(n – 1)!}.

08. Selection of One or More Objects


1. Selection From Different Items
Results I The number of ways of selecting one or more items from a group of n distinct
items is 2n – 1.

2. Selection From Identical Objects


Results I The number of ways of selecting r items out of n identical items is 1.
Results II The total number of ways of selecting zero or more i.e. at least one item from a
group of n identical items is (n+1).
Results III The total number of selections of some or all out of p + q + r items where p
are alike of one kind, q are alike of second kind and rest are alike of third
kind is [(p + 1) (q + 1) (r + 1)] –1.

3. Selection From Identical and Distinct Objects


Results II The total number of ways of selecting one or more items from p identical items
of one kind; q identical items of second kind; r identical items of third kind and
n different items is (p + 1) (q + 1) (r + 1) 2n – 1

5
08. Permutations & Combinations
09. Number and Sum of the Divisors
   
Number of divisors of                
(n1 + 1) (n2 + 1) (n3 + 1) ... (nk + 1).

This includes 1 and n as divisors. Therefore, number of divisors other than 1 and n is
(n1 + 1) (n2 + 1) (n3 + 1) ... (nk + 1) –2.
The sum of all divisors of (i) is given by
   

  
        
 
  
  
      


  
 
                
 
 
 
 
 
    

=    


                   
       

10. Division of Objects into Groups


I. Division Into Groups of Unequal Size
Result Number of ways in which (m + n) distinct items can be divided into two unequal
groups containing m and n items is
 
 

Remark 1 The number of ways in which (m+n+p) items can be divided into unequal groups
containing m, n, p items, is
    
      
  

Remark 2 The number of ways to distribute (m+n+p) items among 3 persons in the groups
containing m, n and p items is
  
(No. of ways to devide) × (No. of groups)! =  ×
  

II. Division Into Groups of Equal Size


The Number of ways in which mn different objects can be divided equally into m groups,
  
each containing n objects and the order of the groups is not important, is 
 
  
The number of ways in which mn different items can be divided equally into m groups, each
  
containing n objects and the order of groups is important, is 


×    
  

6
08. Permutations & Combinations

III. Division of Identical Objects Into Groups


Result The total number of ways of dividing n identical items among r persons, each one
of whom, can receive 0, 1, 2, or more items (≤ n) is n+r–1Cr–1
OR
The total number of ways of dividing n identical objects into r groups, if blank groups are
allowed, is n+r–1Cr–1.

Remark 1 As discussed above, the number of ways of dividing n identical objects among r groups (or
distributing n identical objects among r persons, is n+r–1Cr–1.
n+r–1    
but, Cr–1 =  which is equal to the number of ways of arranging n
  
identical objects of one kind and (r – 1) identical objects of other kind in a raw.
Thus, the number of ways of distributing n identical objects among r person is same
as the number of ways of arranging n identical objects of one kind and (r – 1)
identical objects of other kind in a raw.

Results The total number of ways of dividing n identical items among r persons, each one
of whom, receives at least one item is n–1Cr–1.
OR
The number of ways in which n identical items can be divided into r groups such
that blank groups are not allowed, is n–1Cr–1.

Remark 2 We have,
n–1  
Cr–1 = 
    
This is the number of ways of arranging (n – r) identical objects of one kind and
(r – 1) identical objects of other kind in a row. Thus, the number of ways of dividing
n identical objects among r persons each one of whom, receives at least one object is
same as the number of ways of arranging (n – r) identical objects of one kind
(r – 1) identical objects of other kind in a raw.

Results The number of ways in which n identical items can be divided into r groups so
that no group contains less than m items and more than k (m < k), is
Coefficient of xn in the expansion of (xm + xm+1 + ... + xk)r

11. Number of Integral Solution of Linear Equations and In-Equations


I. Consider the equation
x1 + x2 + x3 + x4 + ... + xr = n
Where x1, x2, x3, x4, ... xr and n are non-negative integers.
This equation may be interpreted as that n identical objects are to be divided into r groups
where a group may contain any number of objects.
Total number of solution of equation ...(i)

7
08. Permutations & Combinations

II. Let us consider the equation


x1 + x2 + x3 + ... + xm = n ...(ii)
Where x1, x2, ... xm are integers such that
ai ≤ xi ≤ bi ; i = 1, 2, ..., m
Total number of solution of equation (ii)
= Coefficient of xn in                      
      

    
   
    

III. ax1 + bx2 + cx3 = n ...(iii)


where x1, x2, x3 are integers such that
ai ≤ xi ≤ bi ; i = 1, 2, 3
The total number of solution of this equation is equal to
Coefficient of xn in                    
     

         


  

Remark 1 The total number of non-negative integral solutions of the equation x1 + x2 + ... + xr = n is
n+r–1
Cr–1 and the total number of solution of the same equation in the set N of natural
numbers is r–1Cr–1.

Remark 2 If the upper limit of a variable in solving an equation of the form x1 + x2 + ... + xm = n
subject to the conditions ai ≤ xi ≤ bi ; i = 1, 2, ..., m is more than or equal to the sum
required and lower limit of all the variables are non-negative, then upper limit of that variable
can be taken as infinite.

Remark 3 In ordre to solve inequations of the form


x1 + x2 + ... + xm ≤ n ...(i)
we introduce a dummy (artificial) variable xm+1 such that
x1 + x2 + ... + xm + xm+1 = n, where xm+1 ≥ 0
The number of solutions of this equation is same as the number of solutions of inequation (i).

12. Derangement
I. If n distinct objects are arranged in a row, then the number of ways in which they can
be deranged so that none of them occupies its original place is

    
n!               
   

 
and it is denoted by D (n)

II. (If r (0 ≤ r ≤ n) objects occupy the places assigned to them i.e. their original places
and none of the remaining (n – r) objects occupies its original places, then the number
of such ways is D (n – r) = nCr . D (n – r)


  
= nCr . D (n – r)!               
  

  

8
08. Permutations & Combinations

JEE Main Pattern Question Exercise

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

(a) A.P. (c) H.P.


(b) G.P. (d) none of these

n–1
2. If Cr = (k2 – 3) nCr+1, then k belongs to the interval

(a)  
   (c) (2, ∞)
(b) (– ∞, –2) (d)    

3. A gentleman has 6 friends to invite. In how many ways can he send invitation cards to them, if
he has three servants to carry the cards?

(a) 36 (c) 18
(b) 63 (d) none of these

4. How many 5-letter words, with or without meaning, can be formed out of the letters of the
word ‘EQUATIONS’ if repetition of letters is not allowed?

(a) 126 (c) 95


(b) 59 (d) 15120

5. Let A and B be two sets consisting of m and n elements respectively (n ≥ m). The number of
one-one functions from A to B is

(a) nm (c) nCm × m!


(b) nCm (d) mn

6. The number of arrangements that can be made with the letters of the word ‘MATHEMATICS’
in which all vowels come together, is

 ×  
(a)  (c) 
    
 ×  
(b)  (d) 
     

7. The total number of proper factors of 7875 is

(a) 23 (c) 22
(b) 24 (d) 21

9
08. Permutations & Combinations
8. The number of ways in which a pack of 52 cards can be divided equally among four players in
orders, is

 
(a)  (c) 
 
 
(b)  (d) 
   × 

9. The number of ways of distributing 5 identical balls into three boxes so that no box is empty
(each box being large enough to accommodate all balls), is

(a) 35 (c) 15
(b) 53 (d) 6

10. The number of ways in which 5 letters can be placed in 10 marked envelopes, so that no letter
is in the right envelope, is

(a) 45 (c) 43
(b) 44 (d) 46

10
08. Permutations & Combinations

Answer & Solution


1. (a)
(3x n!)2 = n! × (n + 1)!
9 × (n!)2 = n! × (n + 1) × n!
9 = n + 1 or n = 8
→ 8!, 2 × 8! 9!
2(5 × 8!) = 8! + 9!

2. (d)

Given, 
       

=  
        

 

=     

r
since n ≥ r ⇒  ≤ and nr  
n

⇒     ≤ 
⇒    ≤  ⇒  ∈   
 ∪ 
 

3. (a)
Given: A gentleman has 6 friends to invite. He has 3 servants to carry the cards.
Each friend can be invited by 3 possible number of servants.
So the number of ways of inviting 6 friends using 3 servants = 3 × 3 × 3 × 3 × 3 × 3 = 36

4. (d)
9
C5 × 5! = 15120

5. (c)

11
08. Permutations & Combinations
6. (b)
MTHMTCS AEAI
 
 ×
  

7. (a)
7875 = 32 5371
(2 + 1) (3 + 1)2 – 1
3.4.2 – 1 = 23

8. (a)
The number of ways in which 52 cards be divided equally among four players in order

  ×  ×  ×   


9. (d)

    

=  
 

10.(b)

  






            = 44
  

12
08. Permutations & Combinations

JEE Advanced Pattern Question Exercise

1. If 0 < r < s ≤ n and nPr = nPs, then value of r + s is

(a) 2n – 2 (c) 2
(b) 2n – 1 (d) 1

     
2. If E =            = 8x, then value of x is
     

(a) –7 (c) –10


(b) –972 (d) –12

100
3. The exponent of 7 in C50 is

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

4. Let Tn denote the number of triangles which can be formed by using the vertices of a regular
polygon of n sides. If Tn+1 – Tn = 21, then n equals

(a) 5 (c) 6
(b) 7 (d) 4

n+2 n–2
5. If C8 : P4 = 57 : 16 then n – 12 is

6. Let m and n be two positive integers such that m ≥ n. The number of ways of
Match the entries in Column I with entries in Column II
Column-I Column-II
(a) distributing m distinct books among n children (p) 0
(b) arranging n distinct books at m places (q) mn
(c) selecting m persons out of n persons so that two (r) nm
particular persons are not selected
(d) number of functions from (s) (mCn) (n!)
{1, 2, 3, ... n} to {1, 2, 3, ...m}
p q r s
(a) ⓟ ⓠ ⓡ ⓢ
(b) ⓟ ⓠ ⓡ ⓢ
(c) ⓟ ⓠ ⓡ ⓢ
(d) ⓟ ⓟ ⓡ ⓢ

13
08. Permutations & Combinations
7. Consider all possible permutations of the letters of the word R A C H I T I H C A R
Match the entries in Column I with entries in Column II
Column-I Column-II
(a) The number of words containing the word ACHIT is (p) 56700
(b) The number of words beginning with RA and ending with AR is (q) 630
(c) The number of words in which vowels occur at the odd places is (r) 45360
(d) The number of words in which the words IIT appears is (s) 2520
p q r s
(a) ⓟ ⓠ ⓡ ⓢ
(b) ⓟ ⓠ ⓡ ⓢ
(c) ⓟ ⓠ ⓡ ⓢ
(d) ⓟ ⓟ ⓡ ⓢ

Paragraph for question nos. 8 to 10.


Definition Define a function ϕ: N → N as follows:
ϕ(1) = 1,
ϕ(p ) = pn–1 (p – 1) if p is prime and n ∊ N, and ϕ(mn) = ϕ(m) ϕ(n) if hcf (m, n) = 1
n

8. If n ∊ N, then ϕ(4n + 2) equals

(a) ϕ(4n) (c) ϕ(2n + 1)


(b) ϕ(2n) (d) ϕ(2n + 4)

9. If ϕ(5n) = 100, then value of n is

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

10. If p is prime and n ∊ N, then S = ϕ(1) + ϕ(p) + ϕ(p2) + ... + ϕ(pn) equals

(a) pn – 1 (c) pn + 1
(b) pn (d) 2pn

14
08. Permutations & Combinations

Answer & Solution

1. (b)
 
 = 
 
  
     
(n – r) = (n – s)!
⇒ n – r = 1 & n – s = 0
r = n – 1 & S = n


  
   
n – 1 + n
2n – 1

2. (d)

E  
 
  
 
  
 
 ×   
=    =   (8)–12 = 8x
x = – 12

3. (a)
exponent of 7 on 50!
     
   
     
exponent of 7 in 100!
     
      
     
16 – 28 = 0

4. (b)
Number of triangles that can be formed by using the vertices of a regular polygon = nc3
Now Tn+1 – Tn = 21
      
⇒              

⇒       

⇒     

15
08. Permutations & Combinations
⇒       
⇒         
⇒           
⇒          
∴ n = –6,7

5. 7.
      
 ×  
      
           × 
  
   
n = 19, – 20 but n < 0
⇒ n = 19
7

6.
(a) - (R)
(b) - (s)
(c) - (p)
(d) - (q)

7.
(a) - (s)
(b) - (q)
(c) - (p)
(d) - (R)

8. (c)
ϕ(4n + 2)
= ϕ (2(2n + 1))
(ncf(2, 2n + 1) = 1)
= ϕ (2)ϕ (2n + 1)
2° (2 – 1) ϕ (2n + 1)
= ϕ (2n + 1)

9. (a)
ϕ(5n) = 5n–1(5 – 1) = 100
5n–1 4 = 100
5n–1 = 25 = 52
n – 1 = 2
n = 3

16
08. Permutations & Combinations
10.(b)

a
  r
S = 1 + p    ↑p   pn  p  
P

   
= 1 + (P – 1) 

= 1 + Pn – 1 = Pn

17

You might also like