MATHEMATICS

PERMUTATION & COMBINATION

How to count without actual counting
Elegant technique of counting

IIT-JEE Syllabus : Permutations and Combinations.

INDEX
1. General introduction & Historical development
2. Fundamental principle of counting
3. Significance / meaning of the title of the chapter
4. Useful theorems (For faster execution rate of the problems)
5. Formatting of groups
6. Permutation of alike objects
7. Circular Permutation
8 Total number of combinations
9. Summation of numbers (3 different ways)
10. Distribution of alike objects
11. General / Miscellaneous

st
1 LECTURE
1. GENERAL INTRODUCTION & HISTORICAL DEVELOPMENT :
Useful in the study of combinatorial coefficients. (Study first 2 pages of NCERT for better explanation), Promote
the students to study NCERT.
2. FUNDAMENTAL PRINCIPLE OF COUNTING :
If an event can occur in m different ways following which another event could occur in n different ways, then total
number of ways of simultaneous occurence of both the events in a definite order is m × n (This can be extended
to any number of events)
E(a) Number of ways in which one can travel from town T 1 to T3
1

2 4
via Town T2 in a definite order = 3 × 2. T1
3 T2 5 T3

E(b) Cinema Hall :

Cinema Hall
(i) Number of ways in which he can enter and leave the cinema
hall by a different door = 5 × 4. D2 D4
(ii) He can enter & leave by any door 5 × 5 = 25.
D1 D5
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

(iii) He can enter by D1, D2 and leaves by D3, D4, D5 = 2 × 3 = 6 D3

E(c) Tossing of a coin & Tree diagram :

T
T
H
T
T
H
H ¾¾¾¾
8 ways
® (2 × 2 × 2)
Start
T
T
H
H
T
H
H

(d) Keeping P|C|M|E book on a shelf = 4 × 3 × 2 × 1

E 1
 MATHEMATICS
Examples on Fundamental principle :
E(1) 3 digit numbers using the digits 1, 2, 3, 4, 5 without repetition. [Ans. 5.4.3 = 60]
E(2) 10 students complete in a swimming race. In how many ways can they occupy the first 3 positions.
[Ans. 10.9.8 = 720]
E(3) 7 flags of different colour. Number of different signals that can be transmitted by the use 2 flags one
above the other. [Ans. 7.6 = 42]
E(4) Number of words which can be formed from the letters of the word Machine/Miracle if Vowels may
occupy the
(a) odd position [Ans. 4! 4!]
(b) even position. [Ans. 3! 4!]
E(5) If the letters of the word "TOUGH" are written in all possible ways and then are arranged as in a
dictionary, then find the rank of the word TOUGH. [Ans. 89]
E(6) 4 lettered word using only the letters from the word "DAUGHTER" if each word is to include "G".
[Ans. 4 × 7.6.5 or 8.7.6.5 – 7.6.5.4]
D(7) 10 T/F questions. How many sequences of answers are possible. [Ans. 210]
D(8) A letter lock consists of four rings marked 26 different english alphabet. The number of ways in which an
unsuccessful attempt can be made. [Ans. 26 4 – 1]
D(9) If there m monkeys & n available masters in how many ways monkeys can be given to the masters, if a
master has any number of monkeys. [Ans. nm]
Home work : Race - 01 ..................................................................................................................
...................................................................................................................................................
nd
2 LECTURE
3. SIGNIFICANCE / MEANING OF THE TITLE OF THE CHAPTER :
Permutation & Combination and introducing notion of factorial.
Permutation means arrangement in a definite order of things which may be alike or different taken some or all
at a time. Hence permutation refers to the situation where order of occurence of the events is important.
Define : Things which are alike and which are different.
All God made things in general are treated to be different and all man made things are to be spelled whether
like or different.
0! = 1; 1! = 1; 2! = 2; 3! = 6, 4! = 24, 5! = 120, 6! = 720 ....
n! = 1× 2....(n–1)n etc. (factorials upto 6 must be remembered)
(2n!) = 2n.n! [1.3.5....... (2n – 1)].
Note that sum of all the factorials ³ 4 is never a perfect square.
Greatest integer is denoted by [x] . It is [x] < x like [1.4] = 1 ; [2.7] = 2 , [3] = 3; [0.3] = 0, [–2.7] = –3.
én ù én ù é n ù
If p is a prime number, then exponent of 'p' in n! is ê 1 ú + ê 2 ú + ê 3 ú + ....... + till on when greatest integral
ëp û ëp û ëp û
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

value becomes zero.

Example :
E(1) If (100)! = 2m. I where I is an odd integer then find m. [Ans. 97]
E(2) Find the number of cyphers at the end of 100!. [Ans. 24]

D(3) If 300! = 2r1 3 r2 5 r2 ....... . Find r1 + r2 + r3. [Ans. r1 = 296, r2 = 148, r3 = 74]

4. USEFUL THEOREMS (For faster execution rate of the problems) :

T-1 : Number of permutations of n distinct things taken all at a time symbolysed as : nPn = P(n, n) = A nn = n!

T-2 : Number of permutations of n distinct things taken r at a time 0 £ r £ n as : n P = P(n,r) = A n = n!

