This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 185 2 199 26 213 20 226 20 229 20 Extra Credit Problem. A jar contains k red beads and n-k white beads. a) Beads are drawn one at a time with replacement until k red beads have been drawn. On average, how many beads must be drawn? b) Suppose m beads are removed without replacement. On average, how many red beads are obtained? c) Beads are removed one at a time without replacement until all k of the red beads are obtained. On average, how many beads are taken? Comments. Your book (section 5.3) includes formulae directly applicable to parts a) and b), rendering these parts quite easy. But it does not discuss a method directly applicable to part c). For this part, you must use your basic knowledge of discrete probability to formulate your own approach....
View Full Document
This note was uploaded on 11/29/2011 for the course MATH 3355 taught by Professor Britt during the Spring '08 term at LSU.
- Spring '08