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.

Slides:



Advertisements
Similar presentations
Permutations and Combinations
Advertisements

Permutations and Combinations
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 15 Chances, Probabilities, and Odds 15.1Random Experiments and.
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?
Permutations & Combinations Section 2.4. Permutations When more than one item is selected (without replacement) from a single category and the order of.
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 :
Logic and Introduction to Sets Chapter 6 Dr.Hayk Melikyan/ Department of Mathematics and CS/ For more complicated problems, we will.
April 22, 2010Math 132: Foundations of Mathematics 11.2 Homework Solutions 8. 10! = 3,628, P 7 = 8,648, P 3 = 6, !/(2!2!) =
0! MATH 110 Sec 12.3 Permutations and Combinations Practice Exercises Evaluate the following (7-3)! 6!
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.
Aim: Combinations Course: Math Lit. Do Now: Aim: How do we determine the number of outcomes when order is not an issue? Ann, Barbara, Carol, and Dave.
Permutations and Combinations
Chapter 5: Introduction to Probability 5.3 Counting and theoretical probabilities: How many? 1 Learning Objectives:  Learn how to count outcomes without.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Section 10-3 Using Permutations and Combinations.
Permutations, Combinations, and Counting Theory AII.12 The student will compute and distinguish between permutations and combinations and use technology.
At the local deli you can add two toppings to your sandwich. Draw a tree diagram to show how many ways you can select two different toppings for your sandwich.
Prob/Stats Definition A permutation is an ordered arrangement of objects. (For example, consider the permutations of the letters A, B, C and D.)
Conditional Probability The probability that event B will occur given that A will occur (or has occurred) is denoted P(B|A) (read the probability of B.
Aim #10-7: How do we use the permutation formula? A permutation is an ordered arrangement of items that occurs when: No item is used more than once. The.
Combinations A combination is an unordered collection of distinct elements. To find a combination, the general formula is: Where n is the number of objects.
Ch Counting Principles. Example 1  Eight pieces of paper are numbered from 1-8 and placed in a box. One piece of paper is drawn from the box, its.
Permutations and Combinations
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Permutations, Combinations, and Counting Theory
How many four-digit odd numbers are there? Assume that the digit on the left cannot be a zero.
6.7 Permutations & Combinations. Factorial: 4! = 4*3*2*1 On calculator: math ==> PRB ==> 4 7! = 5040 Try 12!
Honors PreCalculus: Section 9.1 Basic Combinatorics.
Lesson 0.4 (Counting Techniques)
6.7 Permutations and Combinations. Fundamental Counting You have the following clothes to choose from: 1 black and1 blue pair of jeans 1 yellow, 1 green,
I CAN: Use Permutations and Combinations
© 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.
3.2 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.
8.6 Counting Principles. Listing Possibilities: Ex 1 Eight pieces of paper are numbered from 1 to 8 and placed in a box. One piece of paper is drawn from.
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.
Permutations and Combinations
Chapter 10 Counting Methods.
11.8 Combinations A combination of items occurs when
MATH 2311 Section 2.1.
11.3 Notes Combinations.
Counting Methods and Probability Theory
Unit 4 – Combinatorics and Probability Section 4
Permutations and Combinations
Permutations and Combinations
Lesson 11-1 Permutations and Combinations
11.6 Conditional Probability
Permutations and Combinations
Permutations and Combinations
How many possible outcomes can you make with the accessories?
MAT 142 Lecture Video Series
Combinations.
MATH 2311 Section 2.1.
Counting Methods and Probability Theory
Counting Methods and Probability Theory
Bellwork Practice Packet 10.3 B side #3.
Counting Methods and Probability Theory
Permutations and Combinations
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Permutations and Combinations
Lecture 7: Permutations and Combinations
Permutations and Combinations
MATH 2311 Section 2.1.
Presentation transcript:

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 order of the items makes no difference.

Example Distinguishing between Permutations and Combinations For each of the following problems, explain if the problem is one involving permutations or combinations. Six students are running for student government president, vice-president, and treasurer. The student with the greatest number of votes becomes the president, the second biggest vote-getter becomes vice-president, and the student who gets the third largest number of votes will be student government treasurer. How many different outcomes are possible for these three positions?

Solution Students are choosing three student government officers from six candidates. The order in which the officers are chosen makes a difference because each of the offices (president, vice-president, treasurer) is different. Order matters. This is a problem involving permutations.

Example Distinguishing between Permutations and Combinations For each of the following problems, explain if the problem is one involving permutations or combinations. Six people are on the volunteer board of supervisors for your neighborhood park. A three- person committee is needed to study the possibility of expanding the park. How many different committees could be formed from the six people on the board of supervisors?

Solution A three-person committee is to be formed from the six-person board of supervisors. The order in which the three people are selected does not matter because they are not filling different roles on the committee. Because order makes no difference, this is a problem involving combinations.

Example Distinguishing between Permutations and Combinations For each of the following problems, explain if the problem is one involving permutations or combinations. Baskin-Robbins offers 31 different flavors of ice cream. One of their items is a bowl consisting of three scoops of ice cream, each a different flavor. How many such bowls are possible?

Solution A three-scoop bowl of three different flavors is to be formed from Baskin-Robbin’s 31 flavors. The order in which the three scoops of ice cream are put into the bowl is irrelevant. A bowl with chocolate, vanilla, and strawberry is exactly the same as a bowl with vanilla, strawberry, and chocolate. Different orderings do not change things, and so this problem is combinations.

Combinations of n Things Taken r at a Time The number of combinations possible if r items are taken from n items is

Example Using the Formula for Combinations A three-person committee is needed to study ways of improving public transportation. How many committees could be formed from the eight people on the board of supervisors?

Solution The order in which the three people are selected does not matter. This is a problem of selecting r = 3 people from a group of n = 8 people. We are looking for the number of combinations of eight things taken three at a time.

Example Using the Formula for Combinations In poker, a person is dealt 5 cards from a standard 52-card deck. The order in which you are dealt the 5 cards does not matter. How many different 5-card poker hands are possible?

Solution Because the order in which the 5 cards are dealt does not matter, this is a problem involving combinations. We are looking for the number of combinations of n=52 cards drawn r=5 a a time.

Example Using the Formula for Combinations and the Fundamental Counting Principle The U.S. Senate of the 104th Congress consisted of 54 Republicans and 46 Democrats. How many committees can be formed if each committee must have 3 Republicans and 2 Democrats?

Solution The order in which members are selected does not matter. We begin with the number of ways of selecting 3 Republicans out of 54 Republicans without regard to order.

Solution cont. Next, we find the number of ways of selecting 2 Democrats out of 46 Democrats without regard to order.

Solution cont. We use the Fundamental Counting Principle to find the number of committees that can be formed: 28,804  1035 = 25,672,140 Thus, 25,672,140 committees can be formed.

Thinking Mathematically Combinations