Bellwork Practice Packet 10.3 B side #3.

Slides:



Advertisements
Similar presentations
Permutations and Combinations
Advertisements

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.
Statistics Review. Box-and-Whisker Plots The Parts of a Box and Whisker Plot Name the parts of a Box-and-Whisker Plot MedianUpper Quartile Lower.
How many possible outcomes can you make with the accessories?
___ ___ ___ ___ ___ ___ ___ ___ ___
Chapter 2 Section 2.4 Permutations and Combinations.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Expected value a weighted average of all possible values where the weights are the probabilities of each outcome :
Permutations and Combinations. Random Things to Know.
7 Further Topics in Algebra © 2008 Pearson Addison-Wesley. All rights reserved Sections 7.4–7.7.
Permutations and Combinations
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
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.
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Chapter PERMUTATIONS AND COMBINATIONS. Objectives Solve problems involving the Fundamental Counting Principle. Solve problems involving permutations.
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.
PERMUTATIONS AND COMBINATIONS BOTH PERMUTATIONS AND COMBINATIONS USE A COUNTING METHOD CALLED FACTORIAL.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Unit VI Discrete Structures Permutations and Combinations SE (Comp.Engg.)
Fundamental Counting Theorm. Fundamental Counting Principle Fundamental Counting Principle can be used determine the number of possible outcomes when.
Permutations, Combinations, and Counting Theory
Lesson 0.4 (Counting Techniques)
Counting Techniques Tree Diagram Multiplication Rule Permutations Combinations.
37. Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
Warm up How many possible pizzas could you make with 3 types of meats, 2 types of cheeses, and 2 types of sauces? 5 * 4 * 3 * 2 * 1 =
Discrete Math Section 15.3 Solve problems using permutations and combinations Read page Combinations and permutations.
Permutations and Combinations
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
13 Lesson 1 Let Me Count the Ways Fundamental Counting Principle, Permutations & Combinations CP Probability and Statistics FA 2014 S-ID.1S-CP.3S-CP.5.
Permutations and Combinations Review Plus a little Dry Run, Sorting and Code.
Permutations and Combinations
Chapter 10 Counting Methods.
Permutations and Combinations
Counting Methods and Probability Theory
Happy Pi Day! Find x. 15 If you still have x
BASIC PROBABILITY Probability – the chance of something (an event) happening # of successful outcomes # of possible outcomes All probability answers must.
Counting Techniuqes.
Calculating Probability, Combinations and Permutations
Chapter 0.4 Counting Techniques.
Permutations and Combinations
Permutations and Combinations
Warm Up Permutations and Combinations Evaluate  4  3  2  1
Permutations and Combinations
Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.
Permutations and Combinations
Lesson 11-1 Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
10.4 Permutations and Combinations
Counting techniques Basic Counting Principles, Pigeonhole Principle, Permutations and Combinations.
Permutations and Combinations
First lecture fsalamri Faten alamri.
How many possible outcomes can you make with the accessories?
MATH 2311 Section 2.1.
Counting Methods and Probability Theory
Counting Principle.
Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.
Day 2 - Combinations.
Permutations and Combinations
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Permutations and Combinations
Fundamental Counting Theorm
Lecture 7: Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
MATH 2311 Section 2.1.
Presentation transcript:

Bellwork Practice Packet 10.3 B side #3

Permutations and Combinations Section 10.5

Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations vs combinations

Two coins are flipped and the spinner is spun Two coins are flipped and the spinner is spun. The tree diagram shows the possible outcomes.

Fundamental Counting Principle Fundamental Counting Principle can be used determine the number of possible outcomes when there are two or more characteristics . Fundamental Counting Principle states that if an event has m possible outcomes and another independent event has n possible outcomes, then there are m* n possible outcomes for the two events together.

Fundamental Counting Principle Lets start with a simple example. A student is to roll a die and flip a coin. How many possible outcomes will there be? 1H 2H 3H 4H 5H 6H 1T 2T 3T 4T 5T 6T 12 outcomes 6*2 = 12 outcomes

Two coins are flipped and a three way spinner is spun Two coins are flipped and a three way spinner is spun. The tree diagram shows the possible outcomes.

Fundamental Counting Principle For a college interview, Robert has to choose what to wear from the following: 4 slacks, 3 shirts, 2 shoes and 5 ties. How many possible outfits does he have to choose from? 4*3*2*5 = 120 outfits

A permutation is an arrangement of objects in which order is important A permutation is an arrangement of objects in which order is important. For instance, the 6 possible permutations of the letters A, B, and C are shown.

Permutations Notice, ORDER MATTERS! A Permutation is an arrangement of items in a particular order. Notice, ORDER MATTERS! To find the number of Permutations of n items, we can use the Fundamental Counting Principle or factorial notation.

Permutations The number of ways to arrange the letters ABC: ____ ____ ____ 3 ____ ____ Number of choices for first blank? 3 2 ___ Number of choices for second blank? Number of choices for third blank? 3 2 1 3*2*1 = 6 3! = 3*2*1 = 6 ABC ACB BAC BCA CAB CBA

Permutations To find the number of Permutations of n items chosen r at a time, you can use the formula

Permutations Practice: A combination lock will open when the right choice of three numbers (from 1 to 30, inclusive) is selected. How many different lock combinations are possible assuming no number is repeated? Answer Now

You evaluated the expression 4 ⋅ 3 ⋅ 2 ⋅ 1 You evaluated the expression 4 ⋅ 3 ⋅ 2 ⋅ 1.This expression can be written as 4! and is read “4 factorial.” For any positive integer n, the product of the integers from 1 to n is called n factorial and is written as n! = n ⋅ (n − 1) ⋅ (n − 2) ⋅ . . . ⋅ 3 ⋅ 2 ⋅ 1. As a special case, the value of 0! is defined to be 1.

Take Note

Permutations Practice: A combination lock will open when the right choice of three numbers (from 1 to 30, inclusive) is selected. How many different lock combinations are possible assuming no number is repeated?

Permutations Practice: From a club of 24 members, a President, Vice President, Secretary, Treasurer and Historian are to be elected. In how many ways can the offices be filled? Answer Now

Permutations Practice: From a club of 24 members, a President, Vice President, Secretary, Treasurer and Historian are to be elected. In how many ways can the offices be filled?

Combinations ORDER DOES NOT MATTER! A Combination is an arrangement of items in which order does not matter. ORDER DOES NOT MATTER! Since the order does not matter in combinations, there are fewer combinations than permutations.  The combinations are a "subset" of the permutations.

Combinations To find the number of Combinations of n items chosen r at a time, you can use the formula

Combinations To find the number of Combinations of n items chosen r at a time, you can use the formula

Combinations Practice: To play a particular card game, each player is dealt five cards from a standard deck of 52 cards. How many different hands are possible? Answer Now

Combinations To play a particular card game, each player is dealt five cards from a standard deck of 52 cards. How many different hands are possible? Practice:

Combinations Practice: A student must answer 3 out of 5 essay questions on a test. In how many different ways can the student select the questions? Answer Now

Combinations A student must answer 3 out of 5 essay questions on a test. In how many different ways can the student select the questions? Practice:

Combinations Practice: A basketball team consists of two centers, five forwards, and four guards. In how many ways can the coach select a starting line up of one center, two forwards, and two guards? Answer Now

Combinations Practice: A basketball team consists of two centers, five forwards, and four guards. In how many ways can the coach select a starting line up of one center, two forwards, and two guards? Center: Forwards: Guards: Thus, the number of ways to select the starting line up is 2*10*6 = 120.