Counting Techniques: Permutations of Selected Elements Addition Rule, Difference Rule, Inclusion/Exclusion Rule.

Slides:



Advertisements
Similar presentations
Mathematical Preliminaries
Advertisements

Fundamentals of Probability
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
Frigid Fridays On each Friday last January, the temperature was a record low temperature for the date. On Friday, January 30, the mercury dropped to 5°F,
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
Year 6 mental test 5 second questions
Around the World AdditionSubtraction MultiplicationDivision AdditionSubtraction MultiplicationDivision.
5.1 Probability of Simple Events
4-1 Chapter 4 Counting Techniques.
Learning Objectives for Section 7.2 Sets
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.
9.5 Counting Subsets of a Set: Combinations
Counting. Counting in Algorithms How many comparisons are needed to sort n numbers? How many steps to compute the GCD of two numbers ? How many steps.
Business and Economics 6th Edition
Basic Permutations and Combinations
Chris Morgan, MATH G160 January 8, 2012 Lecture 13
5.3 Permutations and Combinations
Applications of Inclusion-Exclusion: Selected Exercises.
Lecture 4 4.1,4.2 Counting. 4.1 Counting Two Important Principles: Product Rule and Sum Rule. Product Rule: Assume we need to perform procedure 1 AND.
Counting. Counting = Determining the number of elements of a finite set.
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
Sets Sets © 2005 Richard A. Medeiros next Patterns.
LO: Count up to 100 objects by grouping them and counting in 5s 10s and 2s. Mrs Criddle: Westfield Middle School.
Addition 1’s to 20.
25 seconds left…...
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
PSSA Preparation.
The Pigeonhole Principle Alan Kaylor Cline. The Pigeonhole Principle Statement Children’s Version: “If k > n, you can’t stuff k pigeons in n holes without.
Commonly Used Distributions
Chapter 5 Relations and Functions
Equivalence Relations
Discrete Structures Chapter 6: Set Theory
12 April 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Inclusion-Exclusion Rosen 6.5 & 6.6
1 Counting Techniques: Possibility Trees, Multiplication Rule, Permutations.
Main Menu Main Menu (Click on the topics below) Combinations Example Theorem Click on the picture.
COUNTING AND PROBABILITY
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.
Combinations We should use permutation where order matters
Discrete Mathematics Lecture 5
Discrete Mathematics Lecture 6 Alexander Bukharovich New York University.
The Inclusion/Exclusion Rule for Two or Three Sets
1 More Counting Techniques Possibility trees Multiplication rule Permutations Combinations.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Counting. Techniques for counting Rule 1 Suppose we carry out have a sets A 1, A 2, A 3, … and that any pair are mutually exclusive (i.e. A 1  A 2 =
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.
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.
Methods of Counting Outcomes BUSA 2100, Section 4.1.
3. Counting Permutations Combinations Pigeonhole principle Elements of Probability Recurrence Relations.
1 Lecture 4 (part 1) Combinatorics Reading: Epp Chp 6.
Chapter 6, Counting and Probability
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.
Counting Principles Multiplication rule Permutations Combinations.
Some other set notation We will use the notation to mean that e is an element of A. We will use the notation to mean that e is not an element of A.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
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.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
The Relation Induced by a Partition
Principle of Inclusion and Exclusion
MAT 2720 Discrete Mathematics
9. Counting and Probability 1 Summary
CS100: Discrete structures
COUNTING AND PROBABILITY
COUNTING AND PROBABILITY
Counting Elements of Disjoint Sets: The Addition Rule
Presentation transcript:

Counting Techniques: Permutations of Selected Elements Addition Rule, Difference Rule, Inclusion/Exclusion Rule

Permutations of Selected Elements Typical situation: A chairman, a secretary and a treasurer are to be chosen in a committee of 7 people. Question: In how many different ways can it be done? Definition: An r-permutation of a set S of n elements is an ordered selection of r elements taken from S. The number of all r-permutations of a set of n elements is denoted P(n,r) . In the example above we want to find P(7,3).

How to compute P(n,r) Theorem: P(n,r) = n(n-1)(n-2)…(n-r+1) or, equivalently, Proof: Forming an r-permutation of a set of n-elements is an r-step operation:  Step 1: Choose the 1st element ( n different ways).  Step 2: Choose the 2nd element ( n-1 different ways). …  Step r: Choose the rth element (n-r+1 different ways). Based on the multiplication rule, the number of r-permutations is n∙(n-1)∙…∙(n-r+1) .

Examples of r-permutations 1. Choosing a chairman, a secretary and a treasurer among 7 people: P(7,3) = 7∙6∙5 = 210 . 2. Suppose Jim is already chosen to be the secretary. Q: How many ways a chairman and a treasurer can be chosen? A: P(6,2) = 6∙5 = 30 . 3. In an instance of the Traveling Salesman Problem, the total number of cities = 10; this time the salesman is supposed to visit only 4 cities (including the home city). Q: How many different tours are possible? A: P(9,3) = 9∙8∙7 = 504 .

The Addition Rule Suppose a finite set A equals the union of k distinct mutually disjoint subsets A1, A2, …, Ak . Then n(A) = n(A1) + n(A2) + … + n(Ak) Example: How many integers from 1 through 999 do not have any repeated digits? Solution: Let A = integers from 1 to 999 not having repeated digits. Partition A into 3 sets: A1=one-digit integers not having repeated digits; A2=two-digit integers not having repeated digits; A3=three-digit integers not having repeated digits. Then n(A)=n(A1)+n(A2)+n(A3) (by the addition rule) = 9 + 9∙9 +9∙9∙8 = 738. (by the multipl. rule)

The Difference Rule If A is a finite set and B is a subset of A, then n(A-B) = n(A) – n(B) . Example: Assume that any seven digits can be used to form a telephone number. Q: How many seven-digit phone numbers have at least one repeated digit? Let A = the set of all possible 7-digit phone numbers; B = the set of 7-digit numbers without repetition. Note that BA . Then A-B is the set of 7-digit numbers with repetition. n(A-B) = n(A) – n(B) (by the difference rule) = 107 – P(10,7) (by the multiplication rule) = 107 – 10! / 3! = 10,000,000 – 3,628,800/6 = = 10,000,000 – 604,800 = 9,395,200

The Inclusion/Exclusion Rule for Two or Three Sets If A, B and C are finite sets then  n(A  B) = n(A) + n(B) – n(A  B)  n(A  B  C) = n(A) + n(B) + n(C) - n(A  B) – n(A  C) – n(B  C) + n(A  B  C) A B A B C

Example on Inclusion/Exclusion Rule (2 sets) Question: How many integers from 1 through 100 are multiples of 4 or multiples of 6 ? Solution: Let A=the set of integers from 1 through 100 which are multiples of 4; B = the set of integers from 1 through 100 which are multiples of 6. Then we want to find n(A  B). First note that A  B is the set of integers from 1 through 100 which are multiples of 12 . n(A  B) = n(A) + n(B) - n(A  B) (by incl./excl. rule) = 25 + 16 – 8 = 33 (by counting the elements of the three lists)

Example on Inclusion/Exclusion Rule (3 sets) 3 headache drugs – A,B, and C – were tested on 40 subjects. The results of tests: 23 reported relief from drug A; 18 reported relief from drug B; 31 reported relief from drug C; 11 reported relief from both drugs A and B; 19 reported relief from both drugs A and C; 14 reported relief from both drugs B and C; 37 reported relief from at least one of the drugs. Questions: 1) How many people got relief from none of the drugs? 2) How many people got relief from all 3 drugs? 3) How many people got relief from A only?

Example on Inclusion/Exclusion Rule (3 sets) We are given: n(A)=23, n(B)=18, n(C)=31, n(A  B)=11, n(A  C)=19, n(B  C)=14 , n(S)=40, n(A  B  C)=37 Q1) How many people got relief from none of the drugs? By difference rule, n((A  B  C)c ) = n(S) – n(A  B  C) = 40 - 37 = 3 S A B C

Example on Inclusion/Exclusion Rule (3 sets) Q2) How many people got relief from all 3 drugs? By inclusion/exclusion rule: n(A  B  C) = n(A  B  C) - n(A) - n(B) - n(C) + n(A  B) + n(A  C) + n(B  C) = 37 – 23 – 18 – 31 + 11 + 19 + 14 = 9 Q3) How many people got relief from A only? n(A – (B  C)) (by inclusion/exclusion rule) = n(A) – n(A  B) - n(A  C) + n(A  B  C) = 23 – 11 – 19 + 9 = 2