Permutations and Combinations. Permutations Definition –An ordered arrangement of objects is called a permutation. –Hence, a permutation of n distinct.

Slides:



Advertisements
Similar presentations
Counting Chapter 6 With Question/Answer Animations.
Advertisements

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.
Chapter 13 sec. 3.  Def.  Is an ordering of distinct objects in a straight line. If we select r different objects from a set of n objects and arrange.
Permutations and Combinations
Counting and Probability The outcome of a random process is sure to occur, but impossible to predict. Examples: fair coin tossing, rolling a pair of dice,
Combinations We should use permutation where order matters
Chapter 7 - Part Two Counting Techniques Wednesday, March 18, 2009.
Discrete Mathematics Lecture 6 Alexander Bukharovich New York University.
Permutations & Combinations Section 2.4. Permutations When more than one item is selected (without replacement) from a single category and the order of.
Warm-Up Complete in notes.
Part 1 Module 5 Factorials, Permutations, and Combinations.
1 Permutations and Combinations CS/APMA 202 Epp section 6.4 Aaron Bloomfield.
Permutations and Combinations
Logic and Introduction to Sets Chapter 6 Dr.Hayk Melikyan/ Department of Mathematics and CS/ For more complicated problems, we will.
College Algebra Fifth Edition
4. Counting 4.1 The Basic of Counting Basic Counting Principles Example 1 suppose that either a member of the faculty or a student in the department is.
Counting Chapter 6 With Question/Answer Animations.
Chapter 8 Counting Principles: Further Probability Topics Section 8.2 Combinations.
Math Duels Competition of Scholars. Rules  The class must be split into 2 groups.  Each group must select a team captain and they must do Rock-Paper-Scissors.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 6 Counting and Probability Instructor: Hayk Melikyan Today we will review sections 6.4,
Counting Techniques 0.4.
3.1Set Notation Venn Diagrams Venn Diagram is used to illustrate the idea of sets and subsets. Example 1 X  U(b) A  B X U B A U.
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Permutations and Combinations
Chapter 3 Permutations and combinations
2 Permutations and Combinations Lesson 8 HAND OUT REFERENCE SHEET AND GO OVER IT.
Permutation and Combination
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Prob/Stats Definition A permutation is an ordered arrangement of objects. (For example, consider the permutations of the letters A, B, C and D.)
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.
CSNB143 – Discrete Structure
The Pigeonhole Principle. The pigeonhole principle Suppose a flock of pigeons fly into a set of pigeonholes to roost If there are more pigeons than pigeonholes,
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.
Discrete Mathematics Lecture # 25 Permutation & Combination.
Counting Principles Multiplication rule Permutations 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.
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.
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.
Introduction to probability (2) Combinations التوافيق Definition of combination: It is a way of selecting items from a collection, such that the order.
Operations on Sets Union of Sets Intersection of Sets
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Section 6.3. Section Summary Permutations Combinations.
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.
Example A standard deck of 52 cards has 13 kinds of cards, with four cards of each of kind, one in each of the four suits, hearts, diamonds, spades, and.
The Multiplication Rule
Chapter 10 Counting Methods.
4-1 Chapter 4 Counting Techniques.
Warm Up Which of the following are combinations?
Permutations and Combinations
MATH 2311 Section 2.1.
Permutations and Combinations
Permutations and Combinations
4-1 Chapter 4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
Part 1 Module 5 Factorials, Permutations, and Combinations
8.3 Counting Apply the fundamental counting principle
Chapter 7 Logic, Sets, and Counting
Warm Up Which of the following are combinations?
Counting techniques Basic Counting Principles, Pigeonhole Principle, Permutations and Combinations.
MATH 2311 Section 2.1.
4-1 Chapter 4 Counting Techniques.
Using Permutations and Combinations
9.6 Counting Theory Example If there are 3 roads from Albany to Baker
Exercise Evaluate 3! 6.
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.
Chapter 11: Further Topics in Algebra
10.3 – Using Permutations and Combinations
MATH 2311 Section 2.1.
Presentation transcript:

Permutations and Combinations

