Coupon collector's problem
id:
coupon-collector-s-problem-162-5057657
title:
Coupon collector's problem
text:
In probability theory, the coupon collector's problem refers to mathematical analysis of "collect all coupons and win" contests. It asks the following question: if each box of a given product contains a coupon, and there are n different types of coupons, what is the probability that more than t boxes need to be bought to collect all n coupons? An alternative statement is: given n coupons, how many coupons do you expect you need to draw with replacement before having drawn each coupon at least on
brand slug:
wiki
category slug:
encyclopedia
description:
Problem in probability theory
original url:
https://en.wikipedia.org/wiki/Coupon_collector%27s_problem
date created:
2007-12-15T21:08:21Z
date modified:
2024-08-27T16:40:42Z
main entity:
{"identifier":"Q1148012","url":"https://www.wikidata.org/entity/Q1148012"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/46/Coupon_collector_problem.svg","width":512,"height":512}
fields total:
13
integrity:
16