Geometric random variable 적용 -- 띠부씰의 확률,통계적 접근
- 최초 등록일
- 2022.04.11
- 최종 저작일
- 2022.04
- 6페이지/ 어도비 PDF
- 가격 2,500원
목차
1. Ddibu seal problems
본문내용
Introduction - Ddibu seal problems
There is some hype around re-released Pok´emon pain ([p˜ε], should be pronounced in french); here is the link, if interested. — namu.wiki
Some of interesting math questions can be posed:
• How many pains (on average) do we need to buy to collect all seals?
Say, thousands of MZ people (or AZ people, or CD/JD/GD) collect Ddibu seals (without trading them!). They keep collecting until completing the full n(159) collection. After almost all MZ people complete their collection (again, without trading). The number of pains they bought, call it N, to complete their n(159) collections will be different depending on their luck; if the number is averaged, then what should it be like? Math people call it expected value of N i.e., E[N].
(note) assumption 1 (no rare seals): At each trial, it is iid (independent, identically distributed). All the Ddibu seal are equally likely to be picked, and each trial is independent.
참고 자료
없음