- Mathematics
- Class 12
- Project 17
17Collect All Six! How Many Packets Will It Take?
Imagine a snack packet that contains one of six different cricket stickers, each equally likely. How many packets must you buy, on average, to collect all six? Students simulate the problem with a die, record how many rolls each full collection takes, draw the distribution, and then derive the exact expected value using a clever splitting argument. They discover why the last sticker is always the hardest to find.
- Class and age
- Class 12 · 17–18
- Activity type
- Individual or group
- Time needed
- 60 minutes
- Difficulty
- Medium
- Estimated budget
- Almost free
Mathematical concepts
- Simulation with dice
- Geometric distribution: expected waiting time 1 ÷ p
- Linearity of expectation
- Harmonic numbers
- Skewed distributions
Learning objectives
- Simulate a probability problem and summarise the results.
- Use the waiting-time rule 1 ÷ p.
- Derive the expected number of packets.
- Explain why the distribution is skewed.
Real-life connection
Companies design collectible promotions knowing this mathematics. The same idea helps scientists estimate how many samples are needed to find every species in a habitat, and engineers test whether every part of a program has been checked.
Materials required
- One die per pair
- Tally sheets
- A spreadsheet for pooling and simulating many collections
Step-by-step instructions
- Before rolling, everyone writes a guess: how many packets, on average, to collect all six stickers?
- Each roll of a die is one packet; the number is the sticker. Roll until all six numbers have appeared. Record the number of rolls.
- Repeat at least five times per pair. Pool the class results.
- Draw a bar chart of the results. Find the mean, median and longest collection. Describe the shape.
- Split the collection into stages: waiting for the 1st new sticker, the 2nd, and so on up to the 6th. At the last stage, what is the chance a packet is new?
- Use the rule: if the chance of success is p, the expected wait is 1 ÷ p. Add the expected waits for the six stages.
- Compare the exact answer with your class mean and with your first guesses.
- Extend: how many packets for 10 stickers? For 50? Make a table and describe the pattern.
Mathematical explanation
At each stage the chance of a new sticker is 6 ÷ 6, 5 ÷ 6, 4 ÷ 6, 3 ÷ 6, 2 ÷ 6 and finally 1 ÷ 6. The expected waits are the reciprocals: 1 + 1.2 + 1.5 + 2 + 3 + 6 = 14.7 packets. Equivalently, 6 × (1 + 1/2 + 1/3 + 1/4 + 1/5 + 1/6) = 6 × 2.45 = 14.7. The last sticker alone takes 6 packets on average, more than the first four put together. The distribution is skewed to the right: most collections finish between about 10 and 20 rolls, but a few take 30 or more, so the mean is a little above the median. For n stickers the expected number is about n × (ln n + 0.58), which grows a little faster than n itself.
Expected project output
Class simulation data, a bar chart with mean and median, the stage-by-stage derivation of 14.7, and a table for larger collections.
Skills developed
- Probability modelling
- Simulation and data summary
- Mathematical argument
- Consumer awareness
Assessment criteria
- Simulations are recorded and pooled correctly.
- The chart and summary statistics are accurate.
- The expected value 14.7 is derived clearly.
- The skew and the cost of the last sticker are explained.
Extension challenge
What if friends trade duplicates? Simulate two friends collecting together and sharing. How many packets does each need on average?
Safety and inclusion
No special risks. This project uses dice only; no purchases are needed.