Combinatorial Analysis: Kutay Tinç, PHD
Combinatorial Analysis: Kutay Tinç, PHD
ANALYSIS
Kutay TİNÇ, PhD
COUNTING
It is important to have an effective method for counting the number of ways things can occur.
If there are m possible outcomes for an experiment and n possible outcomes for another
experiment, then there are mn possible outcomes of the combined experiment.
Ex1a:
A small community consists of 10 women, each of whom has 3 children. If one woman and one
of her children are to be chosen as mother and child of the year, how many different choices are
possible?
Ex1b:
A college planning committee consists of 3 freshmen, 4 sophomores, 5 juniors, and 2 seniors. A
subcommittee of 4, consisting of 1 person from each class, is to be chosen. How many different
subcommittees are possible?
PERMUTATIONS
How many different ordered arrangements (permutations) of the letters a, b, and c are possible?
Ex2:
Ms. Jones has 10 books that she is going to put on her bookshelf. Of these, 4 are mathematics
books, 3 are chemistry books, 2 are history books, and 1 is a language book. Jones wants to
arrange her books so that all the books dealing with the same subject are together on the shelf.
How many different arrangements are possible?
Ex3:
How many different letter arrangements can be formed using the letters P E P P E R ?
Ex4:
How many different signals, each consisting of 9 flags hung in a line, can be made from a set of
white flags, 3 red flags, and 2 blue flags if all flags of the same color are identical?
COMBINATIONS
We are often interested in determining the number of different groups consisting of r objects that
could be formed from a total of n objects. For instance, how many different groups of 3 items
could be selected from the 5 items A, B, C, D, and E ?
To answer this, reason as follows: Since there are 5 ways to select the initial item, 4 ways to then
select the next item, and 3 ways to select the final item, there are thus 5 . 4 . 3 ways of selecting
the group of 3 when the order in which the items are selected is relevant.
However, since every group of 3, say, the group consisting of items A, B, and C, will be counted
6 times (that is, all of the permutations ABC, ACB, BAC, BCA; CAB, and CAB will be counted
when the order of selection is relevant), it follows that the total number of groups can be formed
is
COMBINATIONS
COMBINATIONS
Ex5:
From a group of 5 women and 7 men, how many different committees consisting of 2 women
and 3 men can be formed? What if 2 of the men are quarrelling and refuse to serve together?
Solution:
So there are 350 possible committees.
For the second part there are different ways the quarrelling men can be together in the
committee, which leaves 30 possible outcomes. Hence a total of 300 possible committees.
MULTINOMIAL COEFFICIENTS
Ex6:
A police department in a small city consists of 10 officers. If the department policy is to have 5
of the officers patrolling the streets, 2 of the officers working full time at the station, and 3 of the
officers on reserve at the station, how many different divisions of the 10 officers into the 3
groups are possible?
Ex7a:
Ten children are to be divided into an A team and a B team of 5 each. The A team will play in
one league and the B team in another. How many different divisions are possible?
Ex7b:
In order to play a game of basketball, 10 children at the playground divide themselves into two
teams of 5 each. How many different divisions are possible?
NUMBER OF INTEGER
SOLUTIONS
There are distinct positive integer-valued vectors (x1, x2, …,xr) satisfying
x1 + x2 + …. + xr = n , xi > 0, i = 1, ….., r
There are distinct nonnegative integer-valued vectors (x1, x2, …,xr) satisfying
x1 + x2 + …. + xr = n
NUMBER OF INTEGER
SOLUTIONS
Ex8:
An investor has 20 thousand dollars to invest among 4 possible investments. Each investment
must be in units of a thousand dollars. If the total 20 thousand is to be invested, how many
different investment strategies are possible? What if not all the money need be invested?
NUMBER OF INTEGER
SOLUTIONS
We
have a set of n items of which m are defective. Linear orderings in which no two defectives
are next to each other?
Let 0 show defectives and denote the number of functional items (n-m);