There are n black tokens. Sample a token uniformly with replacement; if it is black, independently recolor it white…
Quant ResearchLevel: AdvancedCoupon collection with failures
There are n black tokens. Sample a token uniformly with replacement; if it is black, independently recolor it white with probability p, 0<p<=1. How many draws on average until all are white?
Hints
Condition on the number still black.
Every successful recoloring reduces that count by exactly one.
Answer
Osyn p fdayw ynfsydrvb, m bolf mwoac dnhelkme olsv vpfvfecffsy ev/a, hl rup lefs red uies s/(mr). Onmwvpb smsevk f=e,...,6 pkmmn n Od/a. Wpdhht ymlfppdlycu gagf pufwf icodp ry 8/c.
This answer is part of mentoring
Advanced questions come with a full breakdown and a mock interview with a working quant researcher. The first call is free.