C OUNTING M ETHOD. T HE A DDITION P RINCIPLE I NCLUSION -E XCLUSION P RINCIPLE.

Slides:



Advertisements
Similar presentations
5.3 Permutations and Combinations
Advertisements

Counting. Counting = Determining the number of elements of a finite set.
Cook’s Theorem The Foundation of NP-Completeness.
Counting Basics: Be careful of the boundary conditions Try to come up with a general rule.
Counting Chapter 6 With Question/Answer Animations.
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.
Math 221 Integrated Learning System Week 2, Lecture 1
Math 106 – Exam #3 - Review Problems 1. (a) (b) (c) (d) A room contains 90 men where 25 are wearing a hat, 34 are wearing a coat, 33 are wearing a pair.
The Division Rule Theorem: Suppose a set A has n elements and is partitioned by the collection {A 1, A 2,..., A p }, where each partition set has m elements.
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,
Discrete Mathematics Lecture 7 More Probability and Counting Harper Langston New York University.
CSE 321 Discrete Structures Winter 2008 Lecture 16 Counting.
Discrete Mathematics Lecture 5
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
HW2 assignment. 1.A fair coin is tossed 5 times. Find a probability of obtaining (a) exactly 3 heads; (b) at most 3 heads Solution: Binomial distribution.
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
Chapter 1 Fundamental principles of counting 陳彥良 中央大學資管系.
Combinatorics 3/15 and 3/ Counting A restaurant offers the following menu: Main CourseVegetablesBeverage BeefPotatoesMilk HamGreen BeansCoffee.
Review of 5.1, 5.3 and new Section 5.5: Generalized Permutations and Combinations.
P ERMUTATIONS AND C OMBINATIONS Homework: Permutation and Combinations WS.
SAT Prep Course - Math Ms. D’Agostino. How it works 3 hours and 45 minutes 44 Multiple Choice 10 Short Answer Questions.
Counting. Product Rule Example Sum Rule Pigeonhole principle If there are more pigeons than pigeonholes, then there must be at least one pigeonhole.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 6 Counting and Probability Instructor: Hayk Melikyan Today we will review sections 6.4,
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
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.
Chapter 3 Permutations and combinations
Advanced Precalculus Advanced Precalculus Notes 12.2 Permutations and Combinations.
Permutations, Combinations, and Counting Theory AII.12 The student will compute and distinguish between permutations and combinations and use technology.
October 13, 2009 Combinations and Permutations.
Chapter 6, Counting and Probability
Introduction to Probability. 5.1 Experiments, Outcomes, Events, and Sample Spaces Sample space - The set of all possible outcomes for an experiment Roll.
1 Chapter 1 Fundamental Principles of Counting Discrete and Combinatorial Mathematics R. P. Grimaldi, 5 th edition, 2004.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Sets and Counting6 Sets and Set Operations The Number of Elements in a Finite Set The.
Zero elements. One element.Two elements.Three elements. { a } { b } { c } { a, b } { b, c } { a, c } { a, b, c } 8 subsets.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Sets and Counting6 Sets and Set Operations The Number of Elements in a Finite Set The.
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,
Discrete Mathematics Lecture # 25 Permutation & Combination.
Menu Traditional Menu Other Menu Nasi LemakBeef Burger Roti Canai Potatoes Chip Capati French Bread Mee Goreng Drink : Coffee, Tea, Coke and Pepsi.
Permutations, Combinations, and Counting Theory
Counting Principles Multiplication rule Permutations Combinations.
1 CS 140 Discrete Mathematics Combinatorics And Review Notes.
I CAN: Use Permutations and Combinations
Probability. 3.1 Events, Sample Spaces, and Probability Sample space - The set of all possible outcomes for an experiment Roll a die Flip a coin Measure.
Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
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.
Warm up A Ferris wheel holds 12 riders. If there are 20 people waiting in line, how many different ways can 12 people ride it? You may write your answer.
1 DISCRETE STRUCTURES DISCRETE STRUCTURES SSK3003 DR. ALI MAMAT 1.
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
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Copyright © Cengage Learning. All rights reserved. Probability and Statistics.
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 4.5.
Generating Permutations and Combinations “Traveling Salesman Problem” – A salesman must visit 6 cities; what’s the best order in which to visit them? Assume.
CS336 F07 Counting 2. Example Consider integers in the set {1, 2, 3, …, 1000}. How many are divisible by either 4 or 10?
Section 6.3. Section Summary Permutations Combinations.
Section 6.1 Set and Set Operations. Set: A set is a collection of objects/elements. Ex. A = {w, a, r, d} Sets are often named with capital letters. Order.
PROBABILITY AND STATISTICS WEEK 2 Onur Doğan. Introduction to Probability The Classical Interpretation of Probability The Frequency Interpretation of.
Warm up (TIPS) A Ferris wheel holds 12 riders. If there are 20 people waiting in line, how many different ways can 12 people ride it? You may write your.
Copyright © Cengage Learning. All rights reserved.
Permutations and Combinations
8.3 Counting Apply the fundamental counting principle
PROBABILITY AND STATISTICS
Chapter 11: Further Topics in Algebra
321 Section Feb. 21 Natalie Linnell.
{ a } { a, b } { a, b, c } { a, c } { b } 8 subsets. { b, c } { c }
Presentation transcript:

C OUNTING M ETHOD

T HE A DDITION P RINCIPLE

I NCLUSION -E XCLUSION P RINCIPLE

T HE M ULTIPLICATION P RINCIPLE

E X 1) A DDING G ROUPS OF S TUDENTS Dr. Abercrombie has 15 students in an abstract algebra class and 20 students in a linear algebra class. How many different students are in these two classes? Case1 : if there is no students in both classes Case2: if there are 3 students in both classes

E X 2) A city has two daily newspapers, A and B say. The following information was obtained from a survey of 100 city residents: 35 people subscribe to A, 60 subscribe to B, and 20 subscribe to both. 1. How many people subscribe to A but not to B? 2. How many subscribe to B but not to A ? 3. How many do not subscribe to either paper? 4. Draw a Venn diagram for the newspaper survey.

E X 3) The menu for a restaurant is listed as follows: How many different dinners consist of 1 appetizer, 1 main- course, and 1 beve- rage ?

E X 4) (1) How many strings of length 4 can be formed using the letters ABCDE if repetitions are not allowed? (2) How many strings of part(1) begin with letter B ? (3) How many strings of part(1) do not begin with letter B ?

E X 5) Let X be an n -element set. (1) How many subsets of X are formed? (2) How many ordered pairs of ( A, B ) satisfy ?

P ERMUTATIONS A permutation of a set of objects is an arrangement of the objects in a specific order without repetition. P ( n, r ) — a permutation of n objects taken r at a time without repitition

A combination of a set of n object taken r at a time without repetition is an r -element subset of the set of n objects. The arrangement of the elements in the subset does not matter. C ( n, r ) — a combination of n objects taken r at a time without repetition C OMBINATIONS

E X 6) F ROM A COMMITTEE OF 10 PEOPLE CONSISTING OF 6 WOMEN AND 4 MEN, (1) In how many ways can we choose a chairperson, a vice-chairperson, and a secretary, assuming that one person cannot hold more than one position? (2) In how many ways can we choose a subcommittee of 3 people? In a permutation, order is vital. In a combination, order is irrelevant.

E X 6) F ROM A COMMITTEE OF 10 PEOPLE CONSISTING OF 6 WOMEN AND 4 MEN, (3) In how many ways can we choose a subcommittee consisting of 3 women and 2 men? (4) In how many ways can we choose a subcommittee of equal number of women and men? (5) In how many ways can we choose a subcommittee of 5 people with at least 2 women?

E X 7) COMBINATIONS If a fair coin is flipped 9 times, how many different ways are there to have 7 or more heads?

E X 8) P ERMUTATIONS (1) How many possibilities are there that everyone of 25 member of a group has a different birthday? (2) How many possibilities are there that at least two of 25 members of a group have a common birthday?

E X 9)D ISTRIBUTION 1 How many routes are there from the lower-left corner of n × n square grid to the upper-right corner if we are restricted to traveling only to the right or upward?

E X 10)D ISTRIBUTION 2 How many nonnegative integer solutions are there to the equation ? How many positive integer solutions are there to the equation ? How many solutions with ?

The number of distributions of r identical objects into n different places is or

E X 11)