Skip to content
Research Article Open access CC BY 4.0

Longest Waiting Time in the Coupon Collector’s Problem

C. Brennan, J. Kariv, A. Knopfmacher

Journal of Advances in Mathematics and Computer Science · pp. 330–336 · Published 14 Jul 2015

10.9734/BJMCS/2015/16934

Abstract

The coupon collector’s problem is a classical problem usually solved by summing independent but not identically distributed geometric random variables. These geometric random variables represent waiting times for the j-th coupon for j = 1, 2,..... In this paper we address the question about the longest of these waiting times. In particular, we evaluate the moments of the longest waiting time.

Coupon collectors problem maximum moments

Cited by 3

Maximum of exponential random variables, Hurwitz’s zeta function, and the partition function

D. Barak-Pelleg, D. Berend, G. Kolesnik · Studia Mathematica · 2020

The Dispersion Time of Random Walks on Finite Graphs

Nicolás Rivera, Thomas Sauerwald, Alexandre O. Stauffer · ACM Symposium on Parallelism in Algorithms and Architectures · 2018

The Plagiarism Singularity Conjecture

Sriram Ranga, Rui Mao, Erik Cambria · North American Chapter of the Association for Computational Linguistics · 2025

Article metrics

Real usage data collected on this platform.

2

Page views

0

PDF downloads

8

Outbound clicks

3

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.