WARM-UP 1.Given that P(A)=.35, P(B)=.85, P(AUB)=.8 a)Find P(AB) b)P(A|B) c)P(B|A) 2. Determine if the events A and B are independent.

Slides:

Advertisements

Similar presentations

PERMUTATIONS AND COMBINATIONS Fundamental Counting Principle ○ If there are n(A) ways in which an event A can occur, and if there are n(B) ways in which.

Advertisements

Warm-Up Problem Can you predict which offers more choices for license plates? Choice A: a plate with three different letters of the alphabet in any order.

Probability Mechanics. Laws of probability: Addition The question of Or p(A or B) = p(A) + p(B) –Probability of getting a grape or lemon skittle in a.

Chapter 13 sec. 3.  Def.  Is an ordering of distinct objects in a straight line. If we select r different objects from a set of n objects and arrange.

Combinations, Permutations, and the Fundamental Counting Principle.

Counting Principles The Fundamental Counting Principle: If one event can occur m ways and another can occur n ways, then the number of ways the events.

Chapter 2: The Next Step… Conditional Probability.

Today Today: Reading: –Read Chapter 1 by next Tuesday –Suggested problems (not to be handed in): 1.1, 1.2, 1.8, 1.10, 1.16, 1.20, 1.24, 1.28.

Slide Slide 1 Copyright © 2007 Pearson Education, Inc Publishing as Pearson Addison-Wesley. Created by Tom Wegleitner, Centreville, Virginia Section 4-7.

BCOR 1020 Business Statistics Lecture 8 – February 12, 2007.

Counting Techniques The Fundamental Rule of Counting (the mn Rule); Permutations; and Combinations.

Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.

© Buddy Freeman, 2015Probability. Segment 2 Outline  Basic Probability  Probability Distributions.

Chapter Probability © 2010 Pearson Prentice Hall. All rights reserved 3 5.

1 Permutations and Combinations CS/APMA 202 Rosen section 4.3 Aaron Bloomfield.

COMBINATORICS Permutations and Combinations. Permutations The study of permutations involved order and arrangements A permutation of a set of n objects.

The Erik Jonsson School of Engineering and Computer Science © Duncan L. MacFarlane Probability and Stochastic Processes Yates and Goodman Chapter 1 Summary.

Aim: Final Review Session 3 Probability

10/1/20151 Math a Sample Space, Events, and Probabilities of Events.

MATH 1107 Elementary Statistics Lecture 7 Combinations and Permutations.

Copyright © 2010, 2007, 2004 Pearson Education, Inc. All Rights Reserved. Lecture Slides Elementary Statistics Eleventh Edition and the Triola.

T—05/26/09—HW #71: Pg 713: ; Pg 719: 12, 13, ; Pg 734: ; Pg 742: 10 – 13 52) ) ) perm, 21058) comb, ).524) e: 13/60,

Warm Up 1/31/11 1. If you were to throw a dart at the purple area, what would be the probability of hitting it? I I 5.

1 Fundamental Counting Principle & Permutations. Outcome-the result of a single trial Sample Space- set of all possible outcomes in an experiment Event-

PROBABILITY. Counting methods can be used to find the number of possible ways to choose objects with and without regard to order. The Fundamental Counting.

Section 10-3 Using Permutations and Combinations.

ELEC 303, Koushanfar, Fall’09 ELEC 303 – Random Signals Lecture 4 – Counting Farinaz Koushanfar ECE Dept., Rice University Sept 3, 2009.

© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.

Section 2.6 Probability and Expectation Cryptanalyzing the Vigenere cipher is not a trivial process. A probabilistic method that allows one to determine.

Statistics 1: Elementary Statistics Section 4-7. Probability Chapter 3 –Section 2: Fundamentals –Section 3: Addition Rule –Section 4: Multiplication Rule.

Probability Counting Methods. Do Now: Find the probablity of: Rolling a 4 on a die Rolling a “hard eight” (2 - 4’s) on a pair of dice.

Chapter 12 PROBABILITY Counting, Combinations, Permutations, Probability, Binomial Theorem.

Ch Counting Techniques Product Rule If the first element or object of an ordered pair can be used in n 1 ways, and for each of these n1 ways.

Section 10.1 Introduction to Probability. Probability Probability is the overall likelihood that an event can occur. A trial is a systematic opportunity.

Lesson # 65 Notes Combinations. Lesson # 65 Combinations.

Counting Methods Topic 4: Permutations with Restrictions.

3.4 Counting Principles I.The Fundamental Counting Principle: if one event can occur m ways and a second event can occur n ways, the number of ways the.

Find permutations using permutation notation and using technology.

Lesson 8.6 Page #1-21 (ODD), (EOO), (ODD), (EOO), (ODD) Pick up the handout on the table.

Learning Objectives for Section 7.4 Permutations and Combinations