r r
(n - r)!
Combination - on the other hand refers to the situation where order of occurence of the events is not important.
2 E
 MATHEMATICS
T-3 : Number of combinations/selections of n distinct things taken r(0 £ r £ n) at a time
ænö n!
= C r = C(n,r) = ç ÷ =
n

r
è ø r!(n - r)!
Note :
(i) n
P0 = 1; nPn = n!
(ii) n
Cr = nCn–r; nC0 = 1; nCn= 1

(iii) n
Cr + n C r -1 = n +1 Cr
(iv) n
Cx = nCy Þ x = y or x + y = n
(v) n
Pr = r! nCr
Examples :
E(1) There are n points in a plane, no 3 of which are collinear. Find
(a) Number of straight lines by joining these points. [Ans. nC2]
(b) Number of triangles [Ans. nC3]
n(n - 3)
(c) Number of diagonals is a polygon = nC2 – n =
2
(d) 10 points in a plane no 3 being collinear except 4 which are in the same line. Find
(i) number of line [Ans. 10C2 – 4C2 + 1]
(ii) number of triangles [Ans. 10C3 – 4C3]
(E)Asking : Consider 6 vertices of a regular Hexagon and its centre. How many
(i) Straight lines ; (ii) Triangles can be formed with these 7 points.
[Ans. (i) 7C2 – 3. 3C2 + 3 = 12 + 3 = 15 or 6C2; (ii) 7C3 – 3]
Note : 5 - Pentagon, 6 - Hexagon, ....... 12 - Dodecogon, 15 - quidecagon
E(2) 6 parallel lines which are cut by another set of 5 parallel lines. Number of parallelograms.
[Ans. 6C2 .5C2 = 150]
E(3) Number of words with 10 different consonants & 4 different vowels if each word has 3C and 2V and
begins with a consonant. [Ans. (10C3 . 4C2) . 3C1 . 4! or 10C1 . 9C2 . 4C2 . 4!]
E(4) In how many ways can the seven different colours of a rainbow be arranged so that the blue and green
never come together. [Ans. 7! – 6! 2!]
D(5) A Grandfather with 7 grandchildren takes them to zoological garden without taking the same three
children together. How frequently each child goes and how frequently Grand father goes. [Ans.6C2; 7C3 ]
D(6) From a group of persons, the number of ways of selecting 5 persons is equal to that of 8 persons. The
number of person in the group is [Ans. 13]
D(7) If first twenty natural numbers are there; the number of ways in which three are selected if they are in
A.P. [Ans. 10C2 + 10C2 ]
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

Home work : Race - 02 and Hall & Knight - Ex.11A,NCERT EX-1 (Except Q. based on alike
objectes) .................................................................................................................... ..............................
rd
3 LECTURE
E(8) 4 boys and 4 girls are to be seated in a line, find :
(a) Number of ways they can be seated so that 'No two girls are together. (or girls are separated)
(b) not all the girls are together or at least one girl is separated from the rest of the girls
(c) 'boys and girls are alternate' or boys as well as girls are separated or each boy follows the girl and
each girl follows the boy
(d) Boy and girl are alternate and a particular boy & girl are never adjacent to each other in any
arrangement
(e) If they are 4 married couples then the number of ways if each couple is together.
[Ans. (a) 5C4.4!4! ; (b) 8! – (5!4!) ; (c) 2(4!)2 ; (d) 2(4!)2 – 7C1.2(3!)2; (e) (2!)4 . 4!]

E 3
 MATHEMATICS
