1. Tree Diagram 2. Multiplication Principle 3. Generalized Multiplication Principle 1.

Slides:



Advertisements
Similar presentations
4-1 Chapter 4 Counting Techniques.
Advertisements

Counting Principles Probability.
Counting Outcomes and Tree Diagrams
Chapter 7 Logic, Sets, and Counting
Math 221 Integrated Learning System Week 2, Lecture 1
How many possible outcomes can you make with the accessories?
6.3 Basic Counting Principles In this section, we will see how set operations play an important role in counting techniques.
Chapter 7 Logic, Sets, and Counting Section 3 Basic Counting Principles.
1 Section 4.1 Basics of Counting. 2 Basic Counting Principles: Sum Rule Suppose you have two tasks to perform: –The first task can be done in n 1 ways;
Elementary Probability Theory
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 93 Chapter 5 Sets and Counting.
Probability : Combined events 2
1. Conditional Probability 2. Conditional Probability of Equally Likely Outcomes 3. Product Rule 4. Independence 5. Independence of a Set of Events 1.
A tree diagram is a segmented graph in the shape of a tree in which no branch leads from any vertex back to itself. Each path through it represents a mutually.
3.0 State Space Representation of Problems 3.1 Graphs 3.2 Formulating Search Problems 3.3 The 8-Puzzle as an example 3.4 State Space Representation using.
Section 7.2 Arithmetic Sequences Arithmetic Sequence Finding the nth term of an Arithmetic Sequence.
By: 1. Kenneth A. Kim John R. Nofsinger And 2. A. C. Fernando.
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
7 Further Topics in Algebra © 2008 Pearson Addison-Wesley. All rights reserved Sections 7.4–7.7.
Permutations and Combinations
Section 3: Trees and Counting Techniques Example Suppose a fast food restaurant sells ice cream cones in two sizes (regular and large) and three flavors.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Suppose you are in a small restaurant and are ready to order a soup, a main course, and a beverage. (Unfortunately, you will need to go somewhere else.
TREES AND COUNTING TECHNIQUES When we simple events like rolling a die, the number of possible outcomes is easily found. When you start to have multiple.
13-1 Permutations and Combinations
Advanced Precalculus Advanced Precalculus Notes 12.2 Permutations and Combinations.
Goldstein/Schnieder/Lay: Finite Math & Its Applications, 9e 1 of 93 Chapter 5 Sets and Counting.
Conditional Probability The probability that event B will occur given that A will occur (or has occurred) is denoted P(B|A) (read the probability of B.
CLASS DIAGRAM. What is a class diagram? Imagine you were given a task of drawing a family tree. The steps you would take would be: What is a class diagram?
9-3 The Fundamental Counting Principle Pages Indicator(s)  D7.
Tree Diagrams.  A tree diagram helps us think through conditional probabilities by showing sequences of events as paths that look like branches of a.
1.A bank contains 6 quarters, 4 nickels, and 3 pennies. If I select 3 coins without looking, how many chances are there that I will select 1 of each coin?
Warm Up If the probability that a company will win a contract is .3, what is the probability that it will not win the contract? Suppose the probability.
Copyright © Cengage Learning. All rights reserved. Elementary Probability Theory 4.
Notes Over A school team sells caps in two colors (blue or white), two sizes (child or adult), and two fabrics (cotton or polyester). Draw a.
SATMathVideos.Net A set S consists of all multiples of 4. Which of the following sets are contained within set S? A) S2 only B) S4 only C) S2 and S4 D)
9.2 Connecting Probability to Models and Counting Remember to Silence Your Cell Phone and Put It In Your Bag!
5.4 The Multiplication Principle Bob is making arrangements to fly home for Thanksgiving. He has to fly to the local airport, then take a taxi to his parent’s.
Section Basic Counting Principles: The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n 1.
CS 104: Discrete Mathematics
AP STATISTICS LESSON AP STATISTICS LESSON PROBABILITY MODELS.
13.1 Permutations and Combinations Solve problems related to the Basic Counting Principle. Distinguish between dependent and independent events. Solve.
P REMUTATION AND M ULTIPLICATION P RINCIPLES Done by OWF, c October 31, 2013.
Counting Unit 1.
4-1 Chapter 4 Counting Techniques.
Permutations and Combinations
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
4 Elementary Probability Theory
12.2 Permutations and Combinations
Chapter 5 Probability 5.5 Counting Techniques.
A ratio that measures the chance that an event will happen
Do Now If fours cards are drawn from a deck without replacement, find the probability of getting these results: All kings All diamonds All sevens.
4-1 Chapter 4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
4 Elementary Probability Theory
8.3 Counting Apply the fundamental counting principle
Binomial Probability Distribution
Chapter 7 Logic, Sets, and Counting
Permutations and Combinations
13-1 Combinations and Permutations
6.2 Fundamental Counting Principal
Stochastic Processes and Trees
How many possible outcomes can you make with the accessories?
4-1 Chapter 4 Counting Techniques.
Sample Test Questions Please identify the use cases of the system that cover all the behaviors described in the system specification. Please identify.
Bellwork Practice Packet 10.3 B side #3.
5 Elementary Probability Theory
9.6 Counting Theory Example If there are 3 roads from Albany to Baker
Chances, Probabilities, and Odds
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Presentation transcript:

1. Tree Diagram 2. Multiplication Principle 3. Generalized Multiplication Principle 1

A tree diagram is a graph showing possibilities for an event having choices along the way. Suppose a rat in a maze starts at point A. There are five possible routes to get from point A to point B and 3 possible routes to get from point B to the final destination, point C. Represent the possible choices using a tree diagram. 2

3 Possible paths: 1a, 1b, 1c 2a, 2b, 2c 3a, 3b, 3c 4a, 4b, 4c 5a, 5b, 5c Total possible paths = 15

Multiplication PrincipleSuppose that a task is composed of two consecutive operations. If operation 1 can be performed in m ways and, for each of these, operation 2 can be performed in n ways, then the complete task can be performed in m  n ways. 4

 Use the multiplication principle to determine the number of different paths a rat can take going from point A to point C if there are five possible routes to get from point A to point B and 3 possible routes to get from point B to point C.  There are 5 possible routes for task 1 and 3 possible routes for task 2 so there are 5  3 = 15 possible routes. This agrees with the tree diagram drawn previously. 5

Generalized Multiplication Principle Suppose that a task is composed of t operations performed consecutively. Suppose operation 1 can be performed in m 1 ways; for each of these, operation 2 can be performed in m 2 ways; for each of these, operation 3 can be performed in m 3 ways; and so forth. Then the complete task can be performed in m 1  m 2  m 3 … m t ways. 6

 A corporation has a board of directors consisting of 10 members. The board must select from among its members a chairperson, vice chairperson, and secretary. In how many ways can this be done? 7

 The operations are:  1. Select chairperson - there are 10 ways (people) to do this.  2. Select a vice chairperson - there are 9 ways (9 people left after chairperson is chosen) to do this.  3. Select a secretary - there are 8 ways to do this.  Total number of ways to complete task is 10  9  8 = 720 ways. 8

 The multiplication principle states that the number of ways a sequence of several independent operations can be performed is the product of the number of ways each individual operation can be performed. 9