Metraipolis › archive › dc_d114dc87d2dc

Coupon collector's problem — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Coupon_collector%27s_problem
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T23:19:33.665Z
SHA-256 of the archived text
ffa3070b6e7e6bc0fd0213d51998a36e246ffd0c76d1ccd275ba49177a78acb2
Stable URL of this page
https://metraipolis.com/documento/dc_d114dc87d2dc

How to cite

Coupon collector's problem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Coupon_collector%27s_problem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_d114dc87d2dc (Metraipolis archive dc_d114dc87d2dc, sha256 ffa3070b6e7e6bc0fd0213d51998a36e246ffd0c76d1ccd275ba49177a78acb2)
BibTeX
@misc{dcd114dc87d2dc,
  title = {Coupon collector's problem — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Coupon_collector%27s_problem},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_d114dc87d2dc; sha256 ffa3070b6e7e6bc0fd0213d51998a36e246ffd0c76d1ccd275ba49177a78acb2},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Coupon_collector%27s_problem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 (e.g., breakfast cereals) 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 once? The mathematical analysis of the problem reveals that the expected number of trials needed grows as Θ ( n log ( n ) ) {\displaystyle \Theta (n\log(n))} . For example, when n = 50 it takes about 225 trials on average to collect all 50 coupons. Sometimes the problem is instead expressed in terms of an n-sided die.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «probability theory»).
Fonte: Wikipedia in inglese, voce «Coupon collector's problem» — https://en.wikipedia.org/wiki/Coupon_collector%27s_problem
Wikidata Q1148012 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1148012
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Coupon_collector%27s_problem?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1375064023, consultata il 2026-10-07T22:56:36.203Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 90105e881f34df9c09bda2b31b549b663371c6a4867e7373b716448bdb970110