13-1 Permutations and Combinations

Slides:



Advertisements
Similar presentations
Permutations and Combinations
Advertisements

Warm Up Evaluate  4  3  2   6  5  4  3  2  1
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?
12.1 & 12.2: The Fundamental Counting Principal, Permutations, & Combinations.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Warm Up Evaluate  4  3  2   6  5  4  3  2  Permutations and Combinations.
Counting Techniques 0.4.
CONFIDENTIAL 1 Algebra1 Combinations and Permutations.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Methods of Counting Outcomes BUSA 2100, Section 4.1.
Warm Up Evaluate  4  3  2   6  5  4  3  2 
Combinations. A combination is a grouping of items in which order does not matter. There are generally fewer ways to select items when order does not.
Chapter 10 – Data Analysis and Probability
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Chapter PERMUTATIONS AND COMBINATIONS. Objectives Solve problems involving the Fundamental Counting Principle. Solve problems involving permutations.
Permutations and Combinations
Permutations and Combinations
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.
Warm Up Evaluate  4  3  2   6  5  4  3  2 
Lesson 0.4 (Counting Techniques)
37. Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
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.
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 =
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 7.2 Counting Our.
Permutations and Combinations
Unit 4: Probability Day 1: Counting Principles. Standards and Benchmarks Select and apply counting procedures, such as the multiplication and.
Warm Up Evaluate  4  3  2   6  5  4  3  2 
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
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 and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
Permutations and Combinations
4-1 Chapter 4 Counting Techniques.
Example 1A: Using the Fundamental Counting Principle
Permutations and Combinations
Permutations and Combinations
12.2 Permutations and Combinations
4-1 Chapter 4 Counting Techniques.
Warm Up Evaluate  4  3  2   6  5  4  3  2  1
4-1 Chapter 4 Counting Techniques.
Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
In this lesson, you will learn to use the Fundamental Counting Principle.
Warm Up Permutations and Combinations Evaluate  4  3  2  1
Wednesday by Dave And Brian
Permutations and Combinations
Permutations and Combinations
Lesson 11-1 Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
Objectives Solve problems involving the Fundamental Counting Principle. Solve problems involving permutations and combinations.
10.4 Permutations and Combinations
Permutations and Combinations
4-1 Chapter 4 Counting Techniques.
Bellwork Practice Packet 10.3 B side #3.
Objectives Solve problems involving the Fundamental Counting Principle. Solve problems involving permutations and combinations.
Permutations and Combinations
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Probability Review Day 1
Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
Lecture 7: Permutations and Combinations
11-1 Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
Presentation transcript:

13-1 Permutations and Combinations

The branch of mathematics that studies different possibilities for the arrangement of objects is COMBINATORICS

A) 82 B) 42 C) 62 D) 22 B

A) 3 B) 55 C) 45 D) 56 56

Assume that Andrew is scheduling courses for his new semester Assume that Andrew is scheduling courses for his new semester. He has a choice of 3 history course, 2 math courses and 3 science courses. If he has to choose one course from each area, how many ways can he build his schedule? Since the selection of one course does not affect the choice of a different course, these events are INDEPENDENT EVENTS. The classic way to determine the number of possible ways he can build his schedule would be to make a tree.

Science 1 Math 1 Science 2 Science 3 History 1 Science 1 Science 2 Science 3 Math 2 Science 1 Science 2 Science 3 Math 1 History 2 Science 1 Science 2 Science 3 Math 2 Science 1 Science 2 Science 3 Math 1 History 3 Science 1 Science 2 Science 3 Math 2

To make a yogurt parfait, you choose one flavor of yogurt, one fruit topping, and one nut topping. How many parfait choices are there? Yogurt Parfait (choose 1 of each) Flavor Plain Vanilla Fruit Peaches Strawberries Bananas Raspberries Blueberries Nuts Almonds Peanuts Walnuts

different ways. The Fundamental (or Basic) Counting Principle If a task consists of a sequence of choices in which there are p selections for the first choice, q selections for the second choice, r selections for the third choice, and the choice for the first selection does not affect the others, then the task of making these selections can be done in different ways.

If a license plate consists of a letter, then 5 numbers, how many different types of license plates are possible? license plates

If a license plate consists of a letter, then 5 numbers If a license plate consists of a letter, then 5 numbers. The letter cannot be an E or an F and the last number must cannot be zero. How many different types of license plates are possible? 24 9 10 10 10 10 2160000

A “make-your-own-adventure” story lets you choose 6 starting points, gives 4 plot choices, and then has 5 possible endings. How many adventures are there? There are 120 adventures.

A permutation is an arrangement of objects in a certain order A permutation is an arrangement of objects in a certain order. Order is VERY important. The number of permutations possible depends on the number of objects available (n) and the number that will be used (r).

Imagine you have 8 children’s books, each with a different title. How many different ways can they be arranged on a shelf? Consider the number of choices for each slot. 4 1 8 5 3 2 7 6 Multiply the number of choices for each slot, and that is the number of possible permutations, that is , the number of possible different arrangements.

5(5-1)(5-2)(5-3)(5-4) 5(4)(3)(2)(1) So if you have n distinct items and you plan to use all of them, you can find the number of possible arrangements ( permutations) by the following multiplication. n · (n – 1) · (n – 2) · (n – 3) · ... · 1. This expression is called n factorial, and is written as n!. 5(5-1)(5-2)(5-3)(5-4) 5(4)(3)(2)(1)