E(9) Numbers of ways in which 5 different books can be distributed between R/S/G if each child gets at least
one book. [Ans. 35 – [3C1 (25 – 2) + 3C2]
note that C3 . 3! . 3 is wrong think why ?
5 2

E(10) A train having 12 stations enroute has to be stopped at 4 stations. Number of ways it can be stopped if
no two of the stopping stations are consecutive. [Ans. 9C4]
E(11) 8 straight lines & 6 circles in a plane. Maximum number of their intersection points.
[Ans. 8C2. 1 + 6C2.2 + 8C1. 6C1× 2]
D(12) A cricket team comprising of A, B, C,..... J, K is to be sent for batting. If 'A' wants to bat before 'J' and 'J'
wants to bat after 'G'. Then the number of batting orders if other players could go in any order.
A Gù
ú
[Hint : G A ú 2 ways
J J ûú
[XXX........X (11 crosses). Select 3 places for A G J who can be seated in two ways and remaining 8 in 8!
ways. Hence total = 11C3 . 2 . 8!]
5. FORMATION OF GROUPS :
(m + n)!
(a) m + n different things m ¹ n; number of groups = .
m! n!
2n!
If m = n then number of groups =
n! n! 2!
(2n)!
If these groups are to be distributed between two persons the number of ways = 2!
n! n! 2!
(m + n + p)!
(b) Similarly (m + n + p) different things can be divided into 3 unequal groups is
m! n! p!
(3n)!
(i) If the groups are all equal then the number of way =
(n!)3 3!
(3n)!.3!
(ii) If these groups are to be distributed between 3 persons then
(n!)3 3!
Home work : Race - 03 (NCERT Ex. 2).................................................................
...................................................................................................................................................
th
4 LECTURE
Proofs and explanation of above
(i) To find the number of ways in which (m + n) different things can be divided into two unequal groups, it is
equivalent to select 'm' persons. Since for each selection of 'm' persons there will be a corresponding
rejection of n persons hence each selection of m and a corresponding rejection of n people will give a
group.

(m + n)!
\ Number of groups = m+nCm = . However situation is different if m = n.
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

m! n!
Consider 4 different toys T1T2T3T4
When T1T2 is selected and T3T4 is rejected Þ one way of forming the group.
4!
When T3T4 is selected and T1T2 is rejected is not a different group hence gives double answer..
2! 2!
4!
Therefore the correct answer is .
2! 2! 2!
Hence the number of ways in which 2n different things can be divided into two equal groups
(2n)!
= ....... (i)
n!n!2!

4 E
 MATHEMATICS
However if these 2n things are to be distributed between two persons then (i) has to be multiplied by 2!
again.
(ii) To understand the article consider 10 children to be divided into three unequal groups of 2, 3
and 5.
10!
First make two groups of 2 and 8 and this can be done in way say. AB/CDEFGHIJ.
2! 8!
8!
Consider one such group of 8 which can be divided into two groups of 3 and 5 in ways.
3! 5!
10! 8! 10!
Hence total = . =
2! 8! 3!5! 2!3!5!
Similar explanation will be valid if initial groups in 3 and 7 and then split 7 in 2 and 5. However if 10 is

10!
divided into two groups of 5 each initially, which can be done in ways ........ (i)
5!5!2!

One such grouping is say

ABCDE FGHIJ
Consider F G H I J keeping A B C D E as it is. Now the group F G H I J can be divided into two groups

5!
of 2 and 3 in ways and similarly when F G H I J is kept as it is, A B C D E can be divided into two
2!3!

5! 5!
groups of 2 and 3 in ways. Hence one group (each of 5) given by (i) generated 2. different
2!3! 2!3!

groups of 2, 3, 5.

10! 2.5! 10!

\ Total number of groups = . =
5!5!2! 2!3! 2!3!5!

Similarly if m = n = p situation becomes different.

Consider T1T2T3T4T5T6 to be divided into 3 equal groups.
6!
When we say 6C2 . 4C2 = is totally wrong why ?
2!2!2!

Selected in 6 C2 Selected in 4 C2 Rejected in 4 C2 (A)

T1 T2 T3 T4 T5 T6
T1 T2 T5 T6 T3 T4
T3 T4 T1 T2 T5 T6
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

T3 T4 T5 T6 T1 T2
T5 T6 T1 T2 T3 T4
T5 T6 T3 T4 T1 T2
R S G

Note the all these six groups are counted in (A), however they are identical. Hence the answer in (A) is as
many numbers of times more more as many number of times these equal groups can be arranged i.e. 3!
6!
times. Hence the correct number of groups is equal to .
2!2!2!3!
6!´ 3!
In case these 6 toys are to be distributed between R/S/G then our answer will be = .
2!2!2!3!

E 5
MATHEMATICS
E(1) Find the number of ways in which 30 Jawans can be divided into 3 equal groups ? In how many
ways can 30 Jawans be deputed equally on 3 borders (10 on each border) ?
30! 1 30!
[Ans. , 3! ]
10!10!10! 3! 10!10!10!3!
E(2) Number of ways in which 200 people can be divided into 100 couples is (100 equal groups)

(200)!
= ........... (B)
(2!)100 .100!
Answer in (B) can also be written as

2100 .100!(1.3.5........199)
(i) = 1.3.5.........199.
2100.100!

(100)!(101)(102).......(200) æ 101 öæ 102 ö æ 200 ö

(ii) =ç ÷ç 2 ÷ ..... ç 2 ÷
2100.100! è 2 øè ø è ø
Consider the example : Number of ways in which 12 different books can be tied up in 3 bundles one
containing two and the other 2 bundles containing 5 different books.

(12)!
Note that our final correct answer is ...... (i)
2!5!5!2!

2 12! 5 10!
One way 12 Þ & 10 Þ Þ (i)
2!10! 5!5!2!
10 5
5 12! 2 7! 12! 7! 12!
Second way 12 Þ & 7 Þ Þ . =
5!7! 5 2!5! 5!7! 2!5! 5!5!2!
7
seems to be a mistake of 2! in denominator. How do we explain.

12!
Consider one group of say ...... (ii)
5!5!2!
A BCDE FGHIJKL
FGHIJ
FGHIJKL
KL
Hence A B C D E | F G H I J | K L is one way
However in (i) when we select F G H I J and reject the remaining i.e.
FGHIJ A B C D EK L
ABCDE
ABCDEKL
KL
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

We have again the same group FGHIJ|ABCDE|KL

12!
Hence answer gives by (ii) is double Þ correct answer is
5!5!2!2!
Examples :
æ 10! ö
E(1) (a) Divide 10 different things into groups of 2, 2, 6 [Ans. ç ÷]
è 2!2!2!6! ø

æ 20! ö
(b) Divide 20 different things into groups of 2, 2, 2, 3, 3, 8 [Ans. ç 4 3 ÷]
è (2!) (3!) 8! ø

6 E
 MATHEMATICS
E(2) 6 different books are to be distributed between R|S|G if each child gets at least one book.
(Do it in two different ways)
[Hint : Method 1 : 36 – {3C1(26 – 2) + 3C2} (note that : 6C3 . 3! . 33 is wrong)
Method 2 : 6 different things (123, 114 and 222) – broad groups
é 6! 6! 6! ù
= ê + + 3 ú .3!
ë 1!2!3! 1!1!4!2! (2!) 3! û
E(3) Number of ways in which 8 persons can be seated in 3 different taxies each having 3 seats for passengers
and duly numbered if
8!
(a) internal arrangement of persons inside the taxi in immaterial. ´ 3! ] [Ans.
3!3!2!2!
(b) internal arrangement also matters. [Ans. 9C8 . 8!]
E(4) 8 computers of different make to be distributed in 5 schools if each school gets at least one computer.
[Hint : (41111; 32111, 22211)]
E(5) If f A ® B
Find the number of one-one functions, many-one functions, onto functions & into functions when :
(a) n(A) = 4; n(B) = 4 [Ans. 4!, 44 – 4!, 4!, 44 – 4!]
(b) n(A) = 5; n(B) = 3 [Ans. 0, 35, 150, 93]
(c) n(A) = 3; n(B) = 5 [Ans. 5C3× 3!, 53 – 5C3× 3!, 0, 53]
D(6) During election 3 districts are to be campaigned by 20, 15 and 10 people respectively. If 45 volunteers
é 45! ù
are aviable, then find the number of ways in which they can be sent. [Ans. ê ú]
ë 20! 15! 10! û
D(7) In how many ways 13 cards to each of the four players be distributed from a pack of 52 cards so that

36!
each may have A | K | Q | J of the same suit. [Ans. ´ 4!´ 4! ]
9!9!9!9!4!

Home work : Race - 03 and Hall & Knight - Ex.11B (Q.6,12,13,16,22,25) ............................
........................................................................................................................................................
th
5 LECTURE
6. PERMUTATION OF ALIKE OBJECTS :
For example : DADDY/MUMMY
é Case-I : taken all at a time
ê
ë Case-II : taken some at a time
Case-I :

p of one kind ü
ï n!
Number of permutation of n things q of another kind and ý taken all at a time=
p! q! r!
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

r are all different ï

þ
10!
For example number of words which can be formed using all letters of the word "MAHABHARAT" =
4! 2!
Examples :
E(1) In how many ways the letters of word PERMUTATIONS be arranged if word starts with P end with S.

10!
[Ans. ]
2!

E(2) 21W and 19B balls are arranged in a line (balls of the same colour alike). Find the number of arrangement
if Black balls are separated. [Ans.22C19=22C3 ]

E 7
MATHEMATICS
E(3) Consider the word INDEPENDENCE, then find the number of words taken all the letters if
5! 7!
(a) no two vowels are consecutive. [Ans. 8C5. ´ ]
4! 3!2!
8!
(b) E's are separated/no two 'E' occur together. [Ans. 9C4 × ]
3! 2!
12 7!
(c) without changing the order of vowels [Ans. C5 . ]
3!2!
12! æ 9! ö
(d) at least one 'E' is separated from the rest of the E's (Total - all four together) [Ans. - ]
2!3!4! çè 3!2! ÷ø

7!
(e) keeping the positions of vowels fixed (each V must remain at its own place) [Ans. ]
3!2!
5! 7!
(f) without changing the relative order of vowels and consonants. ´ ] [Ans.
4! 3!2!
E(4) Number of numbers greater than a million using the digits 2, 3, 0, 3, 4, 2, 5 how many of these are div.
7! 6! 6! æ 6! 5! ö
by 5. [Ans. - , + - ]
2!2! 2!2! 2!2! çè 2!2! 2!2! ÷ø
E(5) How many different words can be formed using all the letters of the word HONOLULU if (no two alike
letters are together) or juxtaposed. [Ans. 2220]
E(6) Find the number of 7 digit numbers if the sum of their digits is 59. Digits to be used can be 5, 6, 7, 8, 9.
[Ans. 210; 40]
D(7) Four faces of a tetrahedral dice are marked with 2, 3, 4, 5. The lowest face being considered as the
outcome. In how many ways a total of 30 can occur in 7 throws. [Ans. 413]
D(8) If all permutations of letters of word 'AGAIN' are arranged as in dictionary, then find fiftieth word.
[Ans. NAAIG]
Case-II : Examples on some at the time :
E(1) Find the number of words formed by taking 5 letters of the word INDEPENDENCE at a time.
[Ans. 3345]
E(2) From word MISSISSIPPI selection of 5 letters can be done in how many ways. [Ans. 25]
D(2) How many 6 lettered word can be formed using the letters from the word INTEGRATION if each word
has 3 vowels and 3 consonants. [Ans. 27720]
D(4) Number of different collections of 7 letters that can be formed from the letters of the word
ACCOMMODATION. [Ans. 315]
CAUTION : Note the language which can be used in the problems
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

Number of other words are asked OR number of ways in which the given word is rearranged OR if as many
more words as possible be formed.
For e.g. Use the letters of the word "CIVILISATION" without changing the relative order of vowels and consonants.

6!
in above all the cases the correct answer is ´ 6!- 1 = 21599
4!

Home work : Hall & Knight - Ex.11B (Remaining Que.) and Select the Que. from Ex.1, 4A & 5
........................................................................................................................................................

8 E
 MATHEMATICS
th
6 LECTURE

7. CIRCULAR PERMUTATION :

A E D C B
1 B 5 A 4 B 3 D 2 C
E 5 2 D 4 1 C 3 5 B 2 4 A 1 3
4 3 3 2 2 1 1 5 5 4
D C C B B A A E E D

All five are the same arrangement in a circle. Hence number of circular permutations
(a) (i) of n different things taken all at a time = (n – 1)!
(ii) taken r at a time = nCr(r – 1)!
This distinguishes/discriminates/considers to be different the clockwise and anticlockwise arrangement.
(b) If clockwise and anticlockwise arrangements are considered as same then the number of circular
(n - 1)!
permutations of n different things =
2
Note : In case of garland anticlockwise & clockwise sense are same
Examples :
E(1) Number of ways in which 7 Americans and 7 British people can be seated on a round table so that no two
Americans are consecutive. [Ans. 6!.7!]
E(2) (a) number of ways in which 8 persons can be seated on a round table so that "all shall not have the
same neighbours in any two arrangement".
(note that clockwise & anticlockwise arrangement are not to be distinguished)
(8 - 1)!
[Ans. = 2520 ]
2
(b) Number of ways in which 10 children can sit in a mery go round relative to one another.
[Ans. 9! (Here clockwise & anticlockwise arrangement is different)]
E(3) Number of ways in which 8 persons can be seated on a round table so that two particular person are
never together. [Ans. 7! – 6!2!]
E(4) Out of 10 flowers of different colours, how many different garlands can be made if each garland consists
10 5!
of 6 flower of different colour. [Ans. C6 . ]
2
D(5) Number of ways in which 5B and 5G can be seated on a circle alternately if a particular B and G are
never adjecent to each other in any arrangement.
[Ans. 4!5! – 8.3!4! = 3(4!)2]
D(6) (a) n people A1, A2, ......., An sitting on a circle. Number of ways in which 3 people can be selected if
no two of them are consecutive. [Ans. nC3 –{ n + n(n–4)}]
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

(b) How many hexagons can be constructed by joining the vertices of a quindecagon (15 sides) if none
15
C1 . 8 C5
of the sides of the hexagon is also the side of the 15-gon. [Ans. ]
6
D(7) 20 persons were invited for a party. The number of ways in which they & host can be seated at a circular
table such that two particular persons be seated on either side of the host is [Ans. 2(18!)]
D(8) There are n seats round a table numbered 1, 2, 3, ........., n. The number of ways in which m (£ n) person
can take the seats is [Ans. (nCm. m!)]
Home work : ......................................................................................................................
........................................................................................................................................................

E 9
 MATHEMATICS
th
7 LECTURE

8. TOTAL NUMBER OF COMBINATIONS : Means selecting at least one out of n things.

Case-I : When things are all different
The number of ways of selecting atleast one thing out of n distinct things = nC1 + nC2 + nC3 + ..... + nCn = 2n –1
Case-II : When some alike, some other alike and remaining all the different
(
The number of ways of selecting atleast one thing = (p + 1)(q + 1)2
n–p–q
–1 )
where p alike are of one kind, q alike are of other kind and rest are different

E(1) Out of 3 different maths (M1|M2|M3), 4 different physics (P1|P2|P3|P4) and 5 different chemistry
(C1|C2|C3|C4|C5|) books, how many different selections/collections can be made so that each selection
consists of
(i) one book on each subject [Ans. 3C1. 4C1.5C1 = 60]
(ii) at least one book on each subject [Ans. (23 – 1)(24 – 1)(25 – 1) = 7 ×15 ×31 = 3255]
(iii) taking at least one book [Ans. 23 . 24 . 25 –1]
E(2) Out of 2 Cocas, 3 Mangoes and 4 Apples how many different selections of fruits can be made if each
selection has
(i) atleast one fruit
(ii) atleast one fruit of every species.
in following cases
Case I : fruits of the same species are alike [Ans. Case I : (i) 3.4.5 – 1 (ii) 2.3.4 ]
Case II : fruits of the same species are different [Ans. Case II : (i) 29–1 (ii) (22–1 (23–1)(24–1)]
E(3) A shopkeeper places before you n different books each having p copies. Find the number of different
selections that can be made. [Ans. (p + 1)n – 1.]
D(4) Every one of the 10 available lamps can be switched on to illuminate a certain hall. The total number of
ways in which the hall can be illuminated is [Ans. 1023]

Impotant note :
That every natural number except 1 has atleast 2 divisors. If it has exactly two divisors then it is called a prime.
System of prime numbers begin with 2. All primes except 2 are odd but all odds are not prime. A number
having more than 2 divisors is called composite. 2 is the only even number which is not composite. A pair of
natural numbers are said to be relatively prime or coprime if their HCF is one. For two natural numbers to be
relatively prime it is not necessary that one or both should be prime. It is possible that they both are composite
but still coprime. eg. 4 and 25. Note that 1 is neither prime nor composite however it is comprime with every
other natural number. A pair of primes are said to be twin primes if their non-negative difference is 2 e.g. & 5;
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

5 & 7 etc.
E(1) Consider the number N = 75600 (24.33.52.71)
(i) Number of divisors = 5.4.3.2 = 120
(ii) Number of proper divisors = 120 – 2 (note that 1 and N are not the proper divisors)
(iii) Number of odd divisors = no 2 should be taken = 4.3.2 = 24
(iv) Number of even divisors = atleast one 2 should be taken = 4.4.3.2 = 96
(v) Number of divisors divisible by 5 = atleast one 5 must be taken = 5.4.2.2 = 80
(vi) Number of divisors divisible by 10 = atleast one 5 and atleast one 2 must be taken = 4.4.2.2 = 64
(vii) Sum of all the divisors = (20 + 21 + 22 + 23 + 24)(30 + 31 + 32 + 33)(50 + 51 + 52)(70 + 71)

10 E
 MATHEMATICS
E(2) How many different ways in which the number N = 75600 can be resolved as a product of two divisors
N = 75600 = 24335271 Þ Total divisors = 120
1 & 24 × 33 × 52 × 7 ü
ï
2 & 23 × 32 × 52 × 7 ï 60 pairs
ý
22 & 2 × 32 × 52 × 7 ï
ïþ
M
120
\ Reqd. number of ways = = 60
2
Note :
(i) Number of ways in which N can be resolved as product of two divisors is

ìn
ïï whenn is even
= í2 , where n is number of divisiors of N.
ï n+1 when n is odd
ïî 2
(ii) If given number is a perfect square, then total number divisors will be odd
e.g. N = 24 × 34 × 52 × 72
\ Number of divisors = 5 × 5 × 3 × 3 = 225

225 + 1
Number of ways in which given number can be split up as a product of two divisors = = 113
2

E(3) In how many different ways the number N = 24.32.53.72.114.132 can be resolved as product of two
divisors which are relatively prime.

4 2 3 2 4 2
[Sol. N = 2 . 3 . 5 . 7 . 11 . 13
2 b c d e f

Number of prime involved = 6 [2, 3, 5, 7, 11, 13]

6
C3
1 + 6 C1 + 6 C2 +
2

1 abcdef ® C0
6

a bcdef ® C1
6

ab cdef ® C2
6
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

abc def ü
6
C3
ý ®
def abc þ 2

Q 6
C0 + 6C1 + 6C2 + 6C3 + 6C4 + 6C5 + 6C6 = 26
Þ 2( 6C0 + 6C1 + 6C2) + 6C3 = 26
6
C3
Þ Required number of ways = 6C0 + 6C1 + 6C2 + = 26 – 1 = 32]
2
Note : Number of ways in which N can be resolved as a product of 2 divisors which are relatively
prime = 2p–1, where p is the number of primes involved in the prime factorisation of N.

E 11
 MATHEMATICS
9. SUMMATION OF NUMBERS (3 different ways) :
E(a) Sum of all the numbers greater then 10000 formed by the digits 1,3,5,7,9 no digit being repeated
Method-1 All possible numbers = 5! = 120
If one occupies the units place then total numbers = 24.

Hence 1 enjoys units place 24 times 1

similarly 1 enjoys each place 24 times

Sum due to 1 = 1 × 24 (1 + 10 + 102 + 103 + 104)
similarly Sum due to the
digit 3 = 3 × 24(1 + 10 + 102 + 103 + 104)
M M M M M M M
Required total sum = 24 (1 + 10 + 10 + 10 + 10 )(1 + 3 + 5 + 7 + 9)
2 3 4

Method-2 In Ist column there are twenty four 1's, Twenty four 3's & so on and their sum is
= 24 × 25 = 600
Hence add. in vertical column normally we get = 6666600
5 th 2nd 1st
éX X X X X
ê
120 êX X X X X
êM M M M M
Number ê
êM M M M M
êëX X X X X

666 6 6 0 0 = 6666600

Method-3 Applicable only if the digits used are such that they have the same common difference.
(valid even if the digits are repeating)
Writing all the numbers in ascending order of magnitude
S = (13579 + 13597 + ........ + 97513 + 97531)
S = (13579 + 99531) + (13597 + 97513) + ......
= (111110) 60 time = 6666600 Ans.
n
( l + L)
S= where n = number of numbers, l = smallest, L = Largest
2
Other examples on summation of numbers
E(1) Sum of all the numbers greater then 10000 formed by the digits 0, 2, 4, 6, 8 no digit being
repeated. [Ans. 5199960]
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

D(2) Sum of all the numbers greater then 10000 formed by the digits 0, 1, 2, 4, 5 no digit being
repeated. [Ans. 389997]
D(3) Sum of all distinct four digit numbers that contain only the digits 1, 2, 3, 4, 5 each at most once is
given by. [Ans. 399960]
D(4) Find the sum of all 6 digit numbers by using the digits 1, 1, 3, 3, 7, 8. [Ans. 7666659]
Home Work : Hall & Knight - Ex.11B (Remaining Que.) and Sheet + Race ..................................
....................................................................................................................................................

12 E
 MATHEMATICS
th
8 LECTURE
10. DISTRIBUTION OF ALIKE OBJECTS :
Ex. In how many different ways 6 identical coins can be distributed between 4 persons each person can
receive none, one or more coins.
Steps :
(i) Add identical false coins one less than the number of persons. i.e. 6 + 3 ¬ (false coins)
(ii) Complete the linear arrangement of there 9 things of which 6 alike of one kind & 3 alike of other
9!
kind i.e.
6!3!
® (2,2,2,0)

® (3,3,0,0)

® (1,5,0,0)

® (1,2,2,1)
In each arrangement false coins will act as a partition wall.
(1) Number of ways in which n identical coins can be distributed among p persons, if each person receiving
(n + p - 1)!
none, one or more coins = = n+p–1Cp–1
n!(p - 1)!

n identical coins (p–1) false coins

(2) Number of ways in which n identical things can be distributed among p person if each person can receive
n -1
at least 1 thing is C p -1

(n–p) identical things (p–1) false coins

n–p+p–1=n–1

(n - 1)!
Required number of ways = = n -1Cp -1
(n - p)!(p - 1)!
Examples :
E(1) A shelf contains 6 separate compartments. Number of ways in which 12 indistinguishable (like)
marbles can be placed in the compartments so that no compartment is empty. [Ans. 11C5]
E(2) Number of different dissimilar terms in (x1 + x2 + ....... + xn)m is m+n–1Cn–1
alternatively stated as : Number of terms in a complete homogeneous expression of degree m in
n variables.
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

Ask : (x + y + z)11 = ? [Ans. 13C2]

E(3) In how many ways 30 marks be allotted to 8 questions if atleast 2 marks are to be given to each
question, assuming the marks are to be alloted in non negative integral values. [Ans. 21C7]
E(4) There are unlimited number of Red, White, Black & Green balls. (balls are all alike except for the
colour)
(i) Number of ways in which a selection of 10 balls can be made. [Ans. 13C3]
(ii) Number of ways in which selection of 10 balls contain balls of all four different colours.
[Ans. 9C3]
E(5) Number of ways in which 2 apples, 3 oranges and 4 mangoes can be distributed between
R / S / G if each child receives none, one or more number of fruits. (Fruits of the same species are
alike). [Ans. 4C2 . 5C2 . 6C2]

E 13
 MATHEMATICS
E(6) A supermarket offers ice creams in 10 different varieties. Ice creams of each variety are identical.
In how many ways 4 ice creams can be selected.
(i) without any restriction
(ii) at least two ice creams of the same variety are taken. [Ans. (i) 13C4 (ii) 505]
[Hint : Total – all different = 13C4 – 10C4 .1 = 505
alternatively
Case-I : All of same variety = 10C1
Case-II : Three same + one different = 10C1.1.9C1
Case-III : Two same + two other same = 10C2
Case-IV : Two same + two different = 10C1.1.9C2
Total = 10C1 + 10C1.1.9C1 + (10C2.1 + 10C1 . 9C2)]
(3) If x1 + x2 + x3 + ........ + xr = n, then find
(a) Number of non-negative integral solutions = n+r–1Cr–1
(b) Number of natural solutions = n–1Cr–1.
E(7) Number of natural solutions of the equation x + y + z = 102 . [Ans.101C2 ]
E(8) (a) Number of non negative integral solutions of the inequality x + y + z + t £ 30 [Ans. 34C4]
(b) Number of points with integral co-ordinates that lie inside a triangle whose vertices are
(0, 0), (0, 102) and (102, 0) is. [Ans. 5050]
D(9) A man has to buy 25 mangoes in four different verities buying at least 4 of each variety in how
many ways can he plan his purchases, if mangoes of each variety are identical and available in
abundance. [Ans. 12C3]
D(10) Number of ways in which K identical balls can be distributed in p different boxes if no of box
(k - 1)!
remains empty. [Ans. ]
(k - p)!(p - 1)!
D(11) In how many ways 4 alike apples and 4 alike oranges can be distributed in six children if each child
gets at least one fruit. [Ans. 750]
D(12) In how many ways 30 can be partitioned into 3 unequal natural parts. Number of ways when equal
parts are also counted. [Ans. 61, 75]
D(13) The number of point (x, y, z) in space, whose each co-ordinate is a negative integer such that
x + y + z + 12 = 0 is [Ans. 55]
r ˆ where x, y, z Î N & ar = ˆi + ˆj + kˆ . If rr .ar = 10 ,
D(14) The position vector of a point P is r = xiˆ + yiˆ + zk,
then the number of possible positions of P is [Ans. 36]
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

Home Work : ..............................................................................................................................

....................................................................................................................................................
th
9 LECTURE
11. GENERAL/MISCELLANEOUS :
(a) Maximise nCr : The value of r for which nCr > nCr+1 and nCr > nCr–1
é n
êr = 2 if n is even
Þ n
Cr is maximum if ê
ê r= n – 1 or n + 1 if n is odd
êë 2 2

14 E
 MATHEMATICS
Examples :
E(1) Find the difference between the greatest value of 15Cr and 12Cr. [Ans. 15C8 – 12C6]
E(2) There are 2n letters which are either a's or b's. Find the maximum number of arrangement of
these letters. [Ans. 2nCn]
D(3) A man wants to give as many number of parties as he can out of his 20 friends by calling the same
number of people but not the same group. How many should he call so that the number of parties
is maximum. [Ans. 20C10]
D(4) Find the greatest number of different groups that can be formed from the letters of the word
"BAROUCHE", each set of group consisting of the same number of letters. In how many of them
will the letter 'C' occur. [Ans. 8C4]

(b) Grid problem : (4,5)

E(1) Complete cartesian plane is partitioned by drawing lines

|| to x and y axis equidistant apart like the lines on a
chess board. Then the number of ways in which an ant
can reach from (1, 1) to (4, 5) via shortest path.

O
Note : If there are n vertical and m horizontal lines then there
will be (n – 1) horizontal and (m – 1) vertical paths.

D(2) If a person wants to go from A to B via shortest path, then find the number B
H
of ways if he always passes through path EF as well as HG.
E G
[Ans. 2 × 2 × 3]
F
(c) Dearrangement : A

If n letters are to be kept in n directed envelopes, then number of ways in which they can be placed when
é1 1 1 1ù
none of the letter goes into its own envelope is = n! ê - + ...... + ( -1)n ú = D(n)
ë 2! 3! 4! n! û
Remember : D(2) = 1, D(3) = 2, D(4) = 9, D(5) = 44, D(6) = 265
E(1) In how many ways 4 letters can be kept in 4 directed envelopes if none of the letter goes into its
own envelope ? [Ans. 9]
Alternate solution :
L1 L2 L3 L4 R ® Right
E1 E2 E3 E4 W ® Wrong
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

Total number of ways = 1R/3W + 2R/2W + All R + All W

E555F
x

é L1 L4 L2 L3 ù
ê ú
4! = 4C1.2 + 4C2.1 + 1 + x Q ê L1 L3 L4 L 2 ú 1R / 3W
êë E1 E2 E3 E 4 úû

\ x = 24 – 8 – 6 – 1 = 9
E(2) From a given number of 6 different question each question has only one correct answer. For each
correct entry a student will be awarded 2 marks & for each wrong entry 1 mark will be deducted.

E 15
MATHEMATICS
Column-I Column-II
Q1 A1
Q2 A2
Q3 A3
Q4 A4
Q5 A5
Q6 A6
Total number of ways in which a student can secure non-negative markes.
Total ways = All R + 4R/2W + 3R/3W + 2R/4W = 1 + 6C4.1 + 6C3.2 + 6C2.9
Miscelleneous problems :
E(1) If 9 balls are to be distributed in 3 boxes, then find the number of ways of distribution if
(i) Balls & boxes are distinct. [Ans. 39]
(ii) Balls are identical & boxes are distinct. [Ans. 11C2]
(iii) Both are identical [Ans. 12]
[Sol. (iii) Let x, y, z be the number of balls in the boxes.
x+y+z=9
above case will have 3 types of distributions
(a) x = y = z ® 3 + 3 + 3 ® 1 way
(b) Exactly 2 identical & 1 different (0,0,9), (1,1,7), (2,2,5), (3,3,3), (4,4,1). Out
of which (3,3,3) is already counted in (a) ® 4 ways
11
C2 - 1 - 4 ´ 3 42
(c) All distinct = = =7
6 6
Þ required no of ways = 1 + 4 + 7 = 12]
E(2) In how many ways 5 distinct balls are to be distributed in 3 identical boxes such that every box contains
any number of balls. [Ans. 36]
[Sol. 5 distinct balls can be grouped as (5, 0, 0) ® 1 way
5!
(4, 1, 0) ® = 5 ways
4!1!0!
(3, 2, 0) ® 5 ways
5!
(2, 2, 1) ® = 15 ways
(2!)2 2!1!
5!
(1, 1, 3) ® 2
= 10 ways
(1!) 2!3!
Þ Required ways = 36
E(3) Find the number of positive integral solutions of x y z = 24.
D:\DATA\TARGET-2012\TEACHING NOTES\PERMUTATION & COMBINATION

[Ans. 30]
[Sol. x y z = 24 = 23.3

Let x = 2a1 .3b1 , y = 2a2 .3b2 ,z = 2a3 .3b3

a +a +a b +b + b
Þ xyz = 23.3 = 2 1 2 3 .3 1 2 3
ìa + a2 + a3 = 3 where a1 ,a2 ,a3 ³ 0
Þí 1
î b1 + b2 + b3 = 1 and b1 ,b2 ,b3 ³ 0
Þ Number of solutions = 3+2C2. 1+2C2 = 30]
Home Work : ..............................................................................................................................
....................................................................................................................................................

16 E