Timeline for Question about Banach's matchbox problem.
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 23, 2010 at 0:34 | vote | accept | reckoner | ||
| Dec 22, 2010 at 23:05 | comment | added | Aaron Meyerowitz | Don't forget that the stop time is when one box fails to get to -1. The 2nd box could be empty k=0 when the first is discovered to be | |
| Dec 22, 2010 at 23:04 | answer | added | Ari | timeline score: 8 | |
| Dec 22, 2010 at 23:02 | answer | added | Peter Shor | timeline score: 2 | |
| Dec 22, 2010 at 22:56 | comment | added | Peter Shor | Since the theoretical probabilities don't add up to 1, I would think there's something wrong with the analytical formula, and not with the program. | |
| Dec 22, 2010 at 22:55 | comment | added | Aaron Meyerowitz | The theoretical probabilities should add to 1 so you already have a problem. This is a programming question. | |
| Dec 22, 2010 at 22:21 | history | asked | reckoner | CC BY-SA 2.5 |