Stats question: Item collection

  • Thread starter Thread starter dreamspace
  • Start date Start date
  • Tags Tags
    Stats
dreamspace
Messages
10
Reaction score
0

Homework Statement



Suppose that I'm collecting cards, and that in a complete collection there are m items.
When buying a new card, there's an equal probability that the card is any of those m cards.

Let X be the number of cards I need to buy in order to get a complete collection

What is the Expectation/Ex of X? What is the Standard Deviation?

Homework Equations



Let X = \sum^{m}_{i=1} X_{i}, where X_{i} is the number of cards I need to buy in order to get a new type of card when I already have i - 1 different types of cards


The Attempt at a Solution



I figure this problem would involve probability mass function, but to be honest I'm stuck as I haven't had any probability or stats in over 10 years.

Any good pointers on how to go on with this problem?
 
Physics news on Phys.org
haven't worked it, but say you have n>m cards, then what is the probability of having m different cards might be a place to start...
 
After doing some reading, this looks like something that falls under Geometric Distribution. Correct?
 
dreamspace said:

Homework Statement



Suppose that I'm collecting cards, and that in a complete collection there are m items.
When buying a new card, there's an equal probability that the card is any of those m cards.

Let X be the number of cards I need to buy in order to get a complete collection

What is the Expectation/Ex of X? What is the Standard Deviation?

Homework Equations



Let X = \sum^{m}_{i=1} X_{i}, where X_{i} is the number of cards I need to buy in order to get a new type of card when I already have i - 1 different types of cards


The Attempt at a Solution



I figure this problem would involve probability mass function, but to be honest I'm stuck as I haven't had any probability or stats in over 10 years.

Any good pointers on how to go on with this problem?

Google the Coupon Collector's Problem.

RGV
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top