Review of 5.1, 5.3 and new Section 5.5: Generalized Permutations and Combinations.

Slides:



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

Generalized Permutations & Combinations: Selected Exercises.
Counting. Counting = Determining the number of elements of a finite set.
Exam 1 Review
Counting Chapter 6 With Question/Answer Animations.
Recursively Defined Functions
College of Information Technology & Design
THE BASIC OF COUNTING Discrete mathematics KNURE, Software department, Ph , N.V. Bilous.
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.
Counting Tools ● Enumeration ● Multiplication ● Addition ● Negation.
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.
CSE 321 Discrete Structures Winter 2008 Lecture 16 Counting.
Combinations We should use permutation where order matters
More Counting Lecture 16: Nov 9 A B …… f. Counting Rule: Bijection If f is a bijection from A to B, then |A| = |B| A B …… f.
Discrete Mathematics Lecture 6 Alexander Bukharovich New York University.
Counting Elements in a List How many integers in the list from 1 to 10? How many integers in the list from m to n? (assuming m
4.4.2 Combinations of multisets
MATH104 Ch. 11: Probability Theory
Chapter 1 Fundamental principles of counting 陳彥良 中央大學資管系.
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.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Combinatorics.
Exam 1 Review 5.1, , 8.1, 8.2.
Combinatorics 3/15 and 3/ Counting A restaurant offers the following menu: Main CourseVegetablesBeverage BeefPotatoesMilk HamGreen BeansCoffee.
C OUNTING M ETHOD. T HE A DDITION P RINCIPLE I NCLUSION -E XCLUSION P RINCIPLE.
More Counting Lecture 13 A B …… f. Counting Rule: Bijection If f is a bijection from A to B, then |A| = |B| A B …… f.
MATH104 Ch. 11: Probability Theory. Permutation Examples 1. If there are 4 people in the math club (Anne, Bob, Cindy, Dave), and we wish to elect a president.
Counting. Product Rule Example Sum Rule Pigeonhole principle If there are more pigeons than pigeonholes, then there must be at least one pigeonhole.
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.
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
Generalized Permutations and Combinations
Counting Techniques 0.4.
9.3 Addition Rule. The basic rule underlying the calculation of the number of elements in a union or difference or intersection is the addition rule.
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
Methods of Counting Outcomes BUSA 2100, Section 4.1.
Counting Techniques. Multiplication Rule of Counting If a task consists of a sequence of choices in which there are p selections for the first choice,
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.
Ch. 5: Counting. 5.1: The Basics of Counting Intro Example #1: If we have a class of 6 math majors and 7 CS majors (with no double majors) – A) In how.
Chapter 6, Counting and Probability
Counting Methods Review General Guidelines. Fundamental Counting Principle Each category outcome is independent of any other category outcome OR Items.
1 Binomial Coefficients CS 202 Epp, section ??? Aaron Bloomfield.
Counting CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Permutations and Combinations Section 2.2 & 2.3 Finite Math.
Counting.
Counting II: Recurring Problems And Correspondences Great Theoretical Ideas In Computer Science V. AdamchikCS Spring 2006 Lecture 6Feb 2, 2005Carnegie.
5.5 Generalized Permutations and Combinations
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.
MATH260 Ch. 5: Probability Theory part 4 Counting: Multiplication, Permutations, Combinations.
Copyright © Peter Cappello 2011 Simple Arrangements & Selections.
Section Basic Counting Principles: The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n 1.
L14: Permutations, Combinations and Some Review EECS 203: Discrete Mathematics.
1 DISCRETE STRUCTURES DISCRETE STRUCTURES SSK3003 DR. ALI MAMAT 1.
Section The Product Rule  Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters.
Counting Overview ICS 6D Sandy Irani. Balls into Bins Distinguishable Balls Indistinguishable Balls No restrictions on the number of balls per bin At.
Section 6.3. Section Summary Permutations Combinations.
Discrete Mathematics Counting.
L14: Permutations, Combinations and Some Review
CSE15 Discrete Mathematics 04/19/17
Generalized Permutations and Combinations
Generalized Permutations & Combinations: Selected Exercises
Permutations and Combinations
CS100: Discrete structures
104- Ch. 11 part 1; 260- Ch. 5 pt. 2 master_prob_pc.pptx
COUNTING AND PROBABILITY
Basic Counting Lecture 9: Nov 5, 6.
Presentation transcript:

Review of 5.1, 5.3 and new Section 5.5: Generalized Permutations and Combinations

Review of 5.1 SUM rule Product rule Inclusion/Exclusion Complement

Review of 5.3 Order matters, repetition allowed – Multiplication Rule – Ex: Social Security numbers 10 9 Order matters, repetition NOT allowed – Permutations: P(n,r)= – Ex: number of ways to pick 1 st, 2 nd, 3 rd from 30P(30,3)=30*29*28=24,360 Order DOESN’T matter, repetition allowed – section 5.5: Combinations with Repetition:C(n+r-1,r)= – Ex: number of ways to pick several types of donuts, with more than 1 of each kind (order doesn’t matter) Order DOESN’T matter, repetition NOT allowed – Combinations: C(n,r)= – Ex: number of ways to pick a committee of 3 from 30C(30,3)=4060 Permutations of sets with indistinguishable objects – section 5.5: – Ex: number of ways to rearrange the letters in MISSISSIPPI (order matters)

5.3 review problems #1) If 4 people out of 35 are selected to win a $10 gift certificate, how many ways could they be chosen? #2) How many subsets of {a,b,c,d} exist? #3) 15 women and 7 men show up for jury duty. How many ways could you pick 8 women and 4 men?

More 5.3 examples #4) How many bit strings of length 10 have: Exactly three 0’s The same number of 0s and 1s At least seven 1s At least two 1s

More 5.3 Examples #5: If you make passwords out of either digits or letters, how many 8 character passwords exist? With no digits With one digit With at least one digit With two digits With at least 2 digits?

New Material– Section 5.5: Ex. 1(example 3 in the book: p.372) How many ways are there to select 5 bills from a money bag containing $1, $2, $5, $10, $20, $50, and $100 bills? Assume order does not matter and bills of each denomination are indistinguishable.

A few examples- two $10s, two $5s, one $1 $100$50$20$10$5$2$1 xx x

$100$50$20$10$5$2$1 xxxxx

$100$50$20$10$5$2$1

$100$50$20$10$5$2$1

$100$50$20$10$5$2$1

$100$50$20$10$5$2$1

$100$50$20$10$5$2$1

solution $100$50$20$10$5$2$1

Ex. #2: Cookies- suppose a shop has 5 types of cookies. How many different way can we pick 7 cookies? ChocolateChoc chipPbSugaroat

more examples on #2, solution ChocChoc chipPbSugaroat

Ex #3: How many solutions does the equation x 1 +x 2 +x 3 +x 4 = 20 have where x 1, x 2, x 3, x 4 are nonnegative integers?

Solution

Review: Permutations of sets with indistinguishable objects Ex. 4: How many ways can we rearrange the letters: BOB CLASSES ARKANSAS

More examples How many ways could a radio announcer decide the order that 6 (identical) Republican ads, 5 Democrats ads, and 4 Independent ads will play?

Ex #5: Donuts Ex 5: A croissant shop has plain, cherry, chocolate, almond, apple, and broccoli croissants (6 types). How many ways are there to choose: a) a dozen croissants b) 3 dozen croissants c) 2 dozen, with at least 2 of each kind? d) 2 dozen, with no more than 2 broccoli? e) 2 dozen, with at least 5 chocolate and at least 3 almond? f) 2 dozen, with at least 1 plain, at least 2 cherry, at least 3 chocolate, at least 1 almond, at least 2 apple, and no more than 3 broccoli?

a) A dozen croissants PlainCherryChocAlmondAppleBroccoli

b) 3 dozen croissants PlainCherryChocAlmondAppleBroccoli

C) 2 dozen, with at least 2 of each kind? PlainCherryChocAlmondAppleBrocolli

d) 2 dozen, with no more than 2 broccoli? PlainCherryChocAlmondAppleBroccoli

e) 2 dozen, with at least 5 chocolate and at least 3 almond? PlainCherryChocAlmondAppleBroccoli

f) 2 dozen, with at least 1 plain, at least 2 cherry, at least 3 chocolate, at least 1 almond, at least 2 apple, and no more than 3 broccoli? PlainCherryChocAlmondAppleBroccoli