Scribd
Upload
22 views27 pages

4 - 3 - Counting Methods and Applications

Notes

Uploaded by

silvercolin77
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
22 views27 pages

4 - 3 - Counting Methods and Applications

Notes

Uploaded by

silvercolin77
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 27

GEM 605

Probability Theory and


Random Processes
Counting Methods
1.
Basic Rules of
Counting
Fundamental Principle of Counting

▣ also known as the product rule of counting


or the multiplication rule of counting

▣ “Assuming a task can be broken down into a


sequence of k independent subtasks, where k
is a positive integer. If the first subtask can be
accomplished in ways, the second subtask in
ways, …, and the th subtask in ways, then
there are a total of distinct ways to
accomplish the task.”
▣ How many positive three-digit

‘’
Problem 1
integers are there that are not
multiples of five?
▣ How many two-digit prime numbers

‘’
Problem 2
and two-digit even numbers are
there?
▣ How many positive two-digit integers

‘’
Problem 3
are there that are multiples of 5 or 7
or both?
▣ In a survey of 120 people, it was

‘’
Problem 4
found that 65 have shares of stock,
45 have shares of stock, and 42 have
shares of stock. It was also found
that 20 have shares in both and
stocks, 25 have shares in both and
stocks, 15 have shares in both and
stocks, and 8 have shares in all
three , , and stocks. Determine the
number of people who have shares
exactly in one stock, and the number
of people who have no shares at all.
▣ A computer access password

‘’
Problem 5
consists of four to seven digits chosen
from 0 to 9 inclusive, where no digit
in a password can be repeated. How
many different passwords are
possible?
▣ How many different sequences of

‘’
Problem 6
five bits do not have two consecutive
zeros?
2.
Permutations
and
Combinations
Combinatorics

▣ Combinatorics is the study of systematic counting


methods; it determines the cardinalities of
various sets that arise in probability.

▣ Order counts with permutations.


□ Order of letters in a word
□ Sequence of digits in a telephone number
□ Positions in hierarchical systems
▣ Order does not count with combinations
□ Selections of members of committees and teams
□ Counting of subsets
□ Cards dealt to form a hand in a card game
Formulas

▣ Permutations without replacement

▣ Combinations without replacement

▣ Permutations with replacement

▣ Combinations with replacement


▣ How many different ways are there to

‘’
Problem 7
select a gold medallist, a silver
medallist, and a bronze medallist
from 195 athletes with different
nationalities who have entered a
world sports competition?
▣ There are 15 players on a sports

‘’
Problem 8
team. The starting lineup consists of
only five players. How many possible
starting lineups are there, assuming
what positions they play are of no
concern?
▣ How many two-letter words in the

‘’
Problem 9
English language, from the letters to
inclusive, can be made, noting that
the words do not need to have
meaning?
▣ An ice cream parlor has 20 different

‘’
Problem 10
flavors of ice creams. In how many
ways can a selection of five ice
creams be chosen?
3.
Multinomial
Counting
Multinomial Coefficient

▣ Suppose we have objects, out of which there are


indistinguishable objects of type 1, indistinguishable
objects of type 2, …, and indistinguishable objects of
type , where as well as , , …, are all positive integers,
and we have . The number of distinguishable ways to
arrange the objects is:
▣ How many different words can be

‘’
made by reordering the letters of
the word MUMMY, noting that the
words do not need to have
Problem 11 meaning?
▣ In a card game, how many ways

‘’
are there to distribute hands of five
cards to each of six players from a
standard deck of 52 cards?
Problem 12
▣ There are four workers, say A, B, C,

‘’
and D, who can be assigned to
three different chores, say X, Y, and
Z. Note that one worker is needed
Problem 13 to do chore X, one worker is needed
to do chore Y, but two workers are
needed to do chore Z. In how many
ways can the workers be formed?
4.
Special
Arrangements
and Selections
Hypergeometric Probability

▣ Suppose , , …, are all positive integers, and we want


to make unordered selection without replacement of
objects from a group objects, objects from a group of
objects and so on. Note that is the total number of
objects and is the total number of objects selected in
an unordered fashion and without replacement. The
number of ways to make such a particular selection is
the product of binomial terms.
Circular Permutation

▣ If objects are arranged in a circle, there are


permutations of objects around the circle. This is known
as the circular permutation.
▣ Suppose we have 8 red balls, 12

‘’
green balls, and 18 blue balls in a
bag. Determine the number of ways
to make an unordered selection
Problem 14 without replacement of 6 red balls,
4 green balls, and 2 blue balls, and
also the corresponding
hypergeometric probability.
▣ In a class, there are seven male
students and eight female students.
Determine the number of ways for
each of the following cases: (a)

‘’
select a six-member committee
from the students, (b) select a six-
member committee with three male
students and three female students,
Problem 15 (c) select a six-member committee
with a given student as a
chairperson, and (d) elect a
president, a vice president, and a
treasurer.
‘’
▣ How many different ways are there
to seat six people around a circular
table?
Problem 16

You might also like