Timeline for Birthday problem - expected number of shared birthdays
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 4, 2021 at 22:31 | comment | added | R.. GitHub STOP HELPING ICE | And thanks again. While the expression was unwieldy to do some of the things I wanted, it made it easy to look at numerical behavior without resorting to running simulations, and to make predictions that accurately predicted that what I wanted to try would work. (In particular, that prefix trees on 8-bit alphabet are a bad idea but that dropping to a 4-bit alphabet makes a huge difference.) | |
| Oct 4, 2021 at 14:25 | history | edited | Henry | CC BY-SA 4.0 |
typo
|
| Oct 4, 2021 at 13:47 | comment | added | R.. GitHub STOP HELPING ICE | Thanks! The expected number of days with exactly one person (the second bullet point) is actually interesting for my purposes, and has a critical point (for $m$) between $n-1$ and $n$, which is somewhat surprising (IOW you go from expecting more unique birthdays to fewer exactly when number of people crosses the number of days). | |
| Oct 4, 2021 at 13:43 | vote | accept | R.. GitHub STOP HELPING ICE | ||
| Oct 4, 2021 at 13:28 | history | answered | Henry | CC BY-SA 4.0 |