The Coupon Collector's Problem

Share it with your friends Like

Thanks! Share it with your friends!

Close

Get 2 months of skillshare premium here! https://skl.sh/vcubingx

Join my discord server! https://discord.gg/Kj8QUZU

The coupon collector’s problem goes as follows: let’s say you want to collect N coupons through draws that have an equal probability of getting any of the N coupons. What’s the expected value of the number of draws to get all N coupons?

Follow Me!
https://vcubingx.com
https://github.com/vivek3141
https://twitter.com/vcubingx
https://instagram.com/vcubingx

Comments

vcubingx says:

Join my discord server! https://discord.gg/Kj8QUZU

Small typo: 7:02 should be 1/p_{n-3}. Credit to viewer Kyro for pointing this out!

Sahil Pandit says:

Great video! I was wondering, how could this be extended to account for multiple cards per draw (eg. drawing 3 cards, at random, with N total cards)? Would it still be reliant on Expected Values?

Killian Defaoite says:

I know I'm being nitpicky here, but words can often get very confusing when dealing with probability, so it's correct to say the expected value of a random variable, not an event.
Great video Vivek!

112BALAGE112 says:

What is the distribution of this random variable? Is there a closed form expression for the probability mass function?

S Vengat says:

Well made video! I was frankly surprised how card picking leads us to harmonic numbers (not that I collect cards or anything lol)

Connor Keenum says:

Love your content!

Giovanni Filippi says:

Really nice video!
There’s a small typo at 7:02 on the p_{n-3}

eliya sne says:

Very elegant!

AeRUBIK Cubing says:

Oh god, I need to learn the manim library

Ryan Yoon says:

sponsored POG

Kyro says:

7:00 typo, the denominator says p_(n-2) instead of p_(n-3)

Flammable Maths says:

Great video Vivek! πŸ™‚

Write a comment

*