mscroggs.co.uk
mscroggs.co.uk

subscribe

Comment

Comments

Comments in green were written by me. Comments in blue were not written by me.
@Matthew: Here is how I calculated it:

You want a specific set of 20 stickers. Imagine you have already \(n\) of these. The probability that the next sticker you buy is one that you want is
$$\frac{20-n}{682}.$$
The probability that the second sticker you buy is the next new sticker is
$$\mathbb{P}(\text{next sticker is not wanted})\times\mathbb{P}(\text{sticker after next is wanted})$$
$$=\frac{662+n}{682}\times\frac{20-n}{682}.$$
Following the same method, we can see that the probability that the \(i\)th sticker you buy is the next wanted sticker is
$$\left(\frac{662+n}{682}\right)^{i-1}\times\frac{20-n}{682}.$$
Using this, we can calculate the expected number of stickers you will need to buy until you find the next wanted one:
$$\sum_{i=1}^{\infty}i \left(\frac{20-n}{682}\right) \left(\frac{662+n}{682}\right)^{i-1} = \frac{682}{20-n}$$
Therefore, to get all 682 stickers, you should expect to buy
$$\sum_{n=0}^{19}\frac{682}{20-n} = 2453 \text{ stickers}.$$
Matthew
on /blog/56
               
@Matthew: Thank you for the calculations. Good job I ordered the stickers I wanted #IRN. 2453 stickers - that's more than the number you bought (1781) to collect all stickers!
Milad
on /blog/56
               
@Matthew: Here is how I calculated it:

You want a specific set of 20 stickers. Imagine you have already \(n\) of these. The probability that the next sticker you buy is one that you want is
$$\frac{20-n}{682}.$$
The probability that the second sticker you buy is the next new sticker is
$$\mathbb{P}(\text{next sticker is not wanted})\times\mathbb{P}(\text{sticker after next is wanted})$$
$$=\frac{662+n}{682}\times\frac{20-n}{682}.$$
Following the same method, we can see that the probability that the \(i\)th sticker you buy is the next wanted sticker is
$$\left(\frac{662+n}{682}\right)^{i-1}\times\frac{20-n}{682}.$$
Using this, we can calculate the expected number of stickers you will need to buy until you find the next wanted one:
$$\sum_{i=1}^{\infty}i \left(\frac{20-n}{682}\right) \left(\frac{662+n}{682}\right)^{i-1} = \frac{682}{20-n}$$
Therefore, to get all 682 stickers, you should expect to buy
$$\sum_{n=0}^{19}\frac{682}{20-n} = 2453 \text{ stickers}.$$
Matthew
on /blog/56
               
@Matthew: Thank you for the calculations. Good job I ordered the stickers I wanted #IRN. 2453 stickers - that's more than the number you bought (1781) to collect all stickers!
Milad
on /blog/56
               
@Matthew: Here is how I calculated it:

You want a specific set of 20 stickers. Imagine you have already \(n\) of these. The probability that the next sticker you buy is one that you want is
$$\frac{20-n}{682}.$$
The probability that the second sticker you buy is the next new sticker is
$$\mathbb{P}(\text{next sticker is not wanted})\times\mathbb{P}(\text{sticker after next is wanted})$$
$$=\frac{662+n}{682}\times\frac{20-n}{682}.$$
Following the same method, we can see that the probability that the \(i\)th sticker you buy is the next wanted sticker is
$$\left(\frac{662+n}{682}\right)^{i-1}\times\frac{20-n}{682}.$$
Using this, we can calculate the expected number of stickers you will need to buy until you find the next wanted one:
$$\sum_{i=1}^{\infty}i \left(\frac{20-n}{682}\right) \left(\frac{662+n}{682}\right)^{i-1} = \frac{682}{20-n}$$
Therefore, to get all 682 stickers, you should expect to buy
$$\sum_{n=0}^{19}\frac{682}{20-n} = 2453 \text{ stickers}.$$
Matthew
on /blog/56
               

Archive

Show me a random blog post
 2021 

Jan 2021

Christmas (2020) is over
 2020 
▼ show ▼
 2019 
▼ show ▼
 2018 
▼ show ▼
 2017 
▼ show ▼
 2016 
▼ show ▼
 2015 
▼ show ▼
 2014 
▼ show ▼
 2013 
▼ show ▼
 2012 
▼ show ▼

Tags

ternary curvature people maths royal institution interpolation craft fractals signorini conditions game of life countdown the aperiodical cambridge pizza cutting manchester preconditioning pi map projections final fantasy pythagoras national lottery trigonometry noughts and crosses reuleaux polygons sport gaussian elimination probability matt parker speed wave scattering chess ucl matrix of minors finite element method go draughts puzzles logic nine men's morris video games hannah fry data graphs matrix multiplication braiding triangles polynomials palindromes simultaneous equations oeis chalkdust magazine royal baby propositional calculus news asteroids inverse matrices exponential growth python football cross stitch captain scarlet javascript binary php martin gardner christmas card estimation game show probability hexapawn world cup matrices big internet math-off london underground wool machine learning logs rhombicuboctahedron chebyshev accuracy menace radio 4 reddit statistics tennis plastic ratio books sound folding paper platonic solids matrix of cofactors golden ratio a gamut of games folding tube maps sorting weather station mathsjam frobel tmip coins rugby electromagnetic field dates bempp stickers twitter computational complexity phd advent calendar hats sobolev spaces bodmas dataset boundary element methods quadrilaterals pac-man harriss spiral flexagons numerical analysis london programming arithmetic misleading statistics realhats convergence christmas games graph theory manchester science festival dragon curves error bars talking maths in public raspberry pi mathslogicbot bubble bobble weak imposition pi approximation day latex geometry data visualisation light mathsteroids squares european cup approximation gerry anderson geogebra determinants inline code golden spiral

Archive

Show me a random blog post
▼ show ▼
© Matthew Scroggs 2012–2021