KnowraCoupon collector's problemLinked fromLinked fromThe 8 pages that link to Coupon collector's problem, each with the reason it gives.All 8Broader topic 1Related 5Compared with 2Inclusion–exclusion principleRelated: Inclusion–exclusion computes the chance that at least one coupon type remains unseen.Geometric distributionRelated: Its total collection time is a sum of geometric waiting times with changing success probabilities.Birthday ProblemCompared with: It concerns repeated sampling too, but seeks complete coverage rather than the first match.Stirling's approximationRelated: Stirling's approximation helps estimate factorial expressions in its completion-time probabilities.Linearity of expectationBroader topic: Its expected collection time is derived by summing waiting-time expectations for successive new types.Law of total expectationRelated: Conditioning on the number already collected separates the stages of the expected collection time.Le Cam's theoremRelated: Poisson approximation helps analyze counts of rare collection events in related sampling regimes.Infinite monkey theoremCompared with: It concerns collecting many targets, while the theorem needs only one specified text.