Section 12.9 Combinations.

Slides:



Advertisements
Similar presentations
Counting Techniques The Fundamental Rule of Counting (the mn Rule); Permutations; and Combinations.
Advertisements

Math in Our World Section 11.2 Combinations.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
12.4 – Permutations & Combinations. Permutation – all possible arrangements of objects in which the order of the objects is taken in to consideration.
Solving Linear Systems by Linear Combinations
Permutations and Combinations
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Section 10-3 Using Permutations and Combinations.
Additional Topics in Probability and Counting
Formula? Unit?.  Formula ?  Unit?  Formula?  Unit?
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Part 2 – Factorial and other Counting Rules
10/23/ Combinations. 10/23/ Combinations Remember that Permutations told us how many different ways we could choose r items from a group.
Compound Inequalities
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Section 11.2 Combinations Math in Our World Learning Objectives  Distinguish between combinations and permutations.  Find the number of combinations.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.9 Combinations.
Copyright © Cengage Learning. All rights reserved. Elementary Probability Theory 4.
Combinations and Permutations CHAPTER 4.4.  Permutations are used when arranging r out of n items in a specific order. n P r = PERMUTATIONS.
Choosing items from a larger group, when the order does not matter. This is different than permutations in chapter 11.2 – items had to be in a certain.
Special Topics. Calculating Outcomes for Equally Likely Events If a random phenomenon has equally likely outcomes, then the probability of event A is:
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.
Visit:
Permutations and Combinations
Solve Linear Systems by Adding Section 6.3 beginning on page 386.
$200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200.
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.
Chapter 10 Counting Methods.
4-1 Chapter 4 Counting Techniques.
11.8 Combinations A combination of items occurs when
Permutations and Combinations
Fundamental Counting Principle
Counting Methods and Probability Theory
4 Elementary Probability Theory
Combinations.
12.2 Permutations and Combinations
Chapter 3 Probability.
Section 3-4 Permutations
Unit 4 – Combinatorics and Probability Section 4
Godrej Prakriti Sodepur | Godrej Prakriti Kolkata
4-1 Chapter 4 Counting Techniques.
Chapter 3 Probability.
4-1 Chapter 4 Counting Techniques.
Copyright © Cengage Learning. All rights reserved.
BACK SOLUTION:
Giftalove Best Cake Offers
Elementary Statistics: Picturing The World
4 Elementary Probability Theory
Permutations and Combinations
Permutation – The number of ways to ARRANGE ‘n’ items ‘r’ at
خطوات البحث العلمي.
Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.
Section 12.8 The Counting Principle and Permutations
11.6 Conditional Probability
Permutations and Combinations
Combinations.
Counting Methods and Probability Theory
Ancient China: Section 1
Chapter 10 Counting Methods.
Chapter 3 Probability.
4-1 Chapter 4 Counting Techniques.
POWER CHALLENGES Several Ways To Solve 7 CHALLENGES.
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
5 Elementary Probability Theory
Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.
Visit us:
Presentation transcript:

Section 12.9 Combinations

What You Will Learn Combinations

Combination A combination is a distinct group (or set) of objects without regard to their arrangement.

Combination Formula The number of combinations possible when r objects are selected from n objects is found by

Example 2: Museum Selection While visiting New York City, the Friedmans are interested in visiting 8 museums but have time to visit only 3. In how many ways can the Friedmans select 3 of the 8 museums to visit?

Example 2: Museum Selection Solution n = 8, r = 3 There are 56 different ways that 3 of the 8 museums can be selected.

Example 3: Floral Arrangements Jan Funkhauser has 10 different cut flowers from which she will choose 6 to use ina floral arrangement. How many different ways can she do so?

Example 3: Floral Arrangements Solution n = 10, r = 6 There are 210 different ways Jan can choose 6 cut flowers from the 10.

Example 4: Dinner Combinations At the Royal Dynasty Chinese restaurant, dinner for eight people consists of 3 items from column A, 4 items from column B, and 3 items from column C. If columns A, B, and C have 5, 7, and 6 items, respectively, how many different dinner combinations are possible?

Example 4: Dinner Combinations Solution Column A: 3 of 5, Column B: 4 of 7, Column C 3 of 6