Transcript Agenda for August 15

Agenda for August 20
•
•
•
•
•
Warm up
Go Over Homework
Tree Diagrams
Fundamental Counting Principle
Homework
Warm Up
There are 10 players in a chess
tournament. How many games are
needed so that each player plays
every other player one time?
45
Go Over Homework
1. B
2. C
3. C
4. A
5. C
6. C
7. B
8. oops
9. C
10. B
Tree Diagrams
A tree diagram is a branching diagram
(picture) that shows all possible outcomes
or combinations of an event.
Ex 1: Rolling a Die Ex 2: Tossing a coin
two times
Tree Diagrams
Worktext page 296
Group Activity
8 groups (2 A’s, B’s, C’s and D’s)
Rotate tree diagram activities
Last group writes on chart paper
Tree Diagrams
Is it practical to draw a tree diagram for all
situations?
Is there a quick way to find out how many
combinations you can make?
Fundamental Counting Principle
Practice
1) Find the number of possible outcomes if
you had a choice of 8 cars and 9 color
choices.
2) A hall locker combination lock has 3
numbers (0 – 49). The numbers can
repeat. How many possible 3 number
combinations exist?
Summary
Describe when you would want to use the
Fundamental Counting Principle instead of
a tree diagram.
Describe when a tree diagram would be
more useful than the Fundamental
Counting Principle.
Homework
Textbook page 560-561; 4-5, 9-19
Don’t forget Friday 8/29 is the Unit
1 test. There will still be a quiz
on Tuesday the 26th.