Using Counting Techniques to Determine Probabilities

Similar documents
= 5! 3! 2! = 5! 3! (5 3)!. In general, the number of different groups of r items out of n items (when the order is ignored) is given by n!

Consider unordered sample of size r. This sample can be used to make r! Ordered samples (r! permutations). unordered sample

MATH Midterm Solutions

4. PERMUTATIONS AND COMBINATIONS

The number of r element subsets of a set with n r elements

CHAPTER 5 : SERIES. 5.2 The Sum of a Series Sum of Power of n Positive Integers Sum of Series of Partial Fraction Difference Method

ICS141: Discrete Mathematics for Computer Science I

Counting Functions and Subsets

MATH /19: problems for supervision in week 08 SOLUTIONS

The Pigeonhole Principle 3.4 Binomial Coefficients

PERMUTATIONS AND COMBINATIONS

Permutations and Combinations

Ch 3.4 Binomial Coefficients. Pascal's Identit y and Triangle. Chapter 3.2 & 3.4. South China University of Technology

a) The average (mean) of the two fractions is halfway between them: b) The answer is yes. Assume without loss of generality that p < r.

THE ANALYTIC LARGE SIEVE

Permutations, Combinations, and the Binomial Theorem

ELEMENTARY AND COMPOUND EVENTS PROBABILITY

4. PERMUTATIONS AND COMBINATIONS Quick Review

2012 GCE A Level H2 Maths Solution Paper Let x,

Chapter 2 Sampling distribution

Disjoint Sets { 9} { 1} { 11} Disjoint Sets (cont) Operations. Disjoint Sets (cont) Disjoint Sets (cont) n elements

BINOMIAL THEOREM An expression consisting of two terms, connected by + or sign is called a

Auchmuty High School Mathematics Department Sequences & Series Notes Teacher Version

Advanced Physical Geodesy

BINOMIAL THEOREM NCERT An expression consisting of two terms, connected by + or sign is called a

By the end of this section you will be able to prove the Chinese Remainder Theorem apply this theorem to solve simultaneous linear congruences

DANIEL YAQUBI, MADJID MIRZAVAZIRI AND YASIN SAEEDNEZHAD

Lecture 6: October 16, 2017

3.1 Counting Principles

Permutations and Combinations

Lecture 24: Observability and Constructibility

KEY. Math 334 Midterm II Fall 2007 section 004 Instructor: Scott Glasgow

( ) ( ) ( ) ( ) Solved Examples. JEE Main/Boards = The total number of terms in the expansion are 8.

EDEXCEL NATIONAL CERTIFICATE UNIT 28 FURTHER MATHEMATICS FOR TECHNICIANS OUTCOME 2- ALGEBRAIC TECHNIQUES TUTORIAL 1 - PROGRESSIONS

Discussion 02 Solutions

Section 5.1 The Basics of Counting

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

ON EUCLID S AND EULER S PROOF THAT THE NUMBER OF PRIMES IS INFINITE AND SOME APPLICATIONS

PROGRESSION AND SERIES

Multivector Functions

Lecture 3 : Concentration and Correlation

Using Difference Equations to Generalize Results for Periodic Nested Radicals

A NOTE ON DOMINATION PARAMETERS IN RANDOM GRAPHS

On randomly generated non-trivially intersecting hypergraphs

Progression. CATsyllabus.com. CATsyllabus.com. Sequence & Series. Arithmetic Progression (A.P.) n th term of an A.P.

Math 7409 Homework 2 Fall from which we can calculate the cycle index of the action of S 5 on pairs of vertices as

What is Probability?

Summary: Binomial Expansion...! r. where

ARRANGEMENTS IN A CIRCLE

SOME ARITHMETIC PROPERTIES OF OVERPARTITION K -TUPLES

6.3 Testing Series With Positive Terms

EXAMPLES. Leader in CBSE Coaching. Solutions of BINOMIAL THEOREM A.V.T.E. by AVTE (avte.in) Class XI

