Classwork-12 Solution of Homework

Advanced Mathematics Classes Topic:Combinatorics
Dibyendu Saha Classwork-12 September 11, 2020
Solution of Homework
Homework 0.1. Among all permutations of the numbers 1, 2, · · · , 100, in how many of them,
maximum of first 50 numbers is in 50th place of the permutation and maximum of first 25
numbers is always in 25th place of the permutation?
Solution: Till now, we know that, number of permutations of the numbers 1, 2, · · · , 100, in
which maximum of first 50 numbers is at 50 th place is
100!
=
50
. Now, if we want to count among the above 100!/50 many permutations, in how many of
them first 25 numbers are always in ascending order, then that count will be
100!
50 × 25!
Now for each of the above permutations, if we consider all possible permutations of the first
24 numbers keeping the maximum at 25th place, then we will get the required number of
permutations
100! 100!
= × 24! =
50 × 25! 50 × 25
Alt. Solution: Till now, we know that, number of permutations of the numbers 1, 2, · · · , 100,
in which maximum of first 50 numbers is at 50 th place is
100!
=
50
. Now, maximum of the first 25 numbers will always be in one of the first 25 places of
the permutations and depending upon its this 25 possible position we will have 25 different
permutation in the above count. But we will count only 1 from this 25 possibilities for each
of the permutations. Hence, the number will be
100!
=
50 × 25
1
1 Permutation of Not All Different Objects

Example 1.1. Find number of all possible permutations of the letters of the following words,
taking all at a time.
(i) “LOGARITHM”
Ans.: 9![Since, all 9 letters are distinct.]
(ii) “UNIVERSITY”
Ans.: 10!/2![Since, out of 10 letters two I’s are identical.]
(iii) “ARRANGE”
Ans.: 7!/2!2![Since, out of 7 letters two A’s are identical and two R’s are identical.]
(iv) “MATHEMATICS”
Ans.: 10!/2!2![Since, out of 10 letters two A’s are identical and two M’s are identical.]
item “NARENDRAPUR”
11!
Ans.: 2!2!3! [Since, out of 11 letters two A’s are identical, two N’s are identical and three
R’s are identical.]
item “INDEPENDENCE”
12!
Ans.: 2!2!4! [Since, out of 12 letters two N’s are identical, two D’s are identical and four
E’s are identical.]
2
Example 1.2. In the figure below, these are 12 gas balloons. In any of the three queue if we
hit any balloon without hitting the balloons above this, we shall not be able to hit the balloons
above.
For example, if we hit balloon A2 before A1 then we shall not be able to hit balloon A1 . In
how many ways we can hit all the balloons?
Solution: To hit all the balloons we have to hit the balloons A1 , A2 , A3 , A4 , A5 in this order,
B1 , B2 , B3 , B4 in this order and also C1 , C2 , C3 in this order. Hence, total number of ways to
hit all the balloons is
12!
=
3!4!5!
Generalisation:
In general, number of ways to arrange n objects when p many of them are identical of one
kind, q many of them are identical of another kind and also r many of them are identical of
yet another kind, is
n!
p!q!r!
3
2 Combination
An informal definition of combination can be considered as,
Given a certain number of things, each of the different groups or selection that can be formed
out of them, by taking all of them or some of them at a time (ignoring the order of the choice
of the things in each group) is called a Combination of the given things.
2.1 Combination of n objects taking r(≤ n) at a Time,n Cr

Consider an yet another version of one of our friends and sitting arrangement problems,
Example 2.1. You have invited 7 of your friends and have 4 seats to make them eat. How
many combination of them is possible taking 4 at a time?[Note that, here we are counting in
how many ways we can feed them but depending upon there arrangement of sitting we are not
counting extra ways.]
Ans.: Number of sitting arrangements of 7 friends taking 4 at a time is

7!
=7 P4 =
3!
Now, among all this counting 4! arrangements are possible for a particular collection of 4
friends among 7 friends. But instead we shall be counting 1 for the above in our counting.
Hence, required number of combinations is
7
P4 7!
= =
4! 4!3!
Generalisation:
In general, number of combination of n different objects taking r(≤ n) at a time is
n n!
Cr :=
(n − r)!r!
Another Notation:
The number n Cr is also denoted by,

n n!
:=
r (n − r)!r!
4
2.2 Combination or Grouping

FACT 2.1. Find number of combination of n different objects taking (n − r) at a time.
Ans.: The required number is,
n n!
Cn−r =
(n − r)!(n − n + r)!
n!
= =n Cr
(n − r)!r!
Note that, number of combination of n different objects taking (n − r) at a time is same as

number of combination of n different objects taking r at a time. One simple thinking behind
this is that, whenever we are choosing a collection of r objects from n distinct objects then
we are also rejecting a collection of rest (n − r) objects from them. Or to be specific whether
we are collecting or rejecting that is unimportant in our counting, all we are doing is that,
we are making a division of groups among the given n objects, one group containing r many
of them and another containing (n − r) many of them.
3 Division and Distribution in Groups

