Math Steven Noble. November 22nd. Steven Noble Math 3790
|
|
- Julian Ball
- 5 years ago
- Views:
Transcription
1 Math 3790 Steven Noble November 22nd
2 Basic ideas of combinations and permutations Simple Addition. If there are a varieties of soup and b varieties of salad then there are a + b possible ways to order a meal of soup or salad (but not soup and salad).
3 Basic ideas of combinations and permutations Simple Addition. If there are a varieties of soup and b varieties of salad then there are a + b possible ways to order a meal of soup or salad (but not soup and salad). This is special case of the idea that if you have two finite sets A and B are disjoint (ie A B = ) then A B = A + B.
4 Basic ideas of combinations and permutations Simple Addition. If there are a varieties of soup and b varieties of salad then there are a + b possible ways to order a meal of soup or salad (but not soup and salad). This is special case of the idea that if you have two finite sets A and B are disjoint (ie A B = ) then A B = A + B. Simple Multiplication. If there are a varieties of soup and b varieties of salad, then there are a b possible ways to order a meal of soup and salad.
5 Basic ideas of combinations and permutations Simple Addition. If there are a varieties of soup and b varieties of salad then there are a + b possible ways to order a meal of soup or salad (but not soup and salad). This is special case of the idea that if you have two finite sets A and B are disjoint (ie A B = ) then A B = A + B. Simple Multiplication. If there are a varieties of soup and b varieties of salad, then there are a b possible ways to order a meal of soup and salad. This is special case of the idea that if you have two finite sets A and B then A B = A B. Here (A B) is just the set made up of paired elements (a, b) where a A and b B.
6 More basic ideas of combinations and permutations A permutation of a collection of objects is a reordering of them. For example, there are 6 different permutations of the letters ABC, namely ABC, BAC, BCA, CAB, CBA.
7 More basic ideas of combinations and permutations A permutation of a collection of objects is a reordering of them. For example, there are 6 different permutations of the letters ABC, namely ABC, BAC, BCA, CAB, CBA. How many ways are there to permute the letters in Hardy?
8 More basic ideas of combinations and permutations A permutation of a collection of objects is a reordering of them. For example, there are 6 different permutations of the letters ABC, namely ABC, BAC, BCA, CAB, CBA. How many ways are there to permute the letters in Hardy? Permutations of n things taken r at a time. The number of different 3-letter words we could make using the 9 letters of CHERNOBYL is = 504. In general, the number of distinct ways of permuting r things chosen from n things is n (n 1) (n r + 1).
9 More basic ideas of combinations and permutations A permutation of a collection of objects is a reordering of them. For example, there are 6 different permutations of the letters ABC, namely ABC, BAC, BCA, CAB, CBA. How many ways are there to permute the letters in Hardy? Permutations of n things taken r at a time. The number of different 3-letter words we could make using the 9 letters of CHERNOBYL is = 504. In general, the number of distinct ways of permuting r things chosen from n things is This equal to n! (n r)! n (n 1) (n r + 1). and is called P(n, r).
10 More basic ideas of combinations and permutations A permutation of a collection of objects is a reordering of them. For example, there are 6 different permutations of the letters ABC, namely ABC, BAC, BCA, CAB, CBA. How many ways are there to permute the letters in Hardy? Permutations of n things taken r at a time. The number of different 3-letter words we could make using the 9 letters of CHERNOBYL is = 504. In general, the number of distinct ways of permuting r things chosen from n things is n (n 1) (n r + 1). n! This equal to (n r)! and is called P(n, r). How many ways are there to permute the letter in GAUSS?
11 More basic ideas of combinations and permutations A permutation of a collection of objects is a reordering of them. For example, there are 6 different permutations of the letters ABC, namely ABC, BAC, BCA, CAB, CBA. How many ways are there to permute the letters in Hardy? Permutations of n things taken r at a time. The number of different 3-letter words we could make using the 9 letters of CHERNOBYL is = 504. In general, the number of distinct ways of permuting r things chosen from n things is n (n 1) (n r + 1). n! This equal to (n r)! and is called P(n, r). How many ways are there to permute the letter in GAUSS? The answer isn t 6! but why isn t it?
12 Mississippi Formula The formula for the amount of permutations of a word is if there are a 1 of the first letter, a 2 of the second letter,..., a n of the n th letter then there are (a 1 + a 2 + a a n )! a 1!a 2! a n! different permutations of the word. This is often referred to as the Mississippi formula. (How many permutations are there of the word Mississippi?) If this is new to you I recommend reading the section titled Combinatorial Arguments on page 208.
13 Example 1 Imagine a piece of graph paper. Starting at the origin draw a path to the point (10, 10) that stays on the grid lines (which are one unit apart) and has a total length of 20. For example, one path is to go from (0, 0) to (0, 7) to (4, 7) to (4, 10) to (10, 10). Another path goes from (0, 0) to (10, 0) to (10, 10). How many possible different paths are there?
14 Solution Each path can be completely described by a 20-letter sequence of U s and R s, where U means move one unit up and R means move one unit to the right. For example, the path that goes from (0, 0) to (0, 7) to (4, 7) to (4, 10) to (10, 10) would be described by the string UUUUUUURRRRUUURRRRRR. So each path is just a permutation of that word.
15 Solution Each path can be completely described by a 20-letter sequence of U s and R s, where U means move one unit up and R means move one unit to the right. For example, the path that goes from (0, 0) to (0, 7) to (4, 7) to (4, 10) to (10, 10) would be described by the string UUUUUUURRRRUUURRRRRR. So each path is just a permutation of that word. Using the Mississippi formula we have that the answer is 20! 10!10!.
16 Example 2 How many different ordered triples (a, b, c) of non-negative integers are there such that a + b + c = 50?
17 Solution 1 First we note that if a + b + c = 50 then 0 c 50. So we have solutions where c = 0 or c = 1 or,..., or c = 50. So we want the sum of solutions for each case. So how many values are there for a and b if c = n. In this case a + b = 50 n so 0 a 50 n and for each a there is exactly 1 b where b = 50 n a.
18 Solution 1 First we note that if a + b + c = 50 then 0 c 50. So we have solutions where c = 0 or c = 1 or,..., or c = 50. So we want the sum of solutions for each case. So how many values are there for a and b if c = n. In this case a + b = 50 n so 0 a 50 n and for each a there is exactly 1 b where b = 50 n a. So let s say that C i = {(a, b) : a + b + i = 50} and we have found that C i = 50 i + 1 (the amount of values that a can be). So the amount of solutions are C 0 + C C 50 = = (51 + 1) + (50 + 2) + (49 + 3) ( ) = 2
19 Solution 2 Before we solve for 50 let s try a smaller number like 11. Recall how we first learned about addition in first or second grade. You practiced sums like = 11 by drawing sequences of dots: + + =. Each ordered triple (a, b, c) that add to 11 can be thought of as such a string of 11, s and 2 + s. So all we have to count is the amount of strings like this, ie the permutations.
20 Solution 2 Before we solve for 50 let s try a smaller number like 11. Recall how we first learned about addition in first or second grade. You practiced sums like = 11 by drawing sequences of dots: + + =. Each ordered triple (a, b, c) that add to 11 can be thought of as such a string of 11, s and 2 + s. So all we have to count is the amount of strings like this, ie the permutations. By using the Mississippi formula we get the amount of permutations are 13! 11!2! = ( ) 13. 2
21 Solution 2 Before we solve for 50 let s try a smaller number like 11. Recall how we first learned about addition in first or second grade. You practiced sums like = 11 by drawing sequences of dots: + + =. Each ordered triple (a, b, c) that add to 11 can be thought of as such a string of 11, s and 2 + s. So all we have to count is the amount of strings like this, ie the permutations. By using the Mississippi formula we get the amount of permutations are 13! 11!2! = ( ) So returning to the actual problem at hand we have a string that is 52 characters long and has 50 s. So we have the number of permutations is ( 52 2 ).
22 The Balls in Urns Formula This last way of solving a problem is a useful general tool which we call the balls in urns formula which is simply stated The number of different ways we can place b indistinguishable balls into u distinguishable urns is ( ) b+u 1 b or in other words the amount of permutations of a string with b s and u 1 s.
23 Example 3 Let us say that 2 ten digit numbers are sisters if they can be obtained from one another by reordering the digits. And further let us call a set that is as large as possible whose elements are all sisters a sorority. For example, 1, 111, 233, 999 and 9, 929, 313, 111 are sisters who belong to a sorority with 10! 4!3!2!, since the membership of the sorority is just the number of ways of permuting the digits. (we will allow in numbers with leading zeroes into these sororities). The sororities have vastly different sizes. The most exclusive sororities have 1 member (for example, the sorority consisting entirely of 6, 666, 666, 666) yet one sorority has 10! members (the one containing 1, 234, 567, 890). How many sororities are there among the 10 digit numbers?
24 Solution We note that each sorority is uniquely determined by its collection of 10 digits repetition is allowed. For example one sorority can be named ten 6 s, while another is called three 4 s, one 7, two 8 s, and four 9 s.
25 Solution We note that each sorority is uniquely determined by its collection of 10 digits repetition is allowed. For example one sorority can be named ten 6 s, while another is called three 4 s, one 7, two 8 s, and four 9 s. So really each sorority is determined by how many of each digit is has; or in other how many balls it has in each digit urn.
26 Solution We note that each sorority is uniquely determined by its collection of 10 digits repetition is allowed. For example one sorority can be named ten 6 s, while another is called three 4 s, one 7, two 8 s, and four 9 s. So really each sorority is determined by how many of each digit is has; or in other how many balls it has in each digit urn. So since there are 10 urns (0, 1, 2, 3, 4, 5, 6, 7, 8, 9) and 10 balls we have that the amount of sororities is ( 19 9 ).
27 Sample problem 1 A (female) contestant on a game show is shown three doors by the (male) host. Behind one of these there is a car, and behind each of the other two there is a goat. She chooses one of the doors, hoping of course to get the car. Before the door is opened, the host (who knows what s behind each door) opens one of the remaining two doors to reveal a goat. At this point he offers her the chance to switch her choice if she so wishes. Should she switch, and if so, how does that change the probability of winning a car?
28 Sample problem 2 You are given one true or false question on a test. If you get the question right, your final mark is increased by one percent, but if you get the question wrong, your final mark is decreased by one percent. You can guess, or you can copy from your neighbour, but you know from experience that you you neighbour answers incorrectly 20% of the time. Besides, there is a 10% chance that the teacher would catch you cheating, and in this case, she would deduct five percent from your final mark. Moral issues aside what should you do: copy from your neighbour, or randomly guess on the question?
29 Sample problem 3 Two players alternately shoot themselves with a six-shooter, only one chamber of which contains a bullet. (This is called Russian Roulette). You have the first shot, so you decide the rules. Either both players take turns shooting the next chamber, or both players randomly spin the chamber before shooting. Naturally, you want to maximize your chances of surviving. Should you spin first and shoot, or shoot without spinning?
30 Sample problem 4 Alison, Bernon, and Chantel play the following game. They take turns (in the order A, B, C, A, B, C,...) rolling one die. Alison wins if she rolls 1, 2, or 3 on her turn. Bernon wins if he rolls 4 or 5 on his turn. Chantel wins if she rolls 6 on her turn. They keep repeating this until there is a winner. What is the probability that Alison wins the game? For example if Alison rolls a 5 then it is Bernon s turn. Say her rolls a 6. Then it s Chantel s turn. Say she rolls 6. Then Chantel wins.
Math Steven Noble. November 24th. Steven Noble Math 3790
Math 3790 Steven Noble November 24th The Rules of Craps In the game of craps you roll two dice then, if the total is 7 or 11, you win, if the total is 2, 3, or 12, you lose, In the other cases (when the
More informationThe Fundamental Counting Principle & Permutations
The Fundamental Counting Principle & Permutations POD: You have 7 boxes and 10 balls. You put the balls into the boxes. How many boxes have more than one ball? Why do you use a fundamental counting principal?
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 informationCHAPTER 8 Additional Probability Topics
CHAPTER 8 Additional Probability Topics 8.1. Conditional Probability Conditional probability arises in probability experiments when the person performing the experiment is given some extra information
More informationSection Summary. Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning
Section 7.1 Section Summary Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning Probability of an Event Pierre-Simon Laplace (1749-1827) We first study Pierre-Simon
More informationStrings. A string is a list of symbols in a particular order.
Ihor Stasyuk Strings A string is a list of symbols in a particular order. Strings A string is a list of symbols in a particular order. Examples: 1 3 0 4 1-12 is a string of integers. X Q R A X P T is a
More information12.1 The Fundamental Counting Principle and Permutations
12.1 The Fundamental Counting Principle and Permutations The Fundamental Counting Principle Two Events: If one event can occur in ways and another event can occur in ways then the number of ways both events
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 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 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 informationCase 1: If Denver is the first city visited, then the outcome looks like: ( D ).
2.37. (a) Think of each city as an object. Each one is distinct. Therefore, there are 6! = 720 different itineraries. (b) Envision the process of selecting an itinerary as a random experiment with sample
More informationCourse Learning Outcomes for Unit V
UNIT V STUDY GUIDE Counting Reading Assignment See information below. Key Terms 1. Combination 2. Fundamental counting principle 3. Listing 4. Permutation 5. Tree diagrams Course Learning Outcomes for
More informationW = {Carrie (U)nderwood, Kelly (C)larkson, Chris (D)aughtry, Fantasia (B)arrino, and Clay (A)iken}
UNIT V STUDY GUIDE Counting Course Learning Outcomes for Unit V Upon completion of this unit, students should be able to: 1. Apply mathematical principles used in real-world situations. 1.1 Draw tree diagrams
More informationJunior Circle Meeting 5 Probability. May 2, ii. In an actual experiment, can one get a different number of heads when flipping a coin 100 times?
Junior Circle Meeting 5 Probability May 2, 2010 1. We have a standard coin with one side that we call heads (H) and one side that we call tails (T). a. Let s say that we flip this coin 100 times. i. How
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 informationProbability and Counting Techniques
Probability and Counting Techniques Diana Pell (Multiplication Principle) Suppose that a task consists of t choices performed consecutively. Suppose that choice 1 can be performed in m 1 ways; for each
More informationGeneralized Permutations and The Multinomial Theorem
Generalized Permutations and The Multinomial Theorem 1 / 19 Overview The Binomial Theorem Generalized Permutations The Multinomial Theorem Circular and Ring Permutations 2 / 19 Outline The Binomial Theorem
More informationAlgebra 2 Notes Section 10.1: Apply the Counting Principle and Permutations
Algebra 2 Notes Section 10.1: Apply the Counting Principle and Permutations Objective(s): Vocabulary: I. Fundamental Counting Principle: Two Events: Three or more Events: II. Permutation: (top of p. 684)
More informationFundamental Counting Principle
Lesson 88 Probability with Combinatorics HL2 Math - Santowski Fundamental Counting Principle Fundamental Counting Principle can be used determine the number of possible outcomes when there are two or more
More informationCounting Methods and Probability
CHAPTER Counting Methods and Probability Many good basketball players can make 90% of their free throws. However, the likelihood of a player making several free throws in a row will be less than 90%. You
More informationThe Teachers Circle Mar. 20, 2012 HOW TO GAMBLE IF YOU MUST (I ll bet you $5 that if you give me $10, I ll give you $20.)
The Teachers Circle Mar. 2, 22 HOW TO GAMBLE IF YOU MUST (I ll bet you $ that if you give me $, I ll give you $2.) Instructor: Paul Zeitz (zeitzp@usfca.edu) Basic Laws and Definitions of Probability If
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 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 informationObjectives: Permutations. Fundamental Counting Principle. Fundamental Counting Principle. Fundamental Counting Principle
and Objectives:! apply fundamental counting principle! compute permutations! compute combinations HL2 Math - Santowski! distinguish permutations vs combinations can be used determine the number of possible
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 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 informationWeek in Review #5 ( , 3.1)
Math 166 Week-in-Review - S. Nite 10/6/2012 Page 1 of 5 Week in Review #5 (2.3-2.4, 3.1) n( E) In general, the probability of an event is P ( E) =. n( S) Distinguishable Permutations Given a set of n objects
More informationLecture 2: Sum rule, partition method, difference method, bijection method, product rules
Lecture 2: Sum rule, partition method, difference method, bijection method, product rules References: Relevant parts of chapter 15 of the Math for CS book. Discrete Structures II (Summer 2018) Rutgers
More informationIntroduction to Mathematical Reasoning, Saylor 111
Here s a game I like plying with students I ll write a positive integer on the board that comes from a set S You can propose other numbers, and I tell you if your proposed number comes from the set Eventually
More information19.2 Permutations and Probability
Name Class Date 19.2 Permutations and Probability Essential Question: When are permutations useful in calculating probability? Resource Locker Explore Finding the Number of Permutations A permutation is
More informationAlgebra II- Chapter 12- Test Review
Sections: Counting Principle Permutations Combinations Probability Name Choose the letter of the term that best matches each statement or phrase. 1. An illustration used to show the total number of A.
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Lecture Notes Counting 101 Note to improve the readability of these lecture notes, we will assume that multiplication takes precedence over division, i.e. A / B*C
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 informationCPCS 222 Discrete Structures I Counting
King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222 Discrete Structures I Counting Dr. Eng. Farag Elnagahy farahelnagahy@hotmail.com Office Phone: 67967 The Basics of counting
More informationHow can I count arrangements?
10.3.2 How can I count arrangements? Permutations There are many kinds of counting problems. In this lesson you will learn to recognize problems that involve arrangements. In some cases outcomes will be
More informationThe study of probability is concerned with the likelihood of events occurring. Many situations can be analyzed using a simplified model of probability
The study of probability is concerned with the likelihood of events occurring Like combinatorics, the origins of probability theory can be traced back to the study of gambling games Still a popular branch
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 informationn r for the number. (n r)!r!
Throughout we use both the notations ( ) n r and C n n! r for the number (n r)!r! 1 Ten points are distributed around a circle How many triangles have all three of their vertices in this 10-element set?
More informationIn this section, we will learn to. 1. Use the Multiplication Principle for Events. Cheesecake Factory. Outback Steakhouse. P.F. Chang s.
Section 10.6 Permutations and Combinations 10-1 10.6 Permutations and Combinations In this section, we will learn to 1. Use the Multiplication Principle for Events. 2. Solve permutation problems. 3. Solve
More informationWeek 6: Advance applications of the PIE. 17 and 19 of October, 2018
(1/22) MA284 : Discrete Mathematics Week 6: Advance applications of the PIE http://www.maths.nuigalway.ie/ niall/ma284 17 and 19 of October, 2018 1 Stars and bars 2 Non-negative integer inequalities 3
More information2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC)
2. Combinatorics: the systematic study of counting The Basic Principle of Counting (BPC) Suppose r experiments will be performed. The 1st has n 1 possible outcomes, for each of these outcomes there are
More information3 The multiplication rule/miscellaneous counting problems
Practice for Exam 1 1 Axioms of probability, disjoint and independent events 1. Suppose P (A) = 0.4, P (B) = 0.5. (a) If A and B are independent, what is P (A B)? What is P (A B)? (b) If A and B are disjoint,
More informationPermutations. and. Combinations
Permutations and Combinations Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another independent event has n possible outcomes, then there
More information(a) Suppose you flip a coin and roll a die. Are the events obtain a head and roll a 5 dependent or independent events?
Unit 6 Probability Name: Date: Hour: Multiplication Rule of Probability By the end of this lesson, you will be able to Understand Independence Use the Multiplication Rule for independent events Independent
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 informationRaise your hand if you rode a bus within the past month. Record the number of raised hands.
166 CHAPTER 3 PROBABILITY TOPICS Raise your hand if you rode a bus within the past month. Record the number of raised hands. Raise your hand if you answered "yes" to BOTH of the first two questions. Record
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 informationCSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions)
CSE 31: Foundations of Computing II Quiz Section #: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions) Review: Main Theorems and Concepts Binomial Theorem: x, y R, n N: (x + y) n
More informationCS 361: Probability & Statistics
February 7, 2018 CS 361: Probability & Statistics Independence & conditional probability Recall the definition for independence So we can suppose events are independent and compute probabilities Or we
More informationStatistics Intermediate Probability
Session 6 oscardavid.barrerarodriguez@sciencespo.fr April 3, 2018 and Sampling from a Population Outline 1 The Monty Hall Paradox Some Concepts: Event Algebra Axioms and Things About that are True Counting
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 informationChapter 3: Probability (Part 1)
Chapter 3: Probability (Part 1) 3.1: Basic Concepts of Probability and Counting Types of Probability There are at least three different types of probability Subjective Probability is found through people
More informationIn how many ways can the letters of SEA be arranged? In how many ways can the letters of SEE be arranged?
-Pick up Quiz Review Handout by door -Turn to Packet p. 5-6 In how many ways can the letters of SEA be arranged? In how many ways can the letters of SEE be arranged? - Take Out Yesterday s Notes we ll
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 informationChapter 7. Intro to Counting
Chapter 7. Intro to Counting 7.7 Counting by complement 7.8 Permutations with repetitions 7.9 Counting multisets 7.10 Assignment problems: Balls in bins 7.11 Inclusion-exclusion principle 7.12 Counting
More informationCS1802 Week 9: Probability, Expectation, Entropy
CS02 Discrete Structures Recitation Fall 207 October 30 - November 3, 207 CS02 Week 9: Probability, Expectation, Entropy Simple Probabilities i. What is the probability that if a die is rolled five times,
More informationBusiness Statistics. Chapter 4 Using Probability and Probability Distributions QMIS 120. Dr. Mohammad Zainal
Department of Quantitative Methods & Information Systems Business Statistics Chapter 4 Using Probability and Probability Distributions QMIS 120 Dr. Mohammad Zainal Chapter Goals After completing this chapter,
More informationWeek 3 Classical Probability, Part I
Week 3 Classical Probability, Part I Week 3 Objectives Proper understanding of common statistical practices such as confidence intervals and hypothesis testing requires some familiarity with probability
More informationMAT 17: Introduction to Mathematics Final Exam Review Packet. B. Use the following definitions to write the indicated set for each exercise below:
MAT 17: Introduction to Mathematics Final Exam Review Packet A. Using set notation, rewrite each set definition below as the specific collection of elements described enclosed in braces. Use the following
More informationFinite Math B, Chapter 8 Test Review Name
Finite Math B, Chapter 8 Test Review Name Evaluate the factorial. 1) 6! A) 720 B) 120 C) 360 D) 1440 Evaluate the permutation. 2) P( 10, 5) A) 10 B) 30,240 C) 1 D) 720 3) P( 12, 8) A) 19,958,400 B) C)
More informationChapter 11: Probability and Counting Techniques
Chapter 11: Probability and Counting Techniques Diana Pell Section 11.1: The Fundamental Counting Principle Exercise 1. How many different two-letter words (including nonsense words) can be formed when
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 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 informationSTATION 1: ROULETTE. Name of Guesser Tally of Wins Tally of Losses # of Wins #1 #2
Casino Lab 2017 -- ICM The House Always Wins! Casinos rely on the laws of probability and expected values of random variables to guarantee them profits on a daily basis. Some individuals will walk away
More informationMixed Counting Problems
We have studied a number of counting principles and techniques since the beginning of the course and when we tackle a counting problem, we may have to use one or a combination of these principles. The
More information, x {1, 2, k}, where k > 0. (a) Write down P(X = 2). (1) (b) Show that k = 3. (4) Find E(X). (2) (Total 7 marks)
1. The probability distribution of a discrete random variable X is given by 2 x P(X = x) = 14, x {1, 2, k}, where k > 0. Write down P(X = 2). (1) Show that k = 3. Find E(X). (Total 7 marks) 2. In a game
More informationMath 1342 Exam 2 Review
Math 1342 Exam 2 Review SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. 1) If a sportscaster makes an educated guess as to how well a team will do this
More informationSome Unusual Applications of Math
Some Unusual Applications of Math Ron Gould Emory University Supported by Heilbrun Distinguished Emeritus Fellowship October 7, 2017 Game 1 - Three Card Game The Tools: A man has three cards, one red on
More informationUnit 5, Activity 1, The Counting Principle
Unit 5, Activity 1, The Counting Principle Directions: With a partner find the answer to the following problems. 1. A person buys 3 different shirts (Green, Blue, and Red) and two different pants (Khaki
More informationInternational Contest-Game MATH KANGAROO Canada, 2007
International Contest-Game MATH KANGAROO Canada, 007 Grade 9 and 10 Part A: Each correct answer is worth 3 points. 1. Anh, Ben and Chen have 30 balls altogether. If Ben gives 5 balls to Chen, Chen gives
More informationMath 1313 Section 6.2 Definition of Probability
Math 1313 Section 6.2 Definition of Probability Probability is a measure of the likelihood that an event occurs. For example, if there is a 20% chance of rain tomorrow, that means that the probability
More informationDuke Math Meet Individual Round
1. Trung has 2 bells. One bell rings 6 times per hour and the other bell rings 10 times per hour. At the start of the hour both bells ring. After how much time will the bells ring again at the same time?
More informationCH 13. Probability and Data Analysis
11.1: Find Probabilities and Odds 11.2: Find Probabilities Using Permutations 11.3: Find Probabilities Using Combinations 11.4: Find Probabilities of Compound Events 11.5: Analyze Surveys and Samples 11.6:
More informationPermutations And Combinations Questions Answers
We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with permutations and combinations
More informationProbability. March 06, J. Boulton MDM 4U1. P(A) = n(a) n(s) Introductory Probability
Most people think they understand odds and probability. Do you? Decision 1: Pick a card Decision 2: Switch or don't Outcomes: Make a tree diagram Do you think you understand probability? Probability Write
More informationEmpirical (or statistical) probability) is based on. The empirical probability of an event E is the frequency of event E.
Probability and Statistics Chapter 3 Notes Section 3-1 I. Probability Experiments. A. When weather forecasters say There is a 90% chance of rain tomorrow, or a doctor says There is a 35% chance of a successful
More informationChapter 11: Probability and Counting Techniques
Chapter 11: Probability and Counting Techniques Diana Pell Section 11.3: Basic Concepts of Probability Definition 1. A sample space is a set of all possible outcomes of an experiment. Exercise 1. An experiment
More informationthe largest sum of three numbers whose faces come together at a corner?
Question 1 The following figure may be folded along the lines shown to form a number cube. What is the largest sum of three numbers whose faces come together at a corner? Question 1 The following figure
More informationDistinguishable Boxes
Math 10B with Professor Stankova Worksheet, Discussion #5; Thursday, 2/1/2018 GSI name: Roy Zhao Distinguishable Boxes Examples 1. Suppose I am catering from Yali s and want to buy sandwiches to feed 60
More information3 The multiplication rule/miscellaneous counting problems
Practice for Exam 1 1 Axioms of probability, disjoint and independent events 1 Suppose P (A 0, P (B 05 (a If A and B are independent, what is P (A B? What is P (A B? (b If A and B are disjoint, what is
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 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 informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 11
EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 11 Counting As we saw in our discussion for uniform discrete probability, being able to count the number of elements of
More informationProbability and the Monty Hall Problem Rong Huang January 10, 2016
Probability and the Monty Hall Problem Rong Huang January 10, 2016 Warm-up: There is a sequence of number: 1, 2, 4, 8, 16, 32, 64, How does this sequence work? How do you get the next number from the previous
More informationProbability Concepts and Counting Rules
Probability Concepts and Counting Rules Chapter 4 McGraw-Hill/Irwin Dr. Ateq Ahmed Al-Ghamedi Department of Statistics P O Box 80203 King Abdulaziz University Jeddah 21589, Saudi Arabia ateq@kau.edu.sa
More informationExam 2 Review F09 O Brien. Finite Mathematics Exam 2 Review
Finite Mathematics Exam Review Approximately 5 0% of the questions on Exam will come from Chapters, 4, and 5. The remaining 70 75% will come from Chapter 7. To help you prepare for the first part of the
More informationAdvanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY
Advanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY 1. Jack and Jill do not like washing dishes. They decide to use a random method to select whose turn it is. They put some red and blue
More information2 A fair coin is flipped 8 times. What is the probability of getting more heads than tails? A. 1 2 B E. NOTA
For all questions, answer E. "NOTA" means none of the above answers is correct. Calculator use NO calculators will be permitted on any test other than the Statistics topic test. The word "deck" refers
More informationFinite Mathematics MAT 141: Chapter 8 Notes
Finite Mathematics MAT 4: Chapter 8 Notes Counting Principles; More David J. Gisch The Multiplication Principle; Permutations Multiplication Principle Multiplication Principle You can think of the multiplication
More informationProbability and Statistics - Grade 5
Probability and Statistics - Grade 5. If you were to draw a single card from a deck of 52 cards, what is the probability of getting a card with a prime number on it? (Answer as a reduced fraction.) 2.
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 informationUsing Technology to Conduct a Simulation. ESSENTIAL QUESTION How can you use technology simulations to estimate probabilities?
? LESSON 6.4 Designing and Conducting a Simulation for a Simple Event You can use a graphing calculator or computer to generate random numbers and conduct a simulation. EXAMPLE 1 Using Technology to Conduct
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 informationFoundations to Algebra In Class: Investigating Probability
Foundations to Algebra In Class: Investigating Probability Name Date How can I use probability to make predictions? Have you ever tried to predict which football team will win a big game? If so, you probably
More informationMath 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing May 8, 2017 May 8, 2017 1 / 15 Extensive Form: Overview We have been studying the strategic form of a game: we considered only a player s overall strategy,
More informationWelcome! Worksheet Counting Principal, Permutations, Combinations. Updates: U4T is 12/12
Welcome! U4H1: Worksheet Counting Principal, Permutations, Combinations Updates: U4T is 12/12 Announcement: December 16 th is the last day I will accept late work. No new assignment list since this section
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 information* Order Matters For Permutations * Section 4.6 Permutations MDM4U Jensen. Part 1: Factorial Investigation
Section 4.6 Permutations MDM4U Jensen Part 1: Factorial Investigation You are trying to put three children, represented by A, B, and C, in a line for a game. How many different orders are possible? a)
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #22: Generalized Permutations and Combinations Based on materials developed by Dr. Adam Lee Counting
More informationProbability Paradoxes
Probability Paradoxes Washington University Math Circle February 20, 2011 1 Introduction We re all familiar with the idea of probability, even if we haven t studied it. That is what makes probability so
More information