Search Results

Consider the coupon collector problem, in which $n$ coupons must be collected and one coupon appears randomly daily. …

This is a modified version of the coupon collector problem, where we are interested in making comparisons between the "coupons". …

At a glance, it seems related to the coupon collector problem, but all the slick methods of solving the coupon collecting problem don't work here for one reason or another. … Also, just to note, it's fairly obvious that the coupon collector problem gives an upper bound on this problem, but the bound it gives ($n \ln (m)$), is worse than the trivial bound of $n$. …

The Coupon Collector Problem is a well-known one in mathematics and statistics. …

The coupon collector's problem Let there be $n$ different types of coupons and we try to collect all of the types. … The article from Lars Holst, 'Extreme value distributions for random coupon collector and birthdays problems', is getting close to what I am searching for. But it still becomes quite technical. …

I stumbled across the coupon collectors problem and was trying to work out a formula for a generalization. … The normal coupon collector problem has $m = N$ and $k = 1$. There are 12 different LEGO figures in a collection. I want to collect 3 copies of each of 10 (any 10) figures. …

I am looking for an equation that will let me calculate the waiting time expectation and variance for a coupon collector problem (equal probabilities of coupons) in which coupons come in packs, with no …

I have come across the famous coupon collector's problem. Linking the problem to the Twelvefold way, my first reaction has been to use the case with unlabelled balls with labelled boxes. …

In the classic Coupon Collector's problem, it is well known that the time $T$ necessary to complete a set of $n$ randomly-picked coupons satisfies $E[T] \sim n \ln n $,$Var(T) \sim n^2$, and $\Pr(T > n …

In a variation on the coupon collector's problem, you don't know the number of coupons and must determine this based on data. …

Suppose I get in an elevator every morning and am in it for exactly one minute. A continuous loop of music plays in the elevator and is 10 minutes long. If my daily arrival time is uniform in the ti …

Number of days between coupon j and j+1 is CC(j+1) - CC(j). Then to collect all c types is CC(c). The problem is that I don't understand how I could start formulating a solution using this. …

I am collecting the new world cup panini album. The album has 680 stickers (approx) and there are 5 different stickers in each packet. I would like to know the probability I have of missing 50 sticker …

I collect coupons of theoretically $n$ different colours, which come up randomly, one at a time. Up to now, I have collected $c$ coupons in total, falling into $j$ different colour classes. From this …

I am revisiting a question I asked previously with a slight caveat. In my new situation, I am considering the marbles to always be attached to the same neighbors. Hopefully this will be clearer with a …