Professional Documents
Culture Documents
Section 9.6 Counting Principles: Name
Section 9.6 Counting Principles: Name
Fundamental Counting Principle Let E1 and E2 be two events. The first event E1
can occur in m1 different ways. After E1 has occurred, E2 can occur in m2 different
ways. The number of ways that the two events can occur is m1 ⋅ m2.
Permutation An ordering of n different elements such that one element is first, one is
second, one is third, and so on.
Distinguishable permutations Suppose a set of n objects has n1 of one kind of
object, n2 of a second kind, n3 of a third kind, and so on, with n = n1 + n2 + n3 + . . . +
nk. Then the number of distinguishable permutations of the n objects is
n!/(n1!⋅n2!⋅n3!⋅ ⋅ ⋅ ⋅ nk!).
Combination A subset of a set of n elements in which the order is not important.
II. The Fundamental Counting Principle (Page 692) What you should learn
How to use the
The Fundamental Counting Principle can be extended to three or Fundamental Counting
more events. For instance, if E1 can occur in m1 ways, E2 in m2 Principle to solve
counting problems
ways, and E3 in m3 ways, the number of ways that three events
E1, E2, and E3 can occur is m1 ⋅ m2 ⋅ m3 .
2184 ways
45,360 ways
364 ways
Homework Assignment
Page(s)
Exercises