Jessie Zhao Course page: 1.

Slides:



Advertisements
Similar presentations
Permutations and Combinations Rosen 4.3. Permutations A permutation of a set of distinct objects is an ordered arrangement these objects. An ordered arrangement.
Advertisements

Counting Chapter 6 With Question/Answer Animations.
Consider the possible arrangements of the letters a, b, and c. List the outcomes in the sample space. If the order is important, then each arrangement.
Permutations and Combinations
Introduction to Probability
Counting Techniques: Combinations
Multiplication Rule. A tree structure is a useful tool for keeping systematic track of all possibilities in situations in which events happen in order.
Quit Permutations Combinations Pascal’s triangle Binomial Theorem.
1 Counting Rules. 2 The probability of a specific event or outcome is a fraction. In the numerator we have the number of ways the specific event can occur.
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}:
1 Counting Rules. 2 The probability of a specific event or outcome is a fraction. In the numerator we have the number of ways the specific event can occur.
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.
1 More Counting Techniques Possibility trees Multiplication rule Permutations Combinations.
Chapter 5 Section 5 Permutations and Combinations.
1 Permutations and Combinations CS/APMA 202 Epp section 6.4 Aaron Bloomfield.
Permutations and Combinations
1 Permutations and Combinations CS/APMA 202 Rosen section 4.3 Aaron Bloomfield.
Permutations and Combinations
Elementary Counting Techniques & Combinatorics
Math 2 Honors - Santowski
1 Permutations and Combinations CS/APMA 202 Rosen section 4.3 Aaron Bloomfield.
P ERMUTATIONS AND C OMBINATIONS Homework: Permutation and Combinations WS.
Counting. Why counting  Determine the complexity of algorithms To sort n numbers, how many instructions are executed ?  Count the number of objects.
The Basics of Counting Section 6.1.
Permutations and Combinations
Topics to be covered: Produce all combinations and permutations of sets. Calculate the number of combinations and permutations of sets of m items taken.
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Permutations and Combinations
10.3 – Using Permutations and Combinations Permutation: The number of ways in which a subset of objects can be selected from a given set of objects, where.
Methods of Counting Outcomes BUSA 2100, Section 4.1.
Chapter 3 Permutations and combinations
Elementary Combinatorics Combinatorics  Deals with enumeration (counting) techniques and related algebra.  Basis of counting XSet |X|No. of elements.
2 Permutations and Combinations Lesson 8 HAND OUT REFERENCE SHEET AND GO OVER IT.
CSE 221: Algorithms and Data Structures Lecture #10 Counting: Easy as 1, 2, C(3,1) Steve Wolfman 2009W1 1.
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}:
Counting CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Main Menu Main Menu (Click on the topics below) Permutation Example 1 Example 2 Circular Permutation Permuting r of n objects Example 1 Example 2 Example.
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,
Menu Traditional Menu Other Menu Nasi LemakBeef Burger Roti Canai Potatoes Chip Capati French Bread Mee Goreng Drink : Coffee, Tea, Coke and Pepsi.
Counting Techniques Tree Diagram Multiplication Rule Permutations Combinations.
WARM-UP By yourselves, make a list of 4 things that you would bring on a desert island. Imagine that you could only bring 3 of the 4 things on your list.
1 Section 5.3 Permutations and Combinations Permutations (order counts) A permutation of a set is an arrangement of the objects from a set. There are n!
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.
1 Strings and Languages Lecture 2-3 Ref. Handout p12-17.
Week 9 - Friday.  What did we talk about last time?  Partial orders  Total orders  Basic probability  Event  Sample space  Monty Hall  Multiplication.
BUSINESS MATHEMATICS & STATISTICS. Module 7 Factorials Permutations and Combinations ( Lecture 34) Elementary Probability ( Lectures 35-36) Chi-Square.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Permutations. Permutation: The number of ways in which a subset of objects can be selected from a given set of objects, where order is important. Given.
Section 6.3. Section Summary Permutations Combinations.
Permutations and Combinations. Permutations Definition –An ordered arrangement of objects is called a permutation. –Hence, a permutation of n distinct.
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
Permutations and Combinations
CSE15 Discrete Mathematics 04/19/17
Permutations and Combinations
Counting, Permutations, & Combinations
Permutations.
Pascal's Triangle This is the start of Pascal's triangle. It follows a pattern, do you know.
Binomial Expansion 2 L.O. All pupils can follow where the binomial expansion comes from All pupils understand binomial notation All pupils can use the.
Counting techniques Basic Counting Principles, Pigeonhole Principle, Permutations and Combinations.
Basic elements of triangle
QUANTITATIVE METHODS 1 SAMIR K. SRIVASTAVA.
Using Permutations and Combinations
Using Permutations and Combinations
10.3 – Using Permutations and Combinations
Properties of Real Numbers
Presentation transcript:

Jessie Zhao Course page: 1

 For any integer n>0, the number of permutations of a set with n elements is n! ◦ A permutation of a set of elements is an ordering of the elements. ◦ E.g. the set of elements {a, b, c} can be ordered in the following ways:  abc acb cba bac bca cab ◦ By the product rule, there are n(n-1)(n-2)..1=n! permutations 2

 Ex: Suppose there are 50 students in the class, ◦ In how many ways can the whole class stand in a line? 50! ◦ In how many ways can we select three students to stand in a line? 50*49*48 3

 An r-permutation is an ordering of r elements of a set of n elements, denoted by P(n,r) ◦ E.g. the 2-permutations of the set of elements {a, b, c} are:  ab ac ba bc ca cb ◦ By the product rule, there are n(n-1)(n-2)....(n-r+1) r-permutations 4

 P(n,r) = n!/(n-r)! = n(n-1)(n-2)....(n-r+1) for 0≤r≤n  Special cases: ◦ P(n,0) = 1 ◦ P(0,0) = 1 ◦ P(n,n) = n! 5

 Recall: How many one-to-one functions are there from a set with m elements to one with n elements? ◦ n(n-1)...(n-m+1) when m≤n ◦ 0 when m>n 6

 For the solitaire hand that show initially ◦ How many possible hands? p(52,7) ◦ How many possible hands with no Aces? p(48,7) ◦ How many possible hands with one or more Aces? P(52,7)-P(48,7) 7

 An r-combination is an unordered selection of r elements of a set of n elements, denoted by C(n,r)  E.g. the 2-combinations of the set of elements {a,b, c} are: ◦ {a,b} {a,c} {b,c} 8

 There are r! permutation of each subset  There are more r-permutation than r- combinations. 9

10 Corollary: C(n,r) = C(n,n-r)

 For a deck of 52 cards,  How many poker hands of five cards can there be? C(52,5)=2,598,960  How many ways are there to select 47 cards? C(52,47)=C(52,5)=2,598,960 11