DISCRETE MATHEMATICS

Text Book :1. Joe L Mott, Abraham Kandel, Theodore P Baker,”Discrete Mathe-
matics for Computer Scientists and Mathematicians”, Second
edition, 2019.
2. J P Tremblay and P. Manohar, “Discrete Mathematical Structures
with applications to Computer Science”, TMH, 2007.
----------------------------------------------------------------------------------------------------

ELEMENTARY COMBINATORICS
(Unit-2)

2.1 Basics of Counting :

If X is a set of elements, then |X| is the number of elements in that set.

SUM Rule : The principle of disjunctive counting

“If a set X is union of disjoint nonempty subsets S1, S2,…,Sn,

then, |X| = (S1| + |S2| + … + |Sn|.”

Here, X =S1 U S2 U…. USn.

i.e., S1, S2,…,Sn is a disjoint partition of X.

Example-1 : In how many ways can we draw the following from an

ordinary deck of playing cards ?

a) A heart or a Spade : 26 ways.

b) A heart or an Ace : 16 ways.

c) An Ace or a King : 8 ways.

d) A card numbered 2 through 10 : 36 ways.

e) A numbered card or a King : 40 ways.

1
Example-2 : Assume that two distinguishable dice are thrown.

a) In how many ways, we can get a sum of 4 or 8.

(13,31, 22,26,62,35,53,44)

b) In how many ways, we can get even sum. (2,4,6,8,10,12)

(11, 13,31,22,15,51,24,42,33,26,62,35,53,44,46,64,55,66)

Answer : a) 8 ways b) 18 ways

(3+5) (1+3+5+5+3+1)
Example-3 : Assume that two indistinguishable dice are thrown.

a) In how many ways, we can get a sum of 8.

(26,35,44)

b) In how many ways, we can get even sum. (2,4,6,8,10,12)

(11,13,22,15,24,33,26,35,44,46,55,66)

Answer : a) 3 ways b) 12 ways

(2+4+6+8+10+12)
PRODUCT Rule : The principle of sequential counting

“If S1, S2,…,Sn are nonempty sets, then the number of elements in the
Cartesian Product S1 X S2 X … X Sn is the product  (i = 1 to n) |Si|.”

i.e.., |S1 X S2 X … X Sn| =  (i = 1 to n) |Si|

For example, if there are 5 elements in the S1 and 3 elements in S2, then
there will be totally 15 elements in S1 X S2.

Example-4 : a) If two distinguishable dice are thrown, in how many

ways can they fall. (36)
b) If five distinguishable dice are thrown, in how many
ways can they fall. (11111 to 66666)

Answer : a) 36 ways b) 65 ways

2
Example-5 :Suppose that the license plates of a certain state require
3 english letters followed by 4 digits.

a) How many different plates can be manufactured, if repetition

of letters and digits are allowed.

b) How many different plates can be manufactured, if repetition

of letters are only possible.

c) How many different plates can be manufactured, if repetition

of digits are only possible.

d) How many different plates can be manufactured, if no repetition

are allowed at all.

Answers : a) 263 . 104 b) 263 . 10. 9.8.7

c) 26.25.24. 104 d) 26.25.24.10.9.8.7

Example-6 :a)How many 3-digit numbers can be formed using the

digits 1,3,4,5,6,8 and 9, if repetition is allowed.

b) How many 3-digit numbers can be formed using above

digits, if no digit can be repeated.

Answers : a) 73 ways b) 7. 6. 5 ways

Example-7 :How many different license plates are there that involve
1, 2, or 3 letters followed by 4 digits.

Answer : [ 26 + 262 + 263 ] 104.

Example-8 :How many different license plates are there that involve
1, 2, or 3 letters followed by 1, 2, 3, or 4 digits.
3
 Answer : [ 26 + 262 + 263 ] [ 10 +102 + 103+ 104].

Example-9 :How many ways are there to roll two distinguishable dice to
yield a sum that is divisible by 3. (3,6,9,12)

Answer : 12 ways. (12,21,15,51,24,42,33,36,63,45,54,66)

Example-10 :How many ways are there to roll two distinguishable dice
to yield a sum that is divisible by 4. (4,8,12)

Answer : 9 ways. (13,31,22,26,62,35,53,44, 66)

