AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (235.8 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Generalized analysis of the coupon collector problem with reset button

Yan Li1, Cancan Dai1, Daeyeoul Kim2( )
Department of Applied Mathematics, College of Science, China Agricultural University, Beijing 100083, China
Department of Mathematics and Institute of Pure and Applied Mathematics, Jeonbuk National University, Jeollabuk-do 54896, South Korea
Show Author Information

Abstract

In this paper, we study a generalized version of the coupon collector problem that includes a reset button, which restarts the collection process when it is drawn. We derive an explicit formula for the expected waiting time to collect all distinct coupons in the general case where standard coupons are drawn with arbitrary probabilities. Using this result, we reprove the recent expected waiting time formula by Jocković and Todić in [8] for the case where standard coupons have equal probabilities, which is expressed in terms of the beta function.

CLC number: 60C05, 60G50

References

【1】
【1】
 
 
AIMS Mathematics
Pages 19739-19748

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Li Y, Dai C, Kim D. Generalized analysis of the coupon collector problem with reset button. AIMS Mathematics, 2026, 11(7): 19739-19748. https://doi.org/10.3934/math.2026800

2

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 16 March 2026
Revised: 16 June 2026
Accepted: 26 June 2026
Published: 15 July 2026
©2026 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)