This preview shows pages 1–2. Sign up to view the full content.
Section 6.3 – The Multiplication Principle
1
Section 6.3
The Multiplication Principle
Generalized Multiplication Principle
Suppose a task T
1
can be performed in N
1
ways, a task T
2
can be performed in N
2
ways,…, and
, finally a task T
n
can be performed in N
n
ways.
Then the number of ways of performing the
tasks T
1
, T
2
, …, T
n
in succession is given by the product
N
1
•
N
2
•
…
•
N
n
.
Example 1: You need to create a 4 digit password using only the digits 1 and 2. In how many
different can you select a password?
Example 2: How many 4letter words can be written by using the first 10 letters of the alphabet if
a) repetition is allowed?
b) repetition is not allowed?
Example 3:
A coin is tossed 3 times, and the sequence of heads and tails is recorded.
a.
Determine the number of outcomes of this activity.
b.
List the outcomes of this experiment by first drawing a tree diagram.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document Section 6.3 – The Multiplication Principle
2
Example 4:
The Burger Bar offers the following items on its menu:
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 02/21/2012 for the course MATH 1313 taught by Professor Constante during the Spring '08 term at University of Houston.
 Spring '08
 CONSTANTE
 Math, Multiplication

Click to edit the document details