Example-11 :How many integers between 1000 and 10,000 having

exactly one 8 and one 9.

Answer : 7.3.2.8 + 2.3.8.8 (720)

Example-12 :How many integers between 105and 106 having no digits

other than 2,5, or 8.

Answer : 36 integers.

Example-13 :In how many different orders can 3 men and 3 women be
seated in a row of 6 seats, if any one may sit in any of the seats.

Answer : 6! = 720 orders.

Example-14 :In how many different orders can 3 men and 3 women be
seated in a row of 6 seats, if the first and last seats must be filled by men.

Answer : 3. 2. 4! = 144 orders.

4
2.2 Combinations and Permutations :

Combination :“A combination of n objects taken r at a time is an

unordered selection of r of the objects.” (r combinations of n
objects).

Example-15 :

Let there are 5 objects : a, a, a, b, c

Then the 3-combinations of these 5 objects are : (4)

aaa, aab, aac, abc

Permutation :“A permutationof n objects taken r at a time is an

ordered selection of r of the objects.” (r permutations of n
objects).

Example-16 :Suppose there are 5 objects, from which selections are

to be made from a,a,a,b,c.

Let there are 5 objects : a, a, a, b, c

Then the 3-permutations of these 5 objects are : (13)

aaa, aab, aba, baa, aac, aca, caa,

abc, acb, bac, bca, cab, cba.

Example-17 :The 3-combinations of (3.a, 2.b, 2.c, 1.d) are : (14)

aaa, aab, aac, aad, bba, bbc, bbd,

cca, ccb, ccd, abc, abd, acd, bcd.

5
Example-18 : The 3-combinations of a,b,c,d with unlimited repetitions
are the 3-combinations of { .a, .b, .c, .d }.

Here there are 20 number of 3-combinations :

aaa, aab, aac, aad,

bba, bbb, bbc, bbd,
cca, ccb, ccc, ccd,
dda, ddb, ddc, ddd,
abc, abd, acd, bcd.

Example-19 :Find the 2-combinations and 2-permutations of unlimited

repetitions { .a, .b, .c, .d }. (with repetitions)

2-combinations 2-permutations
------------------------------------------------------------
aa aa

ab ab, ba

ac ac, ca

ad ad, da

bb bb

bc bc, cb

bd bd, db

cc cc

cd cd, dc

dd dd
------------------------------------------------------------
Total Number : 10 16

6
Example-20 :Find the 2-combinations and 2-permutations without
repetitions from the objects a, b, c, d.

2-combinations 2-permutations
without repetitions without repetitions
------------------------- ------------------------
ab ab, ba

ac ac, ca

ad ad, da

bc bc, cb

bd bd, db

cd cd, dc

------------------------- ------------------------
Total number : 6 12

Example-21 :Find the 3-combinations and 3-permutations without

repetitions from the objects a, b, c, d.

3-combinations 3-permutations
without repetitions without repetitions

------------------------- -------------------------------------
abc abc, acb, bac, bca, cab, cba

abd abd, adb, bad, bda, dab, dba

acd acd, adc, cad, cda, dac, dca

bcd bcd, bdc, cbd, cdb, dbc, dcb

------------------------- --------------------------------------
Total number : 4 24
7
2.3 Enumeration of Combinations and Permutations :

Let P(n,r) denote the number of ‘r’ permutations of ‘n’ elements

without repetitions.

TH : Enumerating r-permutations without repetitions.

P(n,r) = n(n-1)(n-2)…..(n-r+1) = n! / (n-r)!

Proof : Since, there are ‘n’ distinct objects, the first position of
r-permutation may be filled in ‘n’ ways. The second
can be filled in ‘n-1’ ways. The third can be filled in ‘n-2’
ways. Similarly, the rth position can be filled in n-r+1 ways.

So, P(n,r) = n! / (n-r)!

Note : P(n,n) = n!

Example-22 :Find the 3-permutations of (a,b,c).

Here, n = 3 and r = 3. So, P(3,3) = 3! = 6.

They are : (abc, acb, bac, bca, cab, cba)

Example-23 :In how many ways can 7 women and 3 men be arranged in
a row, if the 3 men must always stand next to each other.

Here, there are 3! ways of arranging 3 men.

Since, always 3 men stand to next to each other, we treat them as

single entity.