( ) 1 Comparison Functions. α is strictly increasing since ( r) ( r ) α = for any positive real number c. = 0. It is said to belong to

Electron states in a periodic potential. Assume the electrons do not interact with each other. Solve the single electron Schrodinger equation: KJ =

Week 03 Discussion. 30% are serious, and 50% are stable. Of the critical ones, 30% die; of the serious, 10% die; and of the stable, 2% die.

9.7 Pascal s Formula and the Binomial Theorem

On a Problem of Littlewood

On ARMA(1,q) models with bounded and periodically correlated solutions

LESSON 15: COMPOUND INTEREST

As stated by Laplace, Probability is common sense reduced to calculation.

Lecture 2: Stress. 1. Forces Surface Forces and Body Forces

Lesson 10: Limits and Continuity

Topic 5: Basics of Probability

At the end of this topic, students should be able to understand the meaning of finite and infinite sequences and series, and use the notation u

Infinite Sequences and Series

Chapter Vectors

Strong Result for Level Crossings of Random Polynomials

Chapter 1 : Combinatorial Analysis

Chapter 0. Review of set theory. 0.1 Sets

CHAPTER 5. Theory and Solution Using Matrix Techniques

(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.

Intermediate Math Circles November 4, 2009 Counting II

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Math 155 (Lecture 3)

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

Sets and Probabilistic Models

Lecture 4: Unique-SAT, Parity-SAT, and Approximate Counting

Strong Result for Level Crossings of Random Polynomials. Dipty Rani Dhal, Dr. P. K. Mishra. Department of Mathematics, CET, BPUT, BBSR, ODISHA, INDIA

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

Einstein Classes, Unit No. 102, 103, Vardhman Ring Road Plaza, Vikas Puri Extn., Outer Ring Road New Delhi , Ph. : ,

CHAPTER I: Vector Spaces

Conditional Convergence of Infinite Products

Other quantum algorithms

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)

Summary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function

Sets and Probabilistic Models

MATHS FOR ENGINEERS ALGEBRA TUTORIAL 8 MATHEMATICAL PROGRESSIONS AND SERIES

Math 166 Week-in-Review - S. Nite 11/10/2012 Page 1 of 5 WIR #9 = 1+ r eff. , where r. is the effective interest rate, r is the annual

UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY

Math 113 Exam 3 Practice

COMP 2804 Solutions Assignment 1

Chapter 8 Complex Numbers

SOLUTIONS ( ) ( )! ( ) ( ) ( ) ( )! ( ) ( ) ( ) ( ) n r. r ( Pascal s equation ). n 1. Stepanov Dalpiaz

Injections, Surjections, and the Pigeonhole Principle

Math 113 Exam 4 Practice

Axioms of Measure Theory

Auchmuty High School Mathematics Department Advanced Higher Notes Teacher Version

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

Sequences. Notation. Convergence of a Sequence

Trial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014

Transcription:

Kowledge ticle: obability ad Statistics Usig outig Techiques to Detemie obabilities Tee Diagams ad the Fudametal outig iciple impotat aspect of pobability theoy is the ability to detemie the total umbe of possible outcomes whe multiple evets ae cosideed. I this lesso, we ae tyig to develop coutig techiques we ca use to help compute pobabilities. Oe of the most fudametal coutig techiques is the fudametal coutig piciple (sometimes efeed to as the multiplicatio axiom). efoe we itoduce the fudametal coutig piciple, let s look at some examples. Example If a woma has two blouses {, } ad thee skits {s, s, s }, how may diffeet outfits cosistig of a blouse ad a skit ca she wea? We ca use a tee diagam to detemie the umbe of diffeet outfits. s s s s s s s s s s s s Notice we ed up with two sets (o goups) of thee outfits (thee with the fist blouse ad thee with the secod blouse). We ca also use the multiplicatio fact to detemie the umbe of outfits because the meaig of is two goups of thee. The pocedue we just employed is called the fudametal coutig piciple. The fudametal coutig piciple states that if oe task ca be doe i m ways, ad a secod task ca be doe i ways, the the opeatio ivolvig the fist task

