Chapter 10 Counting Methods.

Slides:



Advertisements
Similar presentations
Chapter 3 Probability.
Advertisements

Basic Concepts of Probability
Larson/Farber 4th ed 1 Basic Concepts of Probability.
Chapter 8 Counting Principles: Further Probability Topics Section 8.3 Probability Applications of Counting Principles.
Activity 1 Activity 2 Index Student Activity 1: Tossing a coin Student Activity 2: Tossing two coins.
Section 7A: Fundamentals of Probability Section Objectives Define outcomes and event Construct a probability distribution Define subjective and empirical.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Probability Using Permutations and Combinations
EXAMPLE 4 Use Pascal’s triangle School Clubs The 6 members of a Model UN club must choose 2 representatives to attend a state convention. Use Pascal’s.
F A T R N T EP N I D A Much of mathematics is based on patterns, so it is important to study patterns in math. We use patterns to understand our world.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Topics to be covered: Produce all combinations and permutations of sets. Calculate the number of combinations and permutations of sets of m items taken.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 12.3, Slide 1 12 Counting Just How Many Are There?
 History and Relevance of probability theory Probability theory began with the study of game of chance that were related to gambling, like throwing a.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Section 11.4 Tree Diagrams, Tables, and Sample Spaces Math in Our World.
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 12.3, Slide 1 12 Counting Just How Many Are There?
Chapter Probability 1 of 88 3 © 2012 Pearson Education, Inc. All rights reserved.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Probability of Independent and Dependent Events CCM2 Unit 6: Probability.
Copyright © 2015, 2012, and 2009 Pearson Education, Inc. 1 Chapter Probability 3.
Aim: How do we find probability using Pascal’s triangle? Do Now: If a coin is tossed two times, what is the probability you will get 2 heads?
Probability Experiments Probability experiment An action, or trial, through which specific results (counts, measurements, or responses) are obtained. Outcome.
Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects.
Counting Techniques (Dr. Monticino). Overview  Why counting?  Counting techniques  Multiplication principle  Permutation  Combination  Examples.
 2012 Pearson Education, Inc. Slide Chapter 10 Counting Methods.
SECTION 10-4 Using Pascal’s Triangle Slide
PROBABILITY AND STATISTICS WEEK 2 Onur Doğan. Introduction to Probability The Classical Interpretation of Probability The Frequency Interpretation of.
The Multiplication Rule
Counting Principles Ex. Eight pieces of paper are numbered 1 to 8 and placed in a box. One piece of paper is drawn from the box, its number is written.
Chapter 10 Counting Methods.
What Is Probability?.
Chapter 12.5 The Binomial Theorem.
Sequences, Series, and Probability
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
Chapter 10 Counting Methods.
Using Combinations You have already learned that order is important for some counting problems. For other counting problems, order is not important. For.
Physics 114: Lecture 7 Probability Density Functions
Chapter 3 Probability Larson/Farber 4th ed.
Objectives Find entries in Pascal’s triangle.
Chapter 3 Probability.
Basic Concepts of Probability
Probability and Statistics Chapter 3 Notes
Elementary Statistics: Picturing The World
Probability Rules!!! … and yea… Rules About Probability
8.3 Counting Apply the fundamental counting principle
Chapter 10 Counting Methods.
Patterns, Patterns, and more Patterns!
Pascal’s Triangle MDM 4U Lesson 5.1.
Chapter 3 Probability.
Chapter 3 Probability Larson/Farber 4th ed.
Chapter 3 Probability.
Now it’s time to look at…
Lecture 22 Section 7.1 – Wed, Oct 20, 2004
COUNTING AND PROBABILITY
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
Chapter 10 Counting Methods.
Patterns and Combinatorics
Exercise Evaluate 3! 6.
DETERMINANT MATH 80 - Linear Algebra.
Pascal’s Triangle By Marisa Eastwood.
Multi-Stage Events and Applications of Probability
Section 5.3 Conditional Probability and the Multiplication Rule
Independence and Counting
Independence and Counting
Independence and Counting
The Standard Score Standard Score (z-score)
Chapter 11 Probability.
Presentation transcript:

Chapter 10 Counting Methods

Chapter 10: Counting Methods 10.1 Counting by Systematic Listing 10.2 Using the Fundamental Counting Principle 10.3 Using Permutations and Combinations 10.4 Using Pascal’s Triangle 10.5 Counting Problems Involving “Not” and “Or”

Using Pascal’s Triangle Section 10-4 Using Pascal’s Triangle

Using Pascal’s Triangle Construct Pascal’s triangle and recognize the relationship between its entries and values of nCr. Use Pascal’s triangle to solve applications involving combinations.

Pascal’s Triangle The triangular array on the next slide represents “random walks” that begin at START and proceed downward according to the following rule. At each circle (branch point), a coin is tossed. If it lands heads, we go downward to the left. If it lands tails, we go downward to the right. At each point, left and right are equally likely. In each circle the number of different routes that could bring us to that point are recorded.

Pascal’s Triangle START 1 1 1 1 2 1 1 1 3 3 1 4 1 4 6

Pascal’s Triangle Another way to generate the same pattern of numbers is to begin with 1s down both diagonals and then fill in the interior entries by adding the two numbers just above the given position. The pattern is shown on the next slide. This unending “triangular array of numbers” is called Pascal’s triangle.

Pascal’s Triangle row and so on 1 2 3 4 6 5 10 15 20 7 21 35 1 2 3 4 5 1 2 3 4 5 6 7 and so on

Combination Values in Pascal’s Triangle The “triangle” possesses many properties. In counting applications, entry number r in row number n is equal to nCr – the number of combinations of n things taken r at a time. The next slide shows part of this correspondence.

Combination Values in Pascal’s Triangle row 1 2 3 4 5 0C0 1C0 1C1 2C0 2C1 2C2 3C0 3C1 3C2 3C3 4C0 4C1 4C2 4C3 4C4 5C0 5C1 5C2 5C3 5C4 5C5 and so on

Example: Applying Pascal’s Triangle to Counting People A group of seven people includes 3 women and 4 men. If five of these people are chosen at random, how many different samples of five people are possible? Solution Since this is really selecting 5 from a set of 7, we can read 7C5 from row 7 of Pascal’s triangle. The answer is 21.

Example: Applying Pascal’s Triangle to Counting People Among the 21 possible samples of five people in the last example, how many of them would consist of exactly 2 women and 3 men? Solution To select the women (2), we have 3C2 ways. To select the men (3), we have 4C3 ways. This gives a total of:

Example: Applying Pascal’s Triangle to Coin Tossing If six fair coins are tossed, in how many different ways could exactly four heads be obtained? Solution There are various “ways” of obtaining exactly four heads because the four heads can occur on different subsets of coins. The answer is the number of size-four subsets of a size-six set. This answer is from row 6 of Pascal’s triangle:

Summary of Tossing Six Fair Coins Number of Heads n Ways to Have Exactly n Heads 1 2 3 4 5 6