By considering 3 men as entity, there will be 8 objects together along with

7 women. Hence, there are (3!) (8!) permutations altogether.

8
Example-24 :In how many ways can the letters of English alphabet be
arranged so that there are exactly 5 letters between the letters a and b.

There are P(24,5) ways to arrange 5 letters between a and b.

There are exactly 2 ways to place a and b.

And, then 20! Ways to arrange any 7-letter word treated as one unit along
with remaining 19 letters.

The total is : P(24,5) . 2 . (20!)

Example-25 : How many 9-letter palindromes are possible using the

the english alphabet.

Answer : 265 ways.

Example-26 : Find the sum of all digits of 4-digit numbers having only
2,3,5,7 digits.

Answer : 24 . 17 = 408

Example-27 : Find the values of P(8,5) and C(6,3).

Answer : P(8,5) = 4.5.6.7.8 = 6,720

C(6,3) = 20

Note : Let P(n,r) = n! / (n-r)!

and C(n,r) = n! / [r! (n-r)!]

The relation between the above two is :

9
 P(n,r) = r! C(n,r)
Example-28 : A farmer buys 3 cows, 9 pigs and 12 chickens from a man
who has 9 cows, 25 pigs, and 100 chickens. How many choices does the
farmer have.

Answer : C(9,3) . C(25,9). C(100,12)

Example-29 : Suppose there are 50 distinguishable books including

18 english books, 17 french books and 15 spanish books. How many ways
can 2 books be selected.

Answer : C(50,2) ways

Example-30 : Find the number of ways in which 5 different English

books, 6 french books, 3 german books, and 7 russian books can be
arranged on a shelf so that all books of the same language are together.

Answer : 4! . 5! . 6! . 3! . 7!

Theorem-1 : There are (n-1)! Permutations of ‘n’ objects in a circle.

Example-31 : In how many ways can 5 children arrange themselves

in a ring.

Here, the 5 children are not assigned to particular places but are
only arranged relative to one another. Hence, the position of child
C1 is immaterial and it is only the position of the 4 other children
relative to C1 that counts. Therefore keeping C1 in a fixed position,
there are 4! arrangements of the remaining children.

Answer : 4!

10
Theorem-2: There are C(n,r) Combinations of ‘n’ objects without
repetitions.

C(n,r) = n! / [ r! (n-r)! ]

Example-32 : In how many ways can a hand of 5 cards be selected

from a deck of 52 cards.

C(52,5) = 52! /[ 5! 47! ] = 2,598,960 hands

Example-33 : In how many ways can a hand of 5 cards be selected

from hearts only.

C(13,5) = 13! /[ 5! 8! ] = 1,287 hands

Example-34 : How many committees of 5 or more can be chosen

from 9 people.

C(9,5) + C(9,6) + C(9,7) + C(9,8) + C(9,9)

Example-35 : There are 21 consonants and 5 vowels in the English

alphabet. Consider only 8-letter words with 3 different
vowels and 5 different consonants.
How many such words can be formed.

C(5,3) C(21,5) 8!

Example-36 : In how many ways are there to seat 10 boys and 10 girls
around a circular table.

19!

11
2.4 Enumerating Combinations and Permutations with repetitions :

Let U(n,r) denote the number of r-permutations of n objects with

unlimited repetitions.

Let V(n,r) denote the number of r-combinations of n objects with

Unlimited repetitions.

Theorem-3: The number of r-permutations with unlimited repetitions.

U(n,r) = nr

Example-37 : There are 25 true or false questions on an examination.

How many different ways can a student do the examination
if he or she can also choose to leave the answer blank.

3 25
Example-38 : How many 10-digit binary numbers are there with
exactly six 1’s.

C(10,6) = C(10,4) = 210

First Observation :

The number of r-combinations of ( .a1, .a2, .a3,…,.an) equals the

number of solutions of x1 + x2 + … +xn = r in nonnegative integers.

Second Observation :

The number of nonnegative integral solutions of x1 + x2 + … +xn = r is

equal to the number of ways of placing r indistinguishable balls in ‘n’
numbered boxes.

This can be seen by just interpreting that the kth box contains xk balls.
12
Third Observation :

The number of ways of placing r indistinguishable balls in ‘n’ numbered

boxes is equal to the number of binary numbers with (n-1) 1’s and r 0’s.

