Section 9.1b… Combinations. What are they??? With permutations, we take n objects, r at a time, and different orderings of these objects are considered.

Slides:



Advertisements
Similar presentations
Algebra 1 Glencoe McGraw-Hill JoAnn Evans Math 8H 12-3 Permutations and Combinations.
Advertisements

Permutations and Combinations
How many possible outcomes can you make with the accessories?
13-3 Permutations and Combinations. Fundamental Counting Principle.
CSRU1100 Counting. Counting What is Counting “how many?” Counting is the process of determining the answer to a question of “how many?” for any given.
Chapter 2 Section 2.4 Permutations and Combinations.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Combinatorics Chapter 3 Section 3.3 Permutations Finite Mathematics – Stall.
6-7 Permutations & Combinations M11.E.3.2.1: Determine the number of permutations and/or combinations or apply the fundamental counting principle.
6.7 – Permutations and Combinations
EXAMPLE 3 Permutations and Combinations Tell whether the possibilities can be counted using a permutation or combination. Then write an expression for.
College Algebra Fifth Edition
Combinations From One Set. Combination Formula is the number of combinations of “n” different objects that can be formed by taking “r” of them at a time.
Chapter 5 Section 5 Counting Techniques.
5.5 Counting Techniques. More Challenging Stuff  The classical method, when all outcomes are equally likely, involves counting the number of ways something.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Permutations Counting Techniques, Part 1. Permutations Recall the notion of calculating the number of ways in which to arrange a given number of items.
Aim: What are the permutation and combination? Do Now: 2. If four students are scheduled to give a report in class, in how many ways can the students.
Notes 9.1 – Basic Combinatorics. I. Types of Data 1.) Discrete Data – “Countable”; how many? 2.) Continuous Data – “uncountable”; measurements; you can.
Introduction to Counting Discrete Structures. A Multiplication Principle.
1/31/2007 Pre-Calculus Chapter 9 Review a n = a 1 + (n – 1)d a n = a 1 r (n – 1)
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
What are we doing today? Have calculator handy Notes: Basic Combinatorics Go over quiz Homework.
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.)
10/23/ Combinations. 10/23/ Combinations Remember that Permutations told us how many different ways we could choose r items from a group.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
CSNB143 – Discrete Structure Topic 6 – Counting Techniques.
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.
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.
Permutations and Combinations Section 2.2 & 2.3 Finite Math.
Permutations and Combinations Review: Counting Principle 1.) Carol has 4 skirts, 3 shirts, and 3 pairs of shoes. How many different outfits are possible?
15.3 Permutations and Combinations OBJ:  To solve problems involving permutations and combinations.
Lesson 0.4 (Counting Techniques)
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
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.
COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.
PreQuiz 12A Make a systematic list of all possible outcomes: You spin a spinner and flip a coin.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Copyright © Cengage Learning. All rights reserved. Probability and Statistics.
Permutations and Combinations
MATH 2311 Section 2.1.
Permutations and Combinations
Happy Pi Day! Find x. 15 If you still have x
6.7 – Permutations and Combinations
Permutations and Combinations
Section 0-4 Counting Techniques
4 Probability Lesson 4.8 Combinations and Probability.
Permutations and Combinations
Permutations and Combinations
Lesson 11-1 Permutations and Combinations
Permutation & COmbination
Permutations and Combinations
Pettit 9-5 Notes Indicator- D7
MATH 2311 Section 2.1.
Counting Principle.
Counting Methods and Probability Theory
Permutations and Combinations
Bellwork Practice Packet 10.3 B side #3.
Combinations & Permutations (4.3.1)
Counting Methods and Probability Theory
9.6 Counting Theory Example If there are 3 roads from Albany to Baker
Permutations and Combinations
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Permutations and Combinations
PERMUTATIONS.
Chapter 11: Further Topics in Algebra
MATH 2311 Section 2.1.
Presentation transcript:

Section 9.1b… Combinations

What are they??? With permutations, we take n objects, r at a time, and different orderings of these objects are considered different permutations. In some situations, different orderings don’t matter!!! Combinations (of n objects taken r at a time) – the numbers of ways to select the objects, regardless of the order in which they are arranged.

Combination Counting Formula The number of combinations of n objects taken r at a time is denoted C and is given by nr for If r > n, then A note about notation: is commonly denoted Both are read: “n choose r ”

Distinguishing Combinations from Permutations In each of the following scenarios, tell whether permutations (ordered) or combinations (unordered) are being described. Then determine the possible choices in the scenario. 1. A president, vice-president, and secretary are chosen from a 25-member garden club. Permutations Permutations – order matters because it matters who gets which office.

Distinguishing Combinations from Permutations In each of the following scenarios, tell whether permutations (ordered) or combinations (unordered) are being described. Then determine the possible choices in the scenario. 2. A cook chooses 5 potatoes from a bag of 12 potatoes to make a potato salad. Combinations Combinations – the salad is the same no matter what order the potatoes are chosen.

Distinguishing Combinations from Permutations In each of the following scenarios, tell whether permutations (ordered) or combinations (unordered) are being described. Then determine the possible choices in the scenario. 3. A teacher makes a seating chart for 22 students in a classroom with 30 desks. Permutations Permutations – a different ordering of students in the same seats results in a different seating chart.

More Guided Practice In the Miss America pageant, 51 contestants must be narrowed down to 10 finalists who will compete on national television. In how many possible ways can the ten finalists be selected? Permutations or Combinations??? ways

More Guided Practice The Georgia Lotto requires winners to pick 6 integers between 1 and 46. The order in which you select them does not matter; indeed, the lottery tickets are always printed with the numbers in ascending order. How many different lottery tickets are possible? Permutations or Combinations??? possible tickets

More Guided Practice Armando’s Pizzeria offers patrons any combination of up to 10 different toppings. How many different pizzas can be ordered possible pizzas (a) if we can choose any three toppings? Order of the toppings does not matter, so:

More Guided Practice Armando’s Pizzeria offers patrons any combination of up to 10 different toppings. How many different pizzas can be ordered (b) if we can choose any number of toppings (0 through 10)? We could add up all numbers of the form for r = 0, 1,…, 10. A quicker way: For each option (topping), we can choose either yes or no. By the Multiplication Principle: possible pizzas

Formula for Counting Subsets of an n - set There are 2 subsets of a set with n objects (including the empty set and the entire set). n

More Guided Practice A national hamburger chain used to advertise that it fixed its hamburgers “256 ways,” since patrons could order whatever toppings they wanted. How many toppings must have been available? We need to solve the following equation for n: toppings