12.2 Permutations and Combinations

Slides:



Advertisements
Similar presentations
Counting Principles Probability.
Advertisements

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.
___ ___ ___ ___ ___ ___ ___ ___ ___
Combinations We should use permutation where order matters
Copyright © Ed2Net Learning Inc.1. 2 Warm Up 1.List all combinations of Roshanda, Shelli, Toshi, and Hector, taken three at a time 2. In how many ways.
Permutation and Combination
Counting and Probability Sets and Counting Permutations & Combinations Probability.
MAT 2720 Discrete Mathematics Section 6.1 Basic Counting Principles
Notes 9.1 – Basic Combinatorics. I. Types of Data 1.) Discrete Data – “Countable”; how many? 2.) Continuous Data – “uncountable”; measurements; you can.
Dr. Fowler AFM Unit 7-7 Permutations and Combinations.
Permutations and Combinations
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
13-1 Permutations and Combinations
Methods of Counting Outcomes BUSA 2100, Section 4.1.
Advanced Precalculus Advanced Precalculus Notes 12.2 Permutations and Combinations.
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Section 10-3 Using Permutations and Combinations.
Lesson Counting Techniques. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting problems using combinations.
Simple Arrangements & Selections. Combinations & Permutations A permutation of n distinct objects is an arrangement, or ordering, of the n objects. An.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
CSNB143 – Discrete Structure
Counting Principles Multiplication rule Permutations 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.
Permutations Counting where order matters If you have two tasks T 1 and T 2 that are performed in sequence. T 1 can be performed in n ways. T 2 can be.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.
Special Topics. Calculating Outcomes for Equally Likely Events If a random phenomenon has equally likely outcomes, then the probability of event A is:
Copyright © Cengage Learning. All rights reserved. Probability and Statistics.
Counting Techniques Section 5.5. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
EXAMPLE 1 Count permutations
MAT 2720 Discrete Mathematics
Counting, Permutations, & Combinations
Chapter 10 Counting Methods.
Counting, Permutations, & Combinations
MATH 2311 Section 2.1.
Counting, Permutations, & Combinations
Permutations and Combinations
Counting Methods and Probability Theory
Copyright © Cengage Learning. All rights reserved.
Counting, Permutations, & Combinations
Chapter 5 Probability 5.5 Counting Techniques.
Counting Principle and Permutations
Copyright © Cengage Learning. All rights reserved.
12.1 The Fundamental Counting Principle & Permutations
8.3 Counting Apply the fundamental counting principle
Warm Up Permutations and Combinations Evaluate  4  3  2  1
Counting, Permutations, & Combinations
Counting, Permutations, & Combinations
Section 12.8 The Counting Principle and Permutations
Permutations and Combinations
Counting techniques Basic Counting Principles, Pigeonhole Principle, Permutations and Combinations.
Permutations.
MATH 2311 Section 2.1.
Counting Methods and Probability Theory
Counting Methods and Probability Theory
Chapter 10 Counting Methods.
Using Permutations and Combinations
Combinations & Permutations (4.3.1)
Counting Methods and Probability Theory
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
Exercise How many different lunches can be made by choosing one of four sandwiches, one of three fruits, and one of two desserts? 24.
WUE Seventeen applicants want to interview with SAS. In how many ways can the 8 time slots be assigned? How many different ways can the letters of the.
PERMUTATIONS.
Permutations and Combinations
10.3 – Using Permutations and Combinations
9.1 Basic Combinatorics.
MATH 2311 Section 2.1.
Presentation transcript:

12.2 Permutations and Combinations

Theorem Multiplication Principle of Counting 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 so on, 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

A permutation is an ordered arrangement of n distinct objects without repetitions. The symbol P(n, r) represents the number of permutations of n distinct objects, taken r at a time, where r < n.

Theorem Number of Permutations 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 important is given by the formula

Evaluate: P (10, 3)

All we know about Anna, Lucy, and John that their birthdays are all in different months. If we were to list all the possible ways this could occur, how many would there be? This is an example of a permutation in which 3 birthdays are selected from a possible 12 months and no birthday may repeat itself. So the 3 requirements are satisfied. 1. the 3 objects are distinct 2. once an object is used, it cannot be repeated 3. order is important

There are 1320 possibilities.

A combination is an arrangement, without regard to order, of n distinct objects without repetitions. The symbol C(n, r) represents the number of combinations of n distinct objects taken r at a time, where r < n.

Theorem 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: C (10, 3)

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:

How many committees of 3 people (chair, secretary, treasurer) can be formed from 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: