英语翻译第一段：In probability theory,the coupon collector's problem describes the "collect all coupons and win" contests.It asks the following question:Suppose that there are n different coupons,equally likely,from which coupons are being co

英语翻译第一段：In probability theory,the coupon collector's problem describes the "collect all coupons and win" contests.It asks the following question:Suppose that there are n different coupons,equally likely,from which coupons are being co
英语翻译
第一段：In probability theory,the coupon collector's problem describes the "collect all coupons and win" contests.It asks the following question:Suppose that there are n different coupons,equally likely,from which coupons are being collected with replacement.What is the probability that more than t sample trials are needed to collect all n coupons?An alternative statement is:Given n coupons,how many coupons do you expect you need to draw with replacement before having drawn each coupon at least once?The mathematical analysis of the problem reveals that the expected number of trials needed grows as …… For example,when n = 50 it takes about 225[2] trials to collect all 50 coupons.
第二段：The key to solving the problem is understanding that it takes very little time to collect the first few coupons.On the other hand,it takes a long time to collect the last few coupons.In fact,for 50 coupons,it takes on average 50 trials to collect the very last coupon after the other 49 coupons have been collected.This is why the expected time to collect all coupons is much longer than 50.The idea now is to split the total time into 50 intervals where the expected time can be calculated.
作为一个热爱数学的英语学渣,或者用你自己的话告诉我“优惠券收集问题”是怎么一回事以及它的公式.

英语翻译第一段：In probability theory,the coupon collector's problem describes the "collect all coupons and win" contests.It asks the following question:Suppose that there are n different coupons,equally likely,from which coupons are being co
第一段：在概率论,优惠券收集器的问题描述了“收集所有优惠券和赢”竞赛.它回答了以下问题:假设有n个不同的优惠券,同样有可能的是,从中收集优惠券与更换.什么是概率,超过t样品试验是需要收集所有n优惠券吗?另一个声明:鉴于n优惠券,优惠券你期望多少你需要绘制与更换前有至少一次绘制每个优惠券吗?问题的数学分析表明,试验需要的预期数量随着……例如,当n = 50花大约225[2]试验收集所有50个优惠券.
第一段：解决这个问题的关键是理解,只需要很少的时间收集最初几个优惠券.另一方面,它需要很长时间来收集过去几个优惠券.事实上,对于50个优惠券,需要花费平均50试验收集最后一息票后优惠券已经收集了其他49.这就是为什么预期的时间来收集所有优惠券远远超过50个.现在的想法是把总时间为50个间隔,可以计算出预期的时间.
希望以上的翻译你满意.如满意,还望采纳,多谢!

概率问题的，太专业啦

呵呵 你这个不容易啊