SECTION 10-4 Using Pascal’s Triangle Slide 10-4-1.

Slides:



Advertisements
Similar presentations
Gl: Students will be expected to conduct simple experiments to determine probabilities G2 Students will be expected to determine simple theoretical probabilities.
Advertisements

Chapter 3 Probability.
Basic Concepts of Probability
Larson/Farber 4th ed 1 Basic Concepts of Probability.
Presentation on Probability Distribution * Binomial * Chi-square
Probability What Are the Chances?. Section 1 The Basics of Probability Theory Objectives: Be able to calculate probabilities by counting the outcomes.
Chapter 12 Probability © 2008 Pearson Addison-Wesley. All rights reserved.
Pascal’s Triangle Row
Chapter 4 Probability and Probability Distributions
Activity 1 Activity 2 Index Student Activity 1: Tossing a coin Student Activity 2: Tossing two coins.
SECTION 4.3 CONDITIONAL PROBABILITY AND THE MULTIPLICATION RULE Copyright ©2014 The McGraw-Hill Companies, Inc. Permission required for reproduction or.
Counting and Probability The outcome of a random process is sure to occur, but impossible to predict. Examples: fair coin tossing, rolling a pair of dice,
1 Copyright M.R.K. Krishna Rao 2003 Chapter 5. Discrete Probability Everything you have learned about counting constitutes the basis for computing the.
Laws of Probability What is the probability of throwing a pair of dice and obtaining a 5 or a 7? These are mutually exclusive events. You can’t throw.
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.
NA387 Lecture 5: Combinatorics, Conditional Probability
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Counting and Probability. Counting Elements of Sets Theorem. The Inclusion/Exclusion Rule for Two or Three Sets If A, B, and C are finite sets, then N(A.
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?
Probability True or False? Answers.
 History and Relevance of probability theory Probability theory began with the study of game of chance that were related to gambling, like throwing a.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
King Saud University Women Students
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.
Simulating Probabilistic Behaviour
5.1 Randomness  The Language of Probability  Thinking about Randomness  The Uses of Probability 1.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
MA 485/585 Probability Theory (Dr Chernov). Five cards Five cards are labeled 1,2,3,4,5. They are shuffled and lined up in an arbitrary order. How many.
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?
2/16/ Pascal’s Triangle. Pascal’s Triangle For any given value of n, there are n+1 different calculations of combinations: 0C00C00C00C0 1C01C01C01C0.
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.
Lesson  Shown at the right are the first six rows of Pascal’s triangle.  It contains many different patterns that have been studied for centuries.
MATH 2311 Section 2.3. Basic Probability Models The probability of any outcome of a random phenomenon is the proportion of times the outcome would occur.
Probability Distributions and Expected Value Chapter 5.1 – Probability Distributions and Predictions Mathematics of Data Management (Nelson) MDM 4U Authors:
Binomial Coefficients and Identities
3/7/20161 Now it’s time to look at… Discrete Probability.
Counting Techniques (Dr. Monticino). Overview  Why counting?  Counting techniques  Multiplication principle  Permutation  Combination  Examples.
 2012 Pearson Education, Inc. Slide Chapter 10 Counting Methods.
Section 4.1 What is Probability ? Larson/Farber 4th ed 1.
Introduction to probability (3) Definition: - The probability of an event A is the sum of the weights of all sample point in A therefore If A1,A2,…..,An.
1 What Is Probability?. 2 To discuss probability, let’s begin by defining some terms. An experiment is a process, such as tossing a coin, that gives definite.
What Is Probability?.
Chapter 10 Counting Methods.
Chapter 3 Probability Larson/Farber 4th ed.
Objectives Find entries in Pascal’s triangle.
Chapter 3 Probability.
Basic Concepts of Probability
Section 5.1 Basic Ideas.
Elementary Statistics: Picturing The World
Patterns, Patterns, and more Patterns!
Pascal’s Triangle MDM 4U Lesson 5.1.
Chapter 3 Probability.
Chapter 3 Probability Larson/Farber 4th ed.
COUNTING AND PROBABILITY
Probability Section 19 NOTE: We are skipping Section 18. 2/21/2019
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
Chapter 10 Counting Methods.
Patterns and Combinatorics
Pascal’s Triangle By Marisa Eastwood.
Chapter 11 Probability.
Presentation transcript:

SECTION 10-4 Using Pascal’s Triangle Slide

USING PASCAL’S TRIANGLE Pascal’s Triangle Applications Slide

PASCAL’S TRIANGLE Slide 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 an right are equally likely. In each circle the number of different routes that could bring us to that point are recorded.

PASCAL’S TRIANGLE Slide START

PASCAL’S TRIANGLE Slide 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 Slide and so on row

COMBINATION VALUES IN PASCAL’S TRIANGLE Slide The “triangle” possesses many properties. In counting applications, entry number r in row number n is equal to n C r – 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 Slide C00C0 1C01C01C11C1 2C02C02C12C12C22C2 3C03C03C13C13C23C23C33C3 4C04C04C14C14C24C24C34C34C44C4 5C05C05C15C15C25C25C35C35C45C45C55C5 and so on row

EXAMPLE: APPLYING PASCAL’S TRIANGLE TO COUNTING PEOPLE Slide 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 7 C 5 from row 7 of Pascal’s triangle. The answer is 21

EXAMPLE: APPLYING PASCAL’S TRIANGLE TO COUNTING PEOPLE Slide Among the 21 possible samples of five people in the last example, how many of them would consist of exactly 2 women? Solution To select the women (2), we have 3 C 2 ways. To select the men (3), we have 4 C 3 ways. This gives a total of

EXAMPLE: APPLYING PASCAL’S TRIANGLE TO COIN TOSSING Slide 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 subset. This answer is from row 6 of Pascal’s triangle:

SUMMARY OF TOSSING SIX FAIR COINS Slide Number of Heads n Ways to Have Exactly n Heads