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.

Slides:



Advertisements
Similar presentations
Permutations and Combinations
Advertisements

Permutations and Combinations Rosen 4.3. Permutations A permutation of a set of distinct objects is an ordered arrangement these objects. An ordered arrangement.
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?
1 Learning Objectives for Section 7.4 Permutations and Combinations After today’s lesson you should be able to set up and compute factorials. apply and.
Multiplication Rule. A tree structure is a useful tool for keeping systematic track of all possibilities in situations in which events happen in order.
Slide Slide 1 Copyright © 2007 Pearson Education, Inc Publishing as Pearson Addison-Wesley. Created by Tom Wegleitner, Centreville, Virginia Section 4-7.
ENM 207 Lecture 5. FACTORIAL NOTATION The product of positive integers from 1 to n is denoted by the special symbol n! and read “n factorial”. n!=1.2.3….(n-2).(n-1).n.
Combinations We should use permutation where order matters
1 More Counting Techniques Possibility trees Multiplication rule Permutations Combinations.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
Math 2 Honors - Santowski
Some lovely and slightly random facts… Give the number of objects described. 1. The number of cards in a standard deck The number of cards of each.
P ERMUTATIONS AND C OMBINATIONS Homework: Permutation and Combinations WS.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. All Rights Reserved. Lecture Slides Elementary Statistics Eleventh Edition and the Triola.
Review of Probability Grade 6 Copyright © Ed2Net Learning Inc.1.
Counting Techniques 0.4.
Slide 7- 1 Copyright © 2006 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
13-1 Permutations and Combinations
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Warm Up Evaluate  4  3  2   6  5  4  3  2 
Section 10-3 Using Permutations and Combinations.
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Part 2 – Factorial and other Counting Rules
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Learning Objectives for Section 7.4 Permutations and Combinations
Copyright © Ed2Net Learning Inc.1. 2 Warm Up Tell whether each event is dependent or independent 1. Selecting a name from a Chicago telephone book and.
Copyright © Ed2Net Learning Inc.1 Graphing in four Quadrants.
Permutations and Combinations
Counting Principles. Counting examples Ex 1: A small sandwich café has 4 different types of bread, 5 different types of meat and 3 different types of.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Copyright © Ed2Net Learning Inc.1. 2 Warm Up Tell whether each event is dependent or independent 1. Selecting a name from a Chicago telephone book and.
Lesson 0.4 (Counting Techniques)
37. Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
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.
Permutations and Combinations
COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.
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.
MATH 2311 Section 2.1.
CSNB 143 Discrete Mathematical Structures
12.2 Permutations and Combinations
Chapter 5 Probability 5.5 Counting Techniques.
Warm Up Permutations and Combinations Evaluate  4  3  2  1
Permutations and Combinations
Combinatorics: Combinations
Permutations and Combinations
Lesson 11-1 Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
MATH 2311 Section 2.1.
Chapter 10 Counting Methods.
Bellwork Practice Packet 10.3 B side #3.
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
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
3.7 Counting Techniques: Permutations
MATH 2311 Section 2.1.
Presentation transcript:

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 can 5 people be seated in a row of 5 chairs?

Copyright © Ed2Net Learning Inc.3 4. In how many ways can 3 representatives be chosen from a group of 11 people? 5. In how many ways can a 5player team be chosen from 16 people? 3. In how many ways can three clarinet players be seated in first, second, and third seats in the orchestra? Warm Up

Copyright © Ed2Net Learning Inc.4 Let’s summarize what we have learnt in the previous lesson 1. The fundamental counting principle says that, the the total number of different ways a task can occur is: n1 * n2 * n3 * ………………… * nr where n1, n2, n3..nr are the tasks performed at first, second and rth stages 2. Factorial is a shorthand notation for a multiplication process. The Fundamental Counting Principle says that the number of ways to choose n items is n ! n! = n * (n-1) * (n-2) *……………*3 * 2 * 1 3. Any factorial less than n! is a factor of n!

Copyright © Ed2Net Learning Inc.5 5. The number of ways (or combinations) in which r objects can be selected from a set of n objects, where repetition is not allowed, is denoted by, or C(n, r) n C r n! n C r = (n-r)! r! 6. Pascal’s Triangle illustrates the symmetric nature of a combination. i,e C(n,r) = C(n,n-r) Recap 4. A combination focuses on the selection of objects without regard to the order in which they are selected

