Section 11.2 Combinations Math in Our World Learning Objectives  Distinguish between combinations and permutations.  Find the number of combinations.

Slides:



Advertisements
Similar presentations
4-1 Chapter 4 Counting Techniques.
Advertisements

HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 4.5.
9.5 Counting Subsets of a Set: Combinations
Counting Principles Probability.
Chapter 10 Counting Techniques.
Permutations and Combinations
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.
Thinking Mathematically Combinations. A combination of items occurs when: The item are selected from the same group. No item is used more than once. The.
___ ___ ___ ___ ___ ___ ___ ___ ___
Combinations We should use permutation where order matters
Math in Our World Section 11.2 Combinations.
Probability Using Permutations and Combinations
Thinking Mathematically
6-7 Permutations & Combinations M11.E.3.2.1: Determine the number of permutations and/or combinations or apply the fundamental counting principle.
College Algebra Fifth Edition
40S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Probability Lesson: PR-4 Fundamental Counting Principle Fundamental Counting Principle Learning.
Chapter 8 Counting Principles: Further Probability Topics Section 8.2 Combinations.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
P ERMUTATIONS AND C OMBINATIONS Homework: Permutation and Combinations WS.
The Fundamental Counting Principle and Permutations
Counting. Product Rule Example Sum Rule Pigeonhole principle If there are more pigeons than pigeonholes, then there must be at least one pigeonhole.
Math Duels Competition of Scholars. Rules  The class must be split into 2 groups.  Each group must select a team captain and they must do Rock-Paper-Scissors.
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Part 2 – Factorial and other Counting Rules
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Quiz Plot the point: (-4, 2, -3) in the Cartesian space. Find the midpoint between the 2 points: P(1, 5, -7) and Q(-5, 3, -3) 3. Find the distance.
CSNB143 – Discrete Structure
Combinations and Permutations CHAPTER 4.4.  Permutations are used when arranging r out of n items in a specific order. n P r = PERMUTATIONS.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
37. Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
Counting Techniques. Multiplication Principle (also called the Fundamental Counting Principle) Combinations Permutations Number of subsets of a given.
3.2 Combinations.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
Permutations and Combinations
Probability and Counting Rules 4-4: Counting Rules.
Section The Pigeonhole Principle If a flock of 20 pigeons roosts in a set of 19 pigeonholes, one of the pigeonholes must have more than 1 pigeon.
Introduction to probability (2) Combinations التوافيق Definition of combination: It is a way of selecting items from a collection, such that the order.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Copyright © Cengage Learning. All rights reserved. Probability and Statistics.
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. Permutations Definition –An ordered arrangement of objects is called a permutation. –Hence, a permutation of n distinct.
LEARNING OUTCOMES : a. understand combinations of a set of objects. b. determine the number of ways to form combinations of r objects from n objects Click.
Example A standard deck of 52 cards has 13 kinds of cards, with four cards of each of kind, one in each of the four suits, hearts, diamonds, spades, and.
4-1 Chapter 4 Counting Techniques.
Permutations and Combinations
Counting Methods and Probability Theory
Copyright © Cengage Learning. All rights reserved.
4-1 Chapter 4 Counting Techniques.
Counting Principles NOTES Coach Bridges.
4-1 Chapter 4 Counting Techniques.
CS100: Discrete structures
8.3 Counting Apply the fundamental counting principle
4 Probability Lesson 4.8 Combinations and Probability.
Permutations and Combinations
Permutation – The number of ways to ARRANGE ‘n’ items ‘r’ at
Permutations and Combinations
Lesson 11-1 Permutations and Combinations
Permutations and Combinations
Permutation & COmbination
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
Chapter 10 Counting Methods.
Counting Methods and Probability Theory
Counting Methods and Probability Theory
4-1 Chapter 4 Counting Techniques.
Counting Methods and Probability Theory
12.1 The Fundamental Counting Principle and Permutations
Exercise Evaluate 3! 6.
Permutations and Combinations
Presentation transcript:

Section 11.2 Combinations Math in Our World

Learning Objectives  Distinguish between combinations and permutations.  Find the number of combinations of n objects taken r at a time.  Use the combination rule in conjunction with the fundamental counting principle.

Combinations A selection of objects without regard to order is called a combination.

EXAMPLE 1 Comparing Permutations and Combinations Given four housemates, Ruth, Elaine, Ama, and Jasmine, list the permutations and combinations when you are selecting two of them. We’ll start with permutations, then eliminate those that have the same two people listed. SOLUTION

EXAMPLE 1 Comparing Permutations and Combinations Permutations Ruth Elaine Elaine Ruth Ruth Ama Ama Ruth Ruth Jasmine Jasmine Ruth Elaine Ama Ama Elaine Elaine Jasmine Jasmine Elaine Ama Jasmine Jasmine Ama Combinations Ruth Elaine Ruth Ama Ruth Jasmine Elaine Ama Elaine Jasmine Ama Jasmine There are 12 permutations, but only 6 combinations. SOLUTION

EXAMPLE 2 Identifying Permutations and Combinations Decide if each selection is a permutation or a combination. (a) From a class of 25 students, a group of 5 is chosen to give a presentation. (b) A starting pitcher and catcher are picked from a 12-person intramural softball team.

EXAMPLE 2 Identifying Permutations and Combinations Decide if each selection is a permutation or a combination. (a) From a class of 25 students, a group of 5 is chosen to give a presentation. (b) A starting pitcher and catcher are picked from a 12-person intramural softball team. SOLUTION (a) This is a combination because there are no distinct roles for the 5 group members, so order is not important. (b) This is a permutation because each selected person has a distinct position, so order matters.

The Combination Rule The number of combinations of n objects taken r at a time is denoted by n C r, and is given by the formula

EXAMPLE 3 Using the Combination Rule How many combinations of four objects are there taken two at a time? SOLUTION Since this is a combination problem, the answer is This matches our result from Example 1.

EXAMPLE 3 Using the Combination Rule How many combinations of four objects are there taken two at a time?

EXAMPLE 4 An Application of Combinations While studying abroad one semester, Tran is required to visit 10 different cities. He plans to visit 3 of the 10 over a long weekend. How many different ways can he choose the 3 to visit? Assume that distance is not a factor.

EXAMPLE 4 An Application of Combinations While studying abroad one semester, Tran is required to visit 10 different cities. He plans to visit 3 of the 10 over a long weekend. How many different ways can he choose the 3 to visit? Assume that distance is not a factor. SOLUTION The problem doesn’t say anything about the order in which they’ll be visited, so this is a combination problem.

EXAMPLE 5 Choosing a Committee At one school, the student government consists of seven women and five men. How many different committees can be chosen with three women and two men?

EXAMPLE 5 Choosing a Committee At one school, the student government consists of seven women and five men. How many different committees can be chosen with three women and two men? SOLUTION First, we will choose three women from the seven candidates. This can be done in 7 C 3 = 35 ways. Then we will choose two men from the five candidates in 5 C 2 = 10 ways. Using the fundamental counting principle, there are 35 x 10 = 350 possible committees.

EXAMPLE 6 Designing a Calendar To raise money for a charity event, a sorority plans to sell a calendar featuring tasteful pictures of some of the more attractive professors on campus. They will need to choose six models from a pool of finalists that includes nine women and six men. How many possible choices are there if they want to feature at least four women?

EXAMPLE 6 Designing a Calendar SOLUTION Since we need to include at least four women, there are three possible compositions: four women and two men, five women and one man, or six women and no men. Four women and two men: Using Fundamental Counting Principle: number of ways to choose 4 women times the number of ways to choose 2 men

EXAMPLE 6 Designing a Calendar SOLUTION Five women and one man: Six women and no men: The total number of possibilities is 1, = 2,730.