How many different arrangements are possible if 4 students are to be seated in a single row of 4 chairs? 4 1 3 2

If Chloe has 7 different stuffed toys and wants to arrange them in a line on her bed, but only 3 will fit, how many different arrangments are possible. Different problem, How?

One way to find possible permutations is to use the Fundamental Counting Principle. There are 7 toys. You are choosing 3 of them in order. First Toy Second Toy Third Toy 7 choices 6 choices 5 choices 210 permutations   =

Another way to find the possible permutations is to use factorials Another way to find the possible permutations is to use factorials. You can divide the total number of arrangements by the number of arrangements that are not used. In the previous slide, there are 7 total toys and 4 whose arrangements do not matter. arrangements of 7 = 7! = 7 · 6 · 5 · 4 · 3 · 2 · 1 = 210 arrangements of 4 4! 4 · 3 · 2 · 1 This can be generalized as a formula, which is useful for large numbers of items.

The number of permutations of n distinct objects, taken r at a time, is

Number of Permutations of n Distinct Objects The number of different arrangements from selecting r objects from a set of n objects (r < n), in which 1. the n objects are distinct 2. once an object is used, it cannot be repeated 3. order is important is given by the formula

The number of permutations of n objects taken n at a time Surprising?

Evaluate:

There are 1320 permutations.

How many ways can a student government select a president, vice president, secretary, and treasurer from a group of 6 people? This is the equivalent of selecting and arranging 4 items from 6. = 6 • 5 • 4 • 3 = 360 There are 360 ways to select the 4 people.

Awards are given out at a costume party Awards are given out at a costume party. How many ways can “most creative,” “silliest,” and “best” costume be awarded to 8 contestants if no one gets more than one award? = 8 • 7 • 6 = 336 There are 336 ways to arrange the awards.

How many ways can a 2-digit number be formed by using only the digits 5–9 and by each digit being used only once? = 5 • 4 = 20 There are 20 ways for the numbers to be formed.

Permutations in a circle If n distinct objects are arranged around a circle, then there are (n-1)! circular permutations of the objects. EX: 1. How many different ways can 12 students be placed around a circular table? (12-1)! = 11! 2. In how many different ways can 7 appetizers be arranged around a circular tray? (7-1)! = 6!

Exception to the circular permutation rule: 1) If the circle contains some sort of a fixed point, the arrangement is treated as a linear permutation. Permutations with repetitions If a group of objects contains a number of identical objects, then the number of permutations possible can be found by the following Where a,b, etc. are the number of times each repeating object repeats.

For example, consider the 3 letters A,B, and C., A combination is a grouping of items in which order does not matter. There are generally fewer ways to select items when order does not matter. For example, consider the 3 letters A,B, and C., There are 6 ways to order 3 items, so there are 6 permutations. 6 permutations  {ABC, ACB, BAC, BCA, CAB, CBA} But they are all the same combination: 1 combination  {ABC}

To find the number of combinations, the formula for permutations can be modified. Because order does not matter, divide the number of permutations by the number of ways to arrange the selected items. Because in a combination, different arrangements of the same items are not counted

The Number of Combinations of n Distinct Objects Taken r at a Time The number of different arrangements from selecting r objects from a set of n objects (r < n), in which 1. the n objects are distinct 2. once an object is used, it cannot be repeated 3. order is not important is given by the formula

Evaluate:

How many committees of 3 people can be formed from out of 8 people? 1. the 8 people are distinct 2. once a person is chosen, he/she cannot be chosen again 3. order is not important Combinations of 8 taken 3 at a time:

When deciding whether to use permutations or combinations, first decide whether order is important. Use a permutation if order matters and a combination if order does not matter.

There are 12 different-colored cubes in a bag There are 12 different-colored cubes in a bag. How many ways can Randall draw a set of 4 cubes from the bag? Step 1 Determine whether the problem represents a permutation of combination. The order does not matter. The cubes may be drawn in any order. It is a combination.

Step 2 Use the formula for combinations. 5 = 495 There are 495 ways to draw 4 cubes from 12.

The swim team has 8 swimmers The swim team has 8 swimmers. Two swimmers will be selected to swim in the first heat. How many ways can the swimmers be selected? Step 1 Determine whether the problem represents a permutation of combination. The order does not matter. The cubes may be drawn in any order. It is a combination.

The swimmers can be selected in 28 ways.

How many committees of 3 people (chair, secretary, treasurer) can be formed out of 8 people? 1. the 8 persons are distinct 2. once a person is chosen, he/she cannot be chosen again 3. order IS IMPORTANT Permutations of 8 taken 3 at a time:

1. Six different books will be displayed in the library window 1. Six different books will be displayed in the library window. How many different arrangements are there? 2. The code for a lock consists of 5 digits. The last number cannot be 0 or 1. How many different codes are possible? 720 80,000 3. The three best essays in a contest will receive gold, silver, and bronze stars. There are 10 essays. In how many ways can the prizes be awarded? 4. In a talent show, the top 3 performers of 15 will advance to the next round. In how many ways can this be done? 720 455