Timeline for What's the probability of getting any one face at least $m$ times, when throwing a $k$-sided die $n$ times?
Current License: CC BY-SA 4.0
14 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 23, 2021 at 6:07 | vote | accept | Tushar Rakheja | ||
Sep 23, 2021 at 3:37 | answer | added | leonbloy | timeline score: 2 | |
Sep 22, 2021 at 21:39 | answer | added | Mike Earnest | timeline score: 2 | |
Sep 22, 2021 at 20:33 | comment | added | user2661923 | To the best of my knowledge (which could be mistaken) there are only 3 methods of attack - [1] Inclusion-Exclusion [2] Recursion [3] the direct approach. From what I can surmise, all three of these approaches are ugly here. Actually, I am ignorant of generating functions, so I don't know if that represents a 4th method of attack. | |
Sep 22, 2021 at 20:29 | history | edited | Tushar Rakheja | CC BY-SA 4.0 |
deleted 27 characters in body
|
Sep 22, 2021 at 20:27 | comment | added | Tushar Rakheja | Yup, I get the same feeling. Almost wondering if I should just do it exhaustively for my use case. | |
Sep 22, 2021 at 20:27 | review | Close votes | |||
Sep 24, 2021 at 4:11 | |||||
Sep 22, 2021 at 20:26 | comment | added | Rushabh Mehta | You need to do some inclusion exclusion. Doesn't look too pretty. | |
Sep 22, 2021 at 20:26 | comment | added | Tushar Rakheja | @user2661923 My bad, I've edited the question, I wanted to ask something different^ | |
Sep 22, 2021 at 20:25 | comment | added | Tushar Rakheja | @DonThousand My bad, I apologize. I was actually looking for the probability of a different event, I misphrased. I've edited the question. | |
Sep 22, 2021 at 20:24 | history | edited | Tushar Rakheja | CC BY-SA 4.0 |
added 382 characters in body; edited title
|
Sep 22, 2021 at 20:10 | comment | added | user2661923 | See Binomial Distribution, specifically $\displaystyle \binom{n}{k}p^kq^{(n-k)}.$ | |
Sep 22, 2021 at 20:06 | comment | added | Rushabh Mehta | Binomial theorem? | |
Sep 22, 2021 at 20:04 | history | asked | Tushar Rakheja | CC BY-SA 4.0 |