combinatorics chapter 3 section 3.1 trees and equally likely outcomes finite mathematics – stall

16
Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

Upload: steven-sherman

Post on 21-Dec-2015

216 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

Combinatorics Chapter 3 Section 3.1 Trees and

Equally Likely Outcomes

Finite Mathematics – Stall

Page 2: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

• 3.1 Trees and Equally Likely Outcomes• • Combinatorics: • _____The study of counting___• List two examples of counting problems given

on page 63.• 1. ____________________________________

• 2._____________________________________

Equally Likely Outcomes

Page 3: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

Equally Likely Outcomes• 3.1 Trees and Equally Likely Outcomes

• Give an example of a one stage experiment. ________________________________________________

• All the possible outcomes of an experiment is called the __________________________________ of the experiment.

• A simple two stage experiment might be rolling a die and then flipping a coin and noting the results. The sample space for this experiment contains ordered pairs of elements.

• List them: S = {1H, 2H, ___________________________}• This is the Sample Space for this two stage experiment.

Page 4: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

• Example A:• A committee of four people must select a chairman and a secretary

for the next year. How many outcomes are in the sample space?• Solution: Let the four people be represented by the letters a, b, c,

and d. The first letter can be the person selected to be chairman, and the second letter is the person selected as secretary.

• The sample space S = __________________________________

• Note: Elements of the sample space “ab” is not the same as “ba”!!!

• This represents the same two people but in ____________

Equally Likely Outcomes

Page 5: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

• Work problems 1-4 from page 64.• 1. _________________________________________________________• __________________________________________________________

• 2. ___________________________________________________________• ___________________________________________________________

• 3. _______________________________________________________________

• _______________________________________________________________

• 4. _________________________________________________• __________________________________________________________

Equally Likely Outcomes

Page 6: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

• Tree Diagrams:• When are tree diagrams most useful?

_______________________________________________________________

Equally Likely Outcomes

Page 7: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

• Example B: • An experiment consists of selecting one card from a deck and

noting the suit, then flipping a coin and noting heads or tails. Draw a tree diagram to represent the outcomes.

• Solution:

• Work problems 5 – 9 on page 66.

Equally Likely Outcomes

Page 8: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

Equally Likely Outcomes

Page 9: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

• Apply the Fundamental Counting Principle to Example B• Stage one could be Hearts, Diamonds, Spades or Clubs

and Stage two could be _________________• • So the number of possible outcomes is 4 ____ = ∙

_____•

Equally Likely Outcomes

Page 10: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

• Example C:• A history test consists of 4 T/F questions followed by 3 multiple-choice

questions which contain 5 responses to each. Each question on the test has only one correct response. How many different ways can a student respond to the seven questions? Assume no questions are left blank.

• • Solution: • Would drawing a tree diagram be practical? • Why or why not?____________________________________• Solution: Try the Fundamental Counting Principle:•

• 2x2x2x2x5x5x5 = 2,000 different ways a student can answer the seven questions. Only one of the 2,000 ways makes a perfect score!!

Equally Likely Outcomes

Page 11: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

• Work problems 10-12 on page 67.

Equally Likely Outcomes

Page 12: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

• Example D: • A hat contains the names of four people ( Amy, Bart, Cody, and Duke) who are entered

in a contest. A name will be drawn from the hat and that person will win $100. Then a second name will be drawn from the same hat and this person will receive $5.

• How many ways can the two cash prizes be awarded to the four people entered in the contest?

• • Solution: What is the number of outcomes for the first stage? ___________• • What is the number of outcomes on each branch of the first stage representing the

second stage? ______________________• Draw the tree.•

• There are 12 different outcomes. • Using the Fundamental Counting Principle, we would write 4 3 = 12∙

Equally Likely Outcomes

Page 13: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

• ***Change the above problem to awarding four prizes to all four people.

• Using the FCP, we write for 4 stages. 4 3 2 1 = 24∙ ∙ ∙• This computation can be written as 4!, read as “four

Factorial”.

Equally Likely Outcomes

Page 14: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

• Example E

Equally Likely Outcomes

Page 15: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

• Example F

Equally Likely Outcomes

Page 16: Combinatorics Chapter 3 Section 3.1 Trees and Equally Likely Outcomes Finite Mathematics – Stall

• 3.1 IP page 71 – 72: • problems #17-27 odd, 28 – 31.

• Questions??

• 3.1 B IP page 71 – 72: • problems #16-30 even.

Equally Likely Outcomes