Example-39 : Let n = 10 and r = 7.

Let us have 7-combinations of ( .a1, .a2, .a3,…, .a10) such that

x1 + x2 + x3 + … + x10 = 7

Let the solution is : (3,0,0,2,0,0,0,2,0,0).

Here x1 = 3, x4 = 2, x8 = 2.

i..e., if there are 10 boxes and 7 balls to be in boxes, then

3 balls in box-1, 2 balls in box4 and 2 balls in box-8.

Here, the binary distribution is : 0001110011110011.

Fourth Observation :

The number of binary numbers with (n-1) 1’s and ‘r’ 0’s is :

C( n - 1 + r, r)

Here, we have ‘n – 1 + r’ positions.

And ‘r’ positions are occupied by 0’s and remaining ‘n-1’ positions
sre occupied by 1’s.

Theorem-4: The number of r-combinations with unlimited repetitions.

V(n,r) = The number of r-combinations of ‘n’ distinct objects with

unlimited repetitions

= The number of nonnegative integral solutions to

13
 x1 + x2 + … +xn = r
=The number of ways of distribution ‘r’ similar balls into ‘n’
numbered boxes.

= The number of binary numbers with ‘n-1‘ one’s and ‘r’ zeros.

= C ( n – 1 + r , r) = C ( n - 1 + r, n – 1 )

= (n+r–1)! / [r!(n–1)!]

Example-40 : Find the number of 4-combinations of ( .a1, .a2,

.a3,.a4, .a5). Here n = 5, r = 4.

C (5 – 1 + 4 , 4 ) = C ( 8, 4 ) = 70.

Example-41 : Find the number of 3-combinations of ( .a1, .a2,

.a3,.a4, .a5). Here n = 5, r = 3.

C (5 – 1 + 3 , 3 ) = C ( 7, 3 ) = 35.

Example-42 : Find the number of ways of placing 10 similar balls

in 6 numbered boxes.

Here, n = 6 and r = 10.

So, C(6 – 1 + 10, 10) = C( 15, 10) = 3,003.

Example-43 : How many different outcomes are possible, when

10 similar coins are tossed. n = 2 and r = 10

Answer : 11

Example-44 : How many different outcomes are possible, when

10 similar dice are thrown.

Here, n = 6 and r = 10

14
 C(6 – 1 + 10, 10) = C(15,10) = 3,003
Theorem-5: The number of integral solutions of x1 + x2 + … +xn = r,
where each xi > 0 is :
= The number of ways of distributing ‘r’ similar balls into
‘n’numbered boxes with at least one ball in each box.

= C[ n – 1 + (r - n), (r - n) ]

= C( r - 1, r - n)

= C( r - 1, n - 1).

Example-45 : Enumerate the number of ways of placing 20 indistin-

guishable balls into 5 boxes, where each box is non-empty.

C(24,20) = C(19,15) n = 5, r = 20

Example-46 : Enumerate the number of nonnegative integral solutions

to the following inequality :

x1 + x2 + x3 + x4 + x5  19

Here, the number of nonnegative integral solutions to 20 equations

x1 + x2 + x3 + x4 + x5  r (= 19)

where r can be any integer from 0 to 19. And n = 5.

So, the number of solutions are :

C(5 – 1 +0, 4) + C(5 – 1 +1, 4) + C(5 – 1 +2, 4) + … +C(5 – 1 +19, 4).

= C(4,4) + C(5,4) + C(6,4) +…+ C(23,4).

Here, there is 19 similar balls. We are counting the number of

ways of distributing either 0 or 1 or 2 or 3 or….or 19 of these
balls into the 5 boxes.

15
Example-47: How many outcomes can be obtained from rolling
m number of indistinguishable dice. Here n = 6, r = m.

C ( 6 + m– 1 , m ) = C (m + 5, m)

Example-48 : In how many ways can 5 glasses be filled with 10

different kinds of coffee, if no mixing is allowed and
the glasses are : n = 10, r = 5

a) Indistinguishable
b) Distinguishable

a) C (10-1 + 5,5) = C (14,5) , b) 105

Example-49 : Find the number of nonnegative integral solutions

x1 + x2 + x3 + x4 + x5 = 10

Here, n = 5, r = 10

