elements in S. It can tricky counting up the numbers of
|
|
- Vanessa Long
- 5 years ago
- Views:
Transcription
1 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 have P( E) elements in E elements in S. It can tricky counting up the numbers of elements in E and S. For example, S might consist of all the five-card poker hands. There are many probability notions that depend on the ability to count. We ll do this quickly, as we can get easily distracted by all the difficulties. The number of ways to arrange n things in sequence is n! 3 n. This gets the name permutation. For instance, 4! 4, and here are the ways to arrange 4 books (A, B, C, and D) on a shelf: ABCD BACD CABD DABC ABDC BADC CADB DACB ACBD BCAD CBAD DBAC ACDB BCDA CBDA DBCA ADBC BDAC CDAB DCAB ADCB BDCA CDBA DCBA The list above gives all permutations of the letters A, B, C, D. There are 5! 0 arrangements of five letters, 6! 70 arrangements of six letters, 7! 5,040 arrangements of seven letters, and so on.
2 You can show easily that n! n (n - )! and then you get quickly to!! 3! 6 4! 4 5! 0 6! 70 7! 5,040 8! 40,30 and so on. The value 68! can be made to appear on (some) calculators that have a factorial key, but 69! cannot. This says merely that 68! < 0 00 < 69! The number 0 00 is called a googol. (The Web browser is Google.) Example: Five people go to a restaurant and check their coats. At the end of the meal, the five coats are given out at random. What is the probability that all five get the correct coat? Assuming that all assignments of coats to people is equally likely, there are 5! ways to give the coats out, and only one of these is correct. The probability must be 5! Think of the people as A, B, C, D, and E. Suppose that their coats have the corresponding names α, β, γ, δ, and ε. Imagine that the people line up in some random arrangement of the Roman letters and that the coats are given out in the order α, β, γ, δ, and ε. If the people line up as A, E, C, D, B, then A and D will get their own coats, while the others are mixed up. You might observe here that we ve established a procedure for giving out the coats (fixed order α through ε) and put the randomness on the way in which the people line up. We could also have said that the people line up in order A through E and at each step a coat is selected at random. We could also have said that the coats were matched with their check tickets (A with α,, E with ε) and that the tickets were given randomly to the five people. All these thought games will produce the same solution.
3 For n coats and n people, the probability that all coats are given out to the correct owners, the probability is n!. The probability that exactly n of the n people get the correct count must be zero. (They can t all match, except for one!) All other probabilities are complicated to compute. For factorials, we will need the side agreement that 0!. The number of ways to place n things in order is n!. The number of ways to n!. n r! place in order r things selected out of n works out to ( ) Try this out for a situation in which you get to taste three tapioca puddings out of eight. The order of tasting is generally considered relevant. You have 8 choices for the first tapioca pudding. Thereafter, you have 7 choices for the second and 6 choices for the third. You have possible orderings. This is the start of the calculation of 8!, but the factors 5, 4, 3,, do not appear. This illustrates the result above with n 8, r 3, n - r 5, and ! 5! More common than this, however, is the need to count the number of ways to select without regard to order. Examples of such problems are these: How many ways can four cheeses (out of available) be selected for serving at a party? How many ways can three utility companies (out of available) be selected for inclusion in a balanced mutual fund? How many ways can three people (out of 5) from a board of directors be chosen to form a subcommittee? Let s consider the last situation. Suppose that we selected first in order. There are 5 ways to pick the first person. Following that, there are 4 ways to select the second person. Finally there are 3 ways to select the third person. All in all, there are 5 4 3,730 ways to select the three people, in order. However, the committee chosen as DKB is indistinguishable from KBD or DBK. Indeed, 3
4 we have overcounted by a multiple of 3! 6. The final number of ways is, In formula layout, we would say that the number of ways of selecting r things out of n, without regard to order, is given as n choose r combinations of n things, r at a time n C r n! r! n r! ( ) binomial coefficient, n choose r r The notation is probably most common. This is sometimes also called a r binomial coefficient, based on the interesting result (a + b) n n a r b n r r 0 r. Here s a simple version of this with n 4. We ll note that 0, 4, 6, 3 4, 4 Then note that (a + b) 4 4 r 4 r a b r 0 r a b a b a b a b a b b + 4 b a + 6 b a + 4 ba + a. n Practical tips to calculating? It really helps to use. This says r n r that the number of ways to select the r things you want is equal to the number of ways of discarding the n r things you don t want. For example, 0 7 F 0 3 I HG K J
5 F I HG 8 K J There are some quick facts that are helpful. Note that for any 0 n positive integer n. This is consistent with our previous definitions. It also uses 0!. ( ) n n Sometimes we need n and. You might conceptualize as the number of handshakes is a room with n people. It s also the number of lines that could be used to connect n points. It s also the maximum possible number of two-person links in a social network with n people. Sometimes the binomial coefficients are related to Pascal s triangle. This is it: This continues indefinitely. The first line starts with a pair of s, and each following number is the sum of the ones above it. This pattern gives binomial coefficients. For the display above, this is 5
6 Let s call the top row as row. It has two entries. The next row will be row, with three entries. Label the positions within rows as 0,,, then (row n, position r) holds value r. The total of row n is n. For instance, the total of row 3 is This is just an instance of the 0 3 binomial theorem: n ( + ) n n j n j j 0 j n j 0 j The general form of the binomial theorem is (a + b) n a b n j n j j 0 j. The rule that defines the triangle is n n + j j j For example, This is
7 You can think of this result as ways of counting up people for a committee. n n j + j j { 3 3 number of committees number of committees with number of committees with of j out of n people Fred and j other people j people (and no Fred) The outermost diagonals of this display are stripes of s. The next diagonals give the integer sequences,, 3, 4,. The diagonals that follow are, 3, 6, 0, 5,, These are the triangle numbers. For instance, 3 is the number of dots in the display. Then 6 is the number of dots in the display and 0 is the number of dots in You can show easily that T n n th triangle number ( n+ ). n, but this is n + Similar geometric stories can be constructed for the next diagonal. It would be foolish in the extreme to use the triangle to compute binomial coefficients. Just imagine how much clerical work would be needed to get something like. The routine arithmetic on this is, and this simplifies quickly to 5,504. 7
8 Suppose that a political committee has 8 Democrats and 6 Republicans. You wish to select a subcommittee with 3 Democrats and Republicans. The number of 8 ways of selecting 3 of the 8 Democrats is The number of 3 6 ways of selecting of the 6 Republicans is Overall, the number of ways of making the selections together is (We multiply here because each selection for the three Democrats can be matched with each selection for the two Republicans.) Suppose that the subcommittee of five were actually selected at random, without regard to party. The number of such selections would be ,00, and each would be equally likely The probability that by chance alone the subcommittee would have three 840 Democrats and two Republicans is then 0.496, around 4%.,00 This type of logic will become the basis of the hypergeometric distribution, which we will see again. The probability of getting three Democrats and two Republicans by chance is about 4%. Could you have made an approximate guess at this number? Yes, and here s how. Let s describe the situation through the number of Democrats turning up in this group of 5. The possible values are {0,,, 3, 4, 5}. The probabilities associated with these six outcomes must sum to 00%. Thus, we start with 00% 7% as a starting guess. We would shrink this for the 6 unlikely events (say 0 and 6) and we would enlarge it a lot for the likely events (say and 3). You may not come up with 4% as your guess, but you should be somewhere between 30% and 50%. 8
Permutations 5/5/2010. Lesson Objectives. Fundamental Counting Theorem. Fundamental Counting Theorem EXAMPLE 1 EXAMPLE 1
1 2 Lesson Objectives S10.2 Use the Fundamental Counting Principle to determine the number of outcomes in a problem. Use the idea of permutations to count the number of possible outcomes in a problem.
More informationCh 9.6 Counting, Permutations, and Combinations LESSONS
Ch 9.6 Counting, Permutations, and Combinations SKILLS OBJECTIVES Apply the fundamental counting principle to solve counting problems. Apply permutations to solve counting problems. Apply combinations
More informationS10.2 Math 2 Honors - Santowski 6/1/2011 1
S10.2 1 Use the Fundamental Counting Principle to determine the number of outcomes in a problem. Use the idea of permutations to count the number of possible outcomes in a problem. 2 It will allow us to
More informationDate Topic Notes Questions 4-8
These Combinatorics NOTES Belong to: Date Topic Notes Questions 1. Chapter Summary 2,3 2. Fundamental Counting Principle 4-8 3. Permutations 9-13 4. Permutations 14-17 5. Combinations 18-22 6. Combinations
More informationCombinatorial Choreography
Bridges 2012: Mathematics, Music, Art, Architecture, Culture Combinatorial Choreography Tom Verhoeff Department of Mathematics and Computer Science Eindhoven University of Technology Den Dolech 2, 5612
More informationChapter Possibilities: goes to bank, gets money from parent, gets paid; buys lunch, goes shopping, pays a bill,
1.1.1: Chapter 1 1-3. Shapes (a), (c), (d), and (e) are rectangles. 1-4. a: 40 b: 6 c: 7 d: 59 1-5. a: y = x + 3 b: y =!x 2 c: y = x 2 + 3 d: y = 3x! 1 1-6. a: 22a + 28 b:!23x! 17 c: x 2 + 5x d: x 2 +
More informationOrganization in Mathematics
Organization in Mathematics Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November 17, 2015 1 Introduction When faced with a difficult mathematical problem, one good strategy is
More informationCOMBINATORICS 2. Recall, in the previous lesson, we looked at Taxicabs machines, which always took the shortest path home
COMBINATORICS BEGINNER CIRCLE 1/0/013 1. ADVANCE TAXICABS Recall, i the previous lesso, we looked at Taxicabs machies, which always took the shortest path home taxipath We couted the umber of ways that
More informationBook 9: Puzzles and Games
Math 11 Recreation and Wellness Book 9: Puzzles and Games Name: Start Date: Completion Date: Year Overview: Earning and Spending Money Home Travel and Transportation Recreation and Wellness 1. Earning
More informationMath 167 Ch 9 Review 1 (c) Janice Epstein
Math 167 Ch 9 Review 1 (c) Janice Epstein CHAPTER 9 VOTING Plurality Method: Each voter votes for one candidate. The candidate with the most votes is the winner. Majority Rule: Each voter votes for one
More informationBook 9: Puzzles and Games
Math 11 Recreation and Wellness Book 9: Puzzles and Games Teacher Version Assessments and Answers Included Year Overview: Earning and Spending Money Home Travel and Transportation Recreation and Wellness
More informationProbability and Random Processes ECS 315
Probability and Random Processes ECS 315 Asst. Prof. Dr. Prapun Suksompong prapun@siit.tu.ac.th 4 Combinatorics 1 Office Hours: BKD, 6th floor of Sirindhralai building Tuesday 9:00-10:00 Wednesday 14:20-15:20
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 informationNINJA CHALLENGE INSTRUCTIONS CONTENTS
6+ COMPLIANCE WITH FCC REGULATIONS (VALID IN U.S. ONLY) This device complies with part 15 of the FCC Rules. Operation is subject to the following two conditions: (1) This device may not cause harmful interference,
More informationIntroductory Probability
Introductory Probability Combinations Nicholas Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK Agenda Assigning Objects to Identical Positions Denitions Committee Card Hands Coin Toss Counts
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 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 informationP R O B A B I L I T Y M A T H E M A T I C S
P R O B A B I L I T Y M A T H E M A T I C S A total of 15 cricketers comprised the Indian team for the ICC 2011 Cricket World Cup. Of these, 11 could play in the finals against Sri Lanka. How many different
More informationCS1800: Permutations & Combinations. Professor Kevin Gold
CS1800: Permutations & Combinations Professor Kevin Gold Permutations A permutation is a reordering of something. In the context of counting, we re interested in the number of ways to rearrange some items.
More informationIntroduction to Combinatorial Mathematics
Introduction to Combinatorial Mathematics George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 300 George Voutsadakis (LSSU) Combinatorics April 2016 1 / 97
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 informationMath 1111 Math Exam Study Guide
Math 1111 Math Exam Study Guide The math exam will cover the mathematical concepts and techniques we ve explored this semester. The exam will not involve any codebreaking, although some questions on the
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 informationSixth Grade Mental Math Test #1
Sixth Grade Mental Math Test #1 Question #1: What is the product of 0.1 times 0.2 times 0.3 times 0.4 times 0.5? Question #2: Zayn s age is twice Yolanda s age, and Yolanda s age is twice Xander s age.
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 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 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 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 informationIntroduction to Counting and Probability
Randolph High School Math League 2013-2014 Page 1 If chance will have me king, why, chance may crown me. Shakespeare, Macbeth, Act I, Scene 3 1 Introduction Introduction to Counting and Probability Counting
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 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 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 information10-1. Combinations. Vocabulary. Lesson. Mental Math. able to compute the number of subsets of size r.
Chapter 10 Lesson 10-1 Combinations BIG IDEA With a set of n elements, it is often useful to be able to compute the number of subsets of size r Vocabulary combination number of combinations of n things
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 informationProblem Set 2. Counting
Problem Set 2. Counting 1. (Blitzstein: 1, Q3 Fred is planning to go out to dinner each night of a certain week, Monday through Friday, with each dinner being at one of his favorite ten restaurants. i
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 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 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 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 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 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 informationSchool of Electrical, Electronic & Computer Engineering
School of Electrical, Electronic & Computer Engineering Fault Tolerant Techniques to Minimise the Impact of Crosstalk on Phase Basel Halak, Alex Yakovlev Technical Report Series NCL-EECE-MSD-TR-2006-115
More information6.4 Permutations and Combinations
Math 141: Business Mathematics I Fall 2015 6.4 Permutations and Combinations Instructor: Yeong-Chyuan Chung Outline Factorial notation Permutations - arranging objects Combinations - selecting objects
More informationUnit on Permutations and Combinations (Counting Techniques)
Page 1 of 15 (Edit by Y.M. LIU) Page 2 of 15 (Edit by Y.M. LIU) Unit on Permutations and Combinations (Counting Techniques) e.g. How many different license plates can be made that consist of three digits
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 information11.3B Warmup. 1. Expand: 2x. 2. Express the expansion of 2x. using combinations. 3. Simplify: a 2b a 2b
11.3 Warmup 1. Expand: 2x y 4 2. Express the expansion of 2x y 4 using combinations. 3 3 3. Simplify: a 2b a 2b 4. How many terms are there in the expansion of 2x y 15? 5. What would the 10 th term in
More information1. For which of the following sets does the mean equal the median?
1. For which of the following sets does the mean equal the median? I. {1, 2, 3, 4, 5} II. {3, 9, 6, 15, 12} III. {13, 7, 1, 11, 9, 19} A. I only B. I and II C. I and III D. I, II, and III E. None of the
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 informationSimple Counting Problems
Appendix F Counting Principles F1 Appendix F Counting Principles What You Should Learn 1 Count the number of ways an event can occur. 2 Determine the number of ways two or three events can occur using
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 informationAbout Permutations and Combinations: Examples
About Permutations and Combinations: Examples TABLE OF CONTENTS Basics... 1 Product Rule...1-2 Sum Rule...2 Permutations... 2-3 Combinations... 3-4 Pascal s Triangle... 4 Binomial Theorem.. 4 Pascal s
More informationUnit Nine Precalculus Practice Test Probability & Statistics. Name: Period: Date: NON-CALCULATOR SECTION
Name: Period: Date: NON-CALCULATOR SECTION Vocabulary: Define each word and give an example. 1. discrete mathematics 2. dependent outcomes 3. series Short Answer: 4. Describe when to use a combination.
More informationGAME THEORY, COMPLEXITY AND SIMPLICITY
1 July 8, 1997 GAME THEORY, COMPLEXITY AND SIMPLICITY Part I: A Tutorial The theory of games is now over 50 years old. Its applications and misapplications abound. It is now "respectable". Bright young
More informationOCR Statistics 1. Probability. Section 2: Permutations and combinations. Factorials
OCR Statistics Probability Section 2: Permutations and combinations Notes and Examples These notes contain subsections on Factorials Permutations Combinations Factorials An important aspect of life is
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 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 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 information5. (1-25 M) How many ways can 4 women and 4 men be seated around a circular table so that no two women are seated next to each other.
A.Miller M475 Fall 2010 Homewor problems are due in class one wee from the day assigned (which is in parentheses. Please do not hand in the problems early. 1. (1-20 W A boo shelf holds 5 different English
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 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 information13 Searching for Pattern
13 Searching for Pattern 13.1 Pictorial Logic In this section we will see how to continue patterns involving simple shapes. Example Continue these patterns by drawing the next 5 shapes in each case: Solution
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 informationTowards temporal logic computation using DNA strand displacement reactions
Towards temporal logic computation using DNA strand displacement reactions Matthew R. Lakin 1,2,3 and Darko Stefanovic 2,3 1 Department of Chemical & Biological Engineering, University of New Mexico, NM,
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. Chapter Permutations. Counting Problems
Chapter 3 Combinatorics 3.1 Permutations Many problems in probability theory require that we count the number of ways that a particular event can occur. For this, we study the topics of permutations and
More informationPrecalc Unit 10 Review
Precalc Unit 10 Review Name: Use binomial expansion to expand. 1. 2. 3.. Use binomial expansion to find the term you are asked for. 4. 5 th term of (4x-3y) 8 5. 3 rd term of 6. 4 th term of 7. 2 nd term
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 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 informationProbability of Derangements
Probability of Derangements Brian Parsonnet Revised Feb 21, 2011 bparsonnet@comcast.net Ft Collins, CO 80524 Brian Parsonnet Page 1 Table of Contents Introduction... 3 A136300... 7 Formula... 8 Point 1:
More informationFundamental. If one event can occur m ways and another event can occur n ways, then the number of ways both events can occur is:.
12.1 The Fundamental Counting Principle and Permutations Objectives 1. Use the fundamental counting principle to count the number of ways an event can happen. 2. Use the permutations to count the number
More information4.1 What is Probability?
4.1 What is Probability? between 0 and 1 to indicate the likelihood of an event. We use event is to occur. 1 use three major methods: 1) Intuition 3) Equally Likely Outcomes Intuition - prediction based
More informationMidterm 2 6:00-8:00pm, 16 April
CS70 2 Discrete Mathematics and Probability Theory, Spring 2009 Midterm 2 6:00-8:00pm, 16 April Notes: There are five questions on this midterm. Answer each question part in the space below it, using the
More informationLecture 18 - Counting
Lecture 18 - Counting 6.0 - April, 003 One of the most common mathematical problems in computer science is counting the number of elements in a set. This is often the core difficulty in determining a program
More informationSTAT Statistics I Midterm Exam One. Good Luck!
STAT 515 - Statistics I Midterm Exam One Name: Instruction: You can use a calculator that has no connection to the Internet. Books, notes, cellphones, and computers are NOT allowed in the test. There are
More informationPermutations and Combinations Practice Test
Name: Class: Date: Permutations and Combinations Practice Test Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Suppose that license plates in the fictional
More informationMidterm practice super-problems
Midterm practice super-problems These problems are definitely harder than the midterm (even the ones without ), so if you solve them you should have no problem at all with the exam. However be aware that
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 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 informationMultiple Choice Questions for Review
Review Questions Multiple Choice Questions for Review 1. Suppose there are 12 students, among whom are three students, M, B, C (a Math Major, a Biology Major, a Computer Science Major. We want to send
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 information7.4 Permutations and Combinations
7.4 Permutations and Combinations The multiplication principle discussed in the preceding section can be used to develop two additional counting devices that are extremely useful in more complicated counting
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 informationMath 447 Test 1 February 25, Spring 2016
Math 447 Test 1 February 2, Spring 2016 No books, no notes, only scientific (non-graphic calculators. You must show work, unless the question is a true/false or fill-in-the-blank question. Name: Question
More informationMath 1111 Math Exam Study Guide
Math 1111 Math Exam Study Guide The math exam will cover the mathematical concepts and techniques we ve explored this semester. The exam will not involve any codebreaking, although some questions on the
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 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 informationSequences. like 1, 2, 3, 4 while you are doing a dance or movement? Have you ever group things into
Math of the universe Paper 1 Sequences Kelly Tong 2017/07/17 Sequences Introduction Have you ever stamped your foot while listening to music? Have you ever counted like 1, 2, 3, 4 while you are doing a
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 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 informationACTIVITY 6.7 Selecting and Rearranging Things
ACTIVITY 6.7 SELECTING AND REARRANGING THINGS 757 OBJECTIVES ACTIVITY 6.7 Selecting and Rearranging Things 1. Determine the number of permutations. 2. Determine the number of combinations. 3. Recognize
More informationTOPIC 2: HOW TO COUNT
TOPIC 2: HOW TO COUNT Problems and solutions on 'How many ways?' (Combinatorics). These start with very simple situations and illustrate how the methods can be extended to more difficult cases. 2. How
More informationUNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST
UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST First Round For all Colorado Students Grades 7-12 October 31, 2009 You have 90 minutes no calculators allowed The average of n numbers is their sum divided
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 informationGMAT-Arithmetic-4. Counting Methods and Probability
GMAT-Arithmetic-4 Counting Methods and Probability Counting Methods: 1).A new flag with six vertical stripes is to be designed using some or all of the colours yellow, green, blue and red. The number of
More informationProbabilities and Probability Distributions
Probabilities and Probability Distributions George H Olson, PhD Doctoral Program in Educational Leadership Appalachian State University May 2012 Contents Basic Probability Theory Independent vs. Dependent
More informationPERMUTATIONS AND COMBINATIONS
PERMUTATIONS AND COMBINATIONS 1. Fundamental Counting Principle Assignment: Workbook: pg. 375 378 #1-14 2. Permutations and Factorial Notation Assignment: Workbook pg. 382-384 #1-13, pg. 526 of text #22
More informationCSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability
CSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability Review: Main Theorems and Concepts Binomial Theorem: Principle of Inclusion-Exclusion
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 informationComputational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 3 Fall 2010
Computational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 3 Fall 21 Peter Bro Miltersen November 1, 21 Version 1.3 3 Extensive form games (Game Trees, Kuhn Trees)
More informationInstructions [CT+PT Treatment]
Instructions [CT+PT Treatment] 1. Overview Welcome to this experiment in the economics of decision-making. Please read these instructions carefully as they explain how you earn money from the decisions
More information