Thinking Mathematically

Aim: What is the counting rule? Exam Tomorrow. Three Rules Sometimes we need to know all possible outcomes for a sequence of events – We use three rules.

Section 4.5-Counting Rules

9.6 The Fundamental Counting Principal & Permutations.

How many ways can we arrange 3 objects A, B, and C: Using just two How many ways can we arrange 4 objects, A, B, C, & D: Using only two Using only three.

Copyright (C) 2002 Houghton Mifflin Company. All rights reserved. 1 Understandable Statistics Seventh Edition By Brase and Brase Prepared by: Lynn Smith.

+ Chapter 5 Overview 5.1 Introducing Probability 5.2 Combining Events 5.3 Conditional Probability 5.4 Counting Methods 1.

Section 6.2: Probability Models Ways to show a sample space of outcomes of multiple actions/tasks: (example: flipping a coin and rolling a 6 sided die)

Chapter 8: Probability: The Mathematics of Chance Lesson Plan Probability Models and Rules Discrete Probability Models Equally Likely Outcomes Continuous.

Welcome to MM207 - Statistics! Unit 3 Seminar Good Evening Everyone! To resize your pods: Place your mouse here. Left mouse click and hold. Drag to the.

Special Topics. Calculating Outcomes for Equally Likely Events If a random phenomenon has equally likely outcomes, then the probability of event A is:

Probability and Counting Rules 4-4: Counting Rules.

Welcome to MM207 Unit 3 Seminar Dr. Bob Probability and Excel 1.

Introduction to Probability Honors Geometry Summer School.

The Fundamental Counting Principle and Permutations 18.0 Students use fundamental counting principles to compute combinations and permutations Students.

Permutations and Combinations. Permutations Definition –An ordered arrangement of objects is called a permutation. –Hence, a permutation of n distinct.

Chapter 10 Counting Methods.

Math a - Sample Space - Events - Definition of Probabilities

Permutations and Combinations

Probability Counting techniques.

Counting Principle and Permutations

Counting Principles NOTES Coach Bridges.

Independent and Dependent Events

4 Probability Lesson 4.8 Combinations and Probability.

Chapter 10 Counting Methods.

Created by Tom Wegleitner, Centreville, Virginia

Probability Multiplication law for dependent events

Presentation transcript:

WARM-UP 1.Given that P(A)=.35, P(B)=.85, P(AUB)=.8 a)Find P(AB) b)P(A|B) c)P(B|A) 2. Determine if the events A and B are independent

Counting and Permutations

GROUP ACTIVITY Break into groups and solve the word problem provided to each group. Each word problem is different, so you should only be talking to the people in your group

FUNDAMENTAL COUNTING PRINCIPAL Given a combined action, or event in which the first action can be performed in n₁ ways, the second action can be performed in n₂ ways, and so on, the total number of ways in which the combined action can be performed is the product n₁∙n₂…..

INDIVIDUAL ACTIVITY You are setting up a special playlist in your iPod. You trying to put 5 songs in an order to your liking. List the songs you are putting in the playlist, and say how many ways you can have the songs listed in that playlist

PERMUTATION A permutation of a set of n objects is an ordered arrangement of all “n” objects

TOTAL NUMBER OF PERMUTATIONS OF “N” OBJECTS The total number of permutations of “n” objects, denoted P(n,n) is given by P(n,n)=n∙(n-1)∙(n-2)∙…1

FACTORIAL NOTATION For any natural number “n”, n!=n∙(n-1)∙(n-2)∙….1 also n!=n∙(n-1)! For the number 0, 0!=1 So, n!=P(n,n)

QUESTION: How many 5-digit numbers can be formed using the digits 2,4,6,8, and 9 without repetition? With repetition?

WITHOUT REPETITION I can only choose from 5 numbers. Every time I choose a number, I will have one less number to choose from the next time 5∙4∙3∙2∙1=20∙6=120

WITH REPLACEMENT I have 5 numbers to choose from. Every time I choose a number, I am allowed to choose that number again. So, I will ALWAYS have 5 numbers to choose from 5∙5 ∙5 ∙5 ∙5=5⁵

GROUP WORK There are 7 people and 3 chairs. How many different ways can I put 7 people in 3 distinct chairs? I have 3 balls and 2 cups. How many ways can I put 3 balls in 2 distinct cups? (only 1 ball can go in each cup). ty/v/permutations ty/v/permutations

Number o f permutations of a set of “n” objects taken k at a time The number of permutations of a set of “n” objects taken k at a time, denoted P(n,k) given by P(n,k)=n∙(n-1)∙(n-2)…[n-(k-1)] =n!/(n-k)!

SOLVE 1)P(6,6) 2)P(10,7) 3)5! 4)P(4,3) 5)(8-5)! 6)9!/4!