followed by the secod ca be pefomed i m ways. The fudametal coutig piciple is ot limited to just two tasks; it ca be used fo ay umbe of tasks. Example tuck licese plate cosists of a lette followed by fou digits. How may such licese plates ae possible? Sice thee ae 6 possibilities fo the lette ad 0 possibilities fo each of the fou digits, the fudametal coutig piciple gives us 6 0 0 0 0 = 60,000 possible licese plates. Detemiig obability with the Fudametal outig iciple Example tuck licese plate cosists of a lette followed by fou digits. If you select oe licese plate at adom, what is the pobability it cotais the lette Z? Recall that the defiitio of pobability is. I example, we detemied that thee ae 60,000 possible outcomes. Now, the umbe of acceptable outcomes is detemied by the fudametal coutig piciple as 0 0 0 0 = 0,000. (Note thee is oly oe choice fo the lette, that beig Z.) 0,000 So, (licese plate cotais Z) =. 60,000 6

emutatios Suppose we ae asked to fid the sequeces that ca be fomed with the lettes {,, } if o lette is epeated. Fist let s use a tee diagam to detemie the umbe of sequeces: The tee diagam gives us six aagemets. We ca also use the fudametal coutig piciple to detemie the umbe of sequeces. Sice the lettes caot be epeated, we have thee choices fo the fist lette, two choices fo the secod lette, ad oe choice fo the thid lette. Theefoe, the fudametal coutig piciple gives us = 6. We ca wite this equatio usig factoial otatio as! = 6. Factoial otatio is defied as! = ( ) ( ). Two impotat defiitios ae! = ad 0! =. agemets like these, whee ode is impotat ad o elemet is epeated, ae called pemutatios. pemutatio of a set of elemets is a odeed aagemet whee each elemet is used oce. Example Give five lettes {,,, D, E}, fid the umbe of fou-lette sequeces possible. Fom the fudametal coutig piciple, we have 5 =.

We ofte ecoute situatios like this oe, whee we have a set of objects ad we ae selectig objects to fom pemutatios. We efe to this as pemutatios of objects take at a time, ad we wite it as. Theefoe, example ca also be asweed as: The umbe of fou-lette sequeces is 5 =. Let s defie. The umbe of pemutatios of objects take at a time is: ) ) )... ) (which is the same as the fudametal coutig piciple), o!, whee ad ae atual umbes. )! We ca show that this fomula is the same as the fist oe:! )! ) )... ) ) )... ) ) ) )... ). You should udestad both fomulas ad feel comfotable applyig eithe oe. Example 5 ompute 6 usig both fomulas. Fist fomula: 6 5 =. 6! (6 5 ) Secod fomula: 6 5.! ( ) Example 6 You have math books ad 5 histoy books to put o a shelf that has 5 slots. I how may ways ca the books be shelved if the fist thee slots ae filled with math books ad the ext two slots ae filled with histoy books? Fist we detemie the umbe of ways the math books ca be aaged. This is a pemutatio of objects take at a time, o : = =. Next we detemie the umbe of ways the histoy books ca be aaged. This is a pemutatio of 5 objects take at a time, o 5 : 5 = 5 =.

Now we use the fudametal coutig piciple. Sice thee ae ways to aage the math books ad ways to aage the histoy books, the total umbe of ways to aage the math ad histoy books is, o 80. ombiatios Suppose that we have a set of thee lettes {,, }, ad we ae asked to make twolette sequeces. We have six pemutatios: Now suppose we have a goup of thee people {,, }, l, ob, ad his, espectively, ad we ae asked to fom committees of two people each. This time we have oly thee committees: Whe fomig committees, the ode is ot impotat because the committee that has l ad ob is o diffeet fom the committee that has ob ad l. s a esult, we have oly thee committees, ot six. Fomig sequeces is a example of pemutatios, while fomig committees is a example of combiatios. emutatios ae those aagemets whee ode is impotat, while combiatios ae those aagemets whee ode is ot sigificat. Recall that epesets the umbe of combiatios of objects take at a time. Now let s look at a situatio i which we eed to detemie the elatioship betwee the umbe of combiatios ad the umbe of pemutatios. Suppose we wat to detemie the umbe of pemutatios of lettes {,,, D} take at a time ( ). We kow that =, ad list all pemutatios: D D D D D D D D D D D D D D D D D D 5

