This paper considers some computational issues related to the problem of the coupon collector behavior. In addition, we propose a simulation algorithm to find the solution to the problem, where we present as a numerical illustration an album of stickers related to the Qatar 2022 Official Football World Cup, which is being sold in Brazilian newsstands. In this case, the complete album has N = 670 stickers, which are sold in packages containing n = 5 stickers each. The simulation was based on a computational code written in R. For this application we obtained as a solution, an average number of 950 packages needed to complete the album, at an average cost of 3,800 reals (Brazilian currency), assuming that the collector does not exchange any of its repetitions with nobody. All computer code used in this article is provided on GitHub. The assumed simulation study could be useful for statistics teachers to motivate their students for lectures in computational statistics and fundamentals of probability.
翻译:此外,我们提出一个模拟算法,以寻找问题的解决方案。 我们以数字示例的形式展示了一张与2022年卡塔尔官方足球世界杯有关的贴纸专辑,该专辑正在巴西的报摊上出售。 完整的专辑有N= 670贴纸,每张装有n= 5贴纸的包件出售。 模拟是基于一个用R书写的计算代码。 对于这个应用程序,我们以3 800实币(巴西货币)的平均成本完成专辑平均需要950个包,假设收藏者不与任何人交换任何重复。 本文中使用的所有计算机代码都在GitHub上提供。 假设的模拟研究对于统计教师来说可能有用,可以激励学生在计算统计和概率基本原理上进行演讲。