[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

相关推荐
BlackPercy7 天前
【概率论】条件期望
概率论
高山莫衣11 天前
【差分隐私相关概念】瑞丽差分隐私(RDP)引理1
概率论·差分隐私
高山莫衣11 天前
【差分隐私相关概念】瑞丽差分隐私(RDP)命题4
概率论·差分隐私
高山莫衣12 天前
【差分隐私相关概念】瑞丽差分隐私(RDP)-命题1
概率论·差分隐私
蹦蹦跳跳真可爱58912 天前
Python----概率论与统计(随机变量,离散概率分布,连续概率分布,期望,方差,标准差,多维随机变量)
概率论
徐行tag13 天前
组合数学——二项式系数
线性代数·概率论
蹦蹦跳跳真可爱58918 天前
Python----概率论与统计(概率论,互斥事件和概率和,非互斥事件和概率和,独立性事件,生日问题,条件概率)
概率论
phoenix@Capricornus19 天前
条件概率、概率乘法公式、全概率公式和贝叶斯 (Bayes) 公式
概率论
jerry60919 天前
协方差相关问题
概率论
RedMery20 天前
多元高斯分布函数
线性代数·矩阵·概率论