Expected number of trials before all cards are collected

  • Thread starter Thread starter xcrunner448
  • Start date Start date
  • Tags Tags
    Cards
Click For Summary
SUMMARY

The expected number of cereal boxes needed to collect all five baseball cards is derived from the concept of expected value in probability theory. The solution involves calculating the expected number of boxes required to find each card sequentially, leading to a total expectation of approximately 11.42 boxes. The probability of obtaining a specific card is 0.2, and the calculations utilize combinatorial methods to account for the various ways cards can be collected. The final result is confirmed as 137/12, which simplifies to 11.416666.

PREREQUISITES
  • Understanding of probability theory and expected value calculations
  • Familiarity with combinatorial mathematics and permutations
  • Knowledge of geometric series and their applications in probability
  • Basic skills in mathematical derivation and problem-solving techniques
NEXT STEPS
  • Study the concept of expected value in probability theory
  • Learn about combinatorial methods for calculating probabilities
  • Explore geometric series and their relevance in expected value calculations
  • Investigate similar problems, such as the "coupon collector's problem" for deeper insights
USEFUL FOR

Students in mathematics, statisticians, and anyone interested in probability theory and combinatorial problems will benefit from this discussion.

xcrunner448
Messages
12
Reaction score
0

Homework Statement



A cereal box company started a promotion in which they put one of five different baseball cards in each box of cereal. All cards occur with equal probability. What is the expected number of cereal boxes you have to buy before you collect all five cards?

The Attempt at a Solution



The expected value is the sum from k=5 to infinity of k*(probability of taking exactly k boxes to collect all 5 cards). However, I cannot find a general expression that gives that probability. For k=5, it would be (0.2^5)*5! = 0.0384, because the probability of a certain card in each box is 0.2, and there are 5!=120 different ways to collect all five cards. I cannot figure out how to calculate this probability for k>5. I have tried the same method as I used for k=5, that is, (0.2^k) times the number of ways of collecting all five cards, but because some cards must be repeated 1 or more times I am having difficulty finding out how to calculate that.
 
Physics news on Phys.org
welcome to pf!

hi xcrunner448! welcome to pf! :smile:

hint: what is P(not ending at k) ? :wink:
 
Hi tiny-tim, thanks for your response! I also had that idea, but I could not figure out a general expression for that either. For k=5, the probability of not getting, say, card #1 by the fifth box is (0.8)^5. I thought I'd multiply that by 5 to cover the all 5 possible cards, but that adds to greater than 1. I realized that I would then have to subtract the overlap (the probability of not getting cards #1 and 2, or the probability of not getting cards #2,3, and 4, and so on). But that got very complicated very quickly. There may be a much better way of finding it, but I could not think of it.

In the meantime, however, I found "[URL ,[/URL] which describes the problem perfectly. It is an interesting derivation, based on the expected number of boxes to find the ith card after finding (i-1) cards. It gave me the answer of 11.416666=137/12, which I believe is correct.
 
Last edited by a moderator:

Similar threads

Replies
31
Views
6K
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
4
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
6
Views
4K
Replies
10
Views
3K
  • · Replies 2 ·
Replies
2
Views
773
  • · Replies 14 ·
Replies
14
Views
2K