C ( 10 + 5 - 1, 5 - 1) = C ( 14, 4) = C (14,10)

Example-50 : How many integral solutions are there of

x1 + x2 + x3 + x4 + x5 = 30 where for each ‘i’

a) Xi  0 (n=5, r=30)

b) Xi  1 (n = 5, r = 25)

c) Xi > i (n=5, r= 10)

d) X1  2 , X2  3, X3  4 , X4  2, X5  0 (n = 5, r=19)

Answers : a) C(34,30) b) C(29,25)

16
 c) (14,10) d) C(23,19)
2.5 Enumerating Permutations with Constrained repetitions :

Here, we have to find the number of permutations on the given

selection of ‘r’ objects.

Example-51 :Find the 3-combinations and 3-permutations of the

following.

[ 3.a, 2.b, 2.c, 1.d ]

-------------------------------------------------------
3-combinations The number of
3-permutations
-------------------------------------------------------
aaa 1

aab (aab, aba, baa) : 3

aac 3
aad 3

bba 3
bbc 3
bbd 3

cca 3
ccb 3
ccd 3

abc 6
abd 6
acd 6
bcd 6
----------------------------------------------------------
14 52

17
Theorem-6: Finding the number of n-permutations with
constrained repetitions.

Let there is a string (S) having ‘n’ number of letters. where some of
the letters in that are repeated for some number of times.

Let letter ‘l1’ repeated ‘n1’ number of times, ‘l2’ repeated ‘n2’
number of times,…,‘lk’ is repeated ‘nk’ number of times.

Then the n-permutations of above word is :

n!
---------------------------
n1! . n2! . n3! . …..nk!

Example-52 : How many different permutations are there for :

[ 3.a, 1.b, 1.c ]

Here, let x be the number of permutations.

Here the total number of letters is 5. The number of permutations

for this 5 is 5!.

There is one letter ‘a’ is repeated for 3 times. The number of per-
mutations for the letter ‘a’ is 3!.

Hence total number of permutations are : 5! / 3! = 20.

bcaaa bacaa baaca baaac abcaa

Cbaaa cabaa caaba caaab acbaa

abaca abaac aabca aabac aaabc

acaba acaab aacba aacab aaacb

18
Example-53 : How many 10-permutations are there for :

[ 3.a, 4.b, 2.c, 1.d ]

Basing on previous example, it can be said that :

The total number of permutations : 10! / [ 3! . 4! . 2! ] = 12,600.

Example-54 : Find the number of arrangements of the letters :

T A LL A H A S S E E

Here, n = 11, n1 (T) = 1, n2 (A) = 3, n3 (L) = 2,

n4 (H) = 1, n5 (S) = 2, n6 (E) = 2.

The letters in above word can be written as :

(3.A, 2.L, 2.S, 2.E, 1.T, 1.H)

So, the number of permutations are :

11!
-------------------------------------
3! .2! .2! .2! . 1! .1!

Example-55 :In how many ways can 23 different books be given to 5

students so that 2 of the students will have 4 books each and the
other 3 will have 5 books each.

Choose 2 students to receive 4 books each in C(5,2) ways.

Then to each such choice the 23 books can be distributed in

23!
P(23; 4,4,5,5,5) = ----------------------
4! 4! 5! 5! 5!

19
 23!
Thus, there areC(5,2) ---------------- total distributions.
4! 4! 5! 5! 5!

Example-56 :Let there are 1 to 5 binary bits to be sent.

In how many ways they can be sent.

21+ 22 + 23 + 24 + 25 = 26- 2 = 62

Example-57 :Find the number of 5-combinations and the number

of 5-permutations of (5.a, 3.b, 2.c, 3.d, 2.e, 1.f, 4.g)
-------------------------------------------------------------------------------------------
Types of Number of Number of Number of
Selection 5-Combinations Arrangements 5-Permutations
From each selection
-------------------------------------------------------------------------------------------
5-alike 1 5! / 5! = 1 1
-------------------------------------------------------------------------------------------
4-alike 12 5! / (4! 1!) = 5 12 * 5 =
1-different 60
-------------------------------------------------------------------------------------------
3-alike 20 5! / (3! 2!) = 10 20 * 10 =
2-others alike 200
-------------------------------------------------------------------------------------------
3-alike 4C(6,2) = 60 5! / (3! 1! 1!) = 20 60 * 20 =
2-others different 1,200
-------------------------------------------------------------------------------------------
2-alike 5C(6,2) = 75 5! / (2! 2! 1!) = 30 75 * 30 =
2-others alike 2,250
and 1 different
-------------------------------------------------------------------------------------------
2-alike 6C(6,3) = 120 5! / (2! 1! 1! 1!) = 60 120 * 60 =

