Timeline for Probability of having n number of cards of the same kind from drawn N cards
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 21, 2022 at 20:01 | vote | accept | Enderluck | ||
| Feb 20, 2022 at 15:12 | answer | added | Enderluck | timeline score: 0 | |
| Feb 20, 2022 at 14:03 | history | edited | Enderluck | CC BY-SA 4.0 |
deleted 1 character in body
|
| Feb 19, 2022 at 20:28 | comment | added | user2661923 | You want to make things as easy as possible from the MathSE reviewer's point of view. I like your discussion of the various methods, and recommend that you keep that in the question. Simply pare everything else way down. Also, as I said, try programming. | |
| Feb 19, 2022 at 20:25 | comment | added | Enderluck | @user2661923 I mentioned the methods to make it known that there exist multiple ways of doing this. However, I specified that I only used one of them. In my calculations, I started using the 2nd, then I moved to the 1st after a suggestion of N. F. Taussig from this answer. Finally, I moved to the 3rd method and started over again my math because I thought that it was easier and cleaner. All my calculations were made with that last method. | |
| Feb 19, 2022 at 20:22 | comment | added | user2661923 | Further, there is another (better) approach, assuming that you are reasonably proficient at some PC programming language (e.g. Python, C, Java, ...). In my experience, a typical PC can handle up to $(10)^8$ simulations. So, for a specific problem, let the computer work through the $2.6$ M cases, and programmatically note the number of satisfying cases.The programming approach is often referred to as sanity checking. | |
| Feb 19, 2022 at 20:21 | comment | added | user2661923 | As you have surmised, you would typically have an answer that looks like $$\frac{N\text{(umerator)}}{D\text{(enominator)}},$$ where $~\displaystyle D = \binom{52}{5} \approx 2.6~$ million. So, when you present the questions, you don't need to present the tables. Simply present the $2$ questions, along with your computations for $N$ and $D$, in each question. ...see next comment | |
| Feb 19, 2022 at 20:16 | comment | added | user2661923 | +1: to your question for outstanding work shown + outstanding discussion of the various methods. Minor criticism specific to MathSE. You are asking a reviewer to study your work from top to bottom, including every single question that you asked. This isn't really reasonable. You discussed $3$ different methods for attacking an individual question. I suggest that you edit your question to pick out two of the more complicated questions, each of which uses a different one of the $3$ tools, and ask a MathSE reviewer to examine only those $2$ questions. ...see next comment | |
| Feb 19, 2022 at 19:59 | comment | added | lulu | Note that it should be easy to deduce these probabilities (or frequencies) from the standard Poker Probability computations (at least for standard hand sizes). Of course, the usual computations for say, three of a kind, would exclude four of a kind or full houses, so you'll have to combine the appropriate cases. | |
| Feb 19, 2022 at 19:56 | history | asked | Enderluck | CC BY-SA 4.0 |