Copyright © Peter Cappello 2011 Simple Arrangements & Selections.

Slides:



Advertisements
Similar presentations
9.5 Counting Subsets of a Set: Combinations
Advertisements

Basic Permutations and Combinations
Permutations and Combinations Rosen 4.3. Permutations A permutation of a set of distinct objects is an ordered arrangement these objects. An ordered arrangement.
Counting Chapter 6 With Question/Answer Animations.
Fall 2002CMSC Discrete Structures1 Permutations How many ways are there to pick a set of 3 people from a group of 6? There are 6 choices for the.
Counting Techniques: 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,
Multiplication Rule. A tree structure is a useful tool for keeping systematic track of all possibilities in situations in which events happen in order.
Discrete Structures Chapter 4 Counting and Probability Nurul Amelina Nasharuddin Multimedia Department.
CSE115/ENGR160 Discrete Mathematics 04/17/12
Permutations r-permutation (AKA “ordered r-selection”) An ordered arrangement of r elements of a set of n distinct elements. permutation of a set of n.
Lecture 5 Counting 4.3, Permutations r-permutation: An ordered arrangement of r elements of a set of n distinct elements. Example: S={1,2,3}:
CSE 321 Discrete Structures Winter 2008 Lecture 16 Counting.
Counting II: Pascal, Binomials, and Other Tricks Great Theoretical Ideas In Computer Science A. Gupta D. Sleator CS Fall 2010 Lecture 8Sept. 16,
Discrete Mathematics Lecture 6 Alexander Bukharovich New York University.
1 More Counting Techniques Possibility trees Multiplication rule Permutations Combinations.
Recursive Definitions Rosen, 3.4 Recursive (or inductive) Definitions Sometimes easier to define an object in terms of itself. This process is called.
The Basics of Counting: Selected Exercises. Copyright © Peter Cappello2 Sum Rule Example There are 3 sizes of pink shirts & 7 sizes of blue shirts. How.
Section 4.3: Permutations and Combinations Def: A permutation of a set of distinct objects is an ordered arrangement of these objects. Ex: {a, b, c, d}
Combinatorics 3/15 and 3/ Counting A restaurant offers the following menu: Main CourseVegetablesBeverage BeefPotatoesMilk HamGreen BeansCoffee.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
1 Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
Counting. Why counting  Determine the complexity of algorithms To sort n numbers, how many instructions are executed ?  Count the number of objects.
Basic Counting Lecture 12: Oct 28. This Lecture We will study some basic rules for counting. Sum rule, product rule, generalized product rule Permutations,
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 6 Counting and Probability Instructor: Hayk Melikyan Today we will review sections 6.4,
Basic Counting. This Lecture We will study some basic rules for counting. Sum rule, product rule, generalized product rule Permutations, combinations.
Generalized Permutations and Combinations
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Permutations and Combinations
Slide 7- 1 Copyright © 2006 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
Chapter 3 Permutations and combinations
March 10, 2015Applied Discrete Mathematics Week 6: Counting 1 Permutations and Combinations How many different sets of 3 people can we pick from a group.
Inclusion-Exclusion Selected Exercises Powerpoint Presentation taken from Peter Cappello’s webpage
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Permutations and Combinations
Unit 7 Permutation and Combination IT Disicipline ITD1111 Discrete Mathematics & Statistics STDTLP 1 Unit 7 Permutation and Combination.
Lecture 5 Counting 4.3, Permutations r-permutation: An ordered arrangement of r elements of a set of n distinct elements. Example: S={1,2,3}:
Simple Arrangements & Selections. Combinations & Permutations A permutation of n distinct objects is an arrangement, or ordering, of the n objects. An.
Counting Methods Topic 4: Permutations with Restrictions.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Spatial Statistics and Spatial Knowledge Discovery First law of geography [Tobler]: Everything is related to everything, but nearby things are more related.
The Product Rule: Use & Misuse. Copyright © Peter Cappello The Product Rule If a procedure has 1.A 1 st stage with s 1 outcomes 2.A 2 nd stage with.
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 Multiplication rule Permutations Combinations.
Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
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.
2/24/20161 One, two, three, we’re… Counting. 2/24/20162 Basic Counting Principles Counting problems are of the following kind: “How many different 8-letter.
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.
Permutations & Combinations: Selected Exercises. Copyright © Peter Cappello2 Preliminaries Denote the # of arrangements of some k elements of a set of.
Copyright © Cengage Learning. All rights reserved. Probability and Statistics.
Fall 2002CMSC Discrete Structures1 Combinations An r-combination of elements of a set is an unordered selection of r elements from the set. Thus,
Section 6.3. Section Summary Permutations Combinations.
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
4-1 Chapter 4 Counting Techniques.
MATH 2311 Section 2.1.
CSE15 Discrete Mathematics 04/19/17
COCS DISCRETE STRUCTURES
Generalized Permutations & Combinations: Selected Exercises
Permutations and Combinations
4-1 Chapter 4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
8.3 Counting Apply the fundamental counting principle
Permutations and Combinations
Basic Counting.
Basic Counting Lecture 9: Nov 5, 6.
Permutations and Combinations
4-1 Chapter 4 Counting Techniques.
Applied Combinatorics, 4th Ed. Alan Tucker
Presentation transcript:

Copyright © Peter Cappello 2011 Simple Arrangements & Selections