20
 3-others different 7,200
-------------------------------------------------------------------------------------------
5-different C(7,5) = 21 5! /(1!1! 1! 1! 1!)= 120 21 * 120 =
2,520
-------------------------------------------------------------------------------------------
TOTAL 309 13,431

Ordered Partitions :

Def : Let S be a set with ‘n’ distinct elements.

Let ‘t’ be a positive integer.

The ‘t’ partition of the set S is a set

{A1, A2,….,At}

of ‘t’ subsets of S : A1, A2,…,At such that

S = A1 U A2 U …. U At … (1)

Ai Aj =  for i j . … (2)

Here, the subsets Ai are called ‘parts’ or ‘cells’ of S.

Example-58 : Let A1 = {a.b}, A2 = {c}, A3 = {d}.

Form a 3-part partition of S = {a,b,c,d}.

Here, the 3-part partition of S is :

{A1, A2, A3}, {A1,A3,A2}, {A2, A1,A3},

{A2, A3,A1}, {A3,A1,A2}, {A3,A2,A1}.

Example-59 : List all ordered partitions of S = {a,b,c,d} of type (1,1,2).

({a}, {b},{c,d}) ({b},{a},{c,d})

21
 ({a}, {c},{b,d}) ({c},{a},{b,d})

({a}, {d},{b,c}) ({d},{a},{b,c})

({b}, {c},{a,d}) ({c},{b},{a,d})

({b}, {d},{a,c}) ({d},{b},{a,c})

({c}, {d},{a,b}) ({d},{c},{a,b})

Theorem-7: Enumerating Ordered Partitions of a Set :

The number of ordered partitions of a set of S type (q1, q2,…,qt),

where |S| = n is :

n!
P(n; q1, q2,…,qt) = -------------------------
q1! q2! …. qt!

Example-60 : How many ways can the 52 cards (4 players) be dealt with all
four kings, when there are four players, each having equal number
of cards?
52! / (13!)4

Example-61 : How many ways will one player be dealt with all four kings,
where there are four players ?

4 ( 48! / [ 9 . (13!)3]

= 4 [ C(48,9) . C(39,13) . C(26,13). C(13,13) ]

Example-62 :Suppose there are four(4) players. How many ways will two
player be dealt with all four kings ?

No. of kings for two players Number of Ways

Player-1 Player-2
0 4 48! / [ (9!) (13!)3]
-----------------------------------------------------------------------------------------

22
 1 3 C(4,1) . 48! / [ (12!) (10!) (13!)2]
-----------------------------------------------------------------------------------------
2 2 C(4,2) . 48! / [ (11!)2 . (13!)2]
-----------------------------------------------------------------------------------------
3 1 C(4,1) . 48! / [ (12!) (10!) (13!)2]
-----------------------------------------------------------------------------------------
4 0 48! / [ (9!) (13!)3]

Unordered Partitions :

Theorem-8: Enumerating unordered Partitions of equal cell size :

Let S be a set.

There are ‘n’ elements in S such that n = q .t

Here, the number of unordered partitions of S of type (q, q, …, q) is :

[ 1 / t! ] [ n! / (q!)t ]

The number of ordered partitions of a set of S type (q1, q2,…,qt),

where |S| = n is :

n!
P(n; q1, q2,…,qt) = -------------------------
q1! q2! …. qt!

Example-63 : How many ways can 14 men be partitioned into 6 teams where,
the first team has 3 members, the second team has 2 members, the third team
has 3 members, and the fourth, fifth and sixth teams each have 2 members ?

Here, the distribution of number of members in teams is : (3, 2, 3, 2, 2, 2).

Hence, P(14 ; 3, 2, 3, 2, 2, 2) = 14! / [ 3!.2!.3!.2!.2!.2! ]

= 14! / [ (3!)2 . (2!)4]

23
Example-64 : How many ways can 12 men out of 14 men be partitioned into
3 teams where, the first team has 3 members, the second team has 5 members,
the third team has 4 members ?

C(14,12) . { 12! / [ (3!) . (5!). (4!) ] }

Example-65 : How many ways can 12 men out of 14 men be partitioned into
3 teams of 4 each.

The distribution of men in teams is : (4, 4, 4).

C(14,12) . { 12! / [ (3!) . (4!)3 ] }

Example-66 : How many ways can 14men be partitioned into 6 teams where,
the first and second teams have 3 members each, and third, fourth, fifth and
sixth teams have 2 members each ?

14! / [ (3!)2. (2!)4 ] }