If we wat to detemie the umbe of combiatios of lettes {,,, D} take at a time, we see that thee ae oly fou sice ode does ot matte. To detemie the umbe of combiatio of objects take at a time, we ca fist detemie the umbe of pemutatios of objects take at a time ad the divide by the umbe of pemutatios fo ay objects take at a time. So i this case, 6. We divide by 6 ( ) because oce we have the thee specific lettes, we ae ot coceed with the ode; so, we divide out the 6 diffeet odes of lettes take at a time. The fomal defiitio of a combiatio is a set of elemets i a aagemet whee each elemet is used oce ad ode is ot impotat. The umbe of combiatios of objects take at a time is witte..!, whee ad ae atual umbes. )!.! Notice that Example 7 ompute 5.! gives )! ad! gives. 5 (5 5! )! 5!!! 5 ( )( ) 0. ombiatios Ivolvig Seveal Sets So fa we have solved the basic combiatio poblem of objects chose fom diffeet objects. Now we will coside moe-complex poblems. Example 8 How may five-peso committees cosistig of me ad wome ca be chose fom a goup of me ad wome? Fist we coside the umbe of combiatios of me chose at a time ( ): = 6. Next we coside the umbe of combiatios of wome chose at a time ( ): =. 6

Sice thee ae 6 ways of choosig me ad ways of choosig wome, the fudametal coutig piciple gives us the umbe of five-peso committees: 6 =. obabilities Ivolvig ombiatios Example 9 high school club cosists of feshme, 5 sophomoes, 5 juios, ad 6 seios. What is the pobability that a committee of people chose at adom icludes oe studet fom each class? The total umbe of committees possible is sice thee ae studets i all ad we wat to select : =,85. The umbe of combiatios of feshma take at a time is =. The umbe of combiatios of 5 sophomoes take at a time is 5 = 5. The umbe of combiatios of 5 juios take at a time is 5 = 5. The umbe of combiatios of 6 juios take at a time is 6 = 6. Usig the fudametal coutig piciple, the umbe of committees is 5 5 6 = 600. Example 0 high school club cosists of feshme, 5 sophomoes, 5 juios, ad 6 seios. What is the pobability that a committee of people chose at adom icludes at least oe seio? The total umbe of committees possible is sice thee ae studets i all ad we wat to select : =,85. We wat the committee to cotai at least oe seio, so it could cotai exactly oe seio, exactly two seios, exactly thee seios, o exactly fou seios. Fidig the pobability that the committee cotais at least oe seio equies us to fid the pobability fo each of the fou cases ad the use the additio piciple sice these fou possibilities ae disjoit evets. 6 6,85 8,85 (exactly oe seio) = 6 0.5. (exactly two seios) = 6 0.8. 9 5,85 65,85 7

,85 80,85 (exactly thee seios) = 6 0.058. (exactly fou seios) = 0 6 0.00. 5,85 5,85 We kow that (at least oe seio) = (exactly oe seio) + (exactly two seios) + (exactly thee seios) + (exactly fou seios), so: (at least oe seio) = 0.5 + 0.8 + 0.058 + 0.00 = 0.79. We ca compute this pobability i a much moe efficiet mae, howeve, by usig the complemet of the evet at least oe seio. The complemet is that the committee cotais o seios (the oly othe possible outcome): (at least oe seio) = (o seios) (at least oe seio) 6 0,00,85 0.6 0.79. Whe dealig with pobability situatios ivolvig at least oe, the most efficiet way to detemie the pobability is to use the complemetay evet oe. This kowledge aticle is adapted fom the followig souce: Sekho, Rupide. "Sets ad outig." oexios. July,. 8