3.1 Division in All Unequal Groups:
• Division into Two Groups: Number of division of m + n many distinct objects into
two group, one containing m many of them and another containing rest n many of
them
(m + n)! m+n
= = Cm =m+n Cn
m!n!
Provided m 6= n.
• Example: In how many ways 9 different chocolates can be divided into two collections
of chocolates one with 5 many of them and another with 4 many of them?
Ans.: The required number is

9!
=
5!4!
• Example:In how many ways 80 different students can be divided into two groups of
students one with 50 many of them and another with 30 many of them?
5

80!
=
50!30!
• Generalisation: Number of division of ki=1 ni many distinct objects into k groups,

P
where the number of objects in the k groups are {n1 , n2 , · · · , nk }
P
k
i=1 ni !
=
Πki=1 ni !
Provided n1 6= n2 6= · · · 6= nk .
3.2 Distribution in All Unequal Groups:

• Division into Two Groups: Number of distribution of m + n many distinct objects
into two group, one containing m many of them and another containing rest n many
of them
(m + n)!
= × 2! =m+n Cm × 2! =m+n Cn × 2!
m!n!
Provided m 6= n.
• Example: In how many ways 9 different chocolates can be distributed among two
different children such that one of them gets 5 chocolates and one of them gets 4
chocolates?
Ans.: For each division of this 9 different chocolates into two groups, one with 5 many
of them and another with 4 many of them, either we can give 5 chocolate to the first
child and 4 to the second or we can give 4 chocolate to the first child or 5 to the second.
Hence, the required number is
9!
= × 2!
5!4!
• Example:In how many ways 80 different students can be divided into two groups of
students one with 50 many of them and another with 30 many of them and finally
assign them to two different sections?

80!
= × 2!
50!30!
6
• Generalisation: Number of distribution of ki=1 ni many distinct objects into k dif-

P
ferent groups, where the number of objects in the k groups are {n1 , n2 , · · · , nk } [In any
order] P
k
i=1 i !
n
= × k!
Πki=1 ni !
Provided n1 6= n2 6= · · · 6= nk .
3.3 Division in All Equal Groups:

• Division into Two Groups: Number of division of 2n many distinct objects into two
equal groups each containing n many of them
(2n)!
=
(n!)2 2!
For each choice of n objects from the 2n objects, the remaining objects are also a
collection of n objects. Now from 2n many different objects we can choose n objects
in 2n Cn ways but half of them will produce the same division. That is why, the count
is (2n)!/((n!)2 2!).
• Example: In how many ways 10 different chocolates can be divided into two equal
collections of chocolates each one with 5 many of them ?

10!
=
(5!)2 2!
• Example:In how many ways 80 different students can be divided into two equal groups
of students each one with 40 many of them ?

80!
=
(40!)2 2!
• Generalisation: Number of division of nk many distinct objects into k groups, each

one with equal number of them in each of them
(nk)!
=
(n!)k k!
Logic behind the k! term in the denominator is left as an thinking exercise for the
reader.
7
3.4 Distribution in All Equal Groups:

• Distribution into Two Groups: Number of distributions of 2n many distinct ob-
jects into two different but equal groups each containing n many of them
(2n)!
=
(n!)2
Similarly, for each division of 2n objects we can distribute the groups in 2! ways. Hence,
the required number is
(2n)! (2n)!
= × 2! =
(n!)2 2! (n!)2
• Example: In how many ways 10 different chocolates can be distributed to two children
such that each of them gets equal numbers of chocolates?

10!
=
(5!)2
• Example:In how many ways 80 different students can be divided into two different
sections where each section contains equal numbers of students?

80!
=
(40!)2
• Generalisation: Number of distribution of nk many distinct objects into k different

groups, each one with equal number of them
(nk)!
=
(n!)k
4 Homework
Homework 4.1. Prove that, Number of diagonals of a n-gon is
n(n − 3)
=
2
Homework 4.2. How many rectangles are there in a 8 × 8 chessboard?

Classwork-12 Solution of Homework

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Classwork-12 Solution of Homework

Uploaded by

Copyright:

Available Formats

Advanced Mathematics Classes Topic:Combinatorics

Dibyendu Saha Classwork-12 September 11, 2020

1 Permutation of Not All Different Objects

Ans.: 9![Since, all 9 letters are distinct.]

Ans.: 10!/2![Since, out of 10 letters two I’s are identical.]

2.1 Combination of n objects taking r(≤ n) at a Time,n Cr

Ans.: Number of sitting arrangements of 7 friends taking 4 at a time is

2.2 Combination or Grouping

Ans.: The required number is,

Note that, number of combination of n different objects taking (n − r) at a time is same as

3 Division and Distribution in Groups

Ans.: The required number is

Ans.: The required number is

• Generalisation: Number of division of ki=1 ni many distinct objects into k groups,

3.2 Distribution in All Unequal Groups:

Ans.: The required number is

• Generalisation: Number of distribution of ki=1 ni many distinct objects into k dif-

3.3 Division in All Equal Groups:

Ans.: The required number is

Ans.: The required number is

• Generalisation: Number of division of nk many distinct objects into k groups, each

3.4 Distribution in All Equal Groups:

Ans.: The required number is

Ans.: The required number is

• Generalisation: Number of distribution of nk many distinct objects into k different

You might also like