2. Combinatorial Methods p2. 2.1 Introduction If the sample space is finite and furthermore sample points are all equally likely, then P(A)=N(A)/N(S)

Slides:



Advertisements
Similar presentations
Methods of Enumeration Counting tools can be very important in probability … particularly if you have a finite sample space with equally likely outcomes.
Advertisements

Chapter 2 Concepts of Prob. Theory
Arrange -ments Single Events Compound ConditionalOther Final Jeopardy.
Counting Chapter 6 With Question/Answer Animations.
Recursively Defined Functions
COUNTING AND PROBABILITY
Chapter 3 Probability.
CSC-2259 Discrete Structures
CSCE 2100: Computing Foundations 1 Combinatorics Tamara Schneider Summer 2013.
Introduction to Probability
Chap 2 Combinatorial Methods Ghahramani 3rd edition.
CSE115/ENGR160 Discrete Mathematics 04/17/12
Basics of Probability. Trial or Experiment Experiment - a process that results in a particular outcome or “event”. Simple event (or sample point), E i.
Probability and combinatorics Notes from Virtual Laboratories in Probability and Statistics.
Counting II: Pascal, Binomials, and Other Tricks Great Theoretical Ideas In Computer Science A. Gupta D. Sleator CS Fall 2010 Lecture 8Sept. 16,
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.
Conditional Probabilities
Probability Chapter 3. § 3.1 Basic Concepts of Probability.
How many ways are there to pass through city A where the arrows represent one-way streets? Answer: mn ways The counting principal: Suppose two experiments.
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.
Counting Principles (Permutations and Combinations )
Counting and Probability Sets and Counting Permutations & Combinations Probability.
Chapter 1 Basics of Probability.
Combinatorics 3/15 and 3/ Counting A restaurant offers the following menu: Main CourseVegetablesBeverage BeefPotatoesMilk HamGreen BeansCoffee.
NA387 Lecture 5: Combinatorics, Conditional Probability
Week 11 What is Probability? Quantification of uncertainty. Mathematical model for things that occur randomly. Random – not haphazard, don’t know what.
1 Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
Chapter 1 Fundamental Principles of Counting Discrete Mathematics.
Probability Review and Counting Fundamentals Ginger Holmes Rowell, Middle TN State University Tracy Goodson-Espy and M. Leigh Lunsford, University of AL,
(13 – 1) The Counting Principle and Permutations Learning targets: To use the fundamental counting principle to count the number of ways an event can happen.
7 Further Topics in Algebra © 2008 Pearson Addison-Wesley. All rights reserved Sections 7.4–7.7.
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
Topics to be covered: Produce all combinations and permutations of sets. Calculate the number of combinations and permutations of sets of m items taken.
Principles of Statistics Chapter 2 Elements of Probability.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 9- 1.
Slide 7- 1 Copyright © 2006 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
You probability wonder what we’re going to do next!
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.
CPSC 531: Probability Review1 CPSC 531:Probability & Statistics: Review Instructor: Anirban Mahanti Office: ICT Class.
Probability Chapter 3. § 3.4 Counting Principles.
Chapter 6, Counting and Probability
Discrete Probability CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Spatial Statistics and Spatial Knowledge Discovery First law of geography [Tobler]: Everything is related to everything, but nearby things are more related.
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,
Probability Basic Concepts Start with the Monty Hall puzzle
ICS 253: Discrete Structures I Discrete Probability King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Discrete Mathematics, 1st Edition Kevin Ferland Chapter 6 Basic Counting 1.
Textbook: Discrete and Combinatorial Mathematics:
Counting Principles Multiplication rule Permutations Combinations.
Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects.
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.
COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.
Conditional probabilities and independence of events.
PROBABILITY AND STATISTICS WEEK 2 Onur Doğan. Introduction to Probability The Classical Interpretation of Probability The Frequency Interpretation of.
1 COMP2121 Discrete Mathematics Principle of Inclusion and Exclusion Probability Hubert Chan (Chapters 7.4, 7.5, 6) [O1 Abstract Concepts] [O3 Basic Analysis.
Combinatorial Principles, Permutations, and Combinations
Counting Principles Ex. Eight pieces of paper are numbered 1 to 8 and placed in a box. One piece of paper is drawn from the box, its number is written.
ICS 253: Discrete Structures I
The Pigeonhole Principle
Developing Your Counting Muscles
Chapter 5, Section 5.1 The Basics of Counting
COCS DISCRETE STRUCTURES
Combining Probabilities
CS100: Discrete structures
PROBABILITY AND STATISTICS
Probability Probability underlies statistical inference - the drawing of conclusions from a sample of data. If samples are drawn at random, their characteristics.
Chapter 3 Probability.
Mutually Exclusive Events
Presentation transcript:

2. Combinatorial Methods

p Introduction If the sample space is finite and furthermore sample points are all equally likely, then P(A)=N(A)/N(S) So we study combinatorial analysis here, which deals with methods of counting.

p Counting principle Ex 2.1 How many outcomes are there if we throw 5 dice? Ex 2.2 In tossing 4 fair dice, P(at least one 3 among these 4 dice)=? Ex 2.3 Virginia wants to give her son, Brian, 14 different baseball cards within a 7-day period. If Virginia gives Brian cards no more than once a day, in how many way can this be done? Ex 2.6 (Standard Birthday Problem) P(at least two among n people have the same Bday)=?

p4. Counting principle Thm 2.3 A set with n elements has 2 n subsets. Ex 2.9 Mark has $4. He decides to bet $1 on the flip of a fair coin 4 times. What is the probability that (a) he breaks even; (b) he wins money?(use tree diagram)

p Permutations Ex people, Brown, Smith, and Jones, must be scheduled for job interviews. In how many different orders can this be done? Ex anthropology, 4 computer science, 3 statistics, 3 biology, and 5 music books are put on a bookshelf with a random arrangement. What is the probability that the books of the same subject are together?

p6. Permutations Ex 2.12 If 5 boys and 5 girls sit in a row in a random order, P(no two children of the same sex sit together)=? Thm 2.4 The number of distinguishable permutations of n objects of k different types, where n 1 are alike, n 2 are alike, …, n k are alike and n=n 1 +n 2 +…+n k is

p7. Permutations Ex 2.13 How many different 10-letter codes can be made using 3 a’s, 4 b’s, and 3 c’s? Ex 2.14 In how many ways can we paint 11 offices so that 4 of them will be painted green, 3 yellow, 2 white, and the remaining 2 pink? Ex 2.15 A fair coin is flipped 10 times. P(exactly 3 heads)=?

p Combinations Definition An unordered arrangement of r objects from a set A containing n objects (r  n) is called an r-element combination of A, or a combination of the elements of A taken r at a time. Notes :

p Combinations Ex 2.16 In how many ways can 2 math and 3 biology books be selected from 8 math and 6 biology books? Ex instructors were selected randomly to ask whether they are happy with their teaching loads. The response of 32 were negative. If Drs. Smith, Brown, and Jones were among those questioned. P(all 3 gave negative responses)=?

p10. Combinations Ex 2.18 In a small town, 11 of the 25 schoolteachers are against abortion, 8 are for abortion, and the rest are indifferent. A random sample of 5 schoolteachers is selected for an interview. (a)P(all 5 are for abortion)=? (b)P(all 5 have the same opinion)=? Ex 2.19 In Maryland’s lottery, player pick 6 integers between 1 and 49, order of selection being irrelevant. P(grand prize)=? P(2 nd prize)=? P(3 rd prize)=?

p11. Combinations Ex cards are drawn from 52 without replacement. P(at least one of the cards is a king)=?

p12. E.g. 7 個人買食物, 有四種食物可選擇, 有幾種買法 ? first second third fourth xxxxxxx xx x x xxx xxxxxxx for x for Combinations with Repetition: Distributions

p13. In general, the number of selections, with repetitions, of r objects from n distinct objects are: Combinations with Repetition: Distributions

p14. E.g. Determine all integer solutions to the equation wherefor all select with repetition from7 times For example, ifis selected twice, then in the final solution. Therefore, C(4+7-1,7)=120 Combinations with Repetition: Distributions

p15. Equivalence of the following: (a) the number of integer solutions of the equation (b) the number of selections, with repetition, of size r from a collection of size n (c) the number of ways r identical objects can be distributed among n distinct containers Combinations with Repetition: Distributions

p16. E.g. How many nonnegative integer solutions are there to the inequality It is equivalent to which can be transformed to wherefo r an d C(7+9- 1,9)=5005 Combinations with Repetition: Distributions

p17. E.g. How many terms there are in the expansion of ? Each distinct term is of the form where for and Therefore, C(4+10-1,10)=286 Combinations with Repetition: Distributions

p18. Theorem 2.5 : Binomial Expansion For any integer n  0, Pf :

p19. Combinations Thm 2.5 (Binomial expansion) Ex 2.25 What is the coefficient of x 2 y 3 in the expansion of (2x+3y) 5 ? Ex 2.26 Evaluate the sum

p20. Combinations Ex 2.27 Evaluate the sum Ex 2.28 Prove that

p21. Combinations Thm 2.6 (Multinomial expansion).