Example-67 : How many ways can 14 men be partitioned into 6 teams where,
two teams have 3 men each, and four teams have 2 men each ?

14! / [ 2! . 4! . (3!)2. (2!)4 ] }

2.7 The principle of Inclusion-Exclusion :

a) If A and B are subsets of some universe set U, then

| A U B| = |A| + |B| - |A  B|. ….. (1)

b) Here, A U B is the union of three disjoint sets.

They are :
|A U B|= |A  B’| +|A  B|+|A’ B| ….. (2)

24
c) Let |A| = |A  B’| + |A  B| .
and |B| = |A  B| + |A’  B|.
|A| + |B| = |A  B’| + |A  B| + |A’  B| + |A  B| ….. (3)

Draw the corresponding Venn Diagram here.

Example-68 : Draw the venn diagram for two sets A and B.

Denote each partition of with the help of A, B, intersection and
complement only.

First Part : A – B = A  B’
Second Part :A  B
Third Part :B – A = A’  B

Here, | A U B| = |A| + |B| - |A  B|.

Example-69 : Draw the venn diagram for three sets A , B and C.

Denote each partition of with the help of A, B, intersection and
complement only.

First Part : A  B’  C’
Second Part : A  B  C’
Third Part : A’ B  C’
Fourth Part : A  B’  C
FifthPart : ABC
Sixth Part : A’ B  C
Seventh Part : A’ B’  C

25
Here, | A U B U C| = |A| + |B| + |c| - |A  B|
- |A  C| - |B  C| + |A  B  C|.

Prove above using partition numbers.

Example-70 : Suppose that 200 lecturers can speak French and

50 can speak Russian, while only 20 can speak both French and
Russian. How many lecturers can speak either French or Russian ?

Let A is the set of lecturers who can speak French.

Let B is the set of lecturers who can speak Russian.
Here, |A| = 200, |B| = 50 and |A  B| = 20
Now, let us consider | A U B| = |A| + |B| - |A  B|.
i.e., The no. of lecturers who speak French or Russian = 230.

Example-71 : Suppose that

- 200 lecturers can speak French.
- 50 lecturers can speak Russian.
- 100 lecturers can speak Spanish.
- 20 lecturers can speak French and Russian.
- 60 lecturers can speak French and Spanish.
- 35 lecturers can speak Russian and Spanish.
- 10 lecturers can speak either French or Russian or Spanish ?

How many lecturers can speak either Russian or French or Spanish ?

Let A is the set of lecturers who can speak French.

Let B is the set of lecturers who can speak Russian.
Let C is the set of lecturers who can speak Spanish.
Here, |A| = 200, |B| = 50 , |C| = 100.
and |A  B| = 20 , |B C| = 35 , |A  C| = 60 .
and |A  B C| = 10 .

26
Let us find the value of | A U B U C|.

Here, | A U B U C| = |A| + |B| + |c| - |A  B|

- |A  C| - |B  C| + |A  B  C|.
= 200 + 50 + 100 – 20 – 60 – 35 + 10 = 245.

Example-72 : Suppose that there are 100 computer programmers.

In this 47 are using Fortran. 35 are using Pascal. And 23 are doing
Both. How many can program in neither of these 2 languages.

100 – 47 - 35 + 23

Answer : 41.

Example-73 : In addition to example-72, suppose 20 can program

Cobol, 12 can program Cobol and Fortran, 11 can program Pascal
and Cobol and 5 in Pascal, Fortran and Cobol.

Find how many can program none of the above three languages.

100 – 47 – 35 – 20 + 23 + 32 + 12 + 11 – 5

Answer : 39

* * * * *

27