Permutations Definition –An ordered arrangement of objects is called a permutation. –Hence, a permutation of n distinct elements is an ordering of these n elements. Notation –P(n,r) or n P r.:The number of permutations of r distinct objects chosen from n distinct objects. P(n,r) =n!/(n-r)! –P(n,n)= n! – Example –Ordering of last four digits of a telephone number if digits are allowed to repeat = –Ordering of four digits if repetition is not allowed = = 5040 = 10!/6!

Permutations: Example 1. Ten athletes compete in an Olympic event. Gold, silver and bronze medals are awarded to the first three in the event, respectively. How many ways can the awards be presented? Answer: 3 objects from a pool of 10 = P(10,3) =10!/7!= How many ways can six people be seated on six chairs? Answer: P(6,6) = 6! = 720

Permutations: Mathematical Definition Hence, mathematically, for r  n, an r-permutation from n objects is defined by –P(n,r) = n*(n-1)*(n-2)*…..*(n-r+1) =  P(n,r) = for 0  r  n where n! = n*(n-1)*(n-2)*….*3*2*1 and by definition 0! = 1 Hence, P(10,4) = 10! / (10-4)! = 10!/6! = 5040

Permutations: Some special cases P(n,0) = n! / n! = 1 –This means that there is only one ordered arrangement of 0 objects, called the empty set. P(n,1) = n!/ (n-1)! = n –There are n ordered arrangements of one object (i.e. n ways of selecting one object from n objects). P(n,n) = n!/(n-n)! = n!/0! = n! –This means that one can arrange n distinct objects in n! ways, that is nothing but the multiplication principle.

Permutations: Practice What is the number of permutations of 3 objects, say, a, b, and c? –(Hint: P(3,3)=?) A.27 B.6 C.18 D.3 E.others

How many three letters (not necessary meaningful) can be formed from the word “compiler” if no letters can be repeated? –(Hint: P(8,3)=?) A.8! B.3! C.5! D.8!/3! E.8!/5!

In how many ways can a president and vice-president be selected from a group of 20 candidates? A.20! B.20 x 20 C.20 x 19 D.2! E.others

A Hard Problem The professor’s dilemma: how to arrange four books on OS, seven on programming, and three on data structures on a shelf such that books on the same subject must be together? –Solution: check subtasks first –Subtask 1: arranging three subject 3! outcomes –Subtask 2: arranging OS books 4! outcomes –… –Total: 3! x 4! x 7! x 3! = 4,354,560

Combinations When order in permutations becomes immaterial, i.e. we are just interested in selecting r objects from n distinct objects, we talk of combinations denoted by C(n,r) or n C r For each combination, there are r! ways of ordering those r chosen objects Hence, from multiplication principle, C(n,r)* r! = P(n,r)  –Note: C(n,r) is much smaller than P(n,r)

Combinations: Example How many 5-card poker hands can be dealt from a 52-card desk? –Question: Is this a permutation problem or combination problem? Does the order of cards matter? –C(52,5) = P(52,5)/5! = 52!/(5!x47!) =52x51x50x49x48/5!=2,598,960

Combinations: Special Cases C(n,0) = 1 –Only one way to choose 0 objects from n objects- chose the empty set C(n,1) = n –Obvious, since n ways to choose one object from n objects C(n,n) = 1 –Only one way to choose n objects from n objects

Exercises Ten athletes compete in an Olympic event. Three will be declared as winners. In how many ways can the winner be chosen? –Is this problem differ from the previous ten- athletes problem? –Is yes, in which way it differs? In how many ways can a committee of 3 be chosen from a group of 12 people?

Combinations in conjunction with multiplication and addition principles In how many ways can a committee of 2 women and 3 men be selected from a pool of 5 women and 7 men? –C(5,2) x C(7,3) A set of four coins is selected from a box of five dimes and seven quarters. –Find the number of sets of four coins. C(12,4) –Find the number of sets in which two are dimes and two are quarters. C(5,2) x C(7,2) –Find the number of sets composed of all dimes or all quarters. C(5,4) + C(7,4) –Find the number of sets with three or more quarters. C(7,3) x C(5,1) + C(7,4)

Class Discussions How many ways can a committee of two be chosen from four men and three women and it must include at least one man. How many distinct permutations can be made from the characters in the word FLORIDA? How many distinct permutations can be made from the characters in the word MISSISSIPPI? Please read Table 4.2 in the seventh edition and Table 3.2 in the sixth edition.