Copyright © Ed2Net Learning Inc The sum of all combinations : C(n,0) + C(n, 1) C(n, n) = 2^n 11. Relationship between permutation and combination is p n r n C r = r! Recap 7. C(n, 1) = n 8. C(n, 0) = 1 9. C(n, n) = 1

Copyright © Ed2Net Learning Inc.7 Concept of Permutation: The letters a, b and c can be arranged in six different ways abc acb bac bca cab cba Each of these arrangements is called the permutations of the letters a, b and c

Copyright © Ed2Net Learning Inc.8 The symbol n P r is used to indicate the number of permutations n objects taken r at a time. n P r = n (n -1)(n -2)…….[n-(r-1)]=n!/ (n - r)! When r = n, last factor of the in the above equation n-(r-1) = n-(n-1) = 1 n P r = n (n -1)(n -2)…….1= n! r factors

Copyright © Ed2Net Learning Inc.9 A permutation focuses on the arrangement of objects with regard to the order in which they are arranged. A combination focuses on the selection of objects without regard to the order in which they are selected. The distinction between a combination and a permutation has to do with the sequence or order in which objects appear. Permutation and Combination - Difference

Copyright © Ed2Net Learning Inc.10 Since the order does not matter in combinations, there are clearly fewer combinations than permutations. The combinations are contained among the permutations. They are a subset of the permutations Relation between permutation and combination

Copyright © Ed2Net Learning Inc.11 Example Find n P r for n = 7 and r = 5. n P r = 7 P 5 = = = /2.1 = = 720 nPr = n!/(n-r)! 7! (7 – 5)! 7! 2! n! (n – r)!

Copyright © Ed2Net Learning Inc.12 Example Find n P r for n = 4 and r = 4. n P n = n! 4 P 4 = 4! = = 24 nPn = n!

Copyright © Ed2Net Learning Inc.13 Example Find the number of permutations of the three letters b, c and d. Solution: The number of permutations of n objects is n! n P n = n! 3 P 3 = 3! = = 12 The number of Permutations of n objects is n!

Copyright © Ed2Net Learning Inc.14 Example From a set of 8 different books, 5 are to selected and arranged on a self. How many arrangements are possible? Solution: Find the number of permutations of 8 books taken 3 at a time: n P r = 8 P 5 = 8!/(8-5)! = /3.2.1 = = 6720 The number of permutations of n objects taken r at a time is nPr. n! (n – r)!

Copyright © Ed2Net Learning Inc.15 If a set of n elements has n 1 elements of one kind, n 2 of another kind alike and so on, then the number of permutations, P, of the n elements taken n at a time is given by: P = n! n 1 !.n 2 !

Copyright © Ed2Net Learning Inc.16 Example Find the number of ways the letters in the word BEEKEEPER can be arranged? Solution: There are 9 letters, 5 of which are E’s, 1 is B, 1 is K and 1 is P. P = P = 9!/5!.1!.1! = / = = 3024 P = n! n 1 !.n 2 ! n! n 1 !.n 2 !...

Copyright © Ed2Net Learning Inc.17 Your Turn Evaluate: 1.5! 2.10!/8! 3.6!/(6-2)! 4. 5 P P 3

Copyright © Ed2Net Learning Inc.18 Your Turn Tell the number of ways the letters in each word can be arranged. 6.TOP 7.NOON 8.SUPPER 9.In how many ways 7 people can be lined up in a row? 10. In how many ways 6 different books can be arranged on a self?

Copyright © Ed2Net Learning Inc.19 Refreshment Time

Copyright © Ed2Net Learning Inc.20 Lets play a Game

Copyright © Ed2Net Learning Inc In how many ways can 3 cards from a deck of cards be laid in a row face up?

Copyright © Ed2Net Learning Inc a) How many vowels are there? How many consonants are there? b) In how many ways can you choose at random a vowel and a consonant?

Copyright © Ed2Net Learning Inc Show that 6 P 4 = 6( 5 P 3 )

Copyright © Ed2Net Learning Inc.24 Let Us Review The symbol n P r is used to indicate the number of permutations n objects taken r at a time. n P r = n!/ (n - r)! The numbers of n objects is n!. If a set of n elements has n 1 elements of one kind, n 2 of another kind alike and so on, then the number of permutations, P, of the n elements taken n at a time is given by: P = n! n 1 !.n 2 !

Copyright © Ed2Net Learning Inc.25 You did Great !!!! Keep up the good work