Timeline for Birthday Problem applied to collisions
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 20, 2013 at 17:38 | comment | added | broccoli | Thanks much for the effort. I'd thought of using this, but decided not to pursue as I only wanted an order of estimate. btw, the Ramanujan approximation is also very handy for handling large factorials | |
| Mar 20, 2013 at 4:21 | history | edited | Ferdinand.kraft | CC BY-SA 3.0 |
deleted 163 characters in body
|
| Mar 20, 2013 at 4:15 | history | edited | Ferdinand.kraft | CC BY-SA 3.0 |
Added some numerical results
|
| Mar 20, 2013 at 3:12 | comment | added | Ferdinand.kraft | Thanks @GregMartin. Actually, the arbitrary precision alternative i've mentioned is not feasible for large $n$... There is no escape but use approximations. | |
| Mar 20, 2013 at 2:57 | comment | added | Greg Martin | Another possibility is replacing $\log N!$ by its approximation using Stirling's formula. | |
| Mar 20, 2013 at 2:13 | review | First posts | |||
| Mar 20, 2013 at 2:13 | |||||
| Mar 20, 2013 at 1:30 | history | edited | Ferdinand.kraft | CC BY-SA 3.0 |
added 494 characters in body
|
| Mar 20, 2013 at 1:18 | history | answered | Ferdinand.kraft | CC BY-SA 3.0 |