[Prob] (Coupon collector)

Suppose there are n types of toys, which you are collecting one by one, with the goal of getting a complete set. When collecting toys, the toy types are random (as is sometimes the case, for example, with toys included in cereal boxes or included with kids' meals from a fast food restaurant).

Assume that each time you collect a toy, it is equally likely to be any of the n types. What is the expected number of toys needed until you have a complete set?

Solution: Let N be the number of toys needed; we want to find E(N). Our strategy will be to break up N into a sum of simpler r.v.s so that we can apply linearity. So write

N = N1 + N2 + · · · + Nn,

where N1 is the number of toys until the first toy type you haven't seen before (which is always 1, as the first toy is always a new type), N2 is the additional number of toys until the second toy type you haven't seen before, and so forth.

with

相关推荐
jimmyleeee1 天前
人工智能基础知识笔记七:随机变量的几种分布
人工智能·笔记·概率论
明月看潮生1 天前
青少年编程与数学 02-015 大学数学知识点 03课题、概率论和数理统计
青少年编程·概率论·数理统计·编程与数学·大学数学
jackyrongvip5 天前
妙用《甄嬛传》中的选妃来记忆概率论中的乘法公式
概率论
lynn-668 天前
【深度学习与大模型基础】第8章-概率分布
人工智能·算法·机器学习·概率论
猎人everest11 天前
机器学习之概率论
人工智能·机器学习·概率论
豆芽81911 天前
二项式分布(Binomial Distribution)
人工智能·python·机器学习·numpy·概率论
zbdx不知名菜鸡13 天前
self Attention为何除以根号dk?(全新角度)
transformer·attention·概率论
优美的赫蒂13 天前
扩展卡尔曼滤波
机器学习·数学建模·矩阵·概率论
Lichenpar15 天前
AI小白的第七天:必要的数学知识(四)
人工智能·概率论·概率分布
pen-ai15 天前
离散概率分布:正态分布,二项分布,连续分布,正态分布的性质
算法·机器学习·概率论