L17_CouponCollector_print

L17_CouponCollector_print - 1 COMP170 Discrete Mathematical...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 COMP170 Discrete Mathematical Tools for Computer Science More on “time until first success” Version 2.0: Last updated, May 13, 2007 2 Example 1 Throw a fair die until you see a 1 . Set X 1 = # of throws until you see 1 . For i > 1 : X i = # of throws, starting from when you see i- 1 for the first time, until you see i for the first time. How many times, on average, do you throw the die? Then throw it until you see a 2 . Continue until you see all of 3 , 4 , 5 , 6 , in that order. 2 5 1 | {z } 3 1 4 2 | {z } 6 5 4 4 3 | {z } 1 3 4 | {z } 6 4 1 2 5 | {z } 1 4 3 6 | {z } X 1 = 3 X 2 = 4 X 3 = 5 X 4 = 3 X 5 = 5 X 6 = 4 3 X = X 1 + X 2 + ... + X 6 . Total number of throws is E ( X ) = E ( X 1 ) + E ( X 2 ) + ... + E ( X 6 ) = 6 · 6 = 36 . X i is a geometric random variable with p = 1 / 6 , ⇒ E ( X i ) = 1 p = 6 . 2 5 1 | {z } 3 1 4 2 | {z } 6 5 4 4 3 | {z } 1 3 4 | {z } 6 4 1 2 5 | {z } 1 4 3 6 | {z } X 1 = 3 X 2 = 4 X 3 = 5 X 4 = 3 X 5 = 5 X 6 = 4 X = 19 Then, by linearity of expectation, 4...
View Full Document

This note was uploaded on 08/25/2010 for the course COMP COMP170 taught by Professor M.j.golin during the Spring '10 term at HKUST.

Page1 / 9

L17_CouponCollector_print - 1 COMP170 Discrete Mathematical...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online