Permutations and Combinations

Slides:



Advertisements
Similar presentations
Copyright © Cengage Learning. All rights reserved. 6 Sets and Counting.
Advertisements

4-1 Chapter 4 Counting Techniques.
Counting Principles Probability.
DM. 13. A method for counting outcomes of multi-stage processes If you want to perform a series of tasks and the first task can be done in (a) ways, the.
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.
COUNTING TECHNIQUES PERMUTATIONS AND COMBINATIONS.
T HE F UNDAMENTAL C OUNTING P RINCIPLE & P ERMUTATIONS.
MATHPOWER TM 12, WESTERN EDITION Chapter 7 Combinatorics.
Math 221 Integrated Learning System Week 2, Lecture 1
Organized Counting Permutations and Combinations.
Combinations We should use permutation where order matters
COUNTING TECHNIQUES PERMUTATIONS AND COMBINATIONS.
Chapter Probability © 2010 Pearson Prentice Hall. All rights reserved 3 5.
6-7 Permutations & Combinations M11.E.3.2.1: Determine the number of permutations and/or combinations or apply the fundamental counting principle.
1 The Multiplication Principle Prepared by E.G. Gascon.
Counting and Probability Sets and Counting Permutations & Combinations Probability.
Do Now: Make a tree diagram that shows the number of different objects that can be created. T-shirts: Sizes: S, M, L and T-shirts: Sizes: S, M, L and Type:
How many different ways can you arrange the letters in “may”?
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.
Dr. Fowler AFM Unit 7-7 Permutations and Combinations.
Counting Techniques 0.4.
Suppose you are in a small restaurant and are ready to order a soup, a main course, and a beverage. (Unfortunately, you will need to go somewhere else.
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.
Lesson # 64 – 65 Notes Permutations and Combinations 1.The Counting Principle – The number of outcomes for an event is the product of the number of outcomes.
Section 5.5 Counting Techniques. An airport shuttle bus driver needs to pick up 4 separate passengers: a,b,c,d. How many different ways can the.
Chapter 10 – Data Analysis and Probability
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Lesson Counting Techniques. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
CSNB143 – Discrete Structure
Unit 2 - Permutations and Organized Counting
Counting Principles Multiplication rule Permutations Combinations.
Algebra 2/TrigonometryName: __________________________ 12.1, 12.2 Counting Principles NotesDate: ___________________________ Example 1: You are buying.
Counting Techniques. Multiplication Principle (also called the Fundamental Counting Principle) Combinations Permutations Number of subsets of a given.
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 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.
COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.
CS 104: Discrete Mathematics
Math 1320 Chapter 6: Sets and Counting 6.2 Cardinality.
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.
Bell work Diagnostic Evaluation Please pick up a Pre-Assessment off the table as you come in to class, take a seat, and get started.
Counting Techniques. Fundamental Counting Principal Two Events: If one event can occur in m ways and another event can occur in n ways, then the number.
Counting Techniques Section 5.5. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
4-1 Chapter 4 Counting Techniques.
Permutations and Combinations
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
Algebra 2/Trig Name: ________________________
12.2 Permutations and Combinations
Copyright © Cengage Learning. All rights reserved.
Chapter 5 Probability 5.5 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
12.1 The Fundamental Counting Principle & Permutations
CS100: Discrete structures
Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.
Permutations and Combinations
Chapter 10 Counting Methods.
4-1 Chapter 4 Counting Techniques.
9.6 Counting Theory Example If there are 3 roads from Albany to Baker
12.1 The Fundamental Counting Principle and Permutations
Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.
Permutations and Combinations
Counting and Probability
Presentation transcript:

Permutations and Combinations Solve Counting Problems Using Multiplication Principle Solve Counting Problems Using Permutations Solve Counting Problems Using Combinations Solve Counting Problems Using Permutations involving non distinct objects

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 and r selections for the third choice and so on then the task of making these selections can be done in p∙q∙r∙……..

Question The fixed price dinner at a restaurant provides the following choices Appetizer: Soup or Salad Entrée: Chicken, Beef, Fish or Pork Dessert: Ice Cream or Cheesecake How many different meals can be ordered?

Permutation A permutation is an ordered arrangement of r objects chosen from n objects

Permutations: Distinct objects with repetition The number of ordered arrangements of r objects chosen from n objects in which the n objects are distinct and repetition is allowed is equal to nr. The symbol P(n,r) represents the number of ordered arrangements of r objects chosen from n distinct objects where r≤ n and repetition is not allowed.

Permutations of r objects chosen from n distinct objects without repetition The number of arrangements of n objects using r ≤ n of them in which The n objects are distinct Once an object is used it can not be used again Order is important Is given by the formula

Example The International Airline Transportation Association assigns three letter codes to represent airport locations. For example the airport code for Ft Lauderdale, Florida is FLL. Notice that repetition is allowed in forming this code. How many airport codes are possible?

Example Suppose that we wish to establish a three letter code using any of the 26 uppercase letters of the alphabet, but we require that no letter be used more than once. How many different three letter codes are there?

Lining up people In how many ways can 5 people be lined up?

Birthday problem All we know about Shannon, Patrick and Ryan is that they have different birthdays. If we listed all the possible ways this could occur how many would there be? Assume there are 365 days in a year

Combinations A combination is an arrangement, without regard to order, of r objects selected from n distinct objects without repetition, where r ≤n. The symbol C(n,r) represents the number of combinations of n distinct objects using r of them.

Forming Committees How many different committees of 3 people can be formed from a pool of 7 people?

Forming Committees 2 In how many ways can a committee consisting of 2 faculty members and 3 students be formed if 6 faculty members and 10 students are eligible to serve on the committee?

Forming different words How many different words (real or imaginary) can be formed using all the letters in the word REARRANGE?

Number of combinations of n distinct objects taken r at a time The number of arrangements of n objects using r≤n of them, in which Th n objects are distinct Once an object is used, it cannot be repeated Order is not important is given by the formula

Permutations involving n objects that are not distinct The number of permutations of n objects of which n1 are of one kind and n2 are of a second kind…….and nk are of the kth kind is given by

Question The student relations committee of a college consists of 2 administrators 3 faculty members and 5 students. Four administrators, 8 faculty members, and 20 students are eligible to serve. How many different committees are possible?

Question How many different 9 letter words (real and imaginary) can be formed from the letters in the word ECONOMICS?

Question How many different 11 letter words (real or imaginary) can be formed from the letters in the word MATHEMATICS?