Introductory Probability
|
|
- Joleen Perkins
- 5 years ago
- Views:
Transcription
1 Introductory Probability Combinations Nicholas Nguyen Department of Mathematics UK
2 Agenda Assigning Objects to Identical Positions Denitions Committee Card Hands Coin Toss Counts Adding binomial coecients Announcement: Quiz on Friday, HW due Saturday
3 A Common Product (Note) We have (n) 0 = 1, and 0! = 1. There is only one way to make an ordered list of no objects: an empty list.
4 Subsets We have (n) 0 = 1, and 0! = 1. There is only one way to make an ordered list of no objects: an empty list. Given a set A of n objects, the act of choosing a random subset of A is a sequence of n stages where we decide if each object is in the subset or not in it. Hence there are a total of 2 n subsets of A.
5 Subsets Given a set A of n objects, the act of choosing a random subset of A is a sequence of n stages where we decide if each object is in the subset or not in it. Hence there are a total of 2 n subsets of A. The number of subsets with k objects will be denoted by the binomial coecient ( n k ), "n choose k."
6 Permutations and Subsets Let A be a set {a,b,c}. Then there are (3) 2 = 6 2-permutations of A: However, there are 3 subsets of A that have two elements each: a,b a,c b,c b,a c,a c,b {a,b} {a,c} {b,c}
7 Permutations and Subsets Let A be a set {a,b,c}. Then there are (3) 2 = 6 2-permutations of A: However, there are 3 subsets of A that have two elements each: a,b a,c b,c b,a c,a c,b {a,b} {a,c} {b,c}
8 Let A be a set {a,b,c}. Then there are (3) 2 = 6 2-permutations of A: However, there are 3 subsets of A that have two elements each: a,b a,c b,c b,a c,a c,b {a,b} {a,c} {b,c} A 2-permutation is formed by picking a subset of A and ordering the 2 objects in the subset. Hence ( ) ( ) 3 3 2! = (3) 2 2, so = (3) 2 = ! 2 1 = 3.
9 Let A be a set {a,b,c}. Then there are (3) 2 = 6 2-permutations of A: However, there are 3 subsets of A that have two elements each: a,b a,c b,c b,a c,a c,b {a,b} {a,c} {b,c} A 2-permutation is formed by picking a subset of A and ordering the 2 objects in the subset. Hence ( ) ( ) 3 3 2! = (3) 2 2, so = (3) 2 = ! 2 1 = 3.
10 Binomial Coecients In general, for non-negative integers n and k with 0 k n, ( ) n = (n) k n! = k k! k!(n k)!. The binomial coecient counts the number of ways to choose k objects from a set of n while ignoring the order. As such, ) ) ( n 0 = ( n n = 1 (one way to choose all or none of the objects).
11 Binomial Coecients In general, for non-negative integers n and k with 0 k n, ( ) n = (n) k n! = k k! k!(n k)!. The binomial coecient counts the number of ways to choose k objects from a set of n while ignoring the order. As such, ) ) ( n 0 = ( n n = 1 (one way to choose all or none of the objects).
12 Combinations When picking from a collection of objects without replacement (repeats), use combinations when the order in which the objects are chosen does not matter.
13 Combinations When picking from a collection of objects without replacement (repeats), use combinations when the order in which the objects are chosen does not matter. This means it only matters if an object is chosen or not. All of the chosen objects are placed into indistinguishable positions.
14 Committee Four people must be chosen from a pool of nine to form a committee. Each person on the committee will have identical roles. How many committees are possible? Use combinations: ( 9 4 ) = (9) 4 4! = = 3,024 =
15 Committee Four people must be chosen from a pool of nine to form a committee. Each person on the committee will have identical roles. How many committees are possible? Use combinations: ( 9 4 ) = (9) 4 4! = = 3,024 =
16 Committee Four people must be chosen from a pool of nine to form a committee. Each person on the committee will have identical roles. How many committees are possible? Use combinations: ( 9 4 ) = (9) 4 4! = = 3,024 =
17 Committee Four people must be chosen from a pool of nine to form a committee. Each person on the committee will have identical roles. How many committees are possible? Use combinations: ( 9 4 ) = (9) 4 4! = = 3,024 =
18 Poker Hands A poker hand is a subset of 5 cards from a deck of 52 cards. There are ( ) 52 = (52) 5 5 5! = = 2, 598, 960 poker hands.
19 Poker Hands A poker hand is a subset of 5 cards from a deck of 52 cards. There are ( ) 52 = (52) 5 5 5! = = 2, 598, 960 poker hands.
20 Poker Hands A poker hand is a subset of 5 cards from a deck of 52 cards. There are ( ) 52 = (52) 5 5 5! = = 2, 598, 960 poker hands.
21 Poker Hands A poker hand is a subset of 5 cards from a deck of 52 cards. There are ( ) 52 = (52) 5 5 5! = = 2, 598, 960 poker hands. The deck has 4 suits, and 13 cards of each suit. How many hands have 5 cards of the same suit 1? 1 Note that this includes royal ushes, straight ushes, and ushes.
22 Poker Hands A poker hand is a subset of 5 cards from a deck of 52 cards. There are ( ) 52 = (52) 5 5 5! = = 2, 598, 960 poker hands. The deck has 4 suits, and 13 cards of each suit. How many hands have 5 cards of the same suit? 1. Pick the suit: 4 choices
23 Poker Hands A poker hand is a subset of 5 cards from a deck of 52 cards. There are ( ) 52 = (52) 5 5 5! = = 2, 598, 960 poker hands. The deck has 4 suits, and 13 cards of each suit. How many hands have 5 cards of the same suit? 1. Pick the suit: 4 choices 2. From the 13 cards of that suit, pick 5 of them in a subset:
24 Poker Hands A poker hand is a subset of 5 cards from a deck of 52 cards. There are ( ) 52 = (52) 5 5 5! = = 2, 598, 960 poker hands. The deck has 4 suits, and 13 cards of each suit. How many hands have 5 cards of the same suit? 1. Pick the suit: 4 choices 2. From the 13 cards of that suit, pick 5 of them in a subset: ( 13 5 ) = (13) 5 5!
25 ( 52 5 ) = (52) 5 5! = = 2, 598, 960 poker hands. The deck has 4 suits, and 13 cards of each suit. How many hands have 5 cards of the same suit? 1. Pick the suit: 4 choices 2. From the 13 cards of that suit, pick 5 of them in a subset: ( ) 13 = (13) 5 5 5! = = 154, = 1,287
26 = = 2, 598, 960 poker hands. The deck has 4 suits, and 13 cards of each suit. How many hands have 5 cards of the same suit? 1. Pick the suit: 4 choices 2. From the 13 cards of that suit, pick 5 of them in a subset: ( ) 13 = (13) 5 5 5! = Multiply: = 154, ,287 = 5,148 hands. = 1,287
27 = 2, 598, 960 poker hands. The deck has 4 suits, and 13 cards of each suit. How many hands have 5 cards of the same suit? 1. Pick the suit: 4 choices 2. From the 13 cards of that suit, pick 5 of them in a subset: ( ) 13 = (13) 5 5 5! = Multiply: = 154, ,287 = 5,148 hands. = 1,287 In particular the probability of getting 5 cards of the same suit in a hand is 5,148 2,598, %
28 Coin Tosses A coin is tossed 5 times. There are 2 5 = 32 possible sequences of tosses (5 stages with 2 outcomes each). How many sequences have 3 heads? Use combinations on the 5 tosses: we pick 3 of them to be heads. For example, picking tosses 1, 2, and 3 to be heads should be the same as picking tosses 3, 2, and 1 to be heads. Hence there are ( 5 3 ) = = 60 6 = 10 sequences where 3 tosses landed heads.
29 Coin Tosses A coin is tossed 5 times. There are 2 5 = 32 possible sequences of tosses (5 stages with 2 outcomes each). How many sequences have 3 heads? Use combinations on the 5 tosses: we pick 3 of them to be heads. For example, picking tosses 1, 2, and 3 to be heads should be the same as picking tosses 3, 2, and 1 to be heads. Hence there are ( 5 3 ) = = 60 6 = 10 sequences where 3 tosses landed heads.
30 Coin Tosses A coin is tossed 5 times. There are 2 5 = 32 possible sequences of tosses (5 stages with 2 outcomes each). How many sequences have 3 heads? Use combinations on the 5 tosses: we pick 3 of them to be heads. For example, picking tosses 1, 2, and 3 to be heads should be the same as picking tosses 3, 2, and 1 to be heads. Hence there are ( 5 3 ) = = 60 6 = 10 sequences where 3 tosses landed heads.
31 Coin Tosses A coin is tossed 5 times. There are 2 5 = 32 possible sequences of tosses (5 stages with 2 outcomes each). How many sequences have 3 heads? Use combinations on the 5 tosses: we pick 3 of them to be heads. For example, picking tosses 1, 2, and 3 to be heads should be the same as picking tosses 3, 2, and 1 to be heads. Hence there are ( 5 3 ) = = 60 6 = 10 sequences where 3 tosses landed heads.
32 A coin is tossed 5 times. There are 2 5 = 32 possible sequences of tosses (5 stages with 2 outcomes each). How many sequences have 3 heads? Use combinations on the 5 tosses: we pick 3 of them to be heads. For example, picking tosses 1, 2, and 3 to be heads should be the same as picking tosses 3, 2, and 1 to be heads. Hence there are ( 5 3 ) = = 60 6 = 10 sequences where 3 tosses landed heads. Thus, the probability of getting 3 heads in 5 tosses is We will nd this probability using another method soon.
33 Adding Binomial Coecients Theorem (3.4) For natural numbers n and k with 0 < k < n, ( ) ( ) ( ) n 1 n 1 n + =. k 1 k k
34 Theorem 3.4 Proof For natural numbers n and k with 0 < k < n, ( ) ( ) ( ) n 1 n 1 n + =. k 1 k k Let A be a set of n objects, and let a be a specic object in A. First, there are ( ) n k subsets of A with k objects in them. Each subset of A with k objects falls into one of two disjoint cases: either the subset has a in it, or it does not have a in it. We will count the number of subsets for each case, and then add them to get the total number of subsets.
35 Theorem 3.4 Proof (Case 1) The subset has a in it. Then we need to choose k 1 more objects to ll up the subset, and these k 1 objects are chosen from the remaining n 1 objects in A (n 1 because a cannot go in the subset more than once). There are ( ) n 1 ways to do this. k 1
36 Theorem 3.4 Proof (Case 2 and Conclusion) The subset does not have a in it. Then we still need to choose k objects to ll up the subset, and these k objects are chosen from the remaining n 1 objects in A (n 1 because a is not in the subset). There are ( ) n 1 ways to do this. k Since a subset either has a in it or not in it, but not both, the total number of subsets with k objects must be the sum of the number of subsets with a in them and the number of subsets that do not have a: ( n 1 k 1 ) ( n 1 + k ) = ( n k ).
37 @Home: Reading Note: page numbers refer to printed version. Add 8 to get page numbers in a PDF reader. Take a look at Pascal's triangle at the top of page 94. It is a table of values of binomial coecients. There is another relation among binomial coecients on page 95. Compare this to any symmetry in each row of Pascal's triangle. The example at the bottom of page 95 discusses two other hands in poker.
38 Next Time Please read Section 3.2 (you can skip the historical remarks). We will look at Bernoulli trials and binomial probabilities. The third homework is due this Saturday. There is a quiz this Friday.
Introductory Probability
Introductory Probability Conditional Probability: Independent Events and Intersections Dr. Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK February 15, 2019 Agenda Independent Events and Intersections
More informationNovember 6, Chapter 8: Probability: The Mathematics of Chance
Chapter 8: Probability: The Mathematics of Chance November 6, 2013 Last Time Crystallographic notation Groups Crystallographic notation The first symbol is always a p, which indicates that the pattern
More informationDiscrete Structures Lecture Permutations and Combinations
Introduction Good morning. Many counting problems can be solved by finding the number of ways to arrange a specified number of distinct elements of a set of a particular size, where the order of these
More informationThe next several lectures will be concerned with probability theory. We will aim to make sense of statements such as the following:
CS 70 Discrete Mathematics for CS Fall 2004 Rao Lecture 14 Introduction to Probability The next several lectures will be concerned with probability theory. We will aim to make sense of statements such
More informationThe topic for the third and final major portion of the course is Probability. We will aim to make sense of statements such as the following:
CS 70 Discrete Mathematics for CS Spring 2006 Vazirani Lecture 17 Introduction to Probability The topic for the third and final major portion of the course is Probability. We will aim to make sense of
More informationThe Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n ways to do the first task and n
Chapter 5 Chapter Summary 5.1 The Basics of Counting 5.2 The Pigeonhole Principle 5.3 Permutations and Combinations 5.5 Generalized Permutations and Combinations Section 5.1 The Product Rule The Product
More information1. More on Binomial Distributions
Math 25-Introductory Statistics Lecture 9/27/06. More on Binomial Distributions When we toss a coin four times, and we compute the probability of getting three heads, for example, we need to know how many
More informationJIGSAW ACTIVITY, TASK # Make sure your answer in written in the correct order. Highest powers of x should come first, down to the lowest powers.
JIGSAW ACTIVITY, TASK #1 Your job is to multiply and find all the terms in ( 1) Recall that this means ( + 1)( + 1)( + 1)( + 1) Start by multiplying: ( + 1)( + 1) x x x x. x. + 4 x x. Write your answer
More informationDISCRETE STRUCTURES COUNTING
DISCRETE STRUCTURES COUNTING LECTURE2 The Pigeonhole Principle The generalized pigeonhole principle: If N objects are placed into k boxes, then there is at least one box containing at least N/k of the
More informationCombinatorial Proofs
Combinatorial Proofs Two Counting Principles Some proofs concerning finite sets involve counting the number of elements of the sets, so we will look at the basics of counting. Addition Principle: If A
More informationProblems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:
Math 22 Fall 2017 Homework 2 Drew Armstrong Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman: Section 1.2, Exercises 5, 7, 13, 16. Section 1.3, Exercises,
More informationNovember 8, Chapter 8: Probability: The Mathematics of Chance
Chapter 8: Probability: The Mathematics of Chance November 8, 2013 Last Time Probability Models and Rules Discrete Probability Models Equally Likely Outcomes Crystallographic notation The first symbol
More information1. Counting. 2. Tree 3. Rules of Counting 4. Sample with/without replacement where order does/doesn t matter.
Lecture 4 Outline: basics What s to come? Probability A bag contains: What is the chance that a ball taken from the bag is blue? Count blue Count total Divide Today: Counting! Later: Probability Professor
More informationLecture 1. Permutations and combinations, Pascal s triangle, learning to count
18.440: Lecture 1 Permutations and combinations, Pascal s triangle, learning to count Scott Sheffield MIT 1 Outline Remark, just for fun Permutations Counting tricks Binomial coefficients Problems 2 Outline
More informationTopics to be covered
Basic Counting 1 Topics to be covered Sum rule, product rule, generalized product rule Permutations, combinations Binomial coefficients, combinatorial proof Inclusion-exclusion principle Pigeon Hole Principle
More informationCounting in Algorithms
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 to factor an integer? Counting in Games How many different
More informationLecture 14. What s to come? Probability. A bag contains:
Lecture 14 What s to come? Probability. A bag contains: What is the chance that a ball taken from the bag is blue? Count blue. Count total. Divide. Today: Counting! Later: Probability. Professor Walrand.
More informationCS70: Lecture Review. 2. Stars/Bars. 3. Balls in Bins. 4. Addition Rules. 5. Combinatorial Proofs. 6. Inclusion/Exclusion
CS70: Lecture 18. 1. Review. 2. Stars/Bars. 3. Balls in Bins. 4. Addition Rules. 5. Combinatorial Proofs. 6. Inclusion/Exclusion The rules! First rule: n 1 n 2 n 3. Product Rule. k Samples with replacement
More informationReading 14 : Counting
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 14 : Counting In this reading we discuss counting. Often, we are interested in the cardinality
More informationDISCUSSION #8 FRIDAY MAY 25 TH Sophie Engle (Teacher Assistant) ECS20: Discrete Mathematics
DISCUSSION #8 FRIDAY MAY 25 TH 2007 Sophie Engle (Teacher Assistant) ECS20: Discrete Mathematics 2 Homework 8 Hints and Examples 3 Section 5.4 Binomial Coefficients Binomial Theorem 4 Example: j j n n
More informationPurpose of Section To introduce some basic tools of counting, such as the multiplication principle, permutations and combinations.
1 Section 2.3 Purpose of Section To introduce some basic tools of counting, such as the multiplication principle, permutations and combinations. Introduction If someone asks you a question that starts
More informationPOKER (AN INTRODUCTION TO COUNTING)
POKER (AN INTRODUCTION TO COUNTING) LAMC INTERMEDIATE GROUP - 10/27/13 If you want to be a succesful poker player the first thing you need to do is learn combinatorics! Today we are going to count poker
More informationWeek 1: Probability models and counting
Week 1: Probability models and counting Part 1: Probability model Probability theory is the mathematical toolbox to describe phenomena or experiments where randomness occur. To have a probability model
More informationMAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology
MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability Preliminary Concepts, Formulas, and Terminology Meanings of Basic Arithmetic Operations in Mathematics Addition: Generally
More informationPoker: Probabilities of the Various Hands
Poker: Probabilities of the Various Hands 22 February 2012 Poker II 22 February 2012 1/27 Some Review from Monday There are 4 suits and 13 values. The suits are Spades Hearts Diamonds Clubs There are 13
More informationChapter 1. Probability
Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.
More informationWith Question/Answer Animations. Chapter 6
With Question/Answer Animations Chapter 6 Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients and Identities Generalized Permutations and
More informationCSE 21 Mathematics for Algorithm and System Analysis
CSE 21 Mathematics for Algorithm and System Analysis Unit 1: Basic Count and List Section 3: Set CSE21: Lecture 3 1 Reminder Piazza forum address: http://piazza.com/ucsd/summer2013/cse21/hom e Notes on
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 13
CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 13 Introduction to Discrete Probability In the last note we considered the probabilistic experiment where we flipped a
More informationCompound Probability. Set Theory. Basic Definitions
Compound Probability Set Theory A probability measure P is a function that maps subsets of the state space Ω to numbers in the interval [0, 1]. In order to study these functions, we need to know some basic
More informationn! = n(n 1)(n 2) 3 2 1
A Counting A.1 First principles If the sample space Ω is finite and the outomes are equally likely, then the probability measure is given by P(E) = E / Ω where E denotes the number of outcomes in the event
More informationSection : Combinations and Permutations
Section 11.1-11.2: Combinations and Permutations Diana Pell A construction crew has three members. A team of two must be chosen for a particular job. In how many ways can the team be chosen? How many words
More informationProbability Theory. Mohamed I. Riffi. Islamic University of Gaza
Probability Theory Mohamed I. Riffi Islamic University of Gaza Table of contents 1. Chapter 1 Probability Properties of probability Counting techniques 1 Chapter 1 Probability Probability Theorem P(φ)
More information1. The chance of getting a flush in a 5-card poker hand is about 2 in 1000.
CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 15 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice, roulette wheels. Today
More informationElementary Combinatorics
184 DISCRETE MATHEMATICAL STRUCTURES 7 Elementary Combinatorics 7.1 INTRODUCTION Combinatorics deals with counting and enumeration of specified objects, patterns or designs. Techniques of counting are
More informationDiscrete Mathematics with Applications MATH236
Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet
More information17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.
7 Symmetries 7 Permutations A permutation of a set is a reordering of its elements Another way to look at it is as a function Φ that takes as its argument a set of natural numbers of the form {, 2,, n}
More informationBlock 1 - Sets and Basic Combinatorics. Main Topics in Block 1:
Block 1 - Sets and Basic Combinatorics Main Topics in Block 1: A short revision of some set theory Sets and subsets. Venn diagrams to represent sets. Describing sets using rules of inclusion. Set operations.
More informationUCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis
UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 3 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 3 Notes Goal for today: CL Section 3 Subsets,
More informationChapter 2. Permutations and Combinations
2. Permutations and Combinations Chapter 2. Permutations and Combinations In this chapter, we define sets and count the objects in them. Example Let S be the set of students in this classroom today. Find
More informationProbability. Ms. Weinstein Probability & Statistics
Probability Ms. Weinstein Probability & Statistics Definitions Sample Space The sample space, S, of a random phenomenon is the set of all possible outcomes. Event An event is a set of outcomes of a random
More informationHonors Precalculus Chapter 9 Summary Basic Combinatorics
Honors Precalculus Chapter 9 Summary Basic Combinatorics A. Factorial: n! means 0! = Why? B. Counting principle: 1. How many different ways can a license plate be formed a) if 7 letters are used and each
More informationUsing a table: regular fine micro. red. green. The number of pens possible is the number of cells in the table: 3 2.
Counting Methods: Example: A pen has tip options of regular tip, fine tip, or micro tip, and it has ink color options of red ink or green ink. How many different pens are possible? Using a table: regular
More informationMore Probability: Poker Hands and some issues in Counting
More Probability: Poker Hands and some issues in Counting Data From Thursday Everybody flipped a pair of coins and recorded how many times they got two heads, two tails, or one of each. We saw that the
More informationHOMEWORK ASSIGNMENT 5
HOMEWORK ASSIGNMENT 5 MATH 251, WILLIAMS COLLEGE, FALL 2006 Abstract. These are the instructor s solutions. 1. Big Brother The social security number of a person is a sequence of nine digits that are not
More informationCombinations. April 14, 2006
Combinations April 14, 2006 Combinations (cont'd), April 14, 2006 Inclusion-Exclusion Principle Theorem. Let P be a probability distribution on a sample space Ω, and let {A 1, A 2,..., A n } be a nite
More informationPermutations and Combinations
Motivating question Permutations and Combinations A) Rosen, Chapter 5.3 B) C) D) Permutations A permutation of a set of distinct objects is an ordered arrangement of these objects. : (1, 3, 2, 4) is a
More informationCSC/MTH 231 Discrete Structures II Spring, Homework 5
CSC/MTH 231 Discrete Structures II Spring, 2010 Homework 5 Name 1. A six sided die D (with sides numbered 1, 2, 3, 4, 5, 6) is thrown once. a. What is the probability that a 3 is thrown? b. What is the
More informationJong C. Park Computer Science Division, KAIST
Jong C. Park Computer Science Division, KAIST Today s Topics Basic Principles Permutations and Combinations Algorithms for Generating Permutations Generalized Permutations and Combinations Binomial Coefficients
More informationSTAT 430/510 Probability Lecture 3: Space and Event; Sample Spaces with Equally Likely Outcomes
STAT 430/510 Probability Lecture 3: Space and Event; Sample Spaces with Equally Likely Outcomes Pengyuan (Penelope) Wang May 25, 2011 Review We have discussed counting techniques in Chapter 1. (Principle
More informationNovember 11, Chapter 8: Probability: The Mathematics of Chance
Chapter 8: Probability: The Mathematics of Chance November 11, 2013 Last Time Probability Models and Rules Discrete Probability Models Equally Likely Outcomes Probability Rules Probability Rules Rule 1.
More informationImportant Distributions 7/17/2006
Important Distributions 7/17/2006 Discrete Uniform Distribution All outcomes of an experiment are equally likely. If X is a random variable which represents the outcome of an experiment of this type, then
More informationMath 42, Discrete Mathematics
c Fall 2018 last updated 10/29/2018 at 18:22:13 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
More informationDiscrete Mathematics: Logic. Discrete Mathematics: Lecture 15: Counting
Discrete Mathematics: Logic Discrete Mathematics: Lecture 15: Counting counting combinatorics: the study of the number of ways to put things together into various combinations basic counting principles
More informationProbability MAT230. Fall Discrete Mathematics. MAT230 (Discrete Math) Probability Fall / 37
Probability MAT230 Discrete Mathematics Fall 2018 MAT230 (Discrete Math) Probability Fall 2018 1 / 37 Outline 1 Discrete Probability 2 Sum and Product Rules for Probability 3 Expected Value MAT230 (Discrete
More informationSTAT 3743: Probability and Statistics
STAT 3743: Probability and Statistics G. Jay Kerns, Youngstown State University Fall 2010 Probability Random experiment: outcome not known in advance Sample space: set of all possible outcomes (S) Probability
More informationCSCI 2200 Foundations of Computer Science (FoCS) Solutions for Homework 7
CSCI 00 Foundations of Computer Science (FoCS) Solutions for Homework 7 Homework Problems. [0 POINTS] Problem.4(e)-(f) [or F7 Problem.7(e)-(f)]: In each case, count. (e) The number of orders in which a
More informationSection The Multiplication Principle and Permutations
Section 2.1 - The Multiplication Principle and Permutations Example 1: A yogurt shop has 4 flavors (chocolate, vanilla, strawberry, and blueberry) and three sizes (small, medium, and large). How many different
More informationCounting Things Solutions
Counting Things Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles March 7, 006 Abstract These are solutions to the Miscellaneous Problems in the Counting Things article at:
More informationChapter 1. Probability
Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.
More informationIf a regular six-sided die is rolled, the possible outcomes can be listed as {1, 2, 3, 4, 5, 6} there are 6 outcomes.
Section 11.1: The Counting Principle 1. Combinatorics is the study of counting the different outcomes of some task. For example If a coin is flipped, the side facing upward will be a head or a tail the
More informationSection Summary. Permutations Combinations Combinatorial Proofs
Section 6.3 Section Summary Permutations Combinations Combinatorial Proofs Permutations Definition: A permutation of a set of distinct objects is an ordered arrangement of these objects. An ordered arrangement
More informationFOURTH LECTURE : SEPTEMBER 18, 2014
FOURTH LECTURE : SEPTEMBER 18, 01 MIKE ZABROCKI I started off by listing the building block numbers that we have already seen and their combinatorial interpretations. S(n, k = the number of set partitions
More informationProbability. Engr. Jeffrey T. Dellosa.
Probability Engr. Jeffrey T. Dellosa Email: jtdellosa@gmail.com Outline Probability 2.1 Sample Space 2.2 Events 2.3 Counting Sample Points 2.4 Probability of an Event 2.5 Additive Rules 2.6 Conditional
More informationCS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6
CS100: DISCRETE STRUCTURES Lecture 8 Counting - CH6 Lecture Overview 2 6.1 The Basics of Counting: THE PRODUCT RULE THE SUM RULE THE SUBTRACTION RULE THE DIVISION RULE 6.2 The Pigeonhole Principle. 6.3
More information7 5 Compound Events. March 23, Alg2 7.5B Notes on Monday.notebook
7 5 Compound Events At a juice bottling factory, quality control technicians randomly select bottles and mark them pass or fail. The manager randomly selects the results of 50 tests and organizes the data
More informationSection 6.1 #16. Question: What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit?
Section 6.1 #16 What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit? page 1 Section 6.1 #38 Two events E 1 and E 2 are called independent if p(e 1
More informationPoker: Probabilities of the Various Hands
Poker: Probabilities of the Various Hands 19 February 2014 Poker II 19 February 2014 1/27 Some Review from Monday There are 4 suits and 13 values. The suits are Spades Hearts Diamonds Clubs There are 13
More informationFinite Math - Fall 2016
Finite Math - Fall 206 Lecture Notes - /28/206 Section 7.4 - Permutations and Combinations There are often situations in which we have to multiply many consecutive numbers together, for example, in examples
More informationPrinciple of Inclusion-Exclusion Notes
Principle of Inclusion-Exclusion Notes The Principle of Inclusion-Exclusion (often abbreviated PIE is the following general formula used for finding the cardinality of a union of finite sets. Theorem 0.1.
More informationMath1116Chapter15ProbabilityProbabilityDone.notebook January 20, 2013
Chapter 15 Notes on Probability 15.4 Probability Spaces Probability assignment A function that assigns to each event E a number between 0 and 1, which represents the probability of the event E and which
More informationMathematical Foundations HW 5 By 11:59pm, 12 Dec, 2015
1 Probability Axioms Let A,B,C be three arbitrary events. Find the probability of exactly one of these events occuring. Sample space S: {ABC, AB, AC, BC, A, B, C, }, and S = 8. P(A or B or C) = 3 8. note:
More informationSMML MEET 3 ROUND 1
ROUND 1 1. How many different 3-digit numbers can be formed using the digits 0, 2, 3, 5 and 7 without repetition? 2. There are 120 students in the senior class at Jefferson High. 25 of these seniors participate
More informationLAMC Junior Circle February 3, Oleg Gleizer. Warm-up
LAMC Junior Circle February 3, 2013 Oleg Gleizer oleg1140@gmail.com Warm-up Problem 1 Compute the following. 2 3 ( 4) + 6 2 Problem 2 Can the value of a fraction increase, if we add one to the numerator
More informationContents 2.1 Basic Concepts of Probability Methods of Assigning Probabilities Principle of Counting - Permutation and Combination 39
CHAPTER 2 PROBABILITY Contents 2.1 Basic Concepts of Probability 38 2.2 Probability of an Event 39 2.3 Methods of Assigning Probabilities 39 2.4 Principle of Counting - Permutation and Combination 39 2.5
More informationCounting and Probability Math 2320
Counting and Probability Math 2320 For a finite set A, the number of elements of A is denoted by A. We have two important rules for counting. 1. Union rule: Let A and B be two finite sets. Then A B = A
More informationCounting. Chapter 6. With Question/Answer Animations
. All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Counting Chapter
More informationSkills we've learned. Skills we need. 7 3 Independent and Dependent Events. March 17, Alg2 Notes 7.3.notebook
7 3 Independent and Dependent Events Skills we've learned 1. In a box of 25 switches, 3 are defective. What is the probability of randomly selecting a switch that is not defective? 2. There are 12 E s
More informationRANDOM EXPERIMENTS AND EVENTS
Random Experiments and Events 18 RANDOM EXPERIMENTS AND EVENTS In day-to-day life we see that before commencement of a cricket match two captains go for a toss. Tossing of a coin is an activity and getting
More informationSample Spaces, Events, Probability
Sample Spaces, Events, Probability CS 3130/ECE 3530: Probability and Statistics for Engineers August 28, 2014 Sets A set is a collection of unique objects. Sets A set is a collection of unique objects.
More informationPermutations and Combinations
Permutations and Combinations Rosen, Chapter 5.3 Motivating question In a family of 3, how many ways can we arrange the members of the family in a line for a photograph? 1 Permutations A permutation of
More informationMat 344F challenge set #2 Solutions
Mat 344F challenge set #2 Solutions. Put two balls into box, one ball into box 2 and three balls into box 3. The remaining 4 balls can now be distributed in any way among the three remaining boxes. This
More informationPermutations and Combinations. MATH 107: Finite Mathematics University of Louisville. March 3, 2014
Permutations and Combinations MATH 107: Finite Mathematics University of Louisville March 3, 2014 Multiplicative review Non-replacement counting questions 2 / 15 Building strings without repetition A familiar
More informationMath 3012 Applied Combinatorics Lecture 2
August 20, 2015 Math 3012 Applied Combinatorics Lecture 2 William T. Trotter trotter@math.gatech.edu The Road Ahead Alert The next two to three lectures will be an integrated approach to material from
More informationCIS 2033 Lecture 6, Spring 2017
CIS 2033 Lecture 6, Spring 2017 Instructor: David Dobor February 2, 2017 In this lecture, we introduce the basic principle of counting, use it to count subsets, permutations, combinations, and partitions,
More information8.2 Union, Intersection, and Complement of Events; Odds
8.2 Union, Intersection, and Complement of Events; Odds Since we defined an event as a subset of a sample space it is natural to consider set operations like union, intersection or complement in the context
More informationTheory of Probability - Brett Bernstein
Theory of Probability - Brett Bernstein Lecture 3 Finishing Basic Probability Review Exercises 1. Model flipping two fair coins using a sample space and a probability measure. Compute the probability of
More informationCounting integral solutions
Thought exercise 2.2 20 Counting integral solutions Question: How many non-negative integer solutions are there of x 1 +x 2 +x 3 +x 4 = 10? Thought exercise 2.2 20 Counting integral solutions Question:
More informationelements in S. It can tricky counting up the numbers of
STAT-UB.003 Notes for Wednesday, 0.FEB.0. For many problems, we need to do a little counting. We try to construct a sample space S for which the elements are equally likely. Then for any event E, we will
More informationINDEPENDENT AND DEPENDENT EVENTS UNIT 6: PROBABILITY DAY 2
INDEPENDENT AND DEPENDENT EVENTS UNIT 6: PROBABILITY DAY 2 WARM UP Students in a mathematics class pick a card from a standard deck of 52 cards, record the suit, and return the card to the deck. The results
More information9.5 Counting Subsets of a Set: Combinations. Answers for Test Yourself
9.5 Counting Subsets of a Set: Combinations 565 H 35. H 36. whose elements when added up give the same sum. (Thanks to Jonathan Goldstine for this problem. 34. Let S be a set of ten integers chosen from
More informationJUST THE MATHS UNIT NUMBER PROBABILITY 2 (Permutations and combinations) A.J.Hobson
JUST THE MATHS UNIT NUMBER 19.2 PROBABILITY 2 (Permutations and combinations) by A.J.Hobson 19.2.1 Introduction 19.2.2 Rules of permutations and combinations 19.2.3 Permutations of sets with some objects
More informationINDIAN STATISTICAL INSTITUTE
INDIAN STATISTICAL INSTITUTE B1/BVR Probability Home Assignment 1 20-07-07 1. A poker hand means a set of five cards selected at random from usual deck of playing cards. (a) Find the probability that it
More informationCOUNTING AND PROBABILITY
CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.2 Possibility Trees and the Multiplication Rule Copyright Cengage Learning. All rights reserved. Possibility
More informationCombinatorics and Intuitive Probability
Chapter Combinatorics and Intuitive Probability The simplest probabilistic scenario is perhaps one where the set of possible outcomes is finite and these outcomes are all equally likely. A subset of the
More informationNOTES ON SEPT 13-18, 2012
NOTES ON SEPT 13-18, 01 MIKE ZABROCKI Last time I gave a name to S(n, k := number of set partitions of [n] into k parts. This only makes sense for n 1 and 1 k n. For other values we need to choose a convention
More informationPermutation Groups. Definition and Notation
5 Permutation Groups Wigner s discovery about the electron permutation group was just the beginning. He and others found many similar applications and nowadays group theoretical methods especially those
More informationDiscrete mathematics
Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2018/2019 About this file This file is meant to be a guideline for the lecturer. Many
More informationDiscussion : Independence 1.6: Counting. Qingyang Xue based on slides from Zack While February 7, University of Massachusetts Amherst
Discussion 2 1.5: Independence 1.6: Counting Qingyang Xue based on slides from Zack While February 7, 2019 University of Massachusetts Amherst 1 Table of Contents 1. Preliminaries 2. Quiz 1 Review 3. Practice
More informationProbability. Dr. Zhang Fordham Univ.
Probability! Dr. Zhang Fordham Univ. 1 Probability: outline Introduction! Experiment, event, sample space! Probability of events! Calculate Probability! Through counting! Sum rule and general sum rule!
More information