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

Slides:



Advertisements
Similar presentations
MATHCOUNTS TOOLBOX Facts, Formulas and Tricks
Advertisements

CMPS 2433 Chapter 8 Counting Techniques Midwestern State University Dr. Ranette Halverson.
Permutations and Combinations
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.
Section 4-6 Counting.
Slide Slide 1 Copyright © 2007 Pearson Education, Inc Publishing as Pearson Addison-Wesley. Created by Tom Wegleitner, Centreville, Virginia Section 4-7.
Chapter 8 Counting Techniques PASCAL’S TRIANGLE AND THE BINOMIAL THEOREM.
6-7 Permutations & Combinations M11.E.3.2.1: Determine the number of permutations and/or combinations or apply the fundamental counting principle.
0.4 – The Counting Principal. The Fundamental Counting Principal If one event can occur m ways followed by another event that can occur n ways then the.
Copyright © 1998, Triola, Elementary Statistics Addison Wesley Longman 1 Counting Section 3-7 M A R I O F. T R I O L A Copyright © 1998, Triola, Elementary.
Section Copyright © 2014, 2012, 2010 Pearson Education, Inc. Lecture Slides Elementary Statistics Twelfth Edition and the Triola Statistics Series.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. All Rights Reserved. Lecture Slides Elementary Statistics Eleventh Edition and the Triola.
Chapter 4 Lecture 4 Section: 4.7. Counting Fundamental Rule of Counting: If an event occurs m ways and if a different event occurs n ways, then the events.
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-
Section Copyright © 2014, 2012, 2010 Pearson Education, Inc. Lecture Slides Elementary Statistics Twelfth Edition and the Triola Statistics Series.
Methods of Counting Outcomes BUSA 2100, Section 4.1.
IT College Introduction to Computer Statistical Packages Lecture 9 Eng. Heba Hamad 2010.
Slide Slide 1 Created by Tom Wegleitner, Centreville, Virginia Edited by Olga Pilipets, San Diego, California Counting.
Section 10-3 Using Permutations and Combinations.
3. Counting Permutations Combinations Pigeonhole principle Elements of Probability Recurrence Relations.
Section 4.3 Objectives Use a tree diagram and the Fundamental Counting Principle to find probabilities Determine the number of ways a group of objects.
Probability Chapter 3. § 3.4 Counting Principles.
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Basic Probability Permutations and Combinations: -Combinations: -The number of different packages of data taken r at time from a data set containing n.
Copyright © 2011 Pearson Education, Inc. Probability: Living with the Odds.
Statistics 1: Elementary Statistics Section 4-7. Probability Chapter 3 –Section 2: Fundamentals –Section 3: Addition Rule –Section 4: Multiplication Rule.
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.
Counting Methods Review General Guidelines. Fundamental Counting Principle Each category outcome is independent of any other category outcome OR Items.
Chapter 12 Probability. Chapter 12 The probability of an occurrence is written as P(A) and is equal to.
Copyright © 1998, Triola, Elementary Statistics Addison Wesley Longman 1 M ARIO F. T RIOLA E IGHTH E DITION E LEMENTARY S TATISTICS Section 3-6 Counting.
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.
Methods of Counting By Dr. Carol A. Marinas Fundamental Counting Principle Event M can occur in m ways Event N can occur in n ways The event M followed.
Arrangements How many ways can I arrange the following candles?
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
Bell Ringer Greg has $75 and saves $4 each week. Veronica has just started saving by earning $9 each week. How long will it take before they have raised.
Honors Analysis.  Independent Events: Events that do not affect each other  Sample Space: List of all possible outcomes  Fundamental Counting Principle:
Counting Techniques Tree Diagram Multiplication Rule Permutations Combinations.
MATH 2311 Section 2.1. Counting Techniques Combinatorics is the study of the number of ways a set of objects can be arranged, combined, or chosen; or.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
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.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Lecture Slides Elementary Statistics Eleventh Edition and the Triola Statistics Series by.
Chapter 3 Probability Initial Objective: Develop procedures to determine the # of elements in a set without resorting to listing them first. 3-6 Counting.
Counting Principles NMH Upward Bound Summer Academy Statistics H. Reardon.
Counting Introduction to Probability & Statistics Counting.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4-1 CHAPTER 4 Counting Techniques.
1 2.3 Counting Sample Points (6)(6)(6)= 216 Example: How many outcome sequences are possible when a die is rolled three times?
Chapter 10 Counting Methods.
Unit 8 Probability.
MATH 2311 Section 2.1.
Counting Methods and Probability Theory
12.1 Tangent lines -Theroem 12.1: if a line is tangent to a circle, then it will be perpendicular to the radius at the point of tangency -Theroem 12.3:
Counting Principles NOTES Coach Bridges.
Advanced Combinations and Permutations
Бази от данни и СУБД Основни понятия инж. Ангел Ст. Ангелов.
6. Multistage events and application of probability
MATH 2311 Section 2.1.
Counting Methods and Probability Theory
Counting Methods and Probability Theory
Counting Methods and Probability Theory
9.6 Counting Theory Example If there are 3 roads from Albany to Baker
Created by Tom Wegleitner, Centreville, Virginia
Lecture Slides Essentials of Statistics 5th Edition
Multi-Stage Events and Applications of Probability
Chapter 11: Further Topics in Algebra
MATH 2311 Section 2.1.
Presentation transcript:

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

The Fundamental Rule of Counting If event A can occur in m distinct ways and event B can occur in any of n distinct ways (regardless of how event A occurs), then event A and event B can occur in mn ways.

Permutations When different arrangements count as distinct outcomes but duplication of items is not allowed, then Permutations is the counting procedure for the arrangement of items. If there are n items and each item can occur x different ways, then Number of ways = P n x = (n!) / (n - x)!

Combinations When different arrangements do not count as distinct outcomes and duplication of items is not allowed, then Combinations is the counting procedure for the arrangement of items. If there are n items and each item can occur x different ways, then Number of ways = C n x = (n!) / x!(n - x)!