Copyright © Peter Cappello 2011 Combinations & Permutations A permutation of n distinct objects is an arrangement, or ordering, of the n objects. An r-permutation of n distinct objects is an arrangement using r of the n objects. An r-combination of n objects is an unordered selection, or subset, of r of the n objects.

Copyright © Peter Cappello 2011 Notation P(n, r) denotes the number of r-permutations of n distinct objects. C(n, r) denotes the number of r-combinations of n distinct objects. It is spoken “n choose r”. The C(n, r) are known as “binomial coefficients” (for reasons that will become clear later).

Copyright © Peter Cappello 2011 Formula for P(n, r) By the product rule, P(n, 1) = n; P(n, 2) = n(n - 1); P(n, 3) = n(n - 1)(n - 2); … P(n, n) = n! n choices for the 1st position (n - 1) choices for the 2nd position, …, 1 choice for the n th position. P(n, r) = n(n - 1)... n - (r - 1) ) = n(n - 1)... (n - (r - 1)) (n - r)!/(n - r)! = n!/(n - r)!

Copyright © Peter Cappello 2011 Formula for C(n, r) All r-permutations can be counted by the product rule: 1. pick the r elements to be ordered: C(n, r) 2. Order the r elements: P(r, r) = r! That is, P(n, r) = C(n, r) P(r, r) = n!/(n - r)! Thus, C(n, r) = n!/(r!(n - r)!)

Copyright © Peter Cappello 2011 C(n, r) = C(n, n - r). Give a counting argument for this.

Copyright © Peter Cappello 2011 Example How many ways can 7 women & 3 men be arranged in a row, if the 3 men must be adjacent?

Copyright © Peter Cappello 2011 How many ways can 7 women & 3 men be arranged in a row, if the 3 men must be adjacent? Treat the men as a block. 1.There are P(8, 8) ways to arrange the 7 women + 1 block. 2.There are P(3, 3) ways to arrange the men. By the product rule, there are 8!3! ways.

Copyright © Peter Cappello 2011 Example How many ways are there to arrange the alphabet so that there are exactly 5 letters between a & b?

Copyright © Peter Cappello 2011 How many ways are there to arrange the alphabet so that there are exactly 5 letters between a & b? 1.Pick the position of the left letter of a & b: C(20, 1) (This forces the position of the other letter.) 2.Pick the order of a & b: P(2, 2) 3.Arrange the other letters: P(24, 24). By the product rule: C(20, 1)P(2, 2)P(24, 24)

Copyright © Peter Cappello 2011 Example How many 6-digit numbers without repetition are there so that the digits are nonzero, and 1 & 2 do not appear consecutively?

Copyright © Peter Cappello 2011 How many 6-digit numbers without repetition are there so that the digits are nonzero, and 1 & 2 do not appear consecutively? It is simpler to do this indirectly: There are P(9, 6) ways to arrange 6 nonzero digits without repetition. Subtract the number of ways to arrange the digits so that 1 & 2 are consecutive:

Copyright © Peter Cappello There are C(5, 1) ways to pick the leftmost position where the 1 or 2 go. 2.There are P(2, 2) ways to order 1 & 2. 3.There are P(9 - 2, 4) ways to order the other 4 digits. The number of ways to do this thus is: P(9, 6) - C(5, 1)P(2, 2)P(7, 4).

Copyright © Peter Cappello 2011 Example How many ways are there to arrange the letters in the word MISSISSIPPI?

Copyright © Peter Cappello 2011 How many ways are there to arrange the letters in the word MISSISSIPPI? Since the letters are not distinct, the answer is less than P(11,11) = 11! 1.Pick the 1 position where the M goes: C(11,1) 2.Pick the 4 positions where the Is go: C(10,4) 3.Pick the 4 positions where the Ss go: C(6,4) 4.Pick the 2 positions where the Ps go: C(2,2) There are C(11,1) C(10,4) C(6,4) C(2,2) ways.

Copyright © Peter Cappello 2011 Example How many committees of 4 people can be chosen from a set of 7 women and 4 men such that there are at least 2 women?

Copyright © Peter Cappello 2011 There are at least 2 women? If we 1.pick 2 women 2.pick 2 more people without restriction, we get: C(7, 2)C(9,2). This is wrong; some committees are counted more than once. Use a tree diagram to identify this product rule misuse.

Copyright © Peter Cappello 2011 The Set Composition Rule When using the product rule, each component must be selected in a distinct stage. In the incorrect counting process, we cannot tell which women were picked in stage 1, & which were picked in stage 2.

Copyright © Peter Cappello 2011 To fix this: Use the addition rule Partition the set of committees into: those with 2 women: C(7, 2)C(4, 2) those with 3 women: C(7, 3)C(4, 1) those with 4 women: C(7, 4)C(4, 0) There thus are C(7, 2)C(4, 2) + C(7, 3)C(4, 1) + C(7, 4)C(4, 0) such committees.

Copyright © Peter Cappello 2011 Example How many ways are there to arrange As & Us such that the 3rd U appears as the 12th letter in a 15 letter sequence?

Copyright © Peter Cappello 2011 Example Solution How many ways are there to arrange As & Us such that the 3rd U appears as the 12th letter in a 15 letter sequence? In the 1st 11 letters, U appears exactly 2 times.

Copyright © Peter Cappello 2011 Use the product rule: 1.Pick the positions of the 1st 2 Us: C(11, 2) 2. Put As in the 9 open positions: 1 3. Put the 3 rd U in position 12: 1 4. Pick the 3 letters that follow the 12th: 2 3.