Timeline for Expected value of attempts needed to find a "pair" of cards
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 12, 2021 at 2:23 | comment | added | Gerry Myerson | Reminds me of en.wikipedia.org/wiki/Concentration_(card_game) | |
| Aug 10, 2021 at 20:17 | comment | added | Iosif Pinelis | @SamHopkins : I agree that being nontrivial may by itself be not enough for MO. However, it was also said that "very similar near-coincidence problems were studied by some prominent probabilists" (which actually surprised me a bit.) Since similar problems were studied in published research, I think the above post is fine for MO. | |
| Aug 10, 2021 at 18:57 | comment | added | Sam Hopkins | @IosifPinelis: I mean, I would say the birthday problem itself is not trivial. But if your comment is implicitly about "is this question a good fit for MO?" then I would say plenty of math is not trivial, but is standard, and for that reason might not be the best for MO. | |
| Aug 10, 2021 at 18:16 | comment | added | Iosif Pinelis | It appears that this problem is not trivial, and very similar near-coincidence problems were studied by some prominent probabilists -- thank you kodlu again for the reference to statistics.stanford.edu/research/methods-studying-coincidences | |
| Aug 10, 2021 at 14:44 | vote | accept | Dominic van der Zypen | ||
| Aug 10, 2021 at 14:40 | answer | added | Iosif Pinelis | timeline score: 2 | |
| Aug 10, 2021 at 13:42 | comment | added | Sam Hopkins | I think this is very close to the "birthday problem" (en.wikipedia.org/wiki/…) and as such your $E_n$ should grow like $\sqrt{n}$, not $\log(n)$. | |
| Aug 10, 2021 at 11:08 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |