FACULTY GUIDANCE NOTES FOR
PERMUTATION AND COMBINATION
(Ref: FGN101008)
Examples to be taken in the class:
Ex 1: In how many ways can you enter the room?
In how many ways can he exit the room?
In how many ways can he enter and leave
the room?
Ex 2: Say, we have 5 digits: 1, 2, 3, 4, 5. How
many 5 digit numbers can we make without
repetition of digits?
Ex 3: There are 5 digits: 0, 2, 3, 5, 8.
(i) How many 4 digit Nos. can you make
without repetition of digits?
(ii) Of these, how many are even?
(iii) Of these even, how many are not div.by 4?
(iv) In how many numbers do 2&8 come
together?
(v) In how many numbers will 2 come before 8?
(Assume you use all 5 digits)
(vi) In how many number will there be exactly
one digit between ‘2’ and ‘0’? (Assume
you use all 5 digits).
(vii) Sum of all the 4 digit Nos. = ?
(viii)If the numbers are arranged in inc. order,
rank of 3582 =?
(ix) How many 4 digit Nos. are possible
(with rep)?
Ex 4: How many arrangements can you make for
the word INDEPENDENCE?
Ex 5: There are 6 men and 5 women. In how many
ways can you select 5 members so that there is:
(i) At least 1 women?
(ii) A particular woman is always present?
(iii) A particular man is always absent?
Circular permutation:
Ex 6: There are 13 friends. If they have to sit in 2
different tables. One is straight with 7 seats
and one circular with 6 seats, in how many
ways can they sit?
Ex 7: You have 10 questions. In how many ways
can you answer at least 1 question?
Ex 8: You have 5 different physics book, 4 different
chemistry books and 3 different Maths books.
In how many ways can you select.
(i) At least 1 book?
(ii) At least 1 book of each type?
Ex 9: In the previous question if the maths books
are identical and so are physics and
chemistry. Answer both the parts of the
previous question.
 Triumphant Institute of Management Education Pvt. Ltd. (7,0(), 95B, Siddamsetty Complex, Park Lane, Secunderabad – 500 003.
All rights reserved. No part of this material may be reproduced, in any form or by any means, without permission in writing.
This course material is only for the use of bonafide students of Triumphant Institute of Management Education Pvt. Ltd. and its
licensees/franchisees and is not for sale. (7 pages) (acau/acav)
Ex 10: In how many ways can you divide 12 different
books in 3 boxes equally? (boxes are identical).
Ex 11: In how many ways can you divide 10 marbles
among 3 boys where a boy may not get a
marble?
Ex 12: In how many ways can you divide 10 marbles
among 3 boys such that each gets at least 1
marble?
Ex 13: In how many ways can you distribute at most
10 marbles among 3 boys (each gets at least 1)?
Ex 14: a + b + c + d ≤ 150;
a ≥ 25, b ≥ 25, c ≥ 25 and d ≥ 25.
How many integer solutions exist?
Ex 15: In how many ways can you divide 10 different
marbles among 3 students.
Ex 16: How many terms will (a + b + c)20 have?
Ex 17: You roll 4 dice. In how many ways can you
have a total of 19?
Ex 18: You have a 6 × 6 square grid.
Z Y
• • • • • • •
• • C
N
• •
NE
• •
• • 45°
E
B
• •
• •
X A
(i) How many straight lines can you make using
the dots?
(ii) How many ∆’s can you make with the dots?
(iii) How many quadrilaterals can you make using
the dots?
(iv) How many rectangles are there in whole fig?
(v) How many squares are there?
(vi) In how many ways can you go from A to C
without going through B? (you can go only
horizontally right, vertically up and diagonally
North–East direction i.e. hyphened lines)?
(vii) Imagine that this is a chess board (6 × 6). In
how many ways can you select a white squares
and then a black square such that it does not lie
on same row or column as the white?
(viii)Assume you have 6 colors. In how many
ways can you color this figure (each small
square) so that only 2 colors are used in
each row and no two adjacent squares have
the same color and no two adjacent rows
have the same color?
FGN101008/1
First we start by explaining the fundamental principle n!
n
Pr = = nCr × r !
of counting by taking an example. (n − r ) !

Say, we have a room with 3 distinct white doors and 2 Say that we will rarely use formulae. We will try to use
distinct black doors for entry and on the other side; logic as much as possible.
we have 2 distinct white doors and 4 distinct black We also discuss a few properties, such as:
doors for exit. *0! = 1
* nCr = nCn − r
n
The FM should ask the question and get the answer * nCr is max when r = (if n is even)
from the students: 2
n +1 n −1
• In how many ways can you enter the room? Or r = or (if n is odd)
2 2
• In how many ways can he exit the room?
* nPn = nPn−1 = n!
• In how many ways can he enter and leave the Now, we explain nPr using an example:
room?
Ex 1: Say, we have 5 digits: 1, 2, 3, 4, 5. How
The answers should be 5 for entry, 6 for exit and 30 many 5 digit numbers can we make without
for entering and leaving the room. repetition of digits?

Now explain why it was addition in the first 2 cases Sol: We will show it using logic.
while it was the product in the last case. Tell that We have a 5 digit No. i.e., 5 spaces to be
filled.
choosing a particular door for entering assures that
– – – – –
he cannot choose any other door, so we add the
The 1st place can be filled with any of the 5
possibilities. Same is the case for leaving the room. digits in 5 ways.
However, in the last case, choosing an entry door The 2nd place in 4 ways
doesn’t in any way affect the choice of an exit door. The 3rd place in 3 ways
As there are 5 entry points and 6 exit points, there are The 4th place in 2 ways
a total of 30 possibilities. The 5th place in 1 way
So, for these independent set of events, total
Now, generalize that whenever the selection of one no. of ways is 5 × 4 × 3 × 2 × 1 = 120.
decides the case for the others, we add and when We can also use nPn i.e. 5P5 = 5! = 120.
selection of one doesn’t affect the selection of others Next we take another question:
(independent event), we multiply.
Ex 2: There are 5 digits:
0, 2, 3, 5, 8.
Next, we explain what is Permutation and what is
(i) How many 4 digit Nos. can you make
Combinations using a simple example. Say, there are
without repetition of digits?
3 men A, B, C and there are 3 digits 1, 2, 3 and make (ii) Of these, how many are even?
a table as below:- (iii) Of these even, how many are not
div. by 4?
Combination Permutation (iv) In how many numbers do 2&8 come
A, B, C 1, 2, 3 together?
Select 2 men from Select 2 digits from the 3 (v) In how many numbers will 2 come before 8?
(Assume you use all 5 digits)
the 3 & make a number
(vi) In how many number will there be exactly
{(A,B), (B,C), (A, C)} {(1,2), (2,1), (1,3), (3,1), one digit between ‘2’ and ‘0’? (Assume
(explain that order is (2,3), (3,2)} you use all 5 digits).
not important here) (explain that the order is (vii) Sum of all the 4 digit Nos. = ?
important) (viii)If the numbers are arranged in inc. order,
rank of 3582 =?
So, explain that combination is just selection while (ix) How many 4 digit Nos. are possible
permutation is selection & then arrangement of the (with rep)?
selected one.
Now, introduce the notations. The FM should discuss each question one
– nCr represents selection of r articles out of n articles at a time
– nPr represents selection of r articles out of n and Sol: (i) There are 4 places to be filled:
then arranging the selected ones. – – – –
1st place in 4 ways (zero cannot be used)
Tell that the formula of 2nd place in 4 ways (zero can be used)
n
Cr =
n! 3rd place in 3 ways
(n − r ) ! r ! 4th place in 2 ways
So, answer = 4 × 4 × 3 × 2 = 96
===================================================================================================
Triumphant Institute of Management Education Pvt. Ltd. (7,0() HO: 95B, 2nd Floor, Siddamsetty Complex, Secunderabad – 500 003.
Tel : 040–27898194/95 Fax : 040–27847334 email : info@time4education.com website : www.time4education.com FGN101008/2
===================================================================================================
 (ii) For even Nos., it must end in 2 or 0 or 8. Now, with (2 _ 0) in the beginning of the
If it ends in zero: number, number of ways we have:
_ _ _ 0 (2 _ 0), _, _
No. of numbers = 4 × 3 × 2 = 24 The remaining 3 digits can be arranged in 3!
If it ends in 2 or 8: i.e. 6 ways. For each of these 6 ways, the
_ _ _ 8/2 space between 2 and zero can be filled in 3
No. of number = 3 × 3 × 2 × 2 = 36 ways. So, we have 18 (= 6 × 3) ways.
So, answer = 24 + 36 = 60 For each of these 18 ways, we interchange
position of 2 & 0, we will get 18 × 2 i.e.
(iii) To be div. by 4, last 2 digits should be 36 way.
div. by 4. [2 _ 0 and 0 _ 2]
Thus, we have the option as: However; 0 _ 2 cannot be used when it is in
_ _ 0 8 the beginning.
_ _ 2 0 Thus, we have (0 _ 2) _ _:
_ _ 2 8
_ _ 3 2 No. of ways = 3 × 2 = 6 ways not possible [3
_ _ 5 2 ways of selecting one digit but 0 & 2 and 2 for
_ _ 8 0 interchanging last 2 digits]. So, answer
= 36 − 6 = 30.
Now, for 08 or 20 or 80; number of ways
=3×2=6 How to calculate sum of all numbers:
For each of the others i.e., 28, 32 and 52,
number of ways = 2 × 2 = 4 (vii) Sum of all 4 digit Nos:
So, number of numbers div. by 4 =
3 × 6 + 3 × 4 = 30 Numbers will have the digits in different
Even numbers not div. by 4 = 60 − 30 = 30 positions.
(iv) As 2 and 8 come together, make it a
group. So, we have 4 digits: We will basically add positional values, say,
0, 3, 5, (28) for 2; we have:
So, number of ways: 2_ _ _
__ __ __ __ _ 2_ _
Zero cannot come in 1st place. _ _ 2 _
Thus, if we use (28), 3, 5 then we can _ _ _ 2
have 3! Arrangements i.e. 6.
If we used (28), 3, 0 or (28), 5, 0 then For 1st No. of numbers = 4 × 3 × 2 = 24; each
We have : 2 × 2 × 1 i.e. 4 ways. with positional value of 2000.
Total = 6 + 2 × 4 = 14 For 2nd No. of numbers = 3 × 3 × 2 = 18 with
But, for each such arrangements, 28 can positional value of 200.
become 82. So, there are 14 × 2 = 28 For 3rd No. of numbers = 3 × 3 × 2 = 18
ways. numbers with positional value = 20
(v) For 2 to come before 8: Finally, 18 numbers with positional value 2.
(a) 2 _ _ _ _ Thus, for 2, we have:
(b) _ 2 _ _ _ 24 × 2000 + 18 × (200 + 20 + 2)
(c) _ _ 2_ _ Similarly for 3, 5, 8
(d) _ _ _ 2 _ Thus, total sum = 24 × 1000 (2 + 3 + 5 + 8)
These are the possibilities for 2. + 18 × 111(2 + 3 + 5 + 8).
or 1st case: the remaining 4 digits can be
arranged in 4! = 24 ways. How to find the rank of a number:
In 2nd case: number of ways = 2 × 3 × 2 × 1 = 12
In 3rd case: there are 2 × 2 × 2 × 1= 8. (viii)The smallest number is 2035 and the largest
In 4th case: last digit must be 8. is 8532, so, 3582 lies in between.
So, for 1st 3 places, number of ways =
All numbers starting with 2 are less: 24
2×2×1= 4
numbers. Starting with 3, smallest no. is with
Thus, total = 24+12+8+4 = 48
30 ….No. of numbers = 3 × 2 = 6
96
[Note: 48 = i.e. there are 2 possibilities: Next is 32 → again 6 Nos.
2
Next is 350 → 2 Nos.
either 2 comes before 8 or after 8; both
Next is 352 → 2Nos.
equally possible. As total 5 digit numbers is
Next is 3580 → 1 No.
96
also, 96, ans. is just = 48] Next, we get 3582
2
Thus, we have: 35 Nos. before it. So, it is the
(vi) To have exactly one digit between 2 & 0;
36th number in rank.
make (2 _ 0) as one group.
===================================================================================================
Triumphant Institute of Management Education Pvt. Ltd. (7,0() HO: 95B, 2nd Floor, Siddamsetty Complex, Secunderabad – 500 003.
Tel : 040–27898194/95 Fax : 040–27847334 email : info@time4education.com website : www.time4education.com FGN101008/3
===================================================================================================
 (ix) What happens if repetition is allowed:
The 1st place has 4 ways
2nd place → 5
3rd place → 5
4th place → 5
Total ways = 4 × 53 = 500
(These 500 include the 96 in ans. (i))
Number of arrangements of n items of which p
are of one type, q of second type and rest
distinct:
Take for example, arrangements for the 3 letters A, B,
C are: ABC; ACB; BAC; BCA; CAB; CBA. Now, if we
replace A with another C, we get only CBC; CCB;
BCC, i.e. the no. of arrangements have come down
by 2! And have become (3! / 2!). Thus, the number of
arrangements are n!/ (p! x q!)
Ex 3: How many arrangements can you make for
the word INDEPENDENCE?
Sol: There are 12 letters so, these could have
been 12! Arrangements. But, there are 3 N’s,
2D’s, 4E’s. Hence, total arrangements would
12 !
be less and would be
3! 4! 2!
Ex 4: There are 6 men and 5 women. In how many
ways can you select 5 members so that there is:
(i) At least 1 women?
(ii) A particular woman is always present?
(iii) A particular man is always absent?
Sol: (i) We can have the following cases:
5 women → 5C5
4 women and 1 man → 5C4 × 6C1
3 women and 2 men → 5C3 × 6C2
2 women & 3 men → 5C2 × 6C3
1 woman & 4 men → 5C1 × 6C4
So, we can add up the above.
Alternate:
11
Total number of ways of selecting 5 out of 11 =
From that remove cases of all men i.e. 6C5
∴ answer = 11C5 − 6C5
(ii) One is always present, so, select 4 more
from 10 ⇒ 10C4
(iii) One is always absent, so select 5 from 10
⇒ 10C5.
Circular permutation:
Explain that in a straight line, ABCDE is different from
EABCD. However,
A (ii) Here, no. of ways is product of no. of
E
E B and D A mathematics individually i.e.(25 − 1) ×
D C C B
===================================================================================================
Triumphant Institute of Management Education Pvt. Ltd. (7,0() HO: 95B, 2nd Floor, Siddamsetty Complex, Secunderabad – 500 003.
Tel : 040–27898194/95 Fax : 040–27847334 email : info@time4education.com website : www.time4education.com
===================================================================================================
are the same arrangement as both are clockwise
ABCDE (a circle has no starting or end, so all
positions are identical). Thus, for circular arrangement,
we need to fix any one person. In that case, the rem.
4 can be arranged in 4! ways. Thus, in circular
permutation for n articles, no. of ways is (n −1)! [circular
table, etc.] In case of a circ. ring; as we can look both
ways,
A E
E B D A
D C C B
are same (as clockwise becomes, anti-clockwise
when looked from other side). Thus, no. of distinct
(n − 1) !
rings we get =
2
Ex 5: There are 13 friends. If they have to sit in 2
different tables. One is straight with 7 seats
and one circular with 6 seats, in how many
ways can they sit?
Sol: 1st select 7 friends from the 13 who will sit in
the straight table.
Then arrange. So, no. of arrangements =
13
C7 × 7! × 6C6 × 5!
6
( C6 = selecting 6 from 6 left i.e., 1 and 5! Is
arranging the 6 friends).
Ex 6: You have 10 questions. In how many ways
can you answer at least 1 question?
Sol: You can answer 1 or 2 or 3 ….. or 10
questions i.e. 10C1 + 10C2 + … + 10C10
Alternate:
Each question has 2 options: either you
attempt or you don’t. Same of all irrespective
of any other question. So, total options = 210.
However there is one way in which you have
not attempted any of the questions. So, no. of
ways in which you attempt at least 1 question
= 210 − 1.
C5. Thus we have:
10
C1 + 10C2 + ….. 10C10 = 210 − 1
or in general,
n
C1 + nC2 + …… nCn = 2n − 1
Ex 7: You have 5 different physics book, 4 different
chemistry books and 3 different Maths books.
In how many ways can you select.
(i) At least 1 book?
(ii) At least 1 book of each type?
Sol: (i) As all the books are different and there
are 12 books, no. of ways = (1212 − 1).
ways for physics, chemistry and
(24 − 1) × (23 − 1).
FGN101008/4
Ex 8: In the previous question if the maths books Ex 11: In how many ways can you divide 10 marbles
are identical and so are physics and among 3 boys such that each gets at least 1
chemistry. Answer both the parts of the marble?
previous question.
Sol: The situation can be presented as shown
Sol: If the physics books are identical, whether below:
you select 1 or 2 or 3 or all books, it can be
done in only 1way. Thus, for 1st case, for at
We first assign 1 marble each to the 3 boys
least 1 book:
which is done in only 1 way as the marbles
For physics:
are identical. Now, the remaining 7 marbles
1 book → 1 way
can be distributed among the boys in any
2 book → 1 way
way with a boy not getting any marble in
3 book → 1 way (7 + 3 – 1)
C(3 – 1) ways i.e. 9C2 ways.
4 book → 1 way
This can also be looked upon as:
5 book → 1 way
No book → 1 way
Total no. of ways = 6 oo|oooo|oooo

Similarly for chemistry and maths we have 5 If there are 10 marbles, gaps present
and 4 ways.
between the marbles would be 9. Now, we
(i) Thus, total ways for at least 1 = 6 × 5 × 4 − 1 have to place 2 partitions in between to
(remove the case where we selected divide into 3 groups.
none) = 119.
(ii) For 2nd case, no. of ways = 5 × 4 × 3 = 60 Thus, no. of ways in which this can be done
ways. in 9C2 i.e. (10 – 1)C(3 – 1).

Ex 9: In how many ways can you divide 12 different Thus, if ‘n’ identical articles are to be
books in 3 boxes equally? (boxes are distributed among r distinct groups with each
identical). group getting at least 1, no. of ways
= (n – 1)C(r – 1).
Sol: Each box must have 4 books. So, it basically
means selecting 4 books from 12 for 1st box
in 12C4, then 4 from remaining 8 i.e. 8C4 and Ex 12: In how many ways can you distribute at most
finally 4 from remaining 4 i.e. 1 way i.e. 12C4 × 10 marbles among 3 boys (each gets at least 1)?
8
C4 × 4C4.
Sol: This is same as in a + b + c ≤ 10 (positive
But as the 3 boxes are identical, the answer integral solutions)
12
C4 × 8C4 × 4C4 Case 1: a + b + c = 10 and
is
3! Case 2: a + b + c < 10 (case 2)
[Had the boxes been distinct : i.e., a + b + c + k = 10 where (k is positive)
Ans = 12C4 × 8C4 × 4C4] Case 1: 9C2
Case 2: 9C3
Ex 10: In how many ways can you divide 10 marbles Ans : 9C2 + 9C3
among 3 boys where a boy may not get a {If, a, b, c are non-negative integers, then
marble? a + b + c ≤ 10
⇒ a + b + c + k = 10
Sol: [This is the same as solving for a + b + c = 10 (where k ≥ 0)
where a, b, c are non- negative integers]. ⇒ No. of solutions = (10 + 4 – 1)C(4 – 1) = 13C3}
Think of this as a word having 10 B’s and
2 P’ (10 articles and 2 partitions). Here, we Ex 13: a + b + c + d ≤ 150;
have to find the no. of permutations possible a ≥ 25, b ≥ 25, c ≥ 25 and d ≥ 25.
(here, both the P’s i.e. partition can be in the How many integer solutions exist?
beginning as well as a group can have no
articles as well). So, no. of arrangements for Sol: a ≥ 25 ⇒ a = A + 25
such a word formed with 10 B’s and 2 P’s will
similarly, b = B + 25, c = C + 25, d = D + 25
12!
be i.e. basically 12C2 i.e.,(10 + 3 – 1)C(3 – 1) where A, B, C, D ≥ 0
10 ! × 2 ! Thus; a + b + c + d = A + B + C + D + 100 ≤ 150
⇒ A + B + C + D ≤ 50
Thus in general, for dividing n articles among ⇒ A + B + C + D + K = 50 ( K ≥ 0)
r group (each group not necessarily getting at ⇒ No. of sons =(50 + 5 – 1)C(5 – 1) = 54C4
least 1), no. of ways = (n + r − 1)C(r −1)
===================================================================================================
Triumphant Institute of Management Education Pvt. Ltd. (7,0() HO: 95B, 2nd Floor, Siddamsetty Complex, Secunderabad – 500 003.
Tel : 040–27898194/95 Fax : 040–27847334 email : info@time4education.com website : www.time4education.com FGN101008/5
===================================================================================================
Ex 14: In how many ways can you divide 10 different
marbles among 3 students.
Sol: 1st marble distributed in 3 ways and so for all.
So, no. of ways = 310
Ex 15: How many terms will (a+b+c)20 have?
Sol: We know that in any expansion like (a+b)3
= a3+3a2b+3ab2+b3; sum of powers of each
term is the power of the whole. Thus, each of
the 3 terms a, b, c will be having some
combination of powers that add up to 20 here
with some powers being zero. So, no. of terms
is same as dividing 20 articles among 3 terms
(non neg. solutions) =(20 + 3 – 1)C(3 – 1) = 22C2.
[Note: This answer is the same as that for
number of non-negative integer solutions for
a + b + c = 20. The answer would be the
same for the number of terms of (2a + 3b +
5c)20 as the coefficients do not affect the
number of terms. However, this is no longer
the same as number of non-negative integer
solutions for 2a + 3b + 5c = 10; where we
have to go case by case].
Ex 16: You roll 4 dice. In how many ways can you
have a total of 19?
Sol: Here, each dice has a maximum limit of 6.
So, the maximum score can be 24. But we
need 19, i.e. 5 less, so, let a, b, c, d are the
scores to be deducted from a maximum
scores of 6 from each dice:
Hence a+b+c+d = 5 (non − neg. solution)
⇒ no. of ways = (5 + 4 – 1)C(4 – 1) = 8C3
Ex 17: You have a 6 × 6 square grid.
Z Y
• • • • • • •
• • C
N adjacent squares in horizontal direction and 2
• •
NE
• •
45°
• •
B Selecting r adjacent things from n different
• •
• •
X A
(i) How many straight lines can you make using
the dots?
(ii) How many ∆’s can you make with the dots?
(iii) How many quadrilaterals can you make using
the dots?
===================================================================================================
Triumphant Institute of Management Education Pvt. Ltd. (7,0() HO: 95B, 2nd Floor, Siddamsetty Complex, Secunderabad – 500 003.
Tel : 040–27898194/95 Fax : 040–27847334 email : info@time4education.com website : www.time4education.com
===================================================================================================
(iv) How many rectangles are there in whole fig?
(v) How many squares are there?
(vi) In how many ways can you go from A to C
without going through B? (you can go only
horizontally right, vertically up and diagonally
North–East direction i.e. hyphened lines)?
(vii) Imagine that this is a chess board (6 × 6). In
how many ways can you select a white
squares and then a black square such that it
does not lie on same row or column as the
white?
(viii)Assume you have 6 colors. In how many
ways can you color this figure (each small
square) so that only 2 colors are used in
each row and no two adjacent squares have
the same color and no two adjacent rows
have the same color?
Sol: (i) for a straight line, we need 2 points. So, it
is basically selecting 2 dots from the dots in
the grid. Thus, it is 18C2. However, along XZ,
if you select any 2 points, we get same
straight line, similarly for YZ and XY. Thus,
no. of straight lines = 18C2 − 7C2 − 7C2 − 7C2 +
1 + 1 + 1 (as XY, YZ & ZX are 3 straight lines
themselves) i.e. 18C2 − 3.7C2 + 3.
(ii) No. of triangles:
For a triangle, we need 3 points and for a
similar reason (as last question) we have
(18C3 − 3 × 7C3).
(iii) For a quadrilateral, we need 4 points. But
selecting 4 points along a straight line won’t
give a quadrilateral. Also, selecting 3 points
along a straight line and one point outside
won’t give a quadrilateral. Thus, the solution
is 18C4 − 3.7C4 − 3.(7C3) × (11C1)
(iv) To make a rectangle, we need 2
horizontal lines and 2 vertical lines. There are
7 horizontal & 7 vertical lines. Thus, no. of
rectangles = 7C2 × 7C2.
(v) For the number of squares we follow the
following logic.
1st, we count square of dimensions 1 × 1:
There are 6 × 6 i.e., 36 such squares. Next,
we look at 2 × 2 dimension squares.
To make a 2 × 2 square, we need to select 2
adjacent squares in vertical direction.
Selecting 2 adjacent squares in horizontal
direction can be done in 5 ways [show by
counting and then give the general formula:
E
articles is possible in (n − r + 1) ways.
Thus no. of 2×2 dimension squares is 5 × 5
= 25. Similarly, for 3 × 3 squares, we have
= 4 × 4 = 16 and so on. So, no. of squares
=6×6+5×5+4×4+3×3+2×2+1×1
= 62 + 52 + 42 + 32 + 22 + 12 = (sum of
squares in this case) = 91.
FGN101008/6
 (vi) For this question, treat the paths as Thus for A to C via B, no. of ways = 13 × 25 = 325
follows:-
∴ No. of ways for A to C without going through B
We can go from A to C as follows. = Total number of ways for A to C − No. of way
From A we have to take 4 horizontal (H) and for A to C via B = 681 − 325 = 356
5 vertical (V) steps. If we take a diagonal step
(D), then we reduce one horizontal and one
(vii) If it is a 6 × 6 chess board no. of black squares = 18
vertical step at the same time.
Thus, we can think of this as a word. and no. of white squares = 18.
H H H H V V V V V → (a) So, number of ways of selecting a white
or square = 18.
H H H D V V V V → (b)
or
Now, for any white square selected, we cannot
H H D D V V V → (c)
or select 3 black squares along that row and 3 more
H D D D V V → (d) black squares along that columns i.e. 6 black
or squares. So, No. of possible black squares to be
D D D D V → (e) selected = 18 − 6 = 12 ways
9!
For (a) no. of arrangements = = 9C4 Thus, number of ways = 18 × 12 = 216 ways
4! 5!

For (b):
8! (viii)For the 1st row, number of ways of selecting
3!4! 2 colors from the 6 = 6C2
7! Now, for each row, the squares can be colored in
(c):
2! 2! 3! 2 ways (using the same 2 colors)
6! For example
(d):
3! 2! 1st sq. → color 1
5! 2nd → Color 2 and so on
(e):
4!
Thus from A to C, no. of paths or
 8! 7! 6! 5! 
=  9C4 + + + +  = 81. 1st sq. → color 2
 3 ! 4 ! 2! + 2! + 3 ! 3 ! 2! 4! 
2nd sq. → color 1 and so on
Now, if we have to go from A to C via B, we Now, for next row, we need to select 2more
first go from A to B and then from B to C
colors from the remaining four colors in 4C2 ways.
4!
HHVV→ = 4C 2 Again, that row can be colored in 2 ways i.e.,
2! 2! (4C2 × 2) ways.
or
H D V → 3! = 6 Now, for the next row, we can use any of the
or
DD→1=1 remaining 2 colors as well as the 2 colors used
i.e. (4C2 + 6 + 1) = 13 ways. for the 1st row i.e., select 2 colors from 4 colors
No. of ways for B to C: again; in: (4C2 × 2) ways and so on for all the
5! remaining 4 Nos.
HHVVV→ = 10
2! 3!
or Thus no. of ways = (6C2 ×2) × (4C2 × 2)5 = 30 × 125.
4!
HDVV→ = 12
2! [PLEASE NOTE: The last 2 parts of this
or question should only be done in very good
3! batches and not in any ordinary batch].
DDV→ =3
2!
i.e. (10 + 12 + 3) = 25 ways

===================================================================================================
Triumphant Institute of Management Education Pvt. Ltd. (7,0() HO: 95B, 2nd Floor, Siddamsetty Complex, Secunderabad – 500 003.
Tel : 040–27898194/95 Fax : 040–27847334 email : info@time4education.com website : www.time4education.com FGN101008/7
===================================================================================================