  This paper is about the Coupon collector's problem. There are some coupons,
or baseball cards, or other plastic knick-knacks that are put into bags of
chips or under soda bottles, etc. A collector starts collecting these trinkets
and wants to form a complete collection of all possible ones. Every time they
buy the product however, they don't know which coupon they will "collect" until
they open the product. How many coupons do they need to collect before they
complete the collection? In this paper, we explore the mean and variance of
this random variable, $N$ using various methods. Some of them work only for the
special case with the coupons having equal probabilities of being collected,
while others generalize to the case where the coupons are collected with
unequal probabilities (which is closer to a real world scenario).

Probability