The Fundamental Counting Principal, Permutations, & Combinations.

Slides:



Advertisements
Similar presentations
The Fundamental Counting Principle & Permutations
Advertisements

10.1 – Counting by Systematic Listing One-Part Tasks The results for simple, one-part tasks can often be listed easily. Tossing a fair coin: Rolling a.
Combinations, Permutations, and the Fundamental Counting Principle.
T HE F UNDAMENTAL C OUNTING P RINCIPLE & P ERMUTATIONS.
15.2 Counting Methods: Permutations
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.
How many possible outcomes can you make with the accessories?
Data Analysis and Probability Presenters Aaron Brittain Adem Meta.
12.1 & 12.2: The Fundamental Counting Principal, Permutations, & Combinations.
Counting Principles. I. Basic Counting Problem  Say that I have a jar with 7 balls in it numbered 1 through 7. How many ways can 10 be made (by addition.
Chapter 7 - Part Two Counting Techniques Wednesday, March 18, 2009.
Counting principle and permutations
Counting Principles Counting Principles Chapter 6.7.
Warm-Up 4/29. Rigor: You will learn how to find the number of possible outcomes using the Fundamental Counting Principle, permutations and combinations.
Conditional Probabilities Multiplication Rule Independence.
Do Now: Make a tree diagram that shows the number of different objects that can be created. T-shirts: Sizes: S, M, L and T-shirts: Sizes: S, M, L and Type:
Math Review 1. Ashton is drawing a map of the trails at the Grand Canyon. If she wants 1 mile to be 2.5 inches on her map, then how many inches would represent.
T HE F UNDAMENTAL C OUNTING P RINCIPLE & P ERMUTATIONS.
The Fundamental Counting Principal - Permutations - Factorials.
Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.
Counting Techniques 0.4.
UNIT 4: Applications of Probability
Permutations, Combinations & Counting Principle
13-1 Permutations and Combinations
Methods of Counting Outcomes BUSA 2100, Section 4.1.
Chapter 10 Section 1 Apply the Counting Principle and Permutations In this assignment, you will be able to Use the Fundamental Counting Principle.
Warm Up Evaluate  4  3  2   6  5  4  3  2 
Permutations, Combinations, and Counting Theory AII.12 The student will compute and distinguish between permutations and combinations and use technology.
Chapter 10 – Data Analysis and Probability
The local Family Restaurant has a daily breakfast special in which the customer may choose one item from each of the following groups: Breakfast Sandwich.
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.
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.
Counting Principle FACTORIAL, PERMUTATION, COMBINATION FACTORIAL, PERMUTATION, COMBINATION.
CSNB143 – Discrete Structure Topic 6 – Counting Techniques.
Algebra II 10.1: Apply the Counting Principle and Permutations HW: HW: p (6, 10, 14, 16, 26, 28, 34, all) Quiz : Friday, 12/13.
Lesson 8.6 Page #1-21 (ODD), (EOO), (ODD), (EOO), (ODD) Pick up the handout on the table.
Warm Up CST Review. EXAMPLE 1 Use a tree diagram Snowboarding A sporting goods store offers 3 types of snowboards (all-mountain, freestyle, and carving)
Permutations and Combinations
Counting Principles. Counting examples Ex 1: A small sandwich café has 4 different types of bread, 5 different types of meat and 3 different types of.
Happy 2014! Sit somewhere new to start the new year! The plan for this semester…
Permutations, Combinations, and Counting Theory
9.6 The Fundamental Counting Principal & Permutations.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 7.2 Counting Our.
Combinations & Permutations Permutation => Order is important Combination => Order doesn’t matter Examples: Your Locker “Combination” The lunch line (might.
Permutations and Combinations
Chance of winning Unit 6 Probability. Multiplication Property of Counting  If one event can occur in m ways and another event can occur in n ways, then.
Warm Up Evaluate  4  3  2   6  5  4  3  2 
SECTION 5.4 COUNTING. Objectives 1. Count the number of ways a sequence of operations can be performed 2. Count the number of permutations 3. Count the.
10.1 Applying the Counting Principle and Permutations.
0.4 Counting Techniques. Fundamental Counting Principle TWO EVENTS:If one event can occur in m ways and another event can occur in n ways, then the number.
Permutations Intro to Algebra/Geometry. Does order matter? In English we use the word "combination" loosely, without thinking if the order of things is.
The Fundamental Counting Principle and Permutations 18.0 Students use fundamental counting principles to compute combinations and permutations Students.
Algebra II 10.1: Apply the Counting Principle and Permutations.
Bell work Diagnostic Evaluation Please pick up a Pre-Assessment off the table as you come in to class, take a seat, and get started.
Permutations & Combinations
Combinations and Permutations Whats the Difference?
How much should I invest?
Apply the Counting Principle and Permutations
Counting Principle and Permutations
combinaTorial Analysis
Calculating Probability, Combinations and Permutations
Chapter 0.4 Counting Techniques.
Ronald Hui Tak Sun Secondary School
12.1 The Fundamental Counting Principle & Permutations
Apply the Counting Principle and Permutations
Apply the Counting Principle and Permutations
How many possible outcomes can you make with the accessories?
12.1 The Fundamental Counting Principle and Permutations
Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.
Presentation transcript:

The Fundamental Counting Principal, Permutations, & Combinations

The Fundamental Counting Principal If you have 2 events: 1 event can occur m ways and another event can occur n ways, then the number of ways that both can occur is m*n Event 1 = 4 types of meats Event 2 = 3 types of bread How many diff types of sandwiches can you make? 4*3 = 12

3 or more events: 3 events can occur m, n, & p ways, then the number of ways all three can occur is m*n*p 4 meats 3 cheeses 3 breads How many different sandwiches can you make? 4*3*3 = 36 sandwiches

At a restaurant at Cedar Point, you have the choice of 8 different entrees, 2 different salads, 12 different drinks, & 6 different deserts. How many different dinners (one choice of each) can you choose? 8*2*12*6= 1152 different dinners

Fund. Counting Principal with repetition Ohio Licenses plates have 3 #’s followed by 3 letters. 1. How many different licenses plates are possible if digits and letters can be repeated? There are 10 choices for digits and 26 choices for letters. 10*10*10*26*26*26= 17,576,000 different plates

How many plates are possible if digits and numbers cannot be repeated? There are still 10 choices for the 1 st digit but only 9 choices for the 2 nd, and 8 for the 3 rd. For the letters, there are 26 for the first, but only 25 for the 2 nd and 24 for the 3 rd. 10*9*8*26*25*24= 11,232,000 plates

Phone numbers How many different 7 digit phone numbers are possible if the 1 st digit cannot be a 0 or 1? 8*10*10*10*10*10*10= 8,000,000 different numbers

Testing A multiple choice test has 10 questions with 4 answers each. How many ways can you complete the test? 4*4*4*4*4*4*4*4*4*4 = 4 10 = 1,048,576

Using Permutations An ordering of n objects is a permutation of the objects.

There are 6 permutations of the letters A, B, &C ABC ACB BAC BCA CAB CBA You can use the Fund. Counting Principal to determine the number of permutations of n objects. Like this ABC. There are 3 choices for 1 st # 2 choices for 2 nd # 1 choice for 3 rd. 3*2*1 = 6 ways to arrange the letters

In general, the # of permutations of n objects is: n! = n*(n-1)*(n-2)* …

12 skiers… How many different ways can 12 skiers in the Olympic finals finish the competition? (if there are no ties) 12! = 12*11*10*9*8*7*6*5*4*3*2*1 = 479,001,600 different ways

Factorial with a calculator: Hit math then over, over, over. Option 4

Back to the finals in the Olympic skiing competition. How many different ways can 3 of the skiers finish 1 st, 2 nd, & 3 rd (gold, silver, bronze) Any of the 12 skiers can finish 1 st, the any of the remaining 11 can finish 2 nd, and any of the remaining 10 can finish 3 rd. So the number of ways the skiers can win the medals is 12*11*10 = 1320

Permutation of n objects taken r at a time n P r =

Back to the last problem with the skiers It can be set up as the number of permutations of 12 objects taken 3 at a time. 12 P 3 = 12! = 12! = (12-3)!9! 12*11*10*9*8*7*6*5*4*3*2*1 = 9*8*7*6*5*4*3*2*1 12*11*10 = 1320

10 colleges, you want to visit all or some. How many ways can you visit 6 of them: Permutation of 10 objects taken 6 at a time: 10 P 6 = 10!/(10-6)! = 10!/4! = 3,628,800/24 = 151,200

How many ways can you visit all 10 of them: 10 P 10 = 10!/(10-10)! = 10!/0!= 10! = ( 0! By definition = 1) 3,628,800

So far in our problems, we have used distinct objects. If some of the objects are repeated, then some of the permutations are not distinguishable. There are 6 ways to order the letters M,O,M MOM, OMM, MMO Only 3 are distinguishable. 3!/2! = 6/2 = 3

Permutations with Repetition The number of DISTINGUISHABLE permutations of n objects where one object is repeated q 1 times, another is repeated q 2 times, and so on : n! q 1 ! * q 2 ! * … * q k !

Find the number of distinguishable permutations of the letters: OHIO : 4 letters with 0 repeated 2 times 4! = 24 = 12 2! 2 MISSISSIPPI : 11 letters with I repeated 4 times, S repeated 4 times, P repeated 2 times 11! = 39,916,800 = 34,650 4!*4!*2!24*24*2

Find the number of distinguishable permutations of the letters: SUMMER : 360 WATERFALL : 90,720

A dog has 8 puppies, 3 male and 5 female. How many birth orders are possible 8!/(3!*5!) = 56

What are Combinations?

Combinations and Permutations Whats the Difference? In English we use the word "combination" loosely, without thinking if the order of things is important. In other words:

Whats the Difference? "My fruit salad is a combination of apples, grapes and bananas" We don't care what order the fruits are in, they could also be "bananas, grapes and apples" or "grapes, apples and bananas", its the same fruit salad. "The combination to the safe was 472". Now we do care about the order. "724" would not work, nor would "247". It has to be exactly

So, in Mathematics we use more precise language: If the order doesn't matter, it is a Combination. If the order does matter it is a Permutation. So, we should really call this a "Permutation Lock"!

How lotteries work. The numbers are drawn one at a time, and if you have the lucky numbers (no matter what order) you win! So what is your chance of winning?

The easiest way to explain it is to: assume that the order does matter (ie permutations), then alter it so the order does not matter.

Wow, that was pretty cool! But knowing how these work is only half of it. Figuring out how to interpret a real world situation can be a challenging. But at least now you know how to find all variations of combinations